@pega/lists-core-utils 8.0.0-build.27.14

package/LICENSE

@@ -0,0 +1,185 @@
+                                 Cosmos License
+                           Version 1.0, September 2020
+   This is a proprietary license that is based on the Apache 2.0 license and
+is intended to provide a similar set of rights with the exception that any and
+     all Cosmos components shall be used only with Pegasystems Software.
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work.
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+      "Pegasystems" (or "Pega") shall mean Pegasystems Inc., a Massachusetts
+      Corporation, having an office at One Rogers Street, Cambridge, MA 02142.
+
+      "Pegasystems Software" shall mean duly licensed Pegasystems software
+      and/or subscription services including but not limited to the Pega
+      Platform.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form solely for
+      use with Pegasystems Software.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License including the limitation that
+      the Work be used only with Pegasystems Software.
+
+   5. Submission of Contributions. Any Contribution intentionally submitted
+      for inclusion in the Work by You to the Licensor shall be under the
+      terms and conditions of this License, without any additional terms or
+      conditions. Notwithstanding the above, nothing herein shall supersede
+      or modify the terms of any separate license agreement you may have
+      executed with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS

package/README.md

@@ -0,0 +1,66 @@
+# pega-ui-list-data-apis(ClientApi)
+
+This package offers two categories of utilities:
+
+1. A set of utilities for performing various operations on data, including filtering, sorting, grouping, and aggregations.
+2. A set of utilities for preparing the [DataViews api](https://docs.pega.com/bundle/dx-api/page/platform/dx-api/dx-api-data-endpoints.html) queries.
+
+## Documentation
+
+- ### [Utilities for Data operations](https://git.pega.io/projects/PS/repos/ui-lists-lib/browse/packages/ClientApi/dataApi/README.md)
+- ### [Utilities for preparing DataViews api Queries](https://git.pega.io/projects/PS/repos/ui-lists-lib/browse/packages/stateConversion/ClientApi/README.md)
+
+## Installation
+
+Install pega-ui-list-data-apis with [npm](https://www.npmjs.com/) as a dependency in your project.
+
+```bash
+  npm install pega-ui-list-data-apis
+```
+
+## Development guidelines
+
+Its a pure [javascript](https://developer.mozilla.org/en-US/docs/Web/JavaScript) library. You can write code in javascript.
+
+### Build
+
+We use [roll-up](https://rollupjs.org/) to build this package. Use below command to build the package.
+
+```bash
+  npm run build
+```
+
+### Writing Tests
+
+[Jest](https://jestjs.io/) framework is being used to for writing and running tests.Below is the standard syntax that is followed across all unit tests.
+
+```js
+describe('A description for group of tests', () => {
+  it('A description for this test', () => {
+    const result = add(2, 3);
+    expect(result).toBe(5);
+  });
+});
+```
+
+### Executing Tests
+
+The below command will run all the unit test present in this package.
+
+```bash
+  npm run test
+```
+
+### Linting
+
+Run below command to catch all the lint issues
+
+```bash
+  npm run lint
+```
+
+Run below command to fix common lint issues automatically
+
+```bash
+  npm run fix
+```

package/SECURITY.md

@@ -0,0 +1,11 @@
+# Reporting Security Issues
+
+Pegasystems takes security seriously. We appreciate your efforts to responsibly disclose your findings, and will make every effort to acknowledge your contributions.
+
+To report a security issue, [email us](mailto:opensource@pega.com;security@pega.com) and include the word "SECURITY" in the subject line.
+
+The Pega team will send a response indicating the next steps in handling your report. We may ask for additional information or guidance.
+
+## Learning More About Security
+
+To learn more about securing a Pega application or our security capabilities, please see the [security article](https://community.pega.com/knowledgebase/capabilities/security) on Pega Community and the [Pega Trust Center](https://www.pega.com/products/cloud/pega-trust-center).

package/lib/dataApi/Aggregation.d.ts

@@ -0,0 +1,2 @@
+export default function aggregation(state?: {}, dataInput?: any[], meta?: {}): {};
+//# sourceMappingURL=Aggregation.d.ts.map

package/lib/dataApi/Aggregation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Aggregation.d.ts","sourceRoot":"","sources":["../../dataApi/Aggregation.js"],"names":[],"mappings":"AA6BA,kFAeC"}

package/lib/dataApi/Aggregation.js

@@ -0,0 +1,36 @@
+import get from 'lodash.get';
+import filter from './Filter';
+/* eslint-disable no-console */
+const sum = (data, prop) => Math.round(data.reduce((acc, d) => (parseFloat(get(d, prop), 10) || 0) + acc, 0) * 100) / 100;
+const max = (data, prop) => Math.max(...data.filter(d => get(d, prop) !== undefined).map(d => parseFloat(get(d, prop), 10)));
+const min = (data, prop) => Math.min(...data.filter(d => get(d, prop) !== undefined).map(d => parseFloat(get(d, prop), 10)));
+const avg = (data, prop) => Math.round((sum(data, prop) / data.filter(d => get(d, prop) !== undefined).length) * 100) / 100;
+const aggregators = {
+    number: { sum, min, max, avg },
+    string: {}
+};
+function aggregate(type, col, data) {
+    // based on column type find if we have required function support.
+    // TODO: Need to provide support for server side from default aggregation.
+    if (aggregators[col.type] && aggregators[col.type][type]) {
+        return aggregators[col.type][type](data, col.name);
+    }
+    console.log(`We are not supporting ${type} for ${col.type} type column.`);
+    return undefined;
+}
+export default function aggregation(state = {}, dataInput = [], meta = {}) {
+    // if filtered state is there, filter data and then do the aggregation
+    const filteredData = filter(state, dataInput, meta);
+    const result = {};
+    const { aggregationInfo } = state;
+    meta.fieldDefs.forEach(col => {
+        const aggregationItem = aggregationInfo?.find(a => a.columnId === col.id || a.columnId === col.name);
+        if (aggregationItem) {
+            result[col.id] = aggregate(aggregationItem?.type?.toLowerCase(), col, filteredData);
+        }
+    });
+    return result;
+}
+// Sample output of Aggregated values.
+// {112: "178", 114: "2.37", 116: "4"}
+//# sourceMappingURL=Aggregation.js.map

package/lib/dataApi/Aggregation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Aggregation.js","sourceRoot":"","sources":["../../dataApi/Aggregation.js"],"names":[],"mappings":"AAAA,OAAO,GAAG,MAAM,YAAY,CAAC;AAE7B,OAAO,MAAM,MAAM,UAAU,CAAC;AAE9B,+BAA+B;AAC/B,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AAChG,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CACzB,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACnG,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CACzB,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACnG,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CACzB,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AAElG,MAAM,WAAW,GAAG;IAClB,MAAM,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAC9B,MAAM,EAAE,EAAE;CACX,CAAC;AAEF,SAAS,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI;IAChC,kEAAkE;IAClE,0EAA0E;IAC1E,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACzD,OAAO,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,yBAAyB,IAAI,QAAQ,GAAG,CAAC,IAAI,eAAe,CAAC,CAAC;IAC1E,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,CAAC,OAAO,UAAU,WAAW,CAAC,KAAK,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE;IACvE,sEAAsE;IACtE,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAEpD,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,eAAe,EAAE,GAAG,KAAK,CAAC;IAClC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QAC3B,MAAM,eAAe,GAAG,eAAe,EAAE,IAAI,CAC3C,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,IAAI,CACtD,CAAC;QACF,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,eAAe,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC;QACtF,CAAC;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sCAAsC;AACtC,sCAAsC","sourcesContent":["import get from 'lodash.get';\n\nimport filter from './Filter';\n\n/* eslint-disable no-console */\nconst sum = (data, prop) =>\n  Math.round(data.reduce((acc, d) => (parseFloat(get(d, prop), 10) || 0) + acc, 0) * 100) / 100;\nconst max = (data, prop) =>\n  Math.max(...data.filter(d => get(d, prop) !== undefined).map(d => parseFloat(get(d, prop), 10)));\nconst min = (data, prop) =>\n  Math.min(...data.filter(d => get(d, prop) !== undefined).map(d => parseFloat(get(d, prop), 10)));\nconst avg = (data, prop) =>\n  Math.round((sum(data, prop) / data.filter(d => get(d, prop) !== undefined).length) * 100) / 100;\n\nconst aggregators = {\n  number: { sum, min, max, avg },\n  string: {}\n};\n\nfunction aggregate(type, col, data) {\n  // based on column type find if we have required function support.\n  // TODO: Need to provide support for server side from default aggregation.\n  if (aggregators[col.type] && aggregators[col.type][type]) {\n    return aggregators[col.type][type](data, col.name);\n  }\n  console.log(`We are not supporting ${type} for ${col.type} type column.`);\n  return undefined;\n}\n\nexport default function aggregation(state = {}, dataInput = [], meta = {}) {\n  // if filtered state is there, filter data and then do the aggregation\n  const filteredData = filter(state, dataInput, meta);\n\n  const result = {};\n  const { aggregationInfo } = state;\n  meta.fieldDefs.forEach(col => {\n    const aggregationItem = aggregationInfo?.find(\n      a => a.columnId === col.id || a.columnId === col.name\n    );\n    if (aggregationItem) {\n      result[col.id] = aggregate(aggregationItem?.type?.toLowerCase(), col, filteredData);\n    }\n  });\n  return result;\n}\n\n// Sample output of Aggregated values.\n// {112: \"178\", 114: \"2.37\", 116: \"4\"}\n"]}

package/lib/dataApi/DataFeatures.d.ts

@@ -0,0 +1,9 @@
+export default function getDataFeatures(): {
+    sort: typeof sort;
+    filter: typeof filter;
+    paginate: typeof paginate;
+};
+import sort from './Sort';
+import filter from './Filter';
+import paginate from './Paginate';
+//# sourceMappingURL=DataFeatures.d.ts.map

package/lib/dataApi/DataFeatures.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataFeatures.d.ts","sourceRoot":"","sources":["../../dataApi/DataFeatures.js"],"names":[],"mappings":"AAIA;;;;EAEC;iBANgB,QAAQ;mBACN,UAAU;qBACR,YAAY"}

package/lib/dataApi/DataFeatures.js

@@ -0,0 +1,7 @@
+import sort from './Sort';
+import filter from './Filter';
+import paginate from './Paginate';
+export default function getDataFeatures() {
+    return { sort, filter, paginate };
+}
+//# sourceMappingURL=DataFeatures.js.map

package/lib/dataApi/DataFeatures.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DataFeatures.js","sourceRoot":"","sources":["../../dataApi/DataFeatures.js"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,QAAQ,CAAC;AAC1B,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,MAAM,CAAC,OAAO,UAAU,eAAe;IACrC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AACpC,CAAC","sourcesContent":["import sort from './Sort';\nimport filter from './Filter';\nimport paginate from './Paginate';\n\nexport default function getDataFeatures() {\n  return { sort, filter, paginate };\n}\n"]}

package/lib/dataApi/Filter.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Filter expression will be evaluated by evaluator provided by condition builder.
+ * Evaluator takes Filter expression, field in {name: value} format and all fields as input.
+ * For every type of filter like: search, quick filter and advance filter,
+ * filter expression will be updated and sent here for evaluation.
+ */
+export default function filter(state?: {}, data?: any[], meta?: {}): any[];
+//# sourceMappingURL=Filter.d.ts.map

package/lib/dataApi/Filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Filter.d.ts","sourceRoot":"","sources":["../../dataApi/Filter.js"],"names":[],"mappings":"AAyCA;;;;;GAKG;AACH,2EAeC"}

package/lib/dataApi/Filter.js

@@ -0,0 +1,52 @@
+import { evaluateCondition, splitConditionTree, parseLogicString } from '@pega/cosmos-react-condition-builder';
+import { getFormattedFields, getFilters, DOT_DELIMITER } from './utils';
+const VALID_TOP_LEVEL_PAGE_NAMES = ['pxRequestor', 'pxThread'];
+/**
+ * Substitutes all filters that reference a top level page (pxRequestor, etc) with a truthy expression.
+ * This makes the overall filter expression evaluate the same for client side mode (since the filter has already applied to the dataset via the server call).
+ *
+ * For example, the following condition
+ * { { lhs: { field: "pxCreateOperator" }, comparator: "EQ", { rhs: { value: "pxRequestor.pxUserIdentifier" } } }
+ * would become
+ * { { lhs: { field: "__null_matcher__" }, comparator: "IS_NULL" }
+ * @param {object} filterExpression
+ * @returns filter expression with top level page references substituted with truthy expressions
+ */
+function resolveTopLevelPageFilters(filterExpression) {
+    // Flatten the filter tree to make it easier to iterate the leaf conditions
+    const flatFilters = splitConditionTree(JSON.parse(JSON.stringify(filterExpression))); // Cloning to avoid mutating the original state.filterExpression
+    Object.values(flatFilters.conditions).forEach(leafCondition => {
+        // Check for top level page reference
+        const hasTopLevelPageReference = VALID_TOP_LEVEL_PAGE_NAMES.some(pageName => leafCondition.rhs?.value?.startsWith?.(`${pageName}.`));
+        if (hasTopLevelPageReference) {
+            // Make the condition something that will always evaluate to TRUE
+            leafCondition.lhs.field = '__null_matcher__'; // This property ID is not possible, therefore will always be NULL
+            leafCondition.comparator = 'IS_NULL';
+            delete leafCondition.rhs;
+        }
+    });
+    // Convert the flattened filters back to a tree (Fall back to original filterExpression in case of some unforeseen issue with converting back to a tree)
+    return parseLogicString(flatFilters.logic, flatFilters.conditions).condition || filterExpression;
+}
+/**
+ * Filter expression will be evaluated by evaluator provided by condition builder.
+ * Evaluator takes Filter expression, field in {name: value} format and all fields as input.
+ * For every type of filter like: search, quick filter and advance filter,
+ * filter expression will be updated and sent here for evaluation.
+ */
+export default function filter(state = {}, data = [], meta = {}) {
+    const { fieldDefs } = meta;
+    const { filterExpression } = state;
+    const formattedFields = getFormattedFields(fieldDefs);
+    const filteredFields = getFilters({ filterExpression });
+    if (filteredFields.length > 0) {
+        // TODO (ISSUE-97073) Below logic needs to be updated with a more elegant solution that actually resolves values from top-level page references
+        const preparedFilterExpression = resolveTopLevelPageFilters(filterExpression);
+        return data.filter(fieldObj => {
+            // running evaluateCondition provided by condition builder
+            return evaluateCondition(preparedFilterExpression, fieldObj, formattedFields, DOT_DELIMITER);
+        });
+    }
+    return data;
+}
+//# sourceMappingURL=Filter.js.map

package/lib/dataApi/Filter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Filter.js","sourceRoot":"","sources":["../../dataApi/Filter.js"],"names":[],"mappings":"AAAA,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,gBAAgB,EACjB,MAAM,sCAAsC,CAAC;AAE9C,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAExE,MAAM,0BAA0B,GAAG,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;AAE/D;;;;;;;;;;GAUG;AACH,SAAS,0BAA0B,CAAC,gBAAgB;IAClD,2EAA2E;IAC3E,MAAM,WAAW,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,gEAAgE;IACtJ,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;QAC5D,qCAAqC;QACrC,MAAM,wBAAwB,GAAG,0BAA0B,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAC1E,aAAa,CAAC,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,CACvD,CAAC;QACF,IAAI,wBAAwB,EAAE,CAAC;YAC7B,iEAAiE;YACjE,aAAa,CAAC,GAAG,CAAC,KAAK,GAAG,kBAAkB,CAAC,CAAC,kEAAkE;YAChH,aAAa,CAAC,UAAU,GAAG,SAAS,CAAC;YACrC,OAAO,aAAa,CAAC,GAAG,CAAC;QAC3B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,wJAAwJ;IACxJ,OAAO,gBAAgB,CAAC,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,UAAU,CAAC,CAAC,SAAS,IAAI,gBAAgB,CAAC;AACnG,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,MAAM,CAAC,KAAK,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE;IAC7D,MAAM,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;IAC3B,MAAM,EAAE,gBAAgB,EAAE,GAAG,KAAK,CAAC;IACnC,MAAM,eAAe,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;IACtD,MAAM,cAAc,GAAG,UAAU,CAAC,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACxD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,+IAA+I;QAC/I,MAAM,wBAAwB,GAAG,0BAA0B,CAAC,gBAAgB,CAAC,CAAC;QAE9E,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;YAC5B,0DAA0D;YAC1D,OAAO,iBAAiB,CAAC,wBAAwB,EAAE,QAAQ,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;QAC/F,CAAC,CAAC,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC","sourcesContent":["import {\n  evaluateCondition,\n  splitConditionTree,\n  parseLogicString\n} from '@pega/cosmos-react-condition-builder';\n\nimport { getFormattedFields, getFilters, DOT_DELIMITER } from './utils';\n\nconst VALID_TOP_LEVEL_PAGE_NAMES = ['pxRequestor', 'pxThread'];\n\n/**\n * Substitutes all filters that reference a top level page (pxRequestor, etc) with a truthy expression.\n * This makes the overall filter expression evaluate the same for client side mode (since the filter has already applied to the dataset via the server call).\n *\n * For example, the following condition\n * { { lhs: { field: \"pxCreateOperator\" }, comparator: \"EQ\", { rhs: { value: \"pxRequestor.pxUserIdentifier\" } } }\n * would become\n * { { lhs: { field: \"__null_matcher__\" }, comparator: \"IS_NULL\" }\n * @param {object} filterExpression\n * @returns filter expression with top level page references substituted with truthy expressions\n */\nfunction resolveTopLevelPageFilters(filterExpression) {\n  // Flatten the filter tree to make it easier to iterate the leaf conditions\n  const flatFilters = splitConditionTree(JSON.parse(JSON.stringify(filterExpression))); // Cloning to avoid mutating the original state.filterExpression\n  Object.values(flatFilters.conditions).forEach(leafCondition => {\n    // Check for top level page reference\n    const hasTopLevelPageReference = VALID_TOP_LEVEL_PAGE_NAMES.some(pageName =>\n      leafCondition.rhs?.value?.startsWith?.(`${pageName}.`)\n    );\n    if (hasTopLevelPageReference) {\n      // Make the condition something that will always evaluate to TRUE\n      leafCondition.lhs.field = '__null_matcher__'; // This property ID is not possible, therefore will always be NULL\n      leafCondition.comparator = 'IS_NULL';\n      delete leafCondition.rhs;\n    }\n  });\n\n  // Convert the flattened filters back to a tree (Fall back to original filterExpression in case of some unforeseen issue with converting back to a tree)\n  return parseLogicString(flatFilters.logic, flatFilters.conditions).condition || filterExpression;\n}\n\n/**\n * Filter expression will be evaluated by evaluator provided by condition builder.\n * Evaluator takes Filter expression, field in {name: value} format and all fields as input.\n * For every type of filter like: search, quick filter and advance filter,\n * filter expression will be updated and sent here for evaluation.\n */\nexport default function filter(state = {}, data = [], meta = {}) {\n  const { fieldDefs } = meta;\n  const { filterExpression } = state;\n  const formattedFields = getFormattedFields(fieldDefs);\n  const filteredFields = getFilters({ filterExpression });\n  if (filteredFields.length > 0) {\n    // TODO (ISSUE-97073) Below logic needs to be updated with a more elegant solution that actually resolves values from top-level page references\n    const preparedFilterExpression = resolveTopLevelPageFilters(filterExpression);\n\n    return data.filter(fieldObj => {\n      // running evaluateCondition provided by condition builder\n      return evaluateCondition(preparedFilterExpression, fieldObj, formattedFields, DOT_DELIMITER);\n    });\n  }\n  return data;\n}\n"]}

package/lib/dataApi/Grouping.d.ts

@@ -0,0 +1,2 @@
+export default function grouping(state?: {}, dataInput?: any[], meta?: {}): any[];
+//# sourceMappingURL=Grouping.d.ts.map

package/lib/dataApi/Grouping.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Grouping.d.ts","sourceRoot":"","sources":["../../dataApi/Grouping.js"],"names":[],"mappings":"AAwCA,kFA4FC"}

package/lib/dataApi/Grouping.js

@@ -0,0 +1,133 @@
+import get from 'lodash.get';
+import { getFieldsMap } from '../stateConversion/PrepareDatapageQuery';
+import filter from './Filter';
+import { getDateFunctionValue } from './utils';
+// eslint-disable-next-line default-param-last
+function insertSorted(arr, obj, key, order = 'asc', compareValuesAsNumbers) {
+    let inserted = false;
+    for (let i = 0; i < arr.length; i += 1) {
+        const input = arr[i];
+        const objValue = compareValuesAsNumbers ? Number(obj[key]) : obj[key];
+        const inputValue = compareValuesAsNumbers ? Number(input[key]) : input[key];
+        if (order === 'asc' ? objValue <= inputValue : objValue >= inputValue) {
+            arr.splice(i, 0, obj);
+            inserted = true;
+            break;
+        }
+    }
+    if (!arr.length || !inserted) {
+        arr.push(obj);
+    }
+}
+/** Returns the value of a group in the given data row */
+function getGroupValueInRow(dataRow, group, field) {
+    // If it's a regular group (i.e. without any dateFunction), return the field value directly
+    if (!group.dateFunction) {
+        return get(dataRow, field.name);
+    }
+    // When a dateFunction is present, format the value to match the conventions from the Data API
+    return getDateFunctionValue(dataRow, field.name, group.dateFunction);
+}
+// Provides grouped information when group state is provided with data.
+// Group information has following properties for each grouped value.
+// name,count:leafnodecount,level,groupBy: key generated using getGroupKey
+export default function grouping(state = {}, dataInput = [], meta = {}) {
+    // if filtered state is there, filter data and then
+    // prepare your group info based on filtered data.
+    const filteredData = filter(state, dataInput, meta);
+    // get groups from state in sorted order of level.
+    const originalGroups = [...state.groups];
+    const groups = originalGroups.sort((g1, g2) => g1.level - g2.level);
+    const result = [];
+    const object = { _: { children: result } };
+    const fieldsMap = getFieldsMap(meta.fieldDefs);
+    const aggregationInfo = state.aggregationInfo?.map(agg => ({
+        ...agg,
+        type: agg.type.toLowerCase(),
+        name: agg.columnId
+    })) || [];
+    filteredData.forEach(d => {
+        groups.reduce((acc, g) => {
+            const field = fieldsMap.get(g.columnId);
+            const name = getGroupValueInRow(d, g, field);
+            if (!acc[name]) {
+                acc[name] = {
+                    _: {
+                        name,
+                        count: 0,
+                        agg: {},
+                        data: d
+                    }
+                };
+                aggregationInfo.forEach(agg => {
+                    acc[name]._.agg[agg.name] = {
+                        max: null,
+                        min: null,
+                        sum: null,
+                        avg: null,
+                        nonNullCount: 0
+                    };
+                });
+                acc._.children = acc._.children || [];
+                const compareValuesAsNumbers = field.type === 'number'; // These need to be parsed as numbers before sorting. DataViews API returns everything as a string
+                insertSorted(acc._.children, acc[name]._, 'name', g.order, compareValuesAsNumbers);
+            }
+            acc[name]._.count += 1;
+            aggregationInfo.forEach(agg => {
+                const aggValue = get(d, agg.name);
+                if (aggValue === null || aggValue === undefined) {
+                    return;
+                }
+                switch (agg.type) {
+                    case 'max':
+                        if (typeof acc[name]._.agg[agg.name].max !== 'number') {
+                            acc[name]._.agg[agg.name].max = get(d, agg.name);
+                        }
+                        else {
+                            acc[name]._.agg[agg.name].max =
+                                Math.max(acc[name]._.agg[agg.name].max, get(d, agg.name)) || null;
+                        }
+                        break;
+                    case 'min':
+                        if (typeof acc[name]._.agg[agg.name].min !== 'number') {
+                            acc[name]._.agg[agg.name].min = get(d, agg.name);
+                        }
+                        else {
+                            acc[name]._.agg[agg.name].min =
+                                Math.min(acc[name]._.agg[agg.name].min, get(d, agg.name)) || null;
+                        }
+                        break;
+                    case 'sum':
+                        acc[name]._.agg[agg.name].sum =
+                            Math.round(((acc[name]._.agg[agg.name].sum || 0) + get(d, agg.name)) * 100) / 100;
+                        break;
+                    case 'avg':
+                        acc[name]._.agg[agg.name].nonNullCount += 1;
+                        acc[name]._.agg[agg.name].sum = (acc[name]._.agg[agg.name].sum || 0) + get(d, agg.name);
+                        acc[name]._.agg[agg.name].avg =
+                            Math.round((acc[name]._.agg[agg.name].sum / acc[name]._.agg[agg.name].nonNullCount) * 100) / 100;
+                        break;
+                    default:
+                        break;
+                }
+            });
+            return acc[name];
+        }, object);
+    });
+    return result;
+}
+// Sample output of grouping.
+// 0:
+// name: "New"
+// count: 9
+// expanded: true
+// children: Array(3)
+// 0: {name: "10", count: 5, expanded: true}
+// 1: {name: "85", count: 1, expanded: true}
+// 2: {name: "86", count: 3, expanded: true}
+// length: 3
+// __proto__: Array(0)
+// __proto__: Object
+// length: 1
+// __proto__: Array(0)
+//# sourceMappingURL=Grouping.js.map

package/lib/dataApi/Grouping.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Grouping.js","sourceRoot":"","sources":["../../dataApi/Grouping.js"],"names":[],"mappings":"AAAA,OAAO,GAAG,MAAM,YAAY,CAAC;AAE7B,OAAO,EAAE,YAAY,EAAE,MAAM,yCAAyC,CAAC;AAEvE,OAAO,MAAM,MAAM,UAAU,CAAC;AAC9B,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAC;AAE/C,8CAA8C;AAC9C,SAAS,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,GAAG,KAAK,EAAE,sBAAsB;IACxE,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,QAAQ,GAAG,sBAAsB,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,UAAU,GAAG,sBAAsB,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5E,IAAI,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,IAAI,UAAU,CAAC,CAAC,CAAC,QAAQ,IAAI,UAAU,EAAE,CAAC;YACtE,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;YACtB,QAAQ,GAAG,IAAI,CAAC;YAChB,MAAM;QACR,CAAC;IACH,CAAC;IAED,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,SAAS,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK;IAC/C,2FAA2F;IAC3F,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QACxB,OAAO,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,8FAA8F;IAC9F,OAAO,oBAAoB,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;AACvE,CAAC;AAED,uEAAuE;AACvE,qEAAqE;AACrE,0EAA0E;AAC1E,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,KAAK,GAAG,EAAE,EAAE,SAAS,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE;IACpE,mDAAmD;IACnD,kDAAkD;IAClD,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAEpD,kDAAkD;IAClD,MAAM,cAAc,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACzC,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;IACpE,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,MAAM,MAAM,GAAG,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAE/C,MAAM,eAAe,GACnB,KAAK,CAAC,eAAe,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,GAAG,GAAG;QACN,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE;QAC5B,IAAI,EAAE,GAAG,CAAC,QAAQ;KACnB,CAAC,CAAC,IAAI,EAAE,CAAC;IAEZ,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACvB,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACvB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACf,GAAG,CAAC,IAAI,CAAC,GAAG;oBACV,CAAC,EAAE;wBACD,IAAI;wBACJ,KAAK,EAAE,CAAC;wBACR,GAAG,EAAE,EAAE;wBACP,IAAI,EAAE,CAAC;qBACR;iBACF,CAAC;gBACF,eAAe,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;oBAC5B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG;wBAC1B,GAAG,EAAE,IAAI;wBACT,GAAG,EAAE,IAAI;wBACT,GAAG,EAAE,IAAI;wBACT,GAAG,EAAE,IAAI;wBACT,YAAY,EAAE,CAAC;qBAChB,CAAC;gBACJ,CAAC,CAAC,CAAC;gBACH,GAAG,CAAC,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC;gBAEtC,MAAM,sBAAsB,GAAG,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,kGAAkG;gBAC1J,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,EAAE,sBAAsB,CAAC,CAAC;YACrF,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAEvB,eAAe,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBAC5B,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;gBAClC,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAChD,OAAO;gBACT,CAAC;gBACD,QAAQ,GAAG,CAAC,IAAI,EAAE,CAAC;oBACjB,KAAK,KAAK;wBACR,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;4BACtD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG;gCAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;wBACtE,CAAC;wBACD,MAAM;oBACR,KAAK,KAAK;wBACR,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;4BACtD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG;gCAC3B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC;wBACtE,CAAC;wBACD,MAAM;oBACR,KAAK,KAAK;wBACR,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG;4BAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;wBACpF,MAAM;oBACR,KAAK,KAAK;wBACR,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC;wBAC5C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC;wBACxF,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG;4BAC3B,IAAI,CAAC,KAAK,CACR,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,GAAG,GAAG,CAC/E,GAAG,GAAG,CAAC;wBACV,MAAM;oBACR;wBACE,MAAM;gBACV,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC,EAAE,MAAM,CAAC,CAAC;IACb,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,6BAA6B;AAE7B,KAAK;AACL,cAAc;AACd,WAAW;AACX,iBAAiB;AACjB,qBAAqB;AACrB,4CAA4C;AAC5C,4CAA4C;AAC5C,4CAA4C;AAC5C,YAAY;AACZ,sBAAsB;AACtB,oBAAoB;AACpB,YAAY;AACZ,sBAAsB","sourcesContent":["import get from 'lodash.get';\n\nimport { getFieldsMap } from '../stateConversion/PrepareDatapageQuery';\n\nimport filter from './Filter';\nimport { getDateFunctionValue } from './utils';\n\n// eslint-disable-next-line default-param-last\nfunction insertSorted(arr, obj, key, order = 'asc', compareValuesAsNumbers) {\n  let inserted = false;\n  for (let i = 0; i < arr.length; i += 1) {\n    const input = arr[i];\n    const objValue = compareValuesAsNumbers ? Number(obj[key]) : obj[key];\n    const inputValue = compareValuesAsNumbers ? Number(input[key]) : input[key];\n    if (order === 'asc' ? objValue <= inputValue : objValue >= inputValue) {\n      arr.splice(i, 0, obj);\n      inserted = true;\n      break;\n    }\n  }\n\n  if (!arr.length || !inserted) {\n    arr.push(obj);\n  }\n}\n\n/** Returns the value of a group in the given data row */\nfunction getGroupValueInRow(dataRow, group, field) {\n  // If it's a regular group (i.e. without any dateFunction), return the field value directly\n  if (!group.dateFunction) {\n    return get(dataRow, field.name);\n  }\n\n  // When a dateFunction is present, format the value to match the conventions from the Data API\n  return getDateFunctionValue(dataRow, field.name, group.dateFunction);\n}\n\n// Provides grouped information when group state is provided with data.\n// Group information has following properties for each grouped value.\n// name,count:leafnodecount,level,groupBy: key generated using getGroupKey\nexport default function grouping(state = {}, dataInput = [], meta = {}) {\n  // if filtered state is there, filter data and then\n  // prepare your group info based on filtered data.\n  const filteredData = filter(state, dataInput, meta);\n\n  // get groups from state in sorted order of level.\n  const originalGroups = [...state.groups];\n  const groups = originalGroups.sort((g1, g2) => g1.level - g2.level);\n  const result = [];\n  const object = { _: { children: result } };\n  const fieldsMap = getFieldsMap(meta.fieldDefs);\n\n  const aggregationInfo =\n    state.aggregationInfo?.map(agg => ({\n      ...agg,\n      type: agg.type.toLowerCase(),\n      name: agg.columnId\n    })) || [];\n\n  filteredData.forEach(d => {\n    groups.reduce((acc, g) => {\n      const field = fieldsMap.get(g.columnId);\n      const name = getGroupValueInRow(d, g, field);\n      if (!acc[name]) {\n        acc[name] = {\n          _: {\n            name,\n            count: 0,\n            agg: {},\n            data: d\n          }\n        };\n        aggregationInfo.forEach(agg => {\n          acc[name]._.agg[agg.name] = {\n            max: null,\n            min: null,\n            sum: null,\n            avg: null,\n            nonNullCount: 0\n          };\n        });\n        acc._.children = acc._.children || [];\n\n        const compareValuesAsNumbers = field.type === 'number'; // These need to be parsed as numbers before sorting. DataViews API returns everything as a string\n        insertSorted(acc._.children, acc[name]._, 'name', g.order, compareValuesAsNumbers);\n      }\n      acc[name]._.count += 1;\n\n      aggregationInfo.forEach(agg => {\n        const aggValue = get(d, agg.name);\n        if (aggValue === null || aggValue === undefined) {\n          return;\n        }\n        switch (agg.type) {\n          case 'max':\n            if (typeof acc[name]._.agg[agg.name].max !== 'number') {\n              acc[name]._.agg[agg.name].max = get(d, agg.name);\n            } else {\n              acc[name]._.agg[agg.name].max =\n                Math.max(acc[name]._.agg[agg.name].max, get(d, agg.name)) || null;\n            }\n            break;\n          case 'min':\n            if (typeof acc[name]._.agg[agg.name].min !== 'number') {\n              acc[name]._.agg[agg.name].min = get(d, agg.name);\n            } else {\n              acc[name]._.agg[agg.name].min =\n                Math.min(acc[name]._.agg[agg.name].min, get(d, agg.name)) || null;\n            }\n            break;\n          case 'sum':\n            acc[name]._.agg[agg.name].sum =\n              Math.round(((acc[name]._.agg[agg.name].sum || 0) + get(d, agg.name)) * 100) / 100;\n            break;\n          case 'avg':\n            acc[name]._.agg[agg.name].nonNullCount += 1;\n            acc[name]._.agg[agg.name].sum = (acc[name]._.agg[agg.name].sum || 0) + get(d, agg.name);\n            acc[name]._.agg[agg.name].avg =\n              Math.round(\n                (acc[name]._.agg[agg.name].sum / acc[name]._.agg[agg.name].nonNullCount) * 100\n              ) / 100;\n            break;\n          default:\n            break;\n        }\n      });\n\n      return acc[name];\n    }, object);\n  });\n\n  return result;\n}\n\n// Sample output of grouping.\n\n// 0:\n// name: \"New\"\n// count: 9\n// expanded: true\n// children: Array(3)\n// 0: {name: \"10\", count: 5, expanded: true}\n// 1: {name: \"85\", count: 1, expanded: true}\n// 2: {name: \"86\", count: 3, expanded: true}\n// length: 3\n// __proto__: Array(0)\n// __proto__: Object\n// length: 1\n// __proto__: Array(0)\n"]}

package/lib/dataApi/Paginate.d.ts

@@ -0,0 +1,2 @@
+export default function paginate(state: {} | undefined, data: any[] | undefined, meta: any): any[];
+//# sourceMappingURL=Paginate.d.ts.map

package/lib/dataApi/Paginate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Paginate.d.ts","sourceRoot":"","sources":["../../dataApi/Paginate.js"],"names":[],"mappings":"AAUA,mGA0CC"}