forked from finos/waltz
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- pulled out non angular code from the ratings browser finos#6635
- Loading branch information
1 parent
b6b130a
commit 8254965
Showing
3 changed files
with
111 additions
and
102 deletions.
There are no files selected for viewing
108 changes: 108 additions & 0 deletions
108
waltz-ng/client/measurable-rating/components/browser/measurable-ratings-browser-utils.js
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,108 @@ | ||
import _ from "lodash"; | ||
import {buildHierarchies} from "../../../common/hierarchy-utils"; | ||
|
||
|
||
function combineRatingTallies(r1, r2) { | ||
return _.mergeWith( | ||
{}, r1, r2, | ||
(v1, v2) => (v1 || 0) + (v2 || 0)); | ||
} | ||
|
||
|
||
function toRatingsSummaryObj(ratings = []) { | ||
|
||
const counts = _.chain(ratings) | ||
.groupBy(r => r.rating) | ||
.mapValues(r => { | ||
|
||
const countsForRating = _.map(_.values(r), r => r.count); | ||
return _.sum(countsForRating); | ||
}) | ||
.value(); | ||
|
||
const total = _.sum(_.values(counts)); | ||
return Object.assign({}, counts, { total }); | ||
} | ||
|
||
|
||
function initialiseRatingTalliesMap(ratingTallies = [], measurables = []) { | ||
const talliesById = _.groupBy(ratingTallies, "id"); | ||
|
||
const reducer = (acc, m) => { | ||
const talliesForMeasurable = talliesById[m.id]; | ||
const summaryObj = talliesForMeasurable | ||
? toRatingsSummaryObj(talliesForMeasurable) | ||
: {}; | ||
|
||
acc[m.id] = { | ||
direct: _.clone(summaryObj), | ||
compound: _.clone(summaryObj), | ||
}; | ||
return acc; | ||
}; | ||
return _.reduce(measurables, reducer, {}); | ||
} | ||
|
||
|
||
export function prepareTreeData(data = []) { | ||
return buildHierarchies(data, false); | ||
} | ||
|
||
|
||
export function prepareTabs(categories = [], measurables = [], ratingSchemesById = {}) { | ||
const measurablesByCategory = _.groupBy(measurables, "categoryId"); | ||
return _ | ||
.chain(categories) | ||
.filter(category => _.get(measurablesByCategory, category.id, []).length > 0) | ||
.map(category => { | ||
const measurablesForCategory = measurablesByCategory[category.id]; | ||
const treeData = prepareTreeData(measurablesForCategory); | ||
const maxSize = _.chain(treeData) | ||
.map("totalRatings.total") | ||
.max() | ||
.value(); | ||
|
||
return { | ||
category, | ||
ratingScheme: ratingSchemesById[category.ratingSchemeId], | ||
treeData, | ||
maxSize, | ||
expandedNodes: [] | ||
}; | ||
}) | ||
.sortBy(d => d.category.position, d => d.category.name) | ||
.value(); | ||
} | ||
|
||
|
||
export function findFirstNonEmptyTab(tabs = []) { | ||
const firstNonEmptyTab = _.find(tabs, t => t.treeData.length > 0); | ||
return firstNonEmptyTab || tabs[0]; | ||
} | ||
|
||
|
||
export function mkRatingTalliesMap(ratingTallies = [], measurables = []) { | ||
const measurablesById = _.keyBy(measurables, "id"); | ||
const talliesMap = initialiseRatingTalliesMap(ratingTallies, measurables); | ||
_.each(measurables, m => { | ||
const rs = talliesMap[m.id]; | ||
|
||
while (m.parentId) { | ||
const parent = measurablesById[m.parentId]; | ||
if (! parent) break; | ||
const parentRating = talliesMap[m.parentId]; | ||
parentRating.compound = combineRatingTallies(parentRating.compound, rs.direct); | ||
m = parent; | ||
} | ||
}); | ||
|
||
return talliesMap; | ||
} | ||
|
||
|
||
export function findMaxTotal(ratingsMap) { | ||
return _.max( | ||
_.flatMap( | ||
_.values(ratingsMap), | ||
r => _.get(r, ["compound", "total"], [0]))) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters