@sis-cc/dotstatsuite-components 22.0.1 → 22.0.2

package/dist/rules2/src/table/getTableLayoutIds.js

@@ -0,0 +1,317 @@
+import * as R from 'ramda';
+import { isTimePeriodDimension, isRefAreaDimension } from '@sis-cc/dotstatsuite-sdmxjs';
+
+const getCombinationsNotInLayout = (combinations, layoutIds) => {
+  const { header=[], sections=[], rows=[] } = layoutIds;
+  const idsInLayout = new Set([...header, ...sections, ...rows]);
+  return R.reject(comb => idsInLayout.has(comb.id), combinations);
+};
+
+const indexCombsRelationships = (combinations) => R.reduce((acc, comb) => {
+  const { id, relationship=[] } = comb;
+  return R.assoc(id, relationship, acc);
+}, {}, combinations);
+
+const getLayoutLevelRelationship = indexedRelationships => ids => R.reduce((acc, id) => {
+  if (R.has(id, indexedRelationships)) {
+    return R.concat(acc, R.prop(id, indexedRelationships));
+  }
+  return R.append(id, acc);
+}, [], ids);
+
+const getLayoutRelationships = (indexedRelationships, layoutIds) => R.map(
+  getLayoutLevelRelationship(indexedRelationships),
+  layoutIds
+);
+
+const injectCombination = combination => ids => {
+  const { id, concepts=[] } = combination;
+  const conceptsSet = new Set(concepts);
+  let inject = true;
+  const refined = R.reduce((acc, i) => {
+    if (!conceptsSet.has(i)) {
+      return R.append(i, acc);
+    }
+    if (inject) {
+      inject = false;
+      return R.append(id, acc);
+    }
+    return acc;
+  }, [], ids);
+  return inject ? R.append(id, refined) : refined;
+};
+
+const getCombinationLevelCompatibility = (layoutRelationships, combination) => {
+  const { relationship=[] } = combination;
+  const idsInHeaderSet = new Set(layoutRelationships.header);
+  const idsInSectionsSet = new Set(layoutRelationships.sections);
+  const idsInRowsSet = new Set(layoutRelationships.rows);
+  const [idsInHeader, rest] = R.partition(
+    i => idsInHeaderSet.has(i),
+    relationship
+  );
+  const [idsInSections, idsInRows] = R.reduce((_acc, id) => {
+    if (idsInSectionsSet.has(id))
+      return R.over(R.lensIndex(0), R.append(id), _acc);
+    if (idsInRowsSet.has(id))
+      return R.over(R.lensIndex(1), R.append(id), _acc);
+    return R.over(R.lensIndex(2), R.append(id), _acc);
+  }, [[], [], []], rest);
+  if (!R.isEmpty(idsInHeader) && R.isEmpty(idsInSections) && R.isEmpty(idsInRows)) {
+    return 'header';
+  }
+  if (!R.isEmpty(idsInHeader)) {
+    return null;
+  }
+  if (!R.isEmpty(idsInSections) && R.isEmpty(idsInRows)) {
+    return 'sections';
+  }
+  if (!R.isEmpty(idsInRows)) {
+    return 'rows';
+  }
+  return 'blank';
+};
+
+const filterLayoutIds = (indexedCombinations, layoutDimsIds, obsAttributes) => (layoutIds) => {
+  const layoutConcepts = R.map(
+    R.reduce((acc, id) => {
+      if (R.has(id, indexedCombinations)) {
+        return R.concat(acc, R.path([id, 'concepts'], indexedCombinations));
+      }
+      return R.append(id, acc);
+    }, []),
+    layoutIds
+  );
+
+  return R.mapObjIndexed(
+    (ids, level) => R.filter(id => {
+      if (id === 'OBS_ATTRIBUTES') {
+        return !R.isEmpty(obsAttributes);
+      }
+      if (R.has(id, indexedCombinations)) {
+        const comb = R.prop(id, indexedCombinations);
+        const dims = R.filter(i => layoutDimsIds.has(i), comb.concepts);
+        if (!R.isEmpty(dims)) {
+          return true;
+        }
+        const oppositeIds = level === 'header'
+          ? R.concat(R.prop('sections', layoutConcepts), R.prop('rows', layoutConcepts))
+          : R.prop('header', layoutConcepts);
+        return R.isEmpty(R.intersection(comb.relationship, oppositeIds));
+      }
+      return layoutDimsIds.has(id);
+    }, ids),
+    layoutIds
+  );
+};
+
+const injectCombinationsInLayout = (combinations, layoutIds, defaultLayoutIds = {}) => {
+  const notInLayoutCombs = getCombinationsNotInLayout(combinations, layoutIds);
+  if (R.isEmpty(notInLayoutCombs)) {
+    return layoutIds;
+  }
+  const indexedCombsRelationships = indexCombsRelationships(combinations);
+  let layoutRelationships = getLayoutRelationships(indexedCombsRelationships, layoutIds);
+  const defaultLayoutRelationships = getLayoutRelationships(indexedCombsRelationships, defaultLayoutIds);
+  return R.reduce((acc, comb) => {
+    let levelCompatibility = getCombinationLevelCompatibility(layoutRelationships, comb);
+    if (R.isNil(levelCompatibility)) {
+      return acc;
+    }
+    if (R.equals('blank', levelCompatibility)) {
+      levelCompatibility = getCombinationLevelCompatibility(defaultLayoutRelationships, comb);
+      if (R.isNil(levelCompatibility)) {
+        return acc;
+      }
+      levelCompatibility = R.equals('blank', levelCompatibility) ? 'rows' : levelCompatibility;
+    }
+
+    layoutRelationships[levelCompatibility] = R.concat(layoutRelationships[levelCompatibility], comb.relationship);
+    const ids = injectCombination(comb)(acc[levelCompatibility]);
+    return R.assoc(levelCompatibility, ids)(acc);
+  }, layoutIds, notInLayoutCombs);
+};
+
+const getLayoutDimsIds = dimensions => R.reduce(
+  (acc, d) => (d.header ? acc : acc.add(d.id)),
+  new Set([]),
+  dimensions,
+);
+
+const getLayoutCombinations = (combinations, layoutDimsIds, attributes) => {
+  const indexedAttributes = R.indexBy(R.prop('id'), attributes);
+  return R.reduce(
+    (acc, comb) => {
+      const { layoutConcepts, relationship } = R.reduce(
+        (_acc, concept) => {
+          if (layoutDimsIds.has(concept)) {
+            return R.map(R.append(concept), _acc);
+          }
+          if (R.has(concept, indexedAttributes)) {
+            const attr = R.prop(concept, indexedAttributes);
+            return attr.series
+              ? {
+                  ..._acc,
+                  relationship: R.concat(_acc.relationship, attr.relationship),
+                }
+              : _acc;
+          }
+          return _acc;
+        },
+        { layoutConcepts: [], relationship: [] },
+        comb.concepts || [],
+      );
+      if (R.isEmpty(relationship)) {
+        return acc;
+      }
+      return R.append({ ...comb, relationship, concepts: layoutConcepts }, acc);
+    },
+    [],
+    combinations,
+  );
+};
+
+const extractConcepts = (ids, indexedCombinations, layoutDimsIds) => {
+  const entry = R.find(id => {
+    if (R.has(id, indexedCombinations)) {
+      const dimId = R.find(i => layoutDimsIds.has(i), R.pathOr([], [id, 'concepts'], indexedCombinations));
+      return !R.isNil(dimId);
+    }
+    return true;
+  }, ids);
+
+  const getRelationship = id => {
+    if (R.has(id, indexedCombinations)) {
+      return R.append(id, R.path([id, 'relationship'], indexedCombinations));
+    }
+    return [id];
+  };
+  let indexedRels = R.reduce((acc, id) =>
+    R.assoc(id, getRelationship(id), acc)
+  , {}, ids);
+  
+  let relationship = [entry];
+  while (!R.isEmpty(indexedRels)) {
+    const related = R.pickBy(rels => !R.isEmpty(R.intersection(relationship, rels)), indexedRels);
+    if (R.isEmpty(related)) {
+      break;
+    }
+    indexedRels = R.omit(R.keys(related), indexedRels);
+    relationship = R.concat(relationship, R.unnest(R.values(related)));
+  }
+  const set = new Set(relationship);
+  return R.partition(id => set.has(id), ids);
+};
+
+const injectRemainingDimensionsInLayout = (layoutIds, remainingDims, indexedCombinations, layoutDimsIds) => {
+  let _layout = layoutIds;
+  let _remaining = remainingDims;
+
+  const dimInRows = R.find(id => {
+    if (layoutDimsIds.has(id)) {
+      return true;
+    }
+    const dimId = R.find(i => layoutDimsIds.has(i), R.pathOr([], [id, 'concepts'], indexedCombinations));
+    return !R.isNil(dimId);
+  }, _layout.rows);
+
+  if (R.isNil(dimInRows)) {
+    if (R.isEmpty(_remaining)) {
+      const toTakeIn = R.isEmpty(_layout.sections) ? 'header' : 'sections';
+      const [extracted, remains] = extractConcepts(R.prop(toTakeIn, _layout), indexedCombinations, layoutDimsIds);
+      _layout = ({ ..._layout, rows: R.concat(_layout.rows, extracted), [toTakeIn]: remains });
+    }
+    else {
+      _layout = R.over(R.lensProp('rows'), R.append(R.head(_remaining)))(_layout);
+      _remaining = R.tail(_remaining);
+    }
+  }
+  if (!R.isEmpty(_remaining)) {
+    const hasNoHeader = R.isEmpty(_layout.header);
+    const firstRemaining = R.head(_remaining);
+    _remaining = hasNoHeader ? R.tail(_remaining) : _remaining;
+    _layout = {
+      ..._layout,
+      sections: R.concat(_layout.sections, _remaining),
+      header: hasNoHeader ? [firstRemaining] : _layout.header,
+    };
+  }
+  return _layout;
+};
+
+const getTableLayoutIds = (
+  defaultLayoutIds,
+  currentLayoutIds,
+  dimensions,
+  attributes,
+  combinations
+) => {
+  const layoutDimsIds = getLayoutDimsIds(dimensions);
+  const layoutCombinations = getLayoutCombinations(
+    combinations,
+    layoutDimsIds,
+    attributes,
+  );
+  const isBlank = R.pipe(R.values, R.all(R.isEmpty))(currentLayoutIds);
+
+  const combinationsConcepts = R.pipe(R.pluck('_concepts'), R.unnest, ids => new Set(ids))(combinations);
+  const obsAttributes = R.filter(a => 
+    a.series && R.isEmpty(a.relationship || []) && a.display && !combinationsConcepts.has(a)
+  , attributes);
+  const indexedCombinations = R.indexBy(R.prop('id'), layoutCombinations);
+  const filteredLayoutIds = filterLayoutIds(indexedCombinations, layoutDimsIds, obsAttributes)
+    (isBlank ? defaultLayoutIds : currentLayoutIds);
+
+  const layoutWithCombs = injectCombinationsInLayout(layoutCombinations, filteredLayoutIds, defaultLayoutIds);
+  const layoutRelationshipsSets = R.map(R.pipe(
+    ids => R.pick(ids, indexedCombinations),
+    R.values,
+    R.pluck('relationship'),
+    R.unnest,
+    i => new Set(i)
+  ), layoutWithCombs);
+  const layoutConceptsSets = R.pipe(
+    R.map(
+      R.reduce((acc, id) => {
+        if (R.has(id, indexedCombinations)) {
+          return R.concat(acc, R.path([id, 'concepts'], indexedCombinations));
+        }
+        return R.append(id, acc);
+      }, []),
+    ),
+    R.values,
+    R.unnest,
+    ids => new Set(ids)
+  )(layoutWithCombs);
+  const defaultLayoutConceptsSets = R.map(
+    ids => new Set(ids),
+    defaultLayoutIds
+  );
+
+  const { nextLayout, remaining } = R.reduce((acc, dim) => {
+    if (layoutConceptsSets.has(dim.id) || dim.header) {
+      return acc;
+    }
+    if (layoutRelationshipsSets.header.has(dim.id) || defaultLayoutConceptsSets.header.has(dim.id)) {
+      return R.over(R.lensPath(['nextLayout', 'header']), R.append(dim.id))(acc);
+    }
+    if (layoutRelationshipsSets.sections.has(dim.id) || defaultLayoutConceptsSets.sections.has(dim.id)) {
+      return R.over(R.lensPath(['nextLayout', 'sections']), R.append(dim.id))(acc);
+    }
+    if (layoutRelationshipsSets.rows.has(dim.id)  || defaultLayoutConceptsSets.rows.has(dim.id)) {
+      return R.over(R.lensPath(['nextLayout','rows']), R.append(dim.id))(acc);
+    }
+    if (isTimePeriodDimension(dim)) {
+      return R.over(R.lensPath(['nextLayout','header']), R.append(dim.id))(acc);
+    }
+    if (isRefAreaDimension(dim)) {
+      return R.over(R.lensPath(['nextLayout','rows']), R.append(dim.id))(acc);
+    }
+    return R.over(R.lensProp('remaining'), R.append(dim.id))(acc);
+  }, { nextLayout: layoutWithCombs, remaining: [] }, dimensions);
+
+  return injectRemainingDimensionsInLayout(nextLayout, remaining, indexedCombinations, layoutDimsIds);
+};
+
+export { getCombinationLevelCompatibility, getCombinationsNotInLayout, getLayoutCombinations, getLayoutDimsIds, getLayoutLevelRelationship, getLayoutRelationships, getTableLayoutIds, indexCombsRelationships, injectCombination, injectCombinationsInLayout, injectRemainingDimensionsInLayout };
+//# sourceMappingURL=getTableLayoutIds.js.map

package/dist/rules2/src/table/getTableLayoutIds.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getTableLayoutIds.js","sources":["../../../../src/rules2/src/table/getTableLayoutIds.js"],"sourcesContent":["import * as R from 'ramda';\nimport { isTimePeriodDimension, isRefAreaDimension } from '@sis-cc/dotstatsuite-sdmxjs';\n\nexport const getCombinationsNotInLayout = (combinations, layoutIds) => {\n  const { header=[], sections=[], rows=[] } = layoutIds;\n  const idsInLayout = new Set([...header, ...sections, ...rows]);\n  return R.reject(comb => idsInLayout.has(comb.id), combinations);\n};\n\nexport const indexCombsRelationships = (combinations) => R.reduce((acc, comb) => {\n  const { id, relationship=[] } = comb;\n  return R.assoc(id, relationship, acc);\n}, {}, combinations);\n\nexport const getLayoutLevelRelationship = indexedRelationships => ids => R.reduce((acc, id) => {\n  if (R.has(id, indexedRelationships)) {\n    return R.concat(acc, R.prop(id, indexedRelationships));\n  }\n  return R.append(id, acc);\n}, [], ids);\n\nexport const getLayoutRelationships = (indexedRelationships, layoutIds) => R.map(\n  getLayoutLevelRelationship(indexedRelationships),\n  layoutIds\n);\n\nexport const injectCombination = combination => ids => {\n  const { id, concepts=[] } = combination;\n  const conceptsSet = new Set(concepts);\n  let inject = true;\n  const refined = R.reduce((acc, i) => {\n    if (!conceptsSet.has(i)) {\n      return R.append(i, acc);\n    }\n    if (inject) {\n      inject = false;\n      return R.append(id, acc);\n    }\n    return acc;\n  }, [], ids);\n  return inject ? R.append(id, refined) : refined;\n};\n\nexport const getCombinationLevelCompatibility = (layoutRelationships, combination) => {\n  const { relationship=[] } = combination;\n  const idsInHeaderSet = new Set(layoutRelationships.header);\n  const idsInSectionsSet = new Set(layoutRelationships.sections);\n  const idsInRowsSet = new Set(layoutRelationships.rows);\n  const [idsInHeader, rest] = R.partition(\n    i => idsInHeaderSet.has(i),\n    relationship\n  );\n  const [idsInSections, idsInRows] = R.reduce((_acc, id) => {\n    if (idsInSectionsSet.has(id))\n      return R.over(R.lensIndex(0), R.append(id), _acc);\n    if (idsInRowsSet.has(id))\n      return R.over(R.lensIndex(1), R.append(id), _acc);\n    return R.over(R.lensIndex(2), R.append(id), _acc);\n  }, [[], [], []], rest);\n  if (!R.isEmpty(idsInHeader) && R.isEmpty(idsInSections) && R.isEmpty(idsInRows)) {\n    return 'header';\n  }\n  if (!R.isEmpty(idsInHeader)) {\n    return null;\n  }\n  if (!R.isEmpty(idsInSections) && R.isEmpty(idsInRows)) {\n    return 'sections';\n  }\n  if (!R.isEmpty(idsInRows)) {\n    return 'rows';\n  }\n  return 'blank';\n}\n\nconst filterLayoutIds = (indexedCombinations, layoutDimsIds, obsAttributes) => (layoutIds) => {\n  const layoutConcepts = R.map(\n    R.reduce((acc, id) => {\n      if (R.has(id, indexedCombinations)) {\n        return R.concat(acc, R.path([id, 'concepts'], indexedCombinations));\n      }\n      return R.append(id, acc);\n    }, []),\n    layoutIds\n  );\n\n  return R.mapObjIndexed(\n    (ids, level) => R.filter(id => {\n      if (id === 'OBS_ATTRIBUTES') {\n        return !R.isEmpty(obsAttributes);\n      }\n      if (R.has(id, indexedCombinations)) {\n        const comb = R.prop(id, indexedCombinations);\n        const dims = R.filter(i => layoutDimsIds.has(i), comb.concepts);\n        if (!R.isEmpty(dims)) {\n          return true;\n        }\n        const oppositeIds = level === 'header'\n          ? R.concat(R.prop('sections', layoutConcepts), R.prop('rows', layoutConcepts))\n          : R.prop('header', layoutConcepts);\n        return R.isEmpty(R.intersection(comb.relationship, oppositeIds));\n      }\n      return layoutDimsIds.has(id);\n    }, ids),\n    layoutIds\n  );\n};\n\nexport const injectCombinationsInLayout = (combinations, layoutIds, defaultLayoutIds = {}) => {\n  const notInLayoutCombs = getCombinationsNotInLayout(combinations, layoutIds);\n  if (R.isEmpty(notInLayoutCombs)) {\n    return layoutIds;\n  }\n  const indexedCombsRelationships = indexCombsRelationships(combinations);\n  let layoutRelationships = getLayoutRelationships(indexedCombsRelationships, layoutIds);\n  const defaultLayoutRelationships = getLayoutRelationships(indexedCombsRelationships, defaultLayoutIds);\n  return R.reduce((acc, comb) => {\n    let levelCompatibility = getCombinationLevelCompatibility(layoutRelationships, comb);\n    if (R.isNil(levelCompatibility)) {\n      return acc;\n    }\n    if (R.equals('blank', levelCompatibility)) {\n      levelCompatibility = getCombinationLevelCompatibility(defaultLayoutRelationships, comb);\n      if (R.isNil(levelCompatibility)) {\n        return acc;\n      }\n      levelCompatibility = R.equals('blank', levelCompatibility) ? 'rows' : levelCompatibility;\n    }\n\n    layoutRelationships[levelCompatibility] = R.concat(layoutRelationships[levelCompatibility], comb.relationship);\n    const ids = injectCombination(comb)(acc[levelCompatibility]);\n    return R.assoc(levelCompatibility, ids)(acc);\n  }, layoutIds, notInLayoutCombs);\n};\n\nexport const getLayoutDimsIds = dimensions => R.reduce(\n  (acc, d) => (d.header ? acc : acc.add(d.id)),\n  new Set([]),\n  dimensions,\n);\n\nexport const getLayoutCombinations = (combinations, layoutDimsIds, attributes) => {\n  const indexedAttributes = R.indexBy(R.prop('id'), attributes);\n  return R.reduce(\n    (acc, comb) => {\n      const { layoutConcepts, relationship } = R.reduce(\n        (_acc, concept) => {\n          if (layoutDimsIds.has(concept)) {\n            return R.map(R.append(concept), _acc);\n          }\n          if (R.has(concept, indexedAttributes)) {\n            const attr = R.prop(concept, indexedAttributes);\n            return attr.series\n              ? {\n                  ..._acc,\n                  relationship: R.concat(_acc.relationship, attr.relationship),\n                }\n              : _acc;\n          }\n          return _acc;\n        },\n        { layoutConcepts: [], relationship: [] },\n        comb.concepts || [],\n      );\n      if (R.isEmpty(relationship)) {\n        return acc;\n      }\n      return R.append({ ...comb, relationship, concepts: layoutConcepts }, acc);\n    },\n    [],\n    combinations,\n  );\n};\n\nconst extractConcepts = (ids, indexedCombinations, layoutDimsIds) => {\n  const entry = R.find(id => {\n    if (R.has(id, indexedCombinations)) {\n      const dimId = R.find(i => layoutDimsIds.has(i), R.pathOr([], [id, 'concepts'], indexedCombinations));\n      return !R.isNil(dimId);\n    }\n    return true;\n  }, ids);\n\n  const getRelationship = id => {\n    if (R.has(id, indexedCombinations)) {\n      return R.append(id, R.path([id, 'relationship'], indexedCombinations));\n    }\n    return [id];\n  };\n  let indexedRels = R.reduce((acc, id) =>\n    R.assoc(id, getRelationship(id), acc)\n  , {}, ids);\n  \n  let relationship = [entry];\n  while (!R.isEmpty(indexedRels)) {\n    const related = R.pickBy(rels => !R.isEmpty(R.intersection(relationship, rels)), indexedRels);\n    if (R.isEmpty(related)) {\n      break;\n    }\n    indexedRels = R.omit(R.keys(related), indexedRels);\n    relationship = R.concat(relationship, R.unnest(R.values(related)));\n  }\n  const set = new Set(relationship);\n  return R.partition(id => set.has(id), ids);\n}\n\nexport const injectRemainingDimensionsInLayout = (layoutIds, remainingDims, indexedCombinations, layoutDimsIds) => {\n  let _layout = layoutIds;\n  let _remaining = remainingDims;\n\n  const dimInRows = R.find(id => {\n    if (layoutDimsIds.has(id)) {\n      return true;\n    }\n    const dimId = R.find(i => layoutDimsIds.has(i), R.pathOr([], [id, 'concepts'], indexedCombinations));\n    return !R.isNil(dimId);\n  }, _layout.rows);\n\n  if (R.isNil(dimInRows)) {\n    if (R.isEmpty(_remaining)) {\n      const toTakeIn = R.isEmpty(_layout.sections) ? 'header' : 'sections';\n      const [extracted, remains] = extractConcepts(R.prop(toTakeIn, _layout), indexedCombinations, layoutDimsIds);\n      _layout = ({ ..._layout, rows: R.concat(_layout.rows, extracted), [toTakeIn]: remains });\n    }\n    else {\n      _layout = R.over(R.lensProp('rows'), R.append(R.head(_remaining)))(_layout);\n      _remaining = R.tail(_remaining)\n    }\n  }\n  if (!R.isEmpty(_remaining)) {\n    const hasNoHeader = R.isEmpty(_layout.header);\n    const firstRemaining = R.head(_remaining);\n    _remaining = hasNoHeader ? R.tail(_remaining) : _remaining;\n    _layout = {\n      ..._layout,\n      sections: R.concat(_layout.sections, _remaining),\n      header: hasNoHeader ? [firstRemaining] : _layout.header,\n    };\n  }\n  return _layout;\n};\n\nexport const getTableLayoutIds = (\n  defaultLayoutIds,\n  currentLayoutIds,\n  dimensions,\n  attributes,\n  combinations\n) => {\n  const layoutDimsIds = getLayoutDimsIds(dimensions);\n  const layoutCombinations = getLayoutCombinations(\n    combinations,\n    layoutDimsIds,\n    attributes,\n  );\n  const isBlank = R.pipe(R.values, R.all(R.isEmpty))(currentLayoutIds);\n\n  const combinationsConcepts = R.pipe(R.pluck('_concepts'), R.unnest, ids => new Set(ids))(combinations);\n  const obsAttributes = R.filter(a => \n    a.series && R.isEmpty(a.relationship || []) && a.display && !combinationsConcepts.has(a)\n  , attributes);\n  const indexedCombinations = R.indexBy(R.prop('id'), layoutCombinations);\n  const filteredLayoutIds = filterLayoutIds(indexedCombinations, layoutDimsIds, obsAttributes)\n    (isBlank ? defaultLayoutIds : currentLayoutIds);\n\n  const layoutWithCombs = injectCombinationsInLayout(layoutCombinations, filteredLayoutIds, defaultLayoutIds);\n  const layoutRelationshipsSets = R.map(R.pipe(\n    ids => R.pick(ids, indexedCombinations),\n    R.values,\n    R.pluck('relationship'),\n    R.unnest,\n    i => new Set(i)\n  ), layoutWithCombs);\n  const layoutConceptsSets = R.pipe(\n    R.map(\n      R.reduce((acc, id) => {\n        if (R.has(id, indexedCombinations)) {\n          return R.concat(acc, R.path([id, 'concepts'], indexedCombinations));\n        }\n        return R.append(id, acc);\n      }, []),\n    ),\n    R.values,\n    R.unnest,\n    ids => new Set(ids)\n  )(layoutWithCombs);\n  const defaultLayoutConceptsSets = R.map(\n    ids => new Set(ids),\n    defaultLayoutIds\n  );\n\n  const { nextLayout, remaining } = R.reduce((acc, dim) => {\n    if (layoutConceptsSets.has(dim.id) || dim.header) {\n      return acc;\n    }\n    if (layoutRelationshipsSets.header.has(dim.id) || defaultLayoutConceptsSets.header.has(dim.id)) {\n      return R.over(R.lensPath(['nextLayout', 'header']), R.append(dim.id))(acc);\n    }\n    if (layoutRelationshipsSets.sections.has(dim.id) || defaultLayoutConceptsSets.sections.has(dim.id)) {\n      return R.over(R.lensPath(['nextLayout', 'sections']), R.append(dim.id))(acc);\n    }\n    if (layoutRelationshipsSets.rows.has(dim.id)  || defaultLayoutConceptsSets.rows.has(dim.id)) {\n      return R.over(R.lensPath(['nextLayout','rows']), R.append(dim.id))(acc);\n    }\n    if (isTimePeriodDimension(dim)) {\n      return R.over(R.lensPath(['nextLayout','header']), R.append(dim.id))(acc);\n    }\n    if (isRefAreaDimension(dim)) {\n      return R.over(R.lensPath(['nextLayout','rows']), R.append(dim.id))(acc);\n    }\n    return R.over(R.lensProp('remaining'), R.append(dim.id))(acc);\n  }, { nextLayout: layoutWithCombs, remaining: [] }, dimensions);\n\n  return injectRemainingDimensionsInLayout(nextLayout, remaining, indexedCombinations, layoutDimsIds);\n};\n"],"names":[],"mappings":";;;AAGY,MAAC,0BAA0B,GAAG,CAAC,YAAY,EAAE,SAAS,KAAK;AACvE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,SAAS;AACvD,EAAE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC;AAChE,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC;AACjE;;AAEY,MAAC,uBAAuB,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK;AACjF,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,CAAC,EAAE,EAAE,GAAG,IAAI;AACtC,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC;AACvC,CAAC,EAAE,EAAE,EAAE,YAAY;;AAEP,MAAC,0BAA0B,GAAG,oBAAoB,IAAI,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK;AAC/F,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,oBAAoB,CAAC,EAAE;AACvC,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,oBAAoB,CAAC,CAAC;AAC1D,EAAE;AACF,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC;AAC1B,CAAC,EAAE,EAAE,EAAE,GAAG;;AAEE,MAAC,sBAAsB,GAAG,CAAC,oBAAoB,EAAE,SAAS,KAAK,CAAC,CAAC,GAAG;AAChF,EAAE,0BAA0B,CAAC,oBAAoB,CAAC;AAClD,EAAE;AACF;;AAEY,MAAC,iBAAiB,GAAG,WAAW,IAAI,GAAG,IAAI;AACvD,EAAE,MAAM,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,GAAG,WAAW;AACzC,EAAE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC;AACvC,EAAE,IAAI,MAAM,GAAG,IAAI;AACnB,EAAE,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,KAAK;AACvC,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;AAC7B,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC;AAC7B,IAAI;AACJ,IAAI,IAAI,MAAM,EAAE;AAChB,MAAM,MAAM,GAAG,KAAK;AACpB,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC;AAC9B,IAAI;AACJ,IAAI,OAAO,GAAG;AACd,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC;AACb,EAAE,OAAO,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO;AACjD;;AAEY,MAAC,gCAAgC,GAAG,CAAC,mBAAmB,EAAE,WAAW,KAAK;AACtF,EAAE,MAAM,EAAE,YAAY,CAAC,EAAE,EAAE,GAAG,WAAW;AACzC,EAAE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,MAAM,CAAC;AAC5D,EAAE,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,QAAQ,CAAC;AAChE,EAAE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,mBAAmB,CAAC,IAAI,CAAC;AACxD,EAAE,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS;AACzC,IAAI,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;AAC9B,IAAI;AACJ,GAAG;AACH,EAAE,MAAM,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK;AAC5D,IAAI,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC;AAChC,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AACvD,IAAI,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;AAC5B,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AACvD,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;AACrD,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC;AACxB,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AACnF,IAAI,OAAO,QAAQ;AACnB,EAAE;AACF,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;AAC/B,IAAI,OAAO,IAAI;AACf,EAAE;AACF,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AACzD,IAAI,OAAO,UAAU;AACrB,EAAE;AACF,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAC7B,IAAI,OAAO,MAAM;AACjB,EAAE;AACF,EAAE,OAAO,OAAO;AAChB;;AAEA,MAAM,eAAe,GAAG,CAAC,mBAAmB,EAAE,aAAa,EAAE,aAAa,KAAK,CAAC,SAAS,KAAK;AAC9F,EAAE,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG;AAC9B,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK;AAC1B,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE;AAC1C,QAAQ,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC3E,MAAM;AACN,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC;AAC9B,IAAI,CAAC,EAAE,EAAE,CAAC;AACV,IAAI;AACJ,GAAG;;AAEH,EAAE,OAAO,CAAC,CAAC,aAAa;AACxB,IAAI,CAAC,GAAG,EAAE,KAAK,KAAK,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI;AACnC,MAAM,IAAI,EAAE,KAAK,gBAAgB,EAAE;AACnC,QAAQ,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC;AACxC,MAAM;AACN,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE;AAC1C,QAAQ,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,mBAAmB,CAAC;AACpD,QAAQ,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;AACvE,QAAQ,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC9B,UAAU,OAAO,IAAI;AACrB,QAAQ;AACR,QAAQ,MAAM,WAAW,GAAG,KAAK,KAAK;AACtC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,cAAc,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC;AACvF,YAAY,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,cAAc,CAAC;AAC5C,QAAQ,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;AACxE,MAAM;AACN,MAAM,OAAO,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;AAClC,IAAI,CAAC,EAAE,GAAG,CAAC;AACX,IAAI;AACJ,GAAG;AACH,CAAC;;AAEW,MAAC,0BAA0B,GAAG,CAAC,YAAY,EAAE,SAAS,EAAE,gBAAgB,GAAG,EAAE,KAAK;AAC9F,EAAE,MAAM,gBAAgB,GAAG,0BAA0B,CAAC,YAAY,EAAE,SAAS,CAAC;AAC9E,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE;AACnC,IAAI,OAAO,SAAS;AACpB,EAAE;AACF,EAAE,MAAM,yBAAyB,GAAG,uBAAuB,CAAC,YAAY,CAAC;AACzE,EAAE,IAAI,mBAAmB,GAAG,sBAAsB,CAAC,yBAAyB,EAAE,SAAS,CAAC;AACxF,EAAE,MAAM,0BAA0B,GAAG,sBAAsB,CAAC,yBAAyB,EAAE,gBAAgB,CAAC;AACxG,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,KAAK;AACjC,IAAI,IAAI,kBAAkB,GAAG,gCAAgC,CAAC,mBAAmB,EAAE,IAAI,CAAC;AACxF,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE;AACrC,MAAM,OAAO,GAAG;AAChB,IAAI;AACJ,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,kBAAkB,CAAC,EAAE;AAC/C,MAAM,kBAAkB,GAAG,gCAAgC,CAAC,0BAA0B,EAAE,IAAI,CAAC;AAC7F,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE;AACvC,QAAQ,OAAO,GAAG;AAClB,MAAM;AACN,MAAM,kBAAkB,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,kBAAkB,CAAC,GAAG,MAAM,GAAG,kBAAkB;AAC9F,IAAI;;AAEJ,IAAI,mBAAmB,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC;AAClH,IAAI,MAAM,GAAG,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;AAChE,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC;AAChD,EAAE,CAAC,EAAE,SAAS,EAAE,gBAAgB,CAAC;AACjC;;AAEY,MAAC,gBAAgB,GAAG,UAAU,IAAI,CAAC,CAAC,MAAM;AACtD,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC9C,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC;AACb,EAAE,UAAU;AACZ;;AAEY,MAAC,qBAAqB,GAAG,CAAC,YAAY,EAAE,aAAa,EAAE,UAAU,KAAK;AAClF,EAAE,MAAM,iBAAiB,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;AAC/D,EAAE,OAAO,CAAC,CAAC,MAAM;AACjB,IAAI,CAAC,GAAG,EAAE,IAAI,KAAK;AACnB,MAAM,MAAM,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,CAAC,CAAC,MAAM;AACvD,QAAQ,CAAC,IAAI,EAAE,OAAO,KAAK;AAC3B,UAAU,IAAI,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;AAC1C,YAAY,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC;AACjD,UAAU;AACV,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,iBAAiB,CAAC,EAAE;AACjD,YAAY,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,iBAAiB,CAAC;AAC3D,YAAY,OAAO,IAAI,CAAC;AACxB,gBAAgB;AAChB,kBAAkB,GAAG,IAAI;AACzB,kBAAkB,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC;AAC9E;AACA,gBAAgB,IAAI;AACpB,UAAU;AACV,UAAU,OAAO,IAAI;AACrB,QAAQ,CAAC;AACT,QAAQ,EAAE,cAAc,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE;AAChD,QAAQ,IAAI,CAAC,QAAQ,IAAI,EAAE;AAC3B,OAAO;AACP,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;AACnC,QAAQ,OAAO,GAAG;AAClB,MAAM;AACN,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,cAAc,EAAE,EAAE,GAAG,CAAC;AAC/E,IAAI,CAAC;AACL,IAAI,EAAE;AACN,IAAI,YAAY;AAChB,GAAG;AACH;;AAEA,MAAM,eAAe,GAAG,CAAC,GAAG,EAAE,mBAAmB,EAAE,aAAa,KAAK;AACrE,EAAE,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI;AAC7B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE;AACxC,MAAM,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC1G,MAAM,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;AAC5B,IAAI;AACJ,IAAI,OAAO,IAAI;AACf,EAAE,CAAC,EAAE,GAAG,CAAC;;AAET,EAAE,MAAM,eAAe,GAAG,EAAE,IAAI;AAChC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE;AACxC,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,cAAc,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC5E,IAAI;AACJ,IAAI,OAAO,CAAC,EAAE,CAAC;AACf,EAAE,CAAC;AACH,EAAE,IAAI,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;AACrC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,eAAe,CAAC,EAAE,CAAC,EAAE,GAAG;AACxC,IAAI,EAAE,EAAE,GAAG,CAAC;AACZ;AACA,EAAE,IAAI,YAAY,GAAG,CAAC,KAAK,CAAC;AAC5B,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;AAClC,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC,EAAE,WAAW,CAAC;AACjG,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;AAC5B,MAAM;AACN,IAAI;AACJ,IAAI,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,WAAW,CAAC;AACtD,IAAI,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AACtE,EAAE;AACF,EAAE,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC;AACnC,EAAE,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC;AAC5C;;AAEY,MAAC,iCAAiC,GAAG,CAAC,SAAS,EAAE,aAAa,EAAE,mBAAmB,EAAE,aAAa,KAAK;AACnH,EAAE,IAAI,OAAO,GAAG,SAAS;AACzB,EAAE,IAAI,UAAU,GAAG,aAAa;;AAEhC,EAAE,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI;AACjC,IAAI,IAAI,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AAC/B,MAAM,OAAO,IAAI;AACjB,IAAI;AACJ,IAAI,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACxG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC;AAC1B,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC;;AAElB,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE;AAC1B,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;AAC/B,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,QAAQ,GAAG,UAAU;AAC1E,MAAM,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,mBAAmB,EAAE,aAAa,CAAC;AACjH,MAAM,OAAO,IAAI,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC,QAAQ,GAAG,OAAO,EAAE,CAAC;AAC9F,IAAI;AACJ,SAAS;AACT,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;AACjF,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU;AACpC,IAAI;AACJ,EAAE;AACF,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;AAC9B,IAAI,MAAM,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;AACjD,IAAI,MAAM,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;AAC7C,IAAI,UAAU,GAAG,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU;AAC9D,IAAI,OAAO,GAAG;AACd,MAAM,GAAG,OAAO;AAChB,MAAM,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC;AACtD,MAAM,MAAM,EAAE,WAAW,GAAG,CAAC,cAAc,CAAC,GAAG,OAAO,CAAC,MAAM;AAC7D,KAAK;AACL,EAAE;AACF,EAAE,OAAO,OAAO;AAChB;;AAEY,MAAC,iBAAiB,GAAG;AACjC,EAAE,gBAAgB;AAClB,EAAE,gBAAgB;AAClB,EAAE,UAAU;AACZ,EAAE,UAAU;AACZ,EAAE;AACF,KAAK;AACL,EAAE,MAAM,aAAa,GAAG,gBAAgB,CAAC,UAAU,CAAC;AACpD,EAAE,MAAM,kBAAkB,GAAG,qBAAqB;AAClD,IAAI,YAAY;AAChB,IAAI,aAAa;AACjB,IAAI,UAAU;AACd,GAAG;AACH,EAAE,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC;;AAEtE,EAAE,MAAM,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC;AACxG,EAAE,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AAClC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;AAC3F,IAAI,UAAU,CAAC;AACf,EAAE,MAAM,mBAAmB,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC;AACzE,EAAE,MAAM,iBAAiB,GAAG,eAAe,CAAC,mBAAmB,EAAE,aAAa,EAAE,aAAa;AAC7F,KAAK,OAAO,GAAG,gBAAgB,GAAG,gBAAgB,CAAC;;AAEnD,EAAE,MAAM,eAAe,GAAG,0BAA0B,CAAC,kBAAkB,EAAE,iBAAiB,EAAE,gBAAgB,CAAC;AAC7G,EAAE,MAAM,uBAAuB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI;AAC9C,IAAI,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,mBAAmB,CAAC;AAC3C,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,CAAC,CAAC,KAAK,CAAC,cAAc,CAAC;AAC3B,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC;AAClB,GAAG,EAAE,eAAe,CAAC;AACrB,EAAE,MAAM,kBAAkB,GAAG,CAAC,CAAC,IAAI;AACnC,IAAI,CAAC,CAAC,GAAG;AACT,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK;AAC5B,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,mBAAmB,CAAC,EAAE;AAC5C,UAAU,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,mBAAmB,CAAC,CAAC;AAC7E,QAAQ;AACR,QAAQ,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC;AAChC,MAAM,CAAC,EAAE,EAAE,CAAC;AACZ,KAAK;AACL,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG;AACtB,GAAG,CAAC,eAAe,CAAC;AACpB,EAAE,MAAM,yBAAyB,GAAG,CAAC,CAAC,GAAG;AACzC,IAAI,GAAG,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;AACvB,IAAI;AACJ,GAAG;;AAEH,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK;AAC3D,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE;AACtD,MAAM,OAAO,GAAG;AAChB,IAAI;AACJ,IAAI,IAAI,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AACpG,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAChF,IAAI;AACJ,IAAI,IAAI,uBAAuB,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,yBAAyB,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AACxG,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAClF,IAAI;AACJ,IAAI,IAAI,uBAAuB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,yBAAyB,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;AACjG,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAC7E,IAAI;AACJ,IAAI,IAAI,qBAAqB,CAAC,GAAG,CAAC,EAAE;AACpC,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAC/E,IAAI;AACJ,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE;AACjC,MAAM,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AAC7E,IAAI;AACJ,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;AACjE,EAAE,CAAC,EAAE,EAAE,UAAU,EAAE,eAAe,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC;;AAEhE,EAAE,OAAO,iCAAiC,CAAC,UAAU,EAAE,SAAS,EAAE,mBAAmB,EAAE,aAAa,CAAC;AACrG;;;;"}

package/dist/rules2/src/table/getTableProps.js

@@ -0,0 +1,85 @@
+import * as R from 'ramda';
+import { declineObservationsOverAttributes } from './declineObservationsOverAttributes.js';
+import { getLayout } from './getLayout.js';
+import { getSortedLayoutIndexes } from './getSortedLayoutIndexes.js';
+import { parseLayoutIndexesHierarchies } from './parseSeriesIndexesHierarchies.js';
+import { refineLayoutSize } from './refineLayoutSize2.js';
+import { getLayoutData } from './getLayoutData2.js';
+import { getCellsAttributesIds } from './getCellsAttributesIds.js';
+import { getIndexedCombinationsByDisplay } from './getIndexedCombinationsByDisplay.js';
+import { getCells } from './getCells.js';
+import { getCuratedCells } from './getCuratedCells.js';
+import { getSeriesCombinations } from '../getSeriesCombinations.js';
+import { getCellsMetadataCoordinates } from './getCellsMetadataCoordinates.js';
+
+const getTableProps = ({ data, layoutIds, customAttributes, limit, isTimeInverted }) => {
+  const {
+    observations,
+    dimensions,
+    combinations,
+    oneValueDimensions,
+    attributesSeries,
+    metadataCoordinates,
+    attributes,
+    header,
+    rejectedDimensions=[]
+  } = data;
+
+  const obsAttributes = R.filter(
+    a => a.series && R.isEmpty(a.relationship) && a.display && !a.combined,
+    attributes
+  );
+  let dupObs = observations;
+  const hasDuplicatedCells = R.pipe(
+    R.values,
+    R.unnest,
+    R.find(R.equals('OBS_ATTRIBUTES')),
+  )(layoutIds);
+  if (hasDuplicatedCells) {
+    const attrsIds = R.pluck('id', obsAttributes);
+    dupObs = declineObservationsOverAttributes(attrsIds, observations);
+  }
+  const seriesCombinations = getSeriesCombinations(combinations, oneValueDimensions);
+  const _dims =  R.append(
+    {
+      id: 'OBS_ATTRIBUTES',
+      values: R.prepend({ id: 'OBS_VALUE' }, obsAttributes),
+    },
+    dimensions,
+  );
+  const layout = getLayout(layoutIds, _dims, seriesCombinations, isTimeInverted);
+  const layoutDimsIds = R.map(R.reduce((acc, entry) => {
+    if (R.has('dimensions', entry)) {
+      return R.concat(acc, R.pluck('id', entry.dimensions));
+    }
+    return R.append(entry.id, acc);
+  }, []), layout);
+  const layoutIndexes = getSortedLayoutIndexes(layout, dupObs, rejectedDimensions);
+  const enhancedLayoutIndexes = parseLayoutIndexesHierarchies(
+    layoutIndexes,
+    layout,
+  );
+  const refinedLayoutIndexes = refineLayoutSize({ layout, observations: dupObs, limit })(enhancedLayoutIndexes);
+  const layoutData = getLayoutData(refinedLayoutIndexes, layout, {
+    metadataCoordinates,
+    attributesSeries,
+    customAttributes,
+    topCoordinates: header.coordinates,
+    rejectedDimensions
+  });
+
+  const cellsAttributesIds = getCellsAttributesIds(layoutDimsIds, attributes);
+  const indexedCombinations = getIndexedCombinationsByDisplay(layout, seriesCombinations);
+  const cellsMetadataCoordinates = getCellsMetadataCoordinates(metadataCoordinates, oneValueDimensions, layoutDimsIds);
+  const cells = getCells(customAttributes, cellsAttributesIds, indexedCombinations, attributesSeries, cellsMetadataCoordinates)(dupObs);
+
+  return ({
+    ...layoutData,
+    cells: getCuratedCells(cells, layout),
+    layout,
+    combinations: seriesCombinations
+  });
+};
+
+export { getTableProps };
+//# sourceMappingURL=getTableProps.js.map

package/dist/rules2/src/table/getTableProps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getTableProps.js","sources":["../../../../src/rules2/src/table/getTableProps.js"],"sourcesContent":["import * as R from 'ramda';\nimport { declineObservationsOverAttributes } from './declineObservationsOverAttributes';\nimport { getLayout } from './getLayout';\nimport { getSortedLayoutIndexes } from './getSortedLayoutIndexes';\nimport { parseLayoutIndexesHierarchies } from './parseSeriesIndexesHierarchies';\nimport { refineLayoutSize } from './refineLayoutSize2';\nimport { getLayoutData } from './getLayoutData2';\nimport { getCellsAttributesIds } from './getCellsAttributesIds';\nimport { getIndexedCombinationsByDisplay } from './getIndexedCombinationsByDisplay';\nimport { getCells } from './getCells';\nimport { getCuratedCells } from './getCuratedCells';\nimport { getSeriesCombinations } from '../getSeriesCombinations';\nimport { getCellsMetadataCoordinates } from './getCellsMetadataCoordinates';\n\nexport const getTableProps = ({ data, layoutIds, customAttributes, limit, isTimeInverted }) => {\n  const {\n    observations,\n    dimensions,\n    combinations,\n    oneValueDimensions,\n    attributesSeries,\n    metadataCoordinates,\n    attributes,\n    header,\n    rejectedDimensions=[]\n  } = data;\n\n  const obsAttributes = R.filter(\n    a => a.series && R.isEmpty(a.relationship) && a.display && !a.combined,\n    attributes\n  );\n  let dupObs = observations;\n  const hasDuplicatedCells = R.pipe(\n    R.values,\n    R.unnest,\n    R.find(R.equals('OBS_ATTRIBUTES')),\n  )(layoutIds);\n  if (hasDuplicatedCells) {\n    const attrsIds = R.pluck('id', obsAttributes);\n    dupObs = declineObservationsOverAttributes(attrsIds, observations);\n  }\n  const seriesCombinations = getSeriesCombinations(combinations, oneValueDimensions);\n  const _dims =  R.append(\n    {\n      id: 'OBS_ATTRIBUTES',\n      values: R.prepend({ id: 'OBS_VALUE' }, obsAttributes),\n    },\n    dimensions,\n  );\n  const layout = getLayout(layoutIds, _dims, seriesCombinations, isTimeInverted);\n  const layoutDimsIds = R.map(R.reduce((acc, entry) => {\n    if (R.has('dimensions', entry)) {\n      return R.concat(acc, R.pluck('id', entry.dimensions));\n    }\n    return R.append(entry.id, acc);\n  }, []), layout);\n  const layoutIndexes = getSortedLayoutIndexes(layout, dupObs, rejectedDimensions);\n  const enhancedLayoutIndexes = parseLayoutIndexesHierarchies(\n    layoutIndexes,\n    layout,\n  );\n  const refinedLayoutIndexes = refineLayoutSize({ layout, observations: dupObs, limit })(enhancedLayoutIndexes);\n  const layoutData = getLayoutData(refinedLayoutIndexes, layout, {\n    metadataCoordinates,\n    attributesSeries,\n    customAttributes,\n    topCoordinates: header.coordinates,\n    rejectedDimensions\n  });\n\n  const cellsAttributesIds = getCellsAttributesIds(layoutDimsIds, attributes);\n  const indexedCombinations = getIndexedCombinationsByDisplay(layout, seriesCombinations);\n  const cellsMetadataCoordinates = getCellsMetadataCoordinates(metadataCoordinates, oneValueDimensions, layoutDimsIds);\n  const cells = getCells(customAttributes, cellsAttributesIds, indexedCombinations, attributesSeries, cellsMetadataCoordinates)(dupObs);\n\n  return ({\n    ...layoutData,\n    cells: getCuratedCells(cells, layout),\n    layout,\n    combinations: seriesCombinations\n  });\n};\n"],"names":[],"mappings":";;;;;;;;;;;;;;AAcY,MAAC,aAAa,GAAG,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,gBAAgB,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK;AAC/F,EAAE,MAAM;AACR,IAAI,YAAY;AAChB,IAAI,UAAU;AACd,IAAI,YAAY;AAChB,IAAI,kBAAkB;AACtB,IAAI,gBAAgB;AACpB,IAAI,mBAAmB;AACvB,IAAI,UAAU;AACd,IAAI,MAAM;AACV,IAAI,kBAAkB,CAAC;AACvB,GAAG,GAAG,IAAI;;AAEV,EAAE,MAAM,aAAa,GAAG,CAAC,CAAC,MAAM;AAChC,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,QAAQ;AAC1E,IAAI;AACJ,GAAG;AACH,EAAE,IAAI,MAAM,GAAG,YAAY;AAC3B,EAAE,MAAM,kBAAkB,GAAG,CAAC,CAAC,IAAI;AACnC,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,CAAC,CAAC,MAAM;AACZ,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACtC,GAAG,CAAC,SAAS,CAAC;AACd,EAAE,IAAI,kBAAkB,EAAE;AAC1B,IAAI,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,aAAa,CAAC;AACjD,IAAI,MAAM,GAAG,iCAAiC,CAAC,QAAQ,EAAE,YAAY,CAAC;AACtE,EAAE;AACF,EAAE,MAAM,kBAAkB,GAAG,qBAAqB,CAAC,YAAY,EAAE,kBAAkB,CAAC;AACpF,EAAE,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM;AACzB,IAAI;AACJ,MAAM,EAAE,EAAE,gBAAgB;AAC1B,MAAM,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,aAAa,CAAC;AAC3D,KAAK;AACL,IAAI,UAAU;AACd,GAAG;AACH,EAAE,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,kBAAkB,EAAE,cAAc,CAAC;AAChF,EAAE,MAAM,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,KAAK;AACvD,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,YAAY,EAAE,KAAK,CAAC,EAAE;AACpC,MAAM,OAAO,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;AAC3D,IAAI;AACJ,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC;AAClC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC;AACjB,EAAE,MAAM,aAAa,GAAG,sBAAsB,CAAC,MAAM,EAAE,MAAM,EAAE,kBAAkB,CAAC;AAClF,EAAE,MAAM,qBAAqB,GAAG,6BAA6B;AAC7D,IAAI,aAAa;AACjB,IAAI,MAAM;AACV,GAAG;AACH,EAAE,MAAM,oBAAoB,GAAG,gBAAgB,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,qBAAqB,CAAC;AAC/G,EAAE,MAAM,UAAU,GAAG,aAAa,CAAC,oBAAoB,EAAE,MAAM,EAAE;AACjE,IAAI,mBAAmB;AACvB,IAAI,gBAAgB;AACpB,IAAI,gBAAgB;AACpB,IAAI,cAAc,EAAE,MAAM,CAAC,WAAW;AACtC,IAAI;AACJ,GAAG,CAAC;;AAEJ,EAAE,MAAM,kBAAkB,GAAG,qBAAqB,CAAC,aAAa,EAAE,UAAU,CAAC;AAC7E,EAAE,MAAM,mBAAmB,GAAG,+BAA+B,CAAC,MAAM,EAAE,kBAAkB,CAAC;AACzF,EAAE,MAAM,wBAAwB,GAAG,2BAA2B,CAAC,mBAAmB,EAAE,kBAAkB,EAAE,aAAa,CAAC;AACtH,EAAE,MAAM,KAAK,GAAG,QAAQ,CAAC,gBAAgB,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,wBAAwB,CAAC,CAAC,MAAM,CAAC;;AAEvI,EAAE,QAAQ;AACV,IAAI,GAAG,UAAU;AACjB,IAAI,KAAK,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC;AACzC,IAAI,MAAM;AACV,IAAI,YAAY,EAAE;AAClB,GAAG;AACH;;;;"}

package/dist/rules2/src/table/parseSeriesIndexesHierarchies.js

@@ -0,0 +1,82 @@
+import * as R from 'ramda';
+
+const registerParsedIndexes = ({ isSameSerie, ...parsed }, register) => {
+  const merged = R.mergeWith((a, b) => R.append(a || [], b), parsed, register);
+  return ({ ...merged, isSameSerie });
+};
+
+const parseParentsIndexesWithPrevious = (parentsIndexes, previousParentsIndexes) => {
+  const previousParentsSet = new Set(previousParentsIndexes);
+  const lastParentIndexInPrevious = R.findLastIndex(i => previousParentsSet.has(i), parentsIndexes);
+  const [rawPresentParentsIndexes, missingParentsIndexes] = lastParentIndexInPrevious !== -1
+    ? R.splitAt(lastParentIndexInPrevious + 1, parentsIndexes)
+    : [[], parentsIndexes];
+  const presentParentsIndexes = R.filter(i => previousParentsSet.has(i), rawPresentParentsIndexes);
+  return ({ presentParentsIndexes, missingParentsIndexes });
+};
+
+const parseSerieIndexesHierarchies = (serieIndexes, previousSerie, dimensions, isSameSerie, replicate) => {
+	return R.addIndex(R.reduce)((acc, _valueIndex, dimensionIndex) => {
+		if (R.is(Array, _valueIndex)) {
+      const previous = R.isEmpty(previousSerie) ? {} : R.map(R.nth(dimensionIndex), previousSerie);
+			const parsed = parseSerieIndexesHierarchies(
+        _valueIndex,
+        previous,
+        R.pathOr([], [dimensionIndex, 'dimensions'], dimensions),
+        acc.isSameSerie,
+        replicate
+      );
+      return registerParsedIndexes(parsed, acc);
+		}
+    const valueIndex = Math.abs(_valueIndex);
+    const parents = R.pathOr([], [dimensionIndex, 'values', valueIndex, 'parents'], dimensions);
+    const previousIndex = R.pipe(R.path(['indexes', dimensionIndex]), i => R.isNil(i) ? -1 : Math.abs(i))(previousSerie);
+    const previousParentsIndexes = acc.isSameSerie
+      ? R.pipe(R.pathOr([], ['parentsIndexes', dimensionIndex]), R.append(previousIndex))(previousSerie) : [];
+    const previousMissingIndexes = acc.isSameSerie
+      ? R.pathOr([], ['missingIndexes', dimensionIndex], previousSerie) : [];
+    /*
+      if replicate = true (sections), missing parents insdexes are replicated on each brother nodes not just the first (as empty lines)
+      thats why passing previous missing as previous parents in case replicate = false
+    */
+    const { presentParentsIndexes, missingParentsIndexes } = parseParentsIndexesWithPrevious(
+      parents,
+      replicate ? previousParentsIndexes : R.concat(previousParentsIndexes, previousMissingIndexes),
+    );
+    return registerParsedIndexes({
+      parentsIndexes: presentParentsIndexes,
+      missingIndexes: missingParentsIndexes,
+      isSameSerie: acc.isSameSerie && valueIndex === previousIndex
+    }, acc);
+  }, { parentsIndexes: [], missingIndexes: [], isSameSerie }, serieIndexes);
+};
+
+const parseSeriesIndexesHierarchies = (seriesIndexes, dimensions, replicateMissing = false) => {
+  return R.reduce((acc, { indexes, ...rest }) => {
+    const previousSerie = R.last(acc) || {};
+    const { isSameSerie, ...parsed } = parseSerieIndexesHierarchies(indexes, previousSerie, dimensions, true, replicateMissing);
+    return R.append({ indexes, ...parsed, ...rest }, acc);
+  }, [], seriesIndexes);
+};
+
+const parseLayoutIndexesHierarchies = (layoutIndexes, layout) => {
+  const header = parseSeriesIndexesHierarchies(layoutIndexes.header, layout.header);
+  const sections = R.pipe(
+    R.transpose,
+    ([_sections, _sectionsRows]) => {
+      if (R.isNil(_sections)) {
+        return [];
+      }
+      // replicate = true on sections
+      const sections = parseSeriesIndexesHierarchies(_sections, layout.sections, true);
+      const sectionsRows = R.map(rows => parseSeriesIndexesHierarchies(rows, layout.rows), _sectionsRows);
+      return R.transpose([sections, sectionsRows]);
+    }
+  )(layoutIndexes.sections);
+
+
+  return ({ header, sections });
+};
+
+export { parseLayoutIndexesHierarchies, parseSeriesIndexesHierarchies };
+//# sourceMappingURL=parseSeriesIndexesHierarchies.js.map

package/dist/rules2/src/table/parseSeriesIndexesHierarchies.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parseSeriesIndexesHierarchies.js","sources":["../../../../src/rules2/src/table/parseSeriesIndexesHierarchies.js"],"sourcesContent":["import * as R from 'ramda';\n\nconst registerParsedIndexes = ({ isSameSerie, ...parsed }, register) => {\n  const merged = R.mergeWith((a, b) => R.append(a || [], b), parsed, register);\n  return ({ ...merged, isSameSerie });\n};\n\nconst parseParentsIndexesWithPrevious = (parentsIndexes, previousParentsIndexes) => {\n  const previousParentsSet = new Set(previousParentsIndexes);\n  const lastParentIndexInPrevious = R.findLastIndex(i => previousParentsSet.has(i), parentsIndexes);\n  const [rawPresentParentsIndexes, missingParentsIndexes] = lastParentIndexInPrevious !== -1\n    ? R.splitAt(lastParentIndexInPrevious + 1, parentsIndexes)\n    : [[], parentsIndexes];\n  const presentParentsIndexes = R.filter(i => previousParentsSet.has(i), rawPresentParentsIndexes);\n  return ({ presentParentsIndexes, missingParentsIndexes });\n};\n\nconst parseSerieIndexesHierarchies = (serieIndexes, previousSerie, dimensions, isSameSerie, replicate) => {\n\treturn R.addIndex(R.reduce)((acc, _valueIndex, dimensionIndex) => {\n\t\tif (R.is(Array, _valueIndex)) {\n      const previous = R.isEmpty(previousSerie) ? {} : R.map(R.nth(dimensionIndex), previousSerie);\n\t\t\tconst parsed = parseSerieIndexesHierarchies(\n        _valueIndex,\n        previous,\n        R.pathOr([], [dimensionIndex, 'dimensions'], dimensions),\n        acc.isSameSerie,\n        replicate\n      );\n      return registerParsedIndexes(parsed, acc);\n\t\t}\n    const valueIndex = Math.abs(_valueIndex);\n    const parents = R.pathOr([], [dimensionIndex, 'values', valueIndex, 'parents'], dimensions);\n    const previousIndex = R.pipe(R.path(['indexes', dimensionIndex]), i => R.isNil(i) ? -1 : Math.abs(i))(previousSerie)\n    const previousParentsIndexes = acc.isSameSerie\n      ? R.pipe(R.pathOr([], ['parentsIndexes', dimensionIndex]), R.append(previousIndex))(previousSerie) : [];\n    const previousMissingIndexes = acc.isSameSerie\n      ? R.pathOr([], ['missingIndexes', dimensionIndex], previousSerie) : [];\n    /*\n      if replicate = true (sections), missing parents insdexes are replicated on each brother nodes not just the first (as empty lines)\n      thats why passing previous missing as previous parents in case replicate = false\n    */\n    const { presentParentsIndexes, missingParentsIndexes } = parseParentsIndexesWithPrevious(\n      parents,\n      replicate ? previousParentsIndexes : R.concat(previousParentsIndexes, previousMissingIndexes),\n    );\n    return registerParsedIndexes({\n      parentsIndexes: presentParentsIndexes,\n      missingIndexes: missingParentsIndexes,\n      isSameSerie: acc.isSameSerie && valueIndex === previousIndex\n    }, acc);\n  }, { parentsIndexes: [], missingIndexes: [], isSameSerie }, serieIndexes);\n};\n\nexport const parseSeriesIndexesHierarchies = (seriesIndexes, dimensions, replicateMissing = false) => {\n  return R.reduce((acc, { indexes, ...rest }) => {\n    const previousSerie = R.last(acc) || {};\n    const { isSameSerie, ...parsed } = parseSerieIndexesHierarchies(indexes, previousSerie, dimensions, true, replicateMissing);\n    return R.append({ indexes, ...parsed, ...rest }, acc);\n  }, [], seriesIndexes);\n};\n\nexport const parseLayoutIndexesHierarchies = (layoutIndexes, layout) => {\n  const header = parseSeriesIndexesHierarchies(layoutIndexes.header, layout.header);\n  const sections = R.pipe(\n    R.transpose,\n    ([_sections, _sectionsRows]) => {\n      if (R.isNil(_sections)) {\n        return [];\n      }\n      // replicate = true on sections\n      const sections = parseSeriesIndexesHierarchies(_sections, layout.sections, true);\n      const sectionsRows = R.map(rows => parseSeriesIndexesHierarchies(rows, layout.rows), _sectionsRows);\n      return R.transpose([sections, sectionsRows]);\n    }\n  )(layoutIndexes.sections);\n\n\n  return ({ header, sections });\n};\n"],"names":[],"mappings":";;AAEA,MAAM,qBAAqB,GAAG,CAAC,EAAE,WAAW,EAAE,GAAG,MAAM,EAAE,EAAE,QAAQ,KAAK;AACxE,EAAE,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC;AAC9E,EAAE,QAAQ,EAAE,GAAG,MAAM,EAAE,WAAW,EAAE;AACpC,CAAC;;AAED,MAAM,+BAA+B,GAAG,CAAC,cAAc,EAAE,sBAAsB,KAAK;AACpF,EAAE,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,sBAAsB,CAAC;AAC5D,EAAE,MAAM,yBAAyB,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC;AACnG,EAAE,MAAM,CAAC,wBAAwB,EAAE,qBAAqB,CAAC,GAAG,yBAAyB,KAAK;AAC1F,MAAM,CAAC,CAAC,OAAO,CAAC,yBAAyB,GAAG,CAAC,EAAE,cAAc;AAC7D,MAAM,CAAC,EAAE,EAAE,cAAc,CAAC;AAC1B,EAAE,MAAM,qBAAqB,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,wBAAwB,CAAC;AAClG,EAAE,QAAQ,EAAE,qBAAqB,EAAE,qBAAqB,EAAE;AAC1D,CAAC;;AAED,MAAM,4BAA4B,GAAG,CAAC,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,WAAW,EAAE,SAAS,KAAK;AAC1G,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,WAAW,EAAE,cAAc,KAAK;AACnE,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE;AAChC,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,aAAa,CAAC;AAClG,GAAG,MAAM,MAAM,GAAG,4BAA4B;AAC9C,QAAQ,WAAW;AACnB,QAAQ,QAAQ;AAChB,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,cAAc,EAAE,YAAY,CAAC,EAAE,UAAU,CAAC;AAChE,QAAQ,GAAG,CAAC,WAAW;AACvB,QAAQ;AACR,OAAO;AACP,MAAM,OAAO,qBAAqB,CAAC,MAAM,EAAE,GAAG,CAAC;AAC/C,EAAE;AACF,IAAI,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;AAC5C,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,UAAU,CAAC;AAC/F,IAAI,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;AACvH,IAAI,MAAM,sBAAsB,GAAG,GAAG,CAAC;AACvC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,EAAE;AAC7G,IAAI,MAAM,sBAAsB,GAAG,GAAG,CAAC;AACvC,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,gBAAgB,EAAE,cAAc,CAAC,EAAE,aAAa,CAAC,GAAG,EAAE;AAC5E;AACA;AACA;AACA;AACA,IAAI,MAAM,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,GAAG,+BAA+B;AAC5F,MAAM,OAAO;AACb,MAAM,SAAS,GAAG,sBAAsB,GAAG,CAAC,CAAC,MAAM,CAAC,sBAAsB,EAAE,sBAAsB,CAAC;AACnG,KAAK;AACL,IAAI,OAAO,qBAAqB,CAAC;AACjC,MAAM,cAAc,EAAE,qBAAqB;AAC3C,MAAM,cAAc,EAAE,qBAAqB;AAC3C,MAAM,WAAW,EAAE,GAAG,CAAC,WAAW,IAAI,UAAU,KAAK;AACrD,KAAK,EAAE,GAAG,CAAC;AACX,EAAE,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,YAAY,CAAC;AAC3E,CAAC;;AAEW,MAAC,6BAA6B,GAAG,CAAC,aAAa,EAAE,UAAU,EAAE,gBAAgB,GAAG,KAAK,KAAK;AACtG,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK;AACjD,IAAI,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;AAC3C,IAAI,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,EAAE,GAAG,4BAA4B,CAAC,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,IAAI,EAAE,gBAAgB,CAAC;AAC/H,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,GAAG,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,CAAC;AACzD,EAAE,CAAC,EAAE,EAAE,EAAE,aAAa,CAAC;AACvB;;AAEY,MAAC,6BAA6B,GAAG,CAAC,aAAa,EAAE,MAAM,KAAK;AACxE,EAAE,MAAM,MAAM,GAAG,6BAA6B,CAAC,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;AACnF,EAAE,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI;AACzB,IAAI,CAAC,CAAC,SAAS;AACf,IAAI,CAAC,CAAC,SAAS,EAAE,aAAa,CAAC,KAAK;AACpC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE;AAC9B,QAAQ,OAAO,EAAE;AACjB,MAAM;AACN;AACA,MAAM,MAAM,QAAQ,GAAG,6BAA6B,CAAC,SAAS,EAAE,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC;AACtF,MAAM,MAAM,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,6BAA6B,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,aAAa,CAAC;AACzG,MAAM,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;AAClD,IAAI;AACJ,GAAG,CAAC,aAAa,CAAC,QAAQ,CAAC;;;AAG3B,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE;AAC9B;;;;"}

package/dist/rules2/src/table/parseValueHierarchy.js

@@ -0,0 +1,29 @@
+import * as R from 'ramda';
+
+const parseValueHierarchy = (value, previousValue, indexedValues) => {
+  const parentsIds = R.propOr([], 'parents', value);
+  if (R.isEmpty(parentsIds)) {
+    return value;
+  }
+  const _previousParentsIds = R.propOr([], 'parentsIds', previousValue);
+  const previousParentsIds = R.isNil(previousValue) ? [] : R.append(R.prop('id', previousValue), _previousParentsIds);
+  const [presentIds, _missingIds] = R.addIndex(R.splitWhen)((val, ind) => R.nth(ind, previousParentsIds) !== val, parentsIds);
+  const __previousParentsIds = R.pipe(R.propOr([], 'parents'), R.pluck('id'))(previousValue);
+  const missingIds = R.pipe(
+    R.takeLastWhile(id => !R.includes(id, __previousParentsIds) && id !== R.prop('id', previousValue)),
+    ids => R.concat(ids, _missingIds)
+  )(presentIds);
+  const _previousParents = R.propOr([], 'parents', previousValue);
+  const previousParents = R.isNil(previousValue) ? [] : R.append(R.pick(['id', 'name'], previousValue), _previousParents);
+  const parents = R.takeWhile(p => R.includes(p.id, presentIds), previousParents);
+  const missingParents = R.props(missingIds, indexedValues);
+  return ({
+    ...value,
+    parents,
+    parentsIds,
+    missingParents
+  });
+};
+
+export { parseValueHierarchy };
+//# sourceMappingURL=parseValueHierarchy.js.map

package/dist/rules2/src/table/parseValueHierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parseValueHierarchy.js","sources":["../../../../src/rules2/src/table/parseValueHierarchy.js"],"sourcesContent":["import * as R from 'ramda';\r\n\r\nexport const isSameValueAsPrevious = (value, previousValue) => {\r\n  const valueHierarchicalPath = R.append(value.id, R.propOr([], 'parents', value));\r\n  const previousValueHierarchicalPath = R.append(previousValue.id, R.propOr([], 'parents', previousValue));\r\n\r\n  return R.equals(valueHierarchicalPath, previousValueHierarchicalPath);\r\n}\r\n\r\nexport const parseValueHierarchy = (value, previousValue, indexedValues) => {\r\n  const parentsIds = R.propOr([], 'parents', value);\r\n  if (R.isEmpty(parentsIds)) {\r\n    return value;\r\n  }\r\n  const _previousParentsIds = R.propOr([], 'parentsIds', previousValue);\r\n  const previousParentsIds = R.isNil(previousValue) ? [] : R.append(R.prop('id', previousValue), _previousParentsIds);\r\n  const [presentIds, _missingIds] = R.addIndex(R.splitWhen)((val, ind) => R.nth(ind, previousParentsIds) !== val, parentsIds);\r\n  const __previousParentsIds = R.pipe(R.propOr([], 'parents'), R.pluck('id'))(previousValue);\r\n  const missingIds = R.pipe(\r\n    R.takeLastWhile(id => !R.includes(id, __previousParentsIds) && id !== R.prop('id', previousValue)),\r\n    ids => R.concat(ids, _missingIds)\r\n  )(presentIds);\r\n  const _previousParents = R.propOr([], 'parents', previousValue);\r\n  const previousParents = R.isNil(previousValue) ? [] : R.append(R.pick(['id', 'name'], previousValue), _previousParents);\r\n  const parents = R.takeWhile(p => R.includes(p.id, presentIds), previousParents);\r\n  const missingParents = R.props(missingIds, indexedValues);\r\n  return ({\r\n    ...value,\r\n    parents,\r\n    parentsIds,\r\n    missingParents\r\n  });\r\n};\r\n"],"names":[],"mappings":";;AASY,MAAC,mBAAmB,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,aAAa,KAAK;AAC5E,EAAE,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;AACpD,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;AAC7B,IAAI,OAAO,KAAK,CAAC;AACjB,EAAE,CAAC;AACH,EAAE,MAAM,mBAAmB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC;AACxE,EAAE,MAAM,kBAAkB,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,mBAAmB,CAAC,CAAC;AACtH,EAAE,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,kBAAkB,CAAC,KAAK,GAAG,EAAE,UAAU,CAAC,CAAC;AAC9H,EAAE,MAAM,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;AAC7F,EAAE,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI;AAC3B,IAAI,CAAC,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;AACtG,IAAI,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC;AACrC,GAAG,CAAC,UAAU,CAAC,CAAC;AAChB,EAAE,MAAM,gBAAgB,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;AAClE,EAAE,MAAM,eAAe,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,aAAa,CAAC,EAAE,gBAAgB,CAAC,CAAC;AAC1H,EAAE,MAAM,OAAO,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,EAAE,eAAe,CAAC,CAAC;AAClF,EAAE,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;AAC5D,EAAE,QAAQ;AACV,IAAI,GAAG,KAAK;AACZ,IAAI,OAAO;AACX,IAAI,UAAU;AACd,IAAI,cAAc;AAClB,GAAG,EAAE;AACL;;;;"}