@tidyjs/tidy 2.5.2 → 2.6.1

package/dist/es/pivotLonger.js

@@ -3,7 +3,7 @@ import { processSelectors } from './select.js';
 function pivotLonger(options) {
   const _pivotLonger = (items) => {
     var _a;
-    const {namesTo, valuesTo, namesSep = "_"} = options;
+    const { namesTo, valuesTo, namesSep = "_" } = options;
     const cols = (_a = options.cols) != null ? _a : [];
     const colsKeys = processSelectors(items, cols);
     const namesToKeys = Array.isArray(namesTo) ? namesTo : [namesTo];
@@ -11,18 +11,42 @@ function pivotLonger(options) {
     const hasMultipleNamesTo = namesToKeys.length > 1;
     const hasMultipleValuesTo = valuesToKeys.length > 1;
     const longer = [];
+    if (!items.length) return longer;
+    const colsKeysSet = new Set(colsKeys);
+    const remainingKeys = Object.keys(items[0]).filter(
+      (key) => !colsKeysSet.has(key)
+    );
+    const nameValueKeysWithoutValuePrefix = hasMultipleValuesTo ? Array.from(
+      new Set(
+        colsKeys.map(
+          (key) => key.substring(key.indexOf(namesSep) + 1)
+        )
+      )
+    ) : colsKeys;
+    const nameValuePartsMap = hasMultipleNamesTo ? new Map(
+      nameValueKeysWithoutValuePrefix.map((nv) => [
+        nv,
+        nv.split(namesSep)
+      ])
+    ) : null;
+    const itemKeysMap = hasMultipleValuesTo ? new Map(
+      nameValueKeysWithoutValuePrefix.map((nv) => [
+        nv,
+        valuesToKeys.map((vk) => `${String(vk)}${namesSep}${String(nv)}`)
+      ])
+    ) : null;
     for (const item of items) {
-      const remainingKeys = Object.keys(item).filter((key) => !colsKeys.includes(key));
       const baseObj = {};
       for (const key of remainingKeys) {
         baseObj[key] = item[key];
       }
-      const nameValueKeysWithoutValuePrefix = hasMultipleValuesTo ? Array.from(new Set(colsKeys.map((key) => key.substring(key.indexOf(namesSep) + 1)))) : colsKeys;
       for (const nameValue of nameValueKeysWithoutValuePrefix) {
-        const entryObj = {...baseObj};
-        for (const valueKey of valuesToKeys) {
-          const itemKey = hasMultipleValuesTo ? `${valueKey}${namesSep}${nameValue}` : nameValue;
-          const nameValueParts = hasMultipleNamesTo ? nameValue.split(namesSep) : [nameValue];
+        const entryObj = { ...baseObj };
+        const nameValueParts = nameValuePartsMap ? nameValuePartsMap.get(nameValue) : [nameValue];
+        const itemKeys = itemKeysMap ? itemKeysMap.get(nameValue) : null;
+        for (let vi = 0; vi < valuesToKeys.length; vi++) {
+          const valueKey = valuesToKeys[vi];
+          const itemKey = itemKeys ? itemKeys[vi] : nameValue;
           let i = 0;
           for (const nameKey of namesToKeys) {
             const nameValuePart = nameValueParts[i++];

package/dist/es/pivotLonger.js.map

@@ -1 +1 @@
-{"version":3,"file":"pivotLonger.js","sources":["../../src/pivotLonger.ts"],"sourcesContent":["import { SingleOrArray } from './helpers/singleOrArray';\nimport { TidyFn, Key } from './types';\nimport { processSelectors } from './select';\n\ntype PivotLongerOptions = {\n  cols?: any; // Typescript gives me max call stack failed if I use KeysInput from `select`\n  namesTo: SingleOrArray<Key>;\n  namesSep?: string;\n  valuesTo: SingleOrArray<Key>;\n};\n\ntype PivotOutput = Record<Key, any>;\n\nexport function pivotLonger<T extends object>(\n  options: PivotLongerOptions\n): TidyFn<T, PivotOutput> {\n  const _pivotLonger: TidyFn<T, PivotOutput> = (items: T[]): PivotOutput[] => {\n    const { namesTo, valuesTo, namesSep = '_' } = options;\n    const cols = options.cols ?? [];\n    const colsKeys = processSelectors(items, cols) as (keyof T)[];\n\n    const namesToKeys = Array.isArray(namesTo) ? namesTo : [namesTo];\n    const valuesToKeys = Array.isArray(valuesTo) ? valuesTo : [valuesTo];\n    const hasMultipleNamesTo = namesToKeys.length > 1;\n    const hasMultipleValuesTo = valuesToKeys.length > 1;\n\n    const longer: PivotOutput[] = [];\n\n    // expand each item into multiple items\n    for (const item of items) {\n      // keys not included in colsKeys must be kept\n      const remainingKeys = Object.keys(item).filter(\n        (key) => !colsKeys.includes(key as keyof T)\n      ) as (keyof T)[];\n\n      // the keys not in `cols` are the same for each row\n      const baseObj = {} as PivotOutput;\n      for (const key of remainingKeys) {\n        baseObj[key as keyof PivotOutput] = item[key];\n      }\n\n      // remove the `${valueKey}_` prefix when we have multiple values\n      const nameValueKeysWithoutValuePrefix = hasMultipleValuesTo\n        ? Array.from(\n            new Set(\n              colsKeys.map((key) =>\n                (key as string).substring((key as string).indexOf(namesSep) + 1)\n              )\n            )\n          )\n        : colsKeys;\n\n      // e.g. `nameValue` or `nameValue1_nameValue2`\n      for (const nameValue of nameValueKeysWithoutValuePrefix) {\n        const entryObj = { ...baseObj };\n        for (const valueKey of valuesToKeys) {\n          // e.g. `valueKey_nameValue1_nameValue2`\n          const itemKey = hasMultipleValuesTo\n            ? `${valueKey}${namesSep}${nameValue}`\n            : nameValue;\n          const nameValueParts = hasMultipleNamesTo\n            ? (nameValue as string).split(namesSep)\n            : [nameValue];\n\n          let i = 0;\n          for (const nameKey of namesToKeys) {\n            const nameValuePart = nameValueParts[i++];\n            entryObj[nameKey] = nameValuePart;\n            entryObj[valueKey] = item[itemKey as keyof T];\n          }\n        }\n\n        longer.push(entryObj);\n      }\n    }\n\n    return longer;\n  };\n\n  return _pivotLonger;\n}\n"],"names":[],"mappings":";;qBAcE;AAEA,QAAM,eAAuC,CAAC;AAhBhD;AAiBI,UAAM,CAAE,SAAS,UAAU,WAAW,OAAQ;AAC9C,UAAM,OAAO,cAAQ,SAAR,YAAgB;AAC7B,UAAM,WAAW,iBAAiB,OAAO;AAEzC,UAAM,cAAc,MAAM,QAAQ,WAAW,UAAU,CAAC;AACxD,UAAM,eAAe,MAAM,QAAQ,YAAY,WAAW,CAAC;AAC3D,UAAM,qBAAqB,YAAY,SAAS;AAChD,UAAM,sBAAsB,aAAa,SAAS;AAElD,UAAM,SAAwB;AAG9B,eAAW,QAAQ;AAEjB,YAAM,gBAAgB,OAAO,KAAK,MAAM,OACtC,CAAC,QAAQ,CAAC,SAAS,SAAS;AAI9B,YAAM,UAAU;AAChB,iBAAW,OAAO;AAChB,gBAAQ,OAA4B,KAAK;AAAA;AAI3C,YAAM,kCAAkC,sBACpC,MAAM,KACJ,IAAI,IACF,SAAS,IAAI,CAAC,QACX,IAAe,UAAW,IAAe,QAAQ,YAAY,QAIpE;AAGJ,iBAAW,aAAa;AACtB,cAAM,WAAW,IAAK;AACtB,mBAAW,YAAY;AAErB,gBAAM,UAAU,sBACZ,GAAG,WAAW,WAAW,cACzB;AACJ,gBAAM,iBAAiB,qBAClB,UAAqB,MAAM,YAC5B,CAAC;AAEL,cAAI,IAAI;AACR,qBAAW,WAAW;AACpB,kBAAM,gBAAgB,eAAe;AACrC,qBAAS,WAAW;AACpB,qBAAS,YAAY,KAAK;AAAA;AAAA;AAI9B,eAAO,KAAK;AAAA;AAAA;AAIhB,WAAO;AAAA;AAGT,SAAO;AAAA;;;;"}
+{"version":3,"file":"pivotLonger.js","sources":["../../src/pivotLonger.ts"],"sourcesContent":["import { SingleOrArray } from './helpers/singleOrArray';\nimport { TidyFn, Key } from './types';\nimport { processSelectors } from './select';\n\ntype PivotLongerOptions = {\n  cols?: any; // Typescript gives me max call stack failed if I use KeysInput from `select`\n  namesTo: SingleOrArray<Key>;\n  namesSep?: string;\n  valuesTo: SingleOrArray<Key>;\n};\n\ntype PivotOutput = Record<Key, any>;\n\nexport function pivotLonger<T extends object>(\n  options: PivotLongerOptions\n): TidyFn<T, PivotOutput> {\n  const _pivotLonger: TidyFn<T, PivotOutput> = (items: T[]): PivotOutput[] => {\n    const { namesTo, valuesTo, namesSep = '_' } = options;\n    const cols = options.cols ?? [];\n    const colsKeys = processSelectors(items, cols) as (keyof T)[];\n\n    const namesToKeys = Array.isArray(namesTo) ? namesTo : [namesTo];\n    const valuesToKeys = Array.isArray(valuesTo) ? valuesTo : [valuesTo];\n    const hasMultipleNamesTo = namesToKeys.length > 1;\n    const hasMultipleValuesTo = valuesToKeys.length > 1;\n\n    const longer: PivotOutput[] = [];\n\n    if (!items.length) return longer;\n\n    // keys not included in colsKeys must be kept (same for all items)\n    const colsKeysSet = new Set<keyof T>(colsKeys);\n    const remainingKeys = Object.keys(items[0]).filter(\n      (key) => !colsKeysSet.has(key as keyof T)\n    ) as (keyof T)[];\n\n    // remove the `${valueKey}_` prefix when we have multiple values\n    // (invariant across items, compute once)\n    const nameValueKeysWithoutValuePrefix = hasMultipleValuesTo\n      ? Array.from(\n          new Set(\n            colsKeys.map((key) =>\n              (key as string).substring((key as string).indexOf(namesSep) + 1)\n            )\n          )\n        )\n      : colsKeys;\n\n    // pre-compute split parts for each nameValue (invariant across items)\n    const nameValuePartsMap = hasMultipleNamesTo\n      ? new Map(\n          (nameValueKeysWithoutValuePrefix as string[]).map((nv) => [\n            nv,\n            nv.split(namesSep),\n          ])\n        )\n      : null;\n\n    // pre-compute item keys for each nameValue+valueKey combination\n    const itemKeysMap = hasMultipleValuesTo\n      ? new Map(\n          (nameValueKeysWithoutValuePrefix as string[]).map((nv) => [\n            nv,\n            valuesToKeys.map((vk) => `${String(vk)}${namesSep}${String(nv)}`),\n          ])\n        )\n      : null;\n\n    // expand each item into multiple items\n    for (const item of items) {\n      // the keys not in `cols` are the same for each row\n      const baseObj = {} as PivotOutput;\n      for (const key of remainingKeys) {\n        baseObj[key as keyof PivotOutput] = item[key];\n      }\n\n      // e.g. `nameValue` or `nameValue1_nameValue2`\n      for (const nameValue of nameValueKeysWithoutValuePrefix) {\n        const entryObj = { ...baseObj };\n        const nameValueParts = nameValuePartsMap\n          ? nameValuePartsMap.get(nameValue as string)!\n          : [nameValue];\n        const itemKeys = itemKeysMap\n          ? itemKeysMap.get(nameValue as string)!\n          : null;\n\n        for (let vi = 0; vi < valuesToKeys.length; vi++) {\n          const valueKey = valuesToKeys[vi];\n          const itemKey = itemKeys ? itemKeys[vi] : nameValue;\n\n          let i = 0;\n          for (const nameKey of namesToKeys) {\n            const nameValuePart = nameValueParts[i++];\n            entryObj[nameKey] = nameValuePart;\n            entryObj[valueKey] = item[itemKey as keyof T];\n          }\n        }\n\n        longer.push(entryObj);\n      }\n    }\n\n    return longer;\n  };\n\n  return _pivotLonger;\n}\n"],"names":[],"mappings":";;AAaO,SAAS,YACd,OACwB,EAAA;AACxB,EAAM,MAAA,YAAA,GAAuC,CAAC,KAA8B,KAAA;AAhB9E,IAAA,IAAA,EAAA,CAAA;AAiBI,IAAA,MAAM,EAAE,OAAA,EAAS,QAAU,EAAA,QAAA,GAAW,KAAQ,GAAA,OAAA,CAAA;AAC9C,IAAA,MAAM,IAAO,GAAA,CAAA,EAAA,GAAA,OAAA,CAAQ,IAAR,KAAA,IAAA,GAAA,EAAA,GAAgB,EAAC,CAAA;AAC9B,IAAM,MAAA,QAAA,GAAW,gBAAiB,CAAA,KAAA,EAAO,IAAI,CAAA,CAAA;AAE7C,IAAA,MAAM,cAAc,KAAM,CAAA,OAAA,CAAQ,OAAO,CAAI,GAAA,OAAA,GAAU,CAAC,OAAO,CAAA,CAAA;AAC/D,IAAA,MAAM,eAAe,KAAM,CAAA,OAAA,CAAQ,QAAQ,CAAI,GAAA,QAAA,GAAW,CAAC,QAAQ,CAAA,CAAA;AACnE,IAAM,MAAA,kBAAA,GAAqB,YAAY,MAAS,GAAA,CAAA,CAAA;AAChD,IAAM,MAAA,mBAAA,GAAsB,aAAa,MAAS,GAAA,CAAA,CAAA;AAElD,IAAA,MAAM,SAAwB,EAAC,CAAA;AAE/B,IAAI,IAAA,CAAC,KAAM,CAAA,MAAA,EAAe,OAAA,MAAA,CAAA;AAG1B,IAAM,MAAA,WAAA,GAAc,IAAI,GAAA,CAAa,QAAQ,CAAA,CAAA;AAC7C,IAAA,MAAM,gBAAgB,MAAO,CAAA,IAAA,CAAK,KAAM,CAAA,CAAC,CAAC,CAAE,CAAA,MAAA;AAAA,MAC1C,CAAC,GAAA,KAAQ,CAAC,WAAA,CAAY,IAAI,GAAc,CAAA;AAAA,KAC1C,CAAA;AAIA,IAAM,MAAA,+BAAA,GAAkC,sBACpC,KAAM,CAAA,IAAA;AAAA,MACJ,IAAI,GAAA;AAAA,QACF,QAAS,CAAA,GAAA;AAAA,UAAI,CAAC,QACX,GAAe,CAAA,SAAA,CAAW,IAAe,OAAQ,CAAA,QAAQ,IAAI,CAAC,CAAA;AAAA,SACjE;AAAA,OACF;AAAA,KAEF,GAAA,QAAA,CAAA;AAGJ,IAAM,MAAA,iBAAA,GAAoB,qBACtB,IAAI,GAAA;AAAA,MACD,+BAAA,CAA6C,GAAI,CAAA,CAAC,EAAO,KAAA;AAAA,QACxD,EAAA;AAAA,QACA,EAAA,CAAG,MAAM,QAAQ,CAAA;AAAA,OAClB,CAAA;AAAA,KAEH,GAAA,IAAA,CAAA;AAGJ,IAAM,MAAA,WAAA,GAAc,sBAChB,IAAI,GAAA;AAAA,MACD,+BAAA,CAA6C,GAAI,CAAA,CAAC,EAAO,KAAA;AAAA,QACxD,EAAA;AAAA,QACA,YAAa,CAAA,GAAA,CAAI,CAAC,EAAA,KAAO,GAAG,MAAO,CAAA,EAAE,CAAC,CAAA,EAAG,QAAQ,CAAA,EAAG,MAAO,CAAA,EAAE,CAAC,CAAE,CAAA,CAAA;AAAA,OACjE,CAAA;AAAA,KAEH,GAAA,IAAA,CAAA;AAGJ,IAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AAExB,MAAA,MAAM,UAAU,EAAC,CAAA;AACjB,MAAA,KAAA,MAAW,OAAO,aAAe,EAAA;AAC/B,QAAQ,OAAA,CAAA,GAAwB,CAAI,GAAA,IAAA,CAAK,GAAG,CAAA,CAAA;AAAA,OAC9C;AAGA,MAAA,KAAA,MAAW,aAAa,+BAAiC,EAAA;AACvD,QAAM,MAAA,QAAA,GAAW,EAAE,GAAG,OAAQ,EAAA,CAAA;AAC9B,QAAA,MAAM,iBAAiB,iBACnB,GAAA,iBAAA,CAAkB,IAAI,SAAmB,CAAA,GACzC,CAAC,SAAS,CAAA,CAAA;AACd,QAAA,MAAM,QAAW,GAAA,WAAA,GACb,WAAY,CAAA,GAAA,CAAI,SAAmB,CACnC,GAAA,IAAA,CAAA;AAEJ,QAAA,KAAA,IAAS,EAAK,GAAA,CAAA,EAAG,EAAK,GAAA,YAAA,CAAa,QAAQ,EAAM,EAAA,EAAA;AAC/C,UAAM,MAAA,QAAA,GAAW,aAAa,EAAE,CAAA,CAAA;AAChC,UAAA,MAAM,OAAU,GAAA,QAAA,GAAW,QAAS,CAAA,EAAE,CAAI,GAAA,SAAA,CAAA;AAE1C,UAAA,IAAI,CAAI,GAAA,CAAA,CAAA;AACR,UAAA,KAAA,MAAW,WAAW,WAAa,EAAA;AACjC,YAAM,MAAA,aAAA,GAAgB,eAAe,CAAG,EAAA,CAAA,CAAA;AACxC,YAAA,QAAA,CAAS,OAAO,CAAI,GAAA,aAAA,CAAA;AACpB,YAAS,QAAA,CAAA,QAAQ,CAAI,GAAA,IAAA,CAAK,OAAkB,CAAA,CAAA;AAAA,WAC9C;AAAA,SACF;AAEA,QAAA,MAAA,CAAO,KAAK,QAAQ,CAAA,CAAA;AAAA,OACtB;AAAA,KACF;AAEA,IAAO,OAAA,MAAA,CAAA;AAAA,GACT,CAAA;AAEA,EAAO,OAAA,YAAA,CAAA;AACT;;;;"}

package/dist/es/pivotWider.js

@@ -13,9 +13,10 @@ function pivotWider(options) {
     const namesFromKeys = Array.isArray(namesFrom) ? namesFrom : [namesFrom];
     const valuesFromKeys = Array.isArray(valuesFrom) ? valuesFrom : [valuesFrom];
     const wider = [];
-    if (!items.length)
-      return wider;
-    const idColumns = Object.keys(items[0]).filter((key) => !namesFromKeys.includes(key) && !valuesFromKeys.includes(key));
+    if (!items.length) return wider;
+    const idColumns = Object.keys(items[0]).filter(
+      (key) => !namesFromKeys.includes(key) && !valuesFromKeys.includes(key)
+    );
     const nameValuesMap = {};
     for (const item of items) {
       for (const nameKey of namesFromKeys) {
@@ -37,13 +38,12 @@ function pivotWider(options) {
         continue;
       }
       for (const valueKey of valuesFromKeys) {
-        baseWideObj[`${valueKey}${namesSep}${nameKey}`] = valuesFillMap != null ? valuesFillMap[valueKey] : valuesFill;
+        baseWideObj[`${String(valueKey)}${namesSep}${nameKey}`] = valuesFillMap != null ? valuesFillMap[valueKey] : valuesFill;
       }
     }
     function widenItems(items2) {
-      if (!items2.length)
-        return [];
-      const wide = {...baseWideObj};
+      if (!items2.length) return [];
+      const wide = { ...baseWideObj };
       for (const idKey of idColumns) {
         wide[idKey] = items2[0][idKey];
       }
@@ -54,7 +54,7 @@ function pivotWider(options) {
           continue;
         }
         for (const valueKey of valuesFromKeys) {
-          wide[`${valueKey}${namesSep}${nameKey}`] = item[valueKey];
+          wide[`${String(valueKey)}${namesSep}${nameKey}`] = item[valueKey];
         }
       }
       return [wide];
@@ -67,20 +67,25 @@ function pivotWider(options) {
   };
   return _pivotWider;
 }
+const PIVOT_WARN_THRESHOLD = 1e5;
 function makeCombinations(separator = "_", arrays) {
-  function combine(accum, prefix, remainingArrays) {
-    if (!remainingArrays.length && prefix != null) {
-      accum.push(prefix);
-      return;
-    }
-    const array = remainingArrays[0];
-    const newRemainingArrays = remainingArrays.slice(1);
-    for (const item of array) {
-      combine(accum, prefix == null ? item : `${prefix}${separator}${item}`, newRemainingArrays);
+  if (!arrays.length) return [];
+  const totalSize = arrays.reduce((acc, v) => acc * v.length, 1);
+  if (totalSize > PIVOT_WARN_THRESHOLD) {
+    console.warn(
+      `tidy pivotWider: generating ${totalSize.toLocaleString()} column combinations. This may be slow or use excessive memory.`
+    );
+  }
+  let result = [null];
+  for (const array of arrays) {
+    const next = [];
+    for (const prefix of result) {
+      for (const item of array) {
+        next.push(prefix == null ? item : `${prefix}${separator}${item}`);
+      }
     }
+    result = next;
   }
-  const result = [];
-  combine(result, null, arrays);
   return result;
 }
 

package/dist/es/pivotWider.js.map

@@ -1 +1 @@
-{"version":3,"file":"pivotWider.js","sources":["../../src/pivotWider.ts"],"sourcesContent":["import { groupBy } from './groupBy';\nimport { SingleOrArray } from './helpers/singleOrArray';\nimport { tidy } from './tidy';\nimport { Key, TidyFn } from './types';\n\ntype PivotOutput = Record<Key, any>;\n\ntype PivotWiderOptions<T extends object> = {\n  namesFrom: SingleOrArray<keyof T>;\n  namesSep?: string;\n  valuesFrom: SingleOrArray<keyof T>;\n  valuesFill?: any;\n  valuesFillMap?: Partial<Record<Key, any>>;\n};\n\nexport function pivotWider<T extends object>(\n  options: PivotWiderOptions<T>\n): TidyFn<T, PivotOutput> {\n  const _pivotWider: TidyFn<T, PivotOutput> = (items: T[]): PivotOutput[] => {\n    const {\n      namesFrom,\n      valuesFrom,\n      valuesFill,\n      valuesFillMap,\n      namesSep = '_',\n    } = options;\n\n    const namesFromKeys: (keyof T)[] = Array.isArray(namesFrom)\n      ? namesFrom\n      : [namesFrom];\n    const valuesFromKeys: (keyof T)[] = Array.isArray(valuesFrom)\n      ? valuesFrom\n      : [valuesFrom];\n    const wider: PivotOutput[] = [];\n\n    if (!items.length) return wider;\n\n    // get all the keys that are left (id columns)\n    const idColumns = Object.keys(items[0]).filter(\n      (key) =>\n        !namesFromKeys.includes(key as keyof T) &&\n        !valuesFromKeys.includes(key as keyof T)\n    ) as (keyof T)[];\n\n    // get all possibilities for the name properties so we can fill them\n    const nameValuesMap: any = {};\n    for (const item of items) {\n      for (const nameKey of namesFromKeys) {\n        if (nameValuesMap[nameKey] == null) {\n          nameValuesMap[nameKey] = {};\n        }\n        nameValuesMap[nameKey][item[nameKey]] = true;\n      }\n    }\n\n    const nameValuesLists: string[][] = [];\n    for (const nameKey in nameValuesMap) {\n      nameValuesLists.push(Object.keys(nameValuesMap[nameKey]));\n    }\n\n    // prefill values if valuesFill is set for each name values combination\n    const baseWideObj: any = {};\n    const combos = makeCombinations(namesSep, nameValuesLists);\n\n    for (const nameKey of combos) {\n      if (valuesFromKeys.length === 1) {\n        baseWideObj[nameKey] =\n          valuesFillMap != null\n            ? valuesFillMap[valuesFromKeys[0] as any]\n            : valuesFill;\n        continue;\n      }\n\n      for (const valueKey of valuesFromKeys) {\n        baseWideObj[`${valueKey}${namesSep}${nameKey}`] =\n          valuesFillMap != null ? valuesFillMap[valueKey as any] : valuesFill;\n      }\n    }\n\n    // given a collection of items, widen\n    function widenItems(items: T[]) {\n      if (!items.length) return [];\n\n      const wide: PivotOutput = { ...baseWideObj };\n\n      // add the id columns (same for each object, so just look at first)\n      for (const idKey of idColumns) {\n        wide[idKey as keyof PivotOutput] = items[0][idKey];\n      }\n\n      // go through each object and widen their values\n      for (const item of items) {\n        const nameKey = namesFromKeys.map((key) => item[key]).join(namesSep);\n\n        if (valuesFromKeys.length === 1) {\n          wide[nameKey] = item[valuesFromKeys[0]];\n          continue;\n        }\n\n        for (const valueKey of valuesFromKeys) {\n          wide[`${valueKey}${namesSep}${nameKey}`] = item[valueKey];\n        }\n      }\n      return [wide];\n    }\n\n    // no id columns, don't do any grouping, just widen and return\n    if (!idColumns.length) {\n      return widenItems(items);\n    }\n\n    // group by the id columns\n    // for each group, widen/flatten to a single value\n    const finish = tidy(items, groupBy(idColumns, [widenItems]));\n    return finish;\n  };\n\n  return _pivotWider;\n}\n\n/*\n  Recursively compute key combinations\n*/\nfunction makeCombinations(separator = '_', arrays: string[][]): string[] {\n  function combine(\n    accum: string[],\n    prefix: string | null,\n    remainingArrays: string[][]\n  ) {\n    if (!remainingArrays.length && prefix != null) {\n      accum.push(prefix);\n      return;\n    }\n\n    const array = remainingArrays[0];\n    const newRemainingArrays = remainingArrays.slice(1);\n    for (const item of array) {\n      combine(\n        accum,\n        prefix == null ? item : `${prefix}${separator}${item}`,\n        newRemainingArrays\n      );\n    }\n  }\n\n  const result: string[] = [];\n  combine(result, null, arrays);\n  return result;\n}\n"],"names":[],"mappings":";;;oBAgBE;AAEA,QAAM,cAAsC,CAAC;AAC3C,UAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,WAAW;AAAA,QACT;AAEJ,UAAM,gBAA6B,MAAM,QAAQ,aAC7C,YACA,CAAC;AACL,UAAM,iBAA8B,MAAM,QAAQ,cAC9C,aACA,CAAC;AACL,UAAM,QAAuB;AAE7B,QAAI,CAAC,MAAM;AAAQ,aAAO;AAG1B,UAAM,YAAY,OAAO,KAAK,MAAM,IAAI,OACtC,CAAC,QACC,CAAC,cAAc,SAAS,QACxB,CAAC,eAAe,SAAS;AAI7B,UAAM,gBAAqB;AAC3B,eAAW,QAAQ;AACjB,iBAAW,WAAW;AACpB,YAAI,cAAc,YAAY;AAC5B,wBAAc,WAAW;AAAA;AAE3B,sBAAc,SAAS,KAAK,YAAY;AAAA;AAAA;AAI5C,UAAM,kBAA8B;AACpC,eAAW,WAAW;AACpB,sBAAgB,KAAK,OAAO,KAAK,cAAc;AAAA;AAIjD,UAAM,cAAmB;AACzB,UAAM,SAAS,iBAAiB,UAAU;AAE1C,eAAW,WAAW;AACpB,UAAI,eAAe,WAAW;AAC5B,oBAAY,WACV,iBAAiB,OACb,cAAc,eAAe,MAC7B;AACN;AAAA;AAGF,iBAAW,YAAY;AACrB,oBAAY,GAAG,WAAW,WAAW,aACnC,iBAAiB,OAAO,cAAc,YAAmB;AAAA;AAAA;AAK/D,wBAAoB;AAClB,UAAI,CAAC,OAAM;AAAQ,eAAO;AAE1B,YAAM,OAAoB,IAAK;AAG/B,iBAAW,SAAS;AAClB,aAAK,SAA8B,OAAM,GAAG;AAAA;AAI9C,iBAAW,QAAQ;AACjB,cAAM,UAAU,cAAc,IAAI,CAAC,QAAQ,KAAK,MAAM,KAAK;AAE3D,YAAI,eAAe,WAAW;AAC5B,eAAK,WAAW,KAAK,eAAe;AACpC;AAAA;AAGF,mBAAW,YAAY;AACrB,eAAK,GAAG,WAAW,WAAW,aAAa,KAAK;AAAA;AAAA;AAGpD,aAAO,CAAC;AAAA;AAIV,QAAI,CAAC,UAAU;AACb,aAAO,WAAW;AAAA;AAKpB,UAAM,SAAS,KAAK,OAAO,QAAQ,WAAW,CAAC;AAC/C,WAAO;AAAA;AAGT,SAAO;AAAA;AAMT,0BAA0B,YAAY,KAAK;AACzC,mBACE,OACA,QACA;AAEA,QAAI,CAAC,gBAAgB,UAAU,UAAU;AACvC,YAAM,KAAK;AACX;AAAA;AAGF,UAAM,QAAQ,gBAAgB;AAC9B,UAAM,qBAAqB,gBAAgB,MAAM;AACjD,eAAW,QAAQ;AACjB,cACE,OACA,UAAU,OAAO,OAAO,GAAG,SAAS,YAAY,QAChD;AAAA;AAAA;AAKN,QAAM,SAAmB;AACzB,UAAQ,QAAQ,MAAM;AACtB,SAAO;AAAA;;;;"}
+{"version":3,"file":"pivotWider.js","sources":["../../src/pivotWider.ts"],"sourcesContent":["import { groupBy } from './groupBy';\nimport { SingleOrArray } from './helpers/singleOrArray';\nimport { tidy } from './tidy';\nimport { Key, TidyFn } from './types';\n\ntype PivotOutput = Record<Key, any>;\n\ntype PivotWiderOptions<T extends object> = {\n  namesFrom: SingleOrArray<keyof T>;\n  namesSep?: string;\n  valuesFrom: SingleOrArray<keyof T>;\n  valuesFill?: any;\n  valuesFillMap?: Partial<Record<Key, any>>;\n};\n\nexport function pivotWider<T extends object>(\n  options: PivotWiderOptions<T>\n): TidyFn<T, PivotOutput> {\n  const _pivotWider: TidyFn<T, PivotOutput> = (items: T[]): PivotOutput[] => {\n    const {\n      namesFrom,\n      valuesFrom,\n      valuesFill,\n      valuesFillMap,\n      namesSep = '_',\n    } = options;\n\n    const namesFromKeys: (keyof T)[] = Array.isArray(namesFrom)\n      ? namesFrom\n      : [namesFrom];\n    const valuesFromKeys: (keyof T)[] = Array.isArray(valuesFrom)\n      ? valuesFrom\n      : [valuesFrom];\n    const wider: PivotOutput[] = [];\n\n    if (!items.length) return wider;\n\n    // get all the keys that are left (id columns)\n    const idColumns = Object.keys(items[0]).filter(\n      (key) =>\n        !namesFromKeys.includes(key as keyof T) &&\n        !valuesFromKeys.includes(key as keyof T)\n    ) as (keyof T)[];\n\n    // get all possibilities for the name properties so we can fill them\n    const nameValuesMap: any = {};\n    for (const item of items) {\n      for (const nameKey of namesFromKeys) {\n        if (nameValuesMap[nameKey] == null) {\n          nameValuesMap[nameKey] = {};\n        }\n        nameValuesMap[nameKey][item[nameKey]] = true;\n      }\n    }\n\n    const nameValuesLists: string[][] = [];\n    for (const nameKey in nameValuesMap) {\n      nameValuesLists.push(Object.keys(nameValuesMap[nameKey]));\n    }\n\n    // prefill values if valuesFill is set for each name values combination\n    const baseWideObj: any = {};\n    const combos = makeCombinations(namesSep, nameValuesLists);\n\n    for (const nameKey of combos) {\n      if (valuesFromKeys.length === 1) {\n        baseWideObj[nameKey] =\n          valuesFillMap != null\n            ? valuesFillMap[valuesFromKeys[0] as any]\n            : valuesFill;\n        continue;\n      }\n\n      for (const valueKey of valuesFromKeys) {\n        baseWideObj[`${String(valueKey)}${namesSep}${nameKey}`] =\n          valuesFillMap != null ? valuesFillMap[valueKey as any] : valuesFill;\n      }\n    }\n\n    // given a collection of items, widen\n    function widenItems(items: T[]) {\n      if (!items.length) return [];\n\n      const wide: PivotOutput = { ...baseWideObj };\n\n      // add the id columns (same for each object, so just look at first)\n      for (const idKey of idColumns) {\n        wide[idKey as keyof PivotOutput] = items[0][idKey];\n      }\n\n      // go through each object and widen their values\n      for (const item of items) {\n        const nameKey = namesFromKeys.map((key) => item[key]).join(namesSep);\n\n        if (valuesFromKeys.length === 1) {\n          wide[nameKey] = item[valuesFromKeys[0]];\n          continue;\n        }\n\n        for (const valueKey of valuesFromKeys) {\n          wide[`${String(valueKey)}${namesSep}${nameKey}`] = item[valueKey];\n        }\n      }\n      return [wide];\n    }\n\n    // no id columns, don't do any grouping, just widen and return\n    if (!idColumns.length) {\n      return widenItems(items);\n    }\n\n    // group by the id columns\n    // for each group, widen/flatten to a single value\n    const finish = tidy(items, groupBy(idColumns, [widenItems]));\n    return finish;\n  };\n\n  return _pivotWider;\n}\n\n/*\n  Recursively compute key combinations\n*/\nconst PIVOT_WARN_THRESHOLD = 100_000;\n\n/*\n  Iteratively compute key combinations (avoids recursive array slicing)\n*/\nfunction makeCombinations(separator = '_', arrays: string[][]): string[] {\n  if (!arrays.length) return [];\n\n  // warn if Cartesian product will be very large\n  const totalSize = arrays.reduce((acc, v) => acc * v.length, 1);\n  if (totalSize > PIVOT_WARN_THRESHOLD) {\n    console.warn(\n      `tidy pivotWider: generating ${totalSize.toLocaleString()} column combinations. ` +\n        `This may be slow or use excessive memory.`\n    );\n  }\n\n  let result: string[] = [null as any];\n  for (const array of arrays) {\n    const next: string[] = [];\n    for (const prefix of result) {\n      for (const item of array) {\n        next.push(prefix == null ? item : `${prefix}${separator}${item}`);\n      }\n    }\n    result = next;\n  }\n  return result;\n}\n"],"names":["items"],"mappings":";;;AAeO,SAAS,WACd,OACwB,EAAA;AACxB,EAAM,MAAA,WAAA,GAAsC,CAAC,KAA8B,KAAA;AACzE,IAAM,MAAA;AAAA,MACJ,SAAA;AAAA,MACA,UAAA;AAAA,MACA,UAAA;AAAA,MACA,aAAA;AAAA,MACA,QAAW,GAAA,GAAA;AAAA,KACT,GAAA,OAAA,CAAA;AAEJ,IAAA,MAAM,gBAA6B,KAAM,CAAA,OAAA,CAAQ,SAAS,CACtD,GAAA,SAAA,GACA,CAAC,SAAS,CAAA,CAAA;AACd,IAAA,MAAM,iBAA8B,KAAM,CAAA,OAAA,CAAQ,UAAU,CACxD,GAAA,UAAA,GACA,CAAC,UAAU,CAAA,CAAA;AACf,IAAA,MAAM,QAAuB,EAAC,CAAA;AAE9B,IAAI,IAAA,CAAC,KAAM,CAAA,MAAA,EAAe,OAAA,KAAA,CAAA;AAG1B,IAAA,MAAM,YAAY,MAAO,CAAA,IAAA,CAAK,KAAM,CAAA,CAAC,CAAC,CAAE,CAAA,MAAA;AAAA,MACtC,CAAC,GACC,KAAA,CAAC,aAAc,CAAA,QAAA,CAAS,GAAc,CACtC,IAAA,CAAC,cAAe,CAAA,QAAA,CAAS,GAAc,CAAA;AAAA,KAC3C,CAAA;AAGA,IAAA,MAAM,gBAAqB,EAAC,CAAA;AAC5B,IAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,MAAA,KAAA,MAAW,WAAW,aAAe,EAAA;AACnC,QAAI,IAAA,aAAA,CAAc,OAAO,CAAA,IAAK,IAAM,EAAA;AAClC,UAAc,aAAA,CAAA,OAAO,IAAI,EAAC,CAAA;AAAA,SAC5B;AACA,QAAA,aAAA,CAAc,OAAO,CAAA,CAAE,IAAK,CAAA,OAAO,CAAC,CAAI,GAAA,IAAA,CAAA;AAAA,OAC1C;AAAA,KACF;AAEA,IAAA,MAAM,kBAA8B,EAAC,CAAA;AACrC,IAAA,KAAA,MAAW,WAAW,aAAe,EAAA;AACnC,MAAA,eAAA,CAAgB,KAAK,MAAO,CAAA,IAAA,CAAK,aAAc,CAAA,OAAO,CAAC,CAAC,CAAA,CAAA;AAAA,KAC1D;AAGA,IAAA,MAAM,cAAmB,EAAC,CAAA;AAC1B,IAAM,MAAA,MAAA,GAAS,gBAAiB,CAAA,QAAA,EAAU,eAAe,CAAA,CAAA;AAEzD,IAAA,KAAA,MAAW,WAAW,MAAQ,EAAA;AAC5B,MAAI,IAAA,cAAA,CAAe,WAAW,CAAG,EAAA;AAC/B,QAAY,WAAA,CAAA,OAAO,IACjB,aAAiB,IAAA,IAAA,GACb,cAAc,cAAe,CAAA,CAAC,CAAQ,CACtC,GAAA,UAAA,CAAA;AACN,QAAA,SAAA;AAAA,OACF;AAEA,MAAA,KAAA,MAAW,YAAY,cAAgB,EAAA;AACrC,QAAA,WAAA,CAAY,CAAG,EAAA,MAAA,CAAO,QAAQ,CAAC,GAAG,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,CACpD,GAAA,aAAA,IAAiB,IAAO,GAAA,aAAA,CAAc,QAAe,CAAI,GAAA,UAAA,CAAA;AAAA,OAC7D;AAAA,KACF;AAGA,IAAA,SAAS,WAAWA,MAAY,EAAA;AAC9B,MAAA,IAAI,CAACA,MAAAA,CAAM,MAAQ,EAAA,OAAO,EAAC,CAAA;AAE3B,MAAM,MAAA,IAAA,GAAoB,EAAE,GAAG,WAAY,EAAA,CAAA;AAG3C,MAAA,KAAA,MAAW,SAAS,SAAW,EAAA;AAC7B,QAAA,IAAA,CAAK,KAA0B,CAAA,GAAIA,MAAM,CAAA,CAAC,EAAE,KAAK,CAAA,CAAA;AAAA,OACnD;AAGA,MAAA,KAAA,MAAW,QAAQA,MAAO,EAAA;AACxB,QAAM,MAAA,OAAA,GAAU,aAAc,CAAA,GAAA,CAAI,CAAC,GAAA,KAAQ,KAAK,GAAG,CAAC,CAAE,CAAA,IAAA,CAAK,QAAQ,CAAA,CAAA;AAEnE,QAAI,IAAA,cAAA,CAAe,WAAW,CAAG,EAAA;AAC/B,UAAA,IAAA,CAAK,OAAO,CAAA,GAAI,IAAK,CAAA,cAAA,CAAe,CAAC,CAAC,CAAA,CAAA;AACtC,UAAA,SAAA;AAAA,SACF;AAEA,QAAA,KAAA,MAAW,YAAY,cAAgB,EAAA;AACrC,UAAK,IAAA,CAAA,CAAA,EAAG,MAAO,CAAA,QAAQ,CAAC,CAAA,EAAG,QAAQ,CAAA,EAAG,OAAO,CAAA,CAAE,CAAI,GAAA,IAAA,CAAK,QAAQ,CAAA,CAAA;AAAA,SAClE;AAAA,OACF;AACA,MAAA,OAAO,CAAC,IAAI,CAAA,CAAA;AAAA,KACd;AAGA,IAAI,IAAA,CAAC,UAAU,MAAQ,EAAA;AACrB,MAAA,OAAO,WAAW,KAAK,CAAA,CAAA;AAAA,KACzB;AAIA,IAAM,MAAA,MAAA,GAAS,KAAK,KAAO,EAAA,OAAA,CAAQ,WAAW,CAAC,UAAU,CAAC,CAAC,CAAA,CAAA;AAC3D,IAAO,OAAA,MAAA,CAAA;AAAA,GACT,CAAA;AAEA,EAAO,OAAA,WAAA,CAAA;AACT,CAAA;AAKA,MAAM,oBAAuB,GAAA,GAAA,CAAA;AAK7B,SAAS,gBAAA,CAAiB,SAAY,GAAA,GAAA,EAAK,MAA8B,EAAA;AACvE,EAAA,IAAI,CAAC,MAAA,CAAO,MAAQ,EAAA,OAAO,EAAC,CAAA;AAG5B,EAAM,MAAA,SAAA,GAAY,OAAO,MAAO,CAAA,CAAC,KAAK,CAAM,KAAA,GAAA,GAAM,CAAE,CAAA,MAAA,EAAQ,CAAC,CAAA,CAAA;AAC7D,EAAA,IAAI,YAAY,oBAAsB,EAAA;AACpC,IAAQ,OAAA,CAAA,IAAA;AAAA,MACN,CAAA,4BAAA,EAA+B,SAAU,CAAA,cAAA,EAAgB,CAAA,+DAAA,CAAA;AAAA,KAE3D,CAAA;AAAA,GACF;AAEA,EAAI,IAAA,MAAA,GAAmB,CAAC,IAAW,CAAA,CAAA;AACnC,EAAA,KAAA,MAAW,SAAS,MAAQ,EAAA;AAC1B,IAAA,MAAM,OAAiB,EAAC,CAAA;AACxB,IAAA,KAAA,MAAW,UAAU,MAAQ,EAAA;AAC3B,MAAA,KAAA,MAAW,QAAQ,KAAO,EAAA;AACxB,QAAK,IAAA,CAAA,IAAA,CAAK,MAAU,IAAA,IAAA,GAAO,IAAO,GAAA,CAAA,EAAG,MAAM,CAAG,EAAA,SAAS,CAAG,EAAA,IAAI,CAAE,CAAA,CAAA,CAAA;AAAA,OAClE;AAAA,KACF;AACA,IAAS,MAAA,GAAA,IAAA,CAAA;AAAA,GACX;AACA,EAAO,OAAA,MAAA,CAAA;AACT;;;;"}

package/dist/es/rename.js.map

@@ -1 +1 @@
-{"version":3,"file":"rename.js","sources":["../../src/rename.ts"],"sourcesContent":["import { O } from 'ts-toolbelt';\nimport { TidyFn } from './types';\n\ntype RenameSpec<T> = Partial<\n  {\n    [K in keyof T]: string;\n  }\n>;\n\n// helper types\ntype OutputT<T extends object, Spec extends RenameSpec<T>> = O.Merge<\n  Omit<T, keyof Spec>,\n  {\n    [NewKey in Exclude<Spec[keyof Spec], undefined>]: T[O.SelectKeys<\n      Spec,\n      NewKey\n    >];\n  }\n>;\n\n/**\n * Renames properties/columns in collection\n *\n * @param renameSpec Mapping of current name to new name { currKey: newKey }\n */\nexport function rename<T extends object, Spec extends RenameSpec<T>>(\n  renameSpec: Spec\n): TidyFn<T, OutputT<T, Spec>> {\n  type Output = OutputT<T, Spec>;\n  const _rename: TidyFn<T, Output> = (items: T[]): Output[] => {\n    return items.map((d) => {\n      const mapped = {} as any;\n      const keys = Object.keys(d) as (keyof T)[];\n      for (const key of keys) {\n        const newKey: keyof Output =\n          ((renameSpec[key] as unknown) as keyof Output) ?? key;\n        mapped[newKey] = d[key];\n      }\n\n      return mapped as Output;\n    });\n  };\n\n  return _rename;\n}\n"],"names":[],"mappings":"gBA0BE;AAGA,QAAM,UAA6B,CAAC;AAClC,WAAO,MAAM,IAAI,CAAC;AA9BtB;AA+BM,YAAM,SAAS;AACf,YAAM,OAAO,OAAO,KAAK;AACzB,iBAAW,OAAO;AAChB,cAAM,SACF,iBAAW,SAAX,YAAgD;AACpD,eAAO,UAAU,EAAE;AAAA;AAGrB,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA;;;;"}
+{"version":3,"file":"rename.js","sources":["../../src/rename.ts"],"sourcesContent":["import { TidyFn } from './types';\nimport { Merge, KeysMatching } from './type-utils';\n\ntype RenameSpec<T> = Partial<{\n  [K in keyof T]: string;\n}>;\n\ntype OutputT<T extends object, Spec extends RenameSpec<T>> = Merge<\n  Omit<T, keyof Spec>,\n  {\n    [NewKey in Exclude<Spec[keyof Spec], undefined>]: T[KeysMatching<\n      Spec,\n      NewKey\n    > &\n      keyof T];\n  }\n>;\n\n/**\n * Renames properties/columns in collection\n *\n * @param renameSpec Mapping of current name to new name { currKey: newKey }\n */\nexport function rename<T extends object, Spec extends RenameSpec<T>>(\n  renameSpec: Spec\n): TidyFn<T, OutputT<T, Spec>> {\n  type Output = OutputT<T, Spec>;\n  const _rename: TidyFn<T, Output> = (items: T[]): Output[] => {\n    return items.map((d) => {\n      const mapped = {} as any;\n      const keys = Object.keys(d) as (keyof T)[];\n      for (const key of keys) {\n        const newKey: keyof Output =\n          (renameSpec[key] as unknown as keyof Output) ?? key;\n        mapped[newKey] = d[key];\n      }\n\n      return mapped as Output;\n    });\n  };\n\n  return _rename;\n}\n"],"names":[],"mappings":"AAuBO,SAAS,OACd,UAC6B,EAAA;AAE7B,EAAM,MAAA,OAAA,GAA6B,CAAC,KAAyB,KAAA;AAC3D,IAAO,OAAA,KAAA,CAAM,GAAI,CAAA,CAAC,CAAM,KAAA;AA5B5B,MAAA,IAAA,EAAA,CAAA;AA6BM,MAAA,MAAM,SAAS,EAAC,CAAA;AAChB,MAAM,MAAA,IAAA,GAAO,MAAO,CAAA,IAAA,CAAK,CAAC,CAAA,CAAA;AAC1B,MAAA,KAAA,MAAW,OAAO,IAAM,EAAA;AACtB,QAAA,MAAM,MACH,GAAA,CAAA,EAAA,GAAA,UAAA,CAAW,GAAG,CAAA,KAAd,IAA+C,GAAA,EAAA,GAAA,GAAA,CAAA;AAClD,QAAO,MAAA,CAAA,MAAM,CAAI,GAAA,CAAA,CAAE,GAAG,CAAA,CAAA;AAAA,OACxB;AAEA,MAAO,OAAA,MAAA,CAAA;AAAA,KACR,CAAA,CAAA;AAAA,GACH,CAAA;AAEA,EAAO,OAAA,OAAA,CAAA;AACT;;;;"}

package/dist/es/replaceNully.js

@@ -2,7 +2,7 @@ function replaceNully(replaceSpec) {
   const _replaceNully = (items) => {
     const replacedItems = [];
     for (const d of items) {
-      const obj = {...d};
+      const obj = { ...d };
       for (const key in replaceSpec) {
         if (obj[key] == null) {
           obj[key] = replaceSpec[key];

package/dist/es/replaceNully.js.map

@@ -1 +1 @@
-{"version":3,"file":"replaceNully.js","sources":["../../src/replaceNully.ts"],"sourcesContent":["import { O } from 'ts-toolbelt';\nimport { TidyFn } from './types';\n\ntype Spec<T extends object> = {\n  [K in keyof T]: T[K];\n};\n\ntype Output<T extends object, ReplaceSpec extends Partial<Spec<T>>> = O.Merge<\n  Omit<T, keyof ReplaceSpec>,\n  {\n    [K in keyof ReplaceSpec]: K extends keyof T\n      ? Exclude<T[K], null | undefined> | ReplaceSpec[K]\n      : ReplaceSpec[K];\n  }\n>;\n\n/**\n * Replaces nully values with what is specified in the spec\n */\nexport function replaceNully<\n  T extends object,\n  ReplaceSpec extends Spec<Partial<T>> = Spec<Partial<T>>\n>(replaceSpec: ReplaceSpec): TidyFn<T, Output<T, ReplaceSpec>> {\n  const _replaceNully: TidyFn<T, Output<T, ReplaceSpec>> = (\n    items: T[]\n  ): Output<T, ReplaceSpec>[] => {\n    const replacedItems: Output<T, ReplaceSpec>[] = [];\n\n    for (const d of items) {\n      const obj = { ...d } as any;\n      for (const key in replaceSpec) {\n        if (obj[(key as unknown) as keyof T] == null) {\n          obj[(key as unknown) as keyof T] = replaceSpec[key] as any;\n        }\n      }\n      replacedItems.push(obj);\n    }\n\n    return replacedItems;\n  };\n\n  return _replaceNully;\n}\n"],"names":[],"mappings":"sBAsBE;AACA,QAAM,gBAAmD,CACvD;AAEA,UAAM,gBAA0C;AAEhD,eAAW,KAAK;AACd,YAAM,MAAM,IAAK;AACjB,iBAAW,OAAO;AAChB,YAAI,IAAK,QAA+B;AACtC,cAAK,OAA8B,YAAY;AAAA;AAAA;AAGnD,oBAAc,KAAK;AAAA;AAGrB,WAAO;AAAA;AAGT,SAAO;AAAA;;;;"}
+{"version":3,"file":"replaceNully.js","sources":["../../src/replaceNully.ts"],"sourcesContent":["import { TidyFn } from './types';\nimport { Merge } from './type-utils';\n\ntype Spec<T extends object> = {\n  [K in keyof T]: T[K];\n};\n\ntype Output<T extends object, ReplaceSpec extends Partial<Spec<T>>> = Merge<\n  Omit<T, keyof ReplaceSpec>,\n  {\n    [K in keyof ReplaceSpec]: K extends keyof T\n      ? Exclude<T[K], null | undefined> | ReplaceSpec[K]\n      : ReplaceSpec[K];\n  }\n>;\n\n/**\n * Replaces nully values with what is specified in the spec\n */\nexport function replaceNully<\n  T extends object,\n  ReplaceSpec extends Spec<Partial<T>> = Spec<Partial<T>>\n>(replaceSpec: ReplaceSpec): TidyFn<T, Output<T, ReplaceSpec>> {\n  const _replaceNully: TidyFn<T, Output<T, ReplaceSpec>> = (\n    items: T[]\n  ): Output<T, ReplaceSpec>[] => {\n    const replacedItems: Output<T, ReplaceSpec>[] = [];\n\n    for (const d of items) {\n      const obj = { ...d } as any;\n      for (const key in replaceSpec) {\n        if (obj[key as unknown as keyof T] == null) {\n          obj[key as unknown as keyof T] = replaceSpec[key] as any;\n        }\n      }\n      replacedItems.push(obj);\n    }\n\n    return replacedItems;\n  };\n\n  return _replaceNully;\n}\n"],"names":[],"mappings":"AAmBO,SAAS,aAGd,WAA6D,EAAA;AAC7D,EAAM,MAAA,aAAA,GAAmD,CACvD,KAC6B,KAAA;AAC7B,IAAA,MAAM,gBAA0C,EAAC,CAAA;AAEjD,IAAA,KAAA,MAAW,KAAK,KAAO,EAAA;AACrB,MAAM,MAAA,GAAA,GAAM,EAAE,GAAG,CAAE,EAAA,CAAA;AACnB,MAAA,KAAA,MAAW,OAAO,WAAa,EAAA;AAC7B,QAAI,IAAA,GAAA,CAAI,GAAyB,CAAA,IAAK,IAAM,EAAA;AAC1C,UAAI,GAAA,CAAA,GAAyB,CAAI,GAAA,WAAA,CAAY,GAAG,CAAA,CAAA;AAAA,SAClD;AAAA,OACF;AACA,MAAA,aAAA,CAAc,KAAK,GAAG,CAAA,CAAA;AAAA,KACxB;AAEA,IAAO,OAAA,aAAA,CAAA;AAAA,GACT,CAAA;AAEA,EAAO,OAAA,aAAA,CAAA;AACT;;;;"}

package/dist/es/select.js

@@ -25,16 +25,16 @@ function processSelectors(items, selectKeys) {
       negationMap[key] = false;
       continue;
     }
-    keysWithoutNegations.unshift(key);
+    keysWithoutNegations.push(key);
   }
+  keysWithoutNegations.reverse();
   processedSelectKeys = Array.from(new Set(keysWithoutNegations));
   return processedSelectKeys;
 }
 function select(selectKeys) {
   const _select = (items) => {
     let processedSelectKeys = processSelectors(items, selectKeys);
-    if (!processedSelectKeys.length)
-      return items;
+    if (!processedSelectKeys.length) return items;
     return items.map((d) => {
       const mapped = {};
       for (const key of processedSelectKeys) {

package/dist/es/select.js.map

@@ -1 +1 @@
-{"version":3,"file":"select.js","sources":["../../src/select.ts"],"sourcesContent":["import { Datum, TidyFn, Key } from './types';\nimport { singleOrArray } from './helpers/singleOrArray';\nimport { everything } from './selectors/everything';\nimport { O, U } from 'ts-toolbelt';\n\ntype DropKey<T extends Datum> = keyof T extends string | number\n  ? `-${keyof T}`\n  : never;\n// type KeysInput1<T> = readonly (keyof T)[] | keyof T;\nexport type KeysInput<T> =\n  | (Key | ((items: T[]) => Key[]))[]\n  | readonly DropKey<T>[]\n  | readonly (keyof T)[]\n  | DropKey<T>\n  | keyof T;\n\ntype Output<\n  T extends object,\n  KS extends KeysInput<T>\n  // is it an array of drop keys?\n> = KS extends readonly DropKey<T>[]\n  ? O.Pick<\n      T,\n      {\n        [TK in keyof T]: `-${U.Intersect<TK, string>}` extends KS[number]\n          ? never\n          : TK;\n      }[keyof T]\n    >\n  : // is an array of keys?\n  KS extends readonly Key[]\n  ? O.Pick<T, KS[number]>\n  : // is a single drop key?\n  KS extends DropKey<T>\n  ? O.Pick<\n      T,\n      {\n        [TK in keyof T]: `-${U.Intersect<TK, string>}` extends KS ? never : TK;\n      }[keyof T]\n    >\n  : // is a single key?\n  KS extends Key\n  ? O.Pick<T, U.Intersect<KS, keyof T>>\n  : // any other case, just be dumb and say T was returned\n    T;\n\nexport function processSelectors<T extends object, Keys extends KeysInput<T>>(\n  items: T[],\n  selectKeys: Keys\n): string[] {\n  let processedSelectKeys: string[] = [];\n  // expand them all to a flat list of keys\n  for (const keyInput of singleOrArray(selectKeys as any)) {\n    if (typeof keyInput === 'function') {\n      processedSelectKeys.push(...(keyInput(items) as string[]));\n    } else {\n      processedSelectKeys.push(keyInput);\n    }\n  }\n\n  // if the first key is negative, add in everything at the front\n  if (processedSelectKeys.length && processedSelectKeys[0][0] === '-') {\n    processedSelectKeys = [...everything()(items), ...processedSelectKeys];\n  }\n\n  const negationMap: any = {};\n  const keysWithoutNegations = [];\n  // go through the list backwards and remove negations\n  for (let k = processedSelectKeys.length - 1; k >= 0; k--) {\n    const key: any = processedSelectKeys[k];\n    if (key[0] === '-') {\n      negationMap[key.substring(1)] = true;\n      continue;\n    }\n    if (negationMap[key]) {\n      negationMap[key] = false;\n      continue;\n    }\n    keysWithoutNegations.unshift(key);\n  }\n\n  // remove duplicates\n  processedSelectKeys = Array.from(new Set(keysWithoutNegations));\n\n  return processedSelectKeys;\n}\n\n/**\n * selects subparts of the objects (aka pick)\n * @param selectFn Returns true to keep the item, false to select out\n */\n// export function select<T extends object, Keys extends SingleOrArray<Key | ((items: T[]) => (keyof T)[])>>(\nexport function select<T extends object, Keys extends KeysInput<T>>(\n  selectKeys: Keys\n): TidyFn<T, Output<T, Keys>> {\n  type OutputT = Output<T, Keys>;\n  const _select: TidyFn<T, OutputT> = (items: T[]): OutputT[] => {\n    let processedSelectKeys: string[] = processSelectors(items, selectKeys);\n\n    if (!processedSelectKeys.length) return items as OutputT[];\n\n    // use the processed keys to create reduced objects\n    return items.map((d: T) => {\n      const mapped: any = {};\n      for (const key of processedSelectKeys) {\n        mapped[key] = d[key as keyof T];\n      }\n\n      return mapped;\n    });\n  };\n\n  return _select;\n}\n"],"names":[],"mappings":";;;0BA+CE,OACA;AAEA,MAAI,sBAAgC;AAEpC,aAAW,YAAY,cAAc;AACnC,QAAI,OAAO,aAAa;AACtB,0BAAoB,KAAK,GAAI,SAAS;AAAA;AAEtC,0BAAoB,KAAK;AAAA;AAAA;AAK7B,MAAI,oBAAoB,UAAU,oBAAoB,GAAG,OAAO;AAC9D,0BAAsB,CAAC,GAAG,aAAa,QAAQ,GAAG;AAAA;AAGpD,QAAM,cAAmB;AACzB,QAAM,uBAAuB;AAE7B,WAAS,IAAI,oBAAoB,SAAS,GAAG,KAAK,GAAG;AACnD,UAAM,MAAW,oBAAoB;AACrC,QAAI,IAAI,OAAO;AACb,kBAAY,IAAI,UAAU,MAAM;AAChC;AAAA;AAEF,QAAI,YAAY;AACd,kBAAY,OAAO;AACnB;AAAA;AAEF,yBAAqB,QAAQ;AAAA;AAI/B,wBAAsB,MAAM,KAAK,IAAI,IAAI;AAEzC,SAAO;AAAA;gBASP;AAGA,QAAM,UAA8B,CAAC;AACnC,QAAI,sBAAgC,iBAAiB,OAAO;AAE5D,QAAI,CAAC,oBAAoB;AAAQ,aAAO;AAGxC,WAAO,MAAM,IAAI,CAAC;AAChB,YAAM,SAAc;AACpB,iBAAW,OAAO;AAChB,eAAO,OAAO,EAAE;AAAA;AAGlB,aAAO;AAAA;AAAA;AAIX,SAAO;AAAA;;;;"}
+{"version":3,"file":"select.js","sources":["../../src/select.ts"],"sourcesContent":["import { singleOrArray } from './helpers/singleOrArray';\nimport { everything } from './selectors/everything';\nimport { Key, TidyFn } from './types';\ntype DropKey<T extends object> = keyof T extends string | number\n  ? `-${keyof T}`\n  : never;\n// type KeysInput1<T> = readonly (keyof T)[] | keyof T;\nexport type KeysInput<T extends object> =\n  | (Key | ((items: T[]) => Key[]))[]\n  | readonly DropKey<T>[]\n  | readonly (keyof T)[]\n  | DropKey<T>\n  | keyof T;\n\ntype Output<\n  T extends object,\n  KS extends KeysInput<T>\n  // is it an array of drop keys?\n> = KS extends readonly DropKey<T>[]\n  ? Pick<\n      T,\n      {\n        [TK in keyof T]: `-${Extract<TK, string>}` extends KS[number]\n          ? never\n          : TK;\n      }[keyof T]\n    >\n  : // is an array of keys?\n  KS extends readonly Key[]\n  ? Pick<T, Extract<KS[number], keyof T>>\n  : // is a single drop key?\n  KS extends DropKey<T>\n  ? Pick<\n      T,\n      {\n        [TK in keyof T]: `-${Extract<TK, string>}` extends KS ? never : TK;\n      }[keyof T]\n    >\n  : // is a single key?\n  KS extends Key\n  ? Pick<T, Extract<KS, keyof T>>\n  : // any other case, just be dumb and say T was returned\n    T;\n\nexport function processSelectors<T extends object, Keys extends KeysInput<T>>(\n  items: T[],\n  selectKeys: Keys\n): string[] {\n  let processedSelectKeys: string[] = [];\n  // expand them all to a flat list of keys\n  for (const keyInput of singleOrArray(selectKeys as any)) {\n    if (typeof keyInput === 'function') {\n      processedSelectKeys.push(...(keyInput(items) as string[]));\n    } else {\n      processedSelectKeys.push(keyInput);\n    }\n  }\n\n  // if the first key is negative, add in everything at the front\n  if (processedSelectKeys.length && processedSelectKeys[0][0] === '-') {\n    processedSelectKeys = [...everything()(items), ...processedSelectKeys];\n  }\n\n  const negationMap: any = {};\n  const keysWithoutNegations = [];\n  // go through the list backwards and remove negations\n  for (let k = processedSelectKeys.length - 1; k >= 0; k--) {\n    const key: any = processedSelectKeys[k];\n    if (key[0] === '-') {\n      negationMap[key.substring(1)] = true;\n      continue;\n    }\n    if (negationMap[key]) {\n      negationMap[key] = false;\n      continue;\n    }\n    keysWithoutNegations.push(key);\n  }\n  keysWithoutNegations.reverse();\n\n  // remove duplicates\n  processedSelectKeys = Array.from(new Set(keysWithoutNegations));\n\n  return processedSelectKeys;\n}\n\n/**\n * selects subparts of the objects (aka pick)\n * @param selectFn Returns true to keep the item, false to select out\n */\n// export function select<T extends object, Keys extends SingleOrArray<Key | ((items: T[]) => (keyof T)[])>>(\nexport function select<T extends object, Keys extends KeysInput<T>>(\n  selectKeys: Keys\n): TidyFn<T, Output<T, Keys>> {\n  type OutputT = Output<T, Keys>;\n  const _select: TidyFn<T, OutputT> = (items: T[]): OutputT[] => {\n    let processedSelectKeys: string[] = processSelectors(items, selectKeys);\n\n    if (!processedSelectKeys.length) return items as OutputT[];\n\n    // use the processed keys to create reduced objects\n    return items.map((d: T) => {\n      const mapped: any = {};\n      for (const key of processedSelectKeys) {\n        mapped[key] = d[key as keyof T];\n      }\n\n      return mapped;\n    });\n  };\n\n  return _select;\n}\n"],"names":[],"mappings":";;;AA4CgB,SAAA,gBAAA,CACd,OACA,UACU,EAAA;AACV,EAAA,IAAI,sBAAgC,EAAC,CAAA;AAErC,EAAW,KAAA,MAAA,QAAA,IAAY,aAAc,CAAA,UAAiB,CAAG,EAAA;AACvD,IAAI,IAAA,OAAO,aAAa,UAAY,EAAA;AAClC,MAAA,mBAAA,CAAoB,IAAK,CAAA,GAAI,QAAS,CAAA,KAAK,CAAc,CAAA,CAAA;AAAA,KACpD,MAAA;AACL,MAAA,mBAAA,CAAoB,KAAK,QAAQ,CAAA,CAAA;AAAA,KACnC;AAAA,GACF;AAGA,EAAA,IAAI,oBAAoB,MAAU,IAAA,mBAAA,CAAoB,CAAC,CAAE,CAAA,CAAC,MAAM,GAAK,EAAA;AACnE,IAAA,mBAAA,GAAsB,CAAC,GAAG,UAAA,GAAa,KAAK,CAAA,EAAG,GAAG,mBAAmB,CAAA,CAAA;AAAA,GACvE;AAEA,EAAA,MAAM,cAAmB,EAAC,CAAA;AAC1B,EAAA,MAAM,uBAAuB,EAAC,CAAA;AAE9B,EAAA,KAAA,IAAS,IAAI,mBAAoB,CAAA,MAAA,GAAS,CAAG,EAAA,CAAA,IAAK,GAAG,CAAK,EAAA,EAAA;AACxD,IAAM,MAAA,GAAA,GAAW,oBAAoB,CAAC,CAAA,CAAA;AACtC,IAAI,IAAA,GAAA,CAAI,CAAC,CAAA,KAAM,GAAK,EAAA;AAClB,MAAA,WAAA,CAAY,GAAI,CAAA,SAAA,CAAU,CAAC,CAAC,CAAI,GAAA,IAAA,CAAA;AAChC,MAAA,SAAA;AAAA,KACF;AACA,IAAI,IAAA,WAAA,CAAY,GAAG,CAAG,EAAA;AACpB,MAAA,WAAA,CAAY,GAAG,CAAI,GAAA,KAAA,CAAA;AACnB,MAAA,SAAA;AAAA,KACF;AACA,IAAA,oBAAA,CAAqB,KAAK,GAAG,CAAA,CAAA;AAAA,GAC/B;AACA,EAAA,oBAAA,CAAqB,OAAQ,EAAA,CAAA;AAG7B,EAAA,mBAAA,GAAsB,KAAM,CAAA,IAAA,CAAK,IAAI,GAAA,CAAI,oBAAoB,CAAC,CAAA,CAAA;AAE9D,EAAO,OAAA,mBAAA,CAAA;AACT,CAAA;AAOO,SAAS,OACd,UAC4B,EAAA;AAE5B,EAAM,MAAA,OAAA,GAA8B,CAAC,KAA0B,KAAA;AAC7D,IAAI,IAAA,mBAAA,GAAgC,gBAAiB,CAAA,KAAA,EAAO,UAAU,CAAA,CAAA;AAEtE,IAAI,IAAA,CAAC,mBAAoB,CAAA,MAAA,EAAe,OAAA,KAAA,CAAA;AAGxC,IAAO,OAAA,KAAA,CAAM,GAAI,CAAA,CAAC,CAAS,KAAA;AACzB,MAAA,MAAM,SAAc,EAAC,CAAA;AACrB,MAAA,KAAA,MAAW,OAAO,mBAAqB,EAAA;AACrC,QAAO,MAAA,CAAA,GAAG,CAAI,GAAA,CAAA,CAAE,GAAc,CAAA,CAAA;AAAA,OAChC;AAEA,MAAO,OAAA,MAAA,CAAA;AAAA,KACR,CAAA,CAAA;AAAA,GACH,CAAA;AAEA,EAAO,OAAA,OAAA,CAAA;AACT;;;;"}

package/dist/es/selectors/contains.js.map

@@ -1 +1 @@
-{"version":3,"file":"contains.js","sources":["../../../src/selectors/contains.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that contain the specified substring\n */\nexport function contains<T extends object>(\n  substring: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(substring, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;kBAME,WACA,aAAsB;AAEtB,SAAO,CAAC;AACN,UAAM,QAAQ,IAAI,OAAO,WAAW,aAAa,MAAM;AACvD,UAAM,OAAO,cAAc;AAC3B,WAAO,KAAK,OAAO,CAAC,MAAM,MAAM,KAAK;AAAA;AAAA;;;;"}
+{"version":3,"file":"contains.js","sources":["../../../src/selectors/contains.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that contain the specified substring\n */\nexport function contains<T extends object>(\n  substring: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(substring, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;AAKgB,SAAA,QAAA,CACd,SACA,EAAA,UAAA,GAAsB,IACtB,EAAA;AACA,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAA,MAAM,QAAQ,IAAI,MAAA,CAAO,SAAW,EAAA,UAAA,GAAa,MAAM,KAAS,CAAA,CAAA,CAAA;AAChE,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAA,OAAO,KAAK,MAAO,CAAA,CAAC,MAAM,KAAM,CAAA,IAAA,CAAK,CAAW,CAAC,CAAA,CAAA;AAAA,GACnD,CAAA;AACF;;;;"}

package/dist/es/selectors/endsWith.js.map

@@ -1 +1 @@
-{"version":3,"file":"endsWith.js","sources":["../../../src/selectors/endsWith.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that end with the specified suffix\n */\nexport function endsWith<T extends object>(\n  suffix: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(`${suffix}$`, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;kBAME,QACA,aAAsB;AAEtB,SAAO,CAAC;AACN,UAAM,QAAQ,IAAI,OAAO,GAAG,WAAW,aAAa,MAAM;AAC1D,UAAM,OAAO,cAAc;AAC3B,WAAO,KAAK,OAAO,CAAC,MAAM,MAAM,KAAK;AAAA;AAAA;;;;"}
+{"version":3,"file":"endsWith.js","sources":["../../../src/selectors/endsWith.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that end with the specified suffix\n */\nexport function endsWith<T extends object>(\n  suffix: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(`${suffix}$`, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;AAKgB,SAAA,QAAA,CACd,MACA,EAAA,UAAA,GAAsB,IACtB,EAAA;AACA,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAM,MAAA,KAAA,GAAQ,IAAI,MAAO,CAAA,CAAA,EAAG,MAAM,CAAK,CAAA,CAAA,EAAA,UAAA,GAAa,MAAM,KAAS,CAAA,CAAA,CAAA;AACnE,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAA,OAAO,KAAK,MAAO,CAAA,CAAC,MAAM,KAAM,CAAA,IAAA,CAAK,CAAW,CAAC,CAAA,CAAA;AAAA,GACnD,CAAA;AACF;;;;"}

package/dist/es/selectors/everything.js.map

@@ -1 +1 @@
-{"version":3,"file":"everything.js","sources":["../../../src/selectors/everything.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys\n */\nexport function everything<T extends object>() {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    return keys;\n  };\n}\n"],"names":[],"mappings":";;;AAME,SAAO,CAAC;AACN,UAAM,OAAO,cAAc;AAC3B,WAAO;AAAA;AAAA;;;;"}
+{"version":3,"file":"everything.js","sources":["../../../src/selectors/everything.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys\n */\nexport function everything<T extends object>() {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    return keys;\n  };\n}\n"],"names":[],"mappings":";;AAKO,SAAS,UAA+B,GAAA;AAC7C,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAO,OAAA,IAAA,CAAA;AAAA,GACT,CAAA;AACF;;;;"}

package/dist/es/selectors/matches.js.map

@@ -1 +1 @@
-{"version":3,"file":"matches.js","sources":["../../../src/selectors/matches.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that match the specified regex\n */\nexport function matches<T extends object>(regex: RegExp) {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;iBAK0C;AACxC,SAAO,CAAC;AACN,UAAM,OAAO,cAAc;AAC3B,WAAO,KAAK,OAAO,CAAC,MAAM,MAAM,KAAK;AAAA;AAAA;;;;"}
+{"version":3,"file":"matches.js","sources":["../../../src/selectors/matches.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that match the specified regex\n */\nexport function matches<T extends object>(regex: RegExp) {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;AAKO,SAAS,QAA0B,KAAe,EAAA;AACvD,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAA,OAAO,KAAK,MAAO,CAAA,CAAC,MAAM,KAAM,CAAA,IAAA,CAAK,CAAW,CAAC,CAAA,CAAA;AAAA,GACnD,CAAA;AACF;;;;"}

package/dist/es/selectors/negate.js

@@ -2,7 +2,7 @@ import { singleOrArray } from '../helpers/singleOrArray.js';
 
 function negate(selectors) {
   return (items) => {
-    let keySet = new Set();
+    let keySet = /* @__PURE__ */ new Set();
     for (const selector of singleOrArray(selectors)) {
       if (typeof selector === "function") {
         const keys2 = selector(items);
@@ -13,7 +13,7 @@ function negate(selectors) {
         keySet.add(selector);
       }
     }
-    const keys = Array.from(keySet).map((key) => `-${key}`);
+    const keys = Array.from(keySet).map((key) => `-${String(key)}`);
     return keys;
   };
 }

package/dist/es/selectors/negate.js.map

@@ -1 +1 @@
-{"version":3,"file":"negate.js","sources":["../../../src/selectors/negate.ts"],"sourcesContent":["import { SingleOrArray, singleOrArray } from '../helpers/singleOrArray';\n\n/**\n * Given a set of selectors, inverts their output to be drop keys. e.g.,\n * `key` becomes `-key`.\n */\nexport function negate<T extends object>(\n  selectors: SingleOrArray<keyof T | ((items: T[]) => (keyof T)[])>\n) {\n  return (items: T[]) => {\n    let keySet = new Set<keyof T>();\n    for (const selector of singleOrArray(selectors as any)) {\n      if (typeof selector === 'function') {\n        const keys = selector(items) as (keyof T)[];\n        for (const key of keys) {\n          keySet.add(key);\n        }\n      } else {\n        keySet.add(selector);\n      }\n    }\n    const keys = Array.from(keySet).map((key) => `-${key}`);\n    return keys as (keyof T)[];\n  };\n}\n"],"names":[],"mappings":";;gBAOE;AAEA,SAAO,CAAC;AACN,QAAI,SAAS,IAAI;AACjB,eAAW,YAAY,cAAc;AACnC,UAAI,OAAO,aAAa;AACtB,cAAM,QAAO,SAAS;AACtB,mBAAW,OAAO;AAChB,iBAAO,IAAI;AAAA;AAAA;AAGb,eAAO,IAAI;AAAA;AAAA;AAGf,UAAM,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,QAAQ,IAAI;AACjD,WAAO;AAAA;AAAA;;;;"}
+{"version":3,"file":"negate.js","sources":["../../../src/selectors/negate.ts"],"sourcesContent":["import { SingleOrArray, singleOrArray } from '../helpers/singleOrArray';\n\n/**\n * Given a set of selectors, inverts their output to be drop keys. e.g.,\n * `key` becomes `-key`.\n */\nexport function negate<T extends object>(\n  selectors: SingleOrArray<keyof T | ((items: T[]) => (keyof T)[])>\n) {\n  return (items: T[]) => {\n    let keySet = new Set<keyof T>();\n    for (const selector of singleOrArray(selectors as any)) {\n      if (typeof selector === 'function') {\n        const keys = selector(items) as (keyof T)[];\n        for (const key of keys) {\n          keySet.add(key);\n        }\n      } else {\n        keySet.add(selector);\n      }\n    }\n    const keys = Array.from(keySet).map((key) => `-${String(key)}`);\n    return keys as (keyof T)[];\n  };\n}\n"],"names":["keys"],"mappings":";;AAMO,SAAS,OACd,SACA,EAAA;AACA,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAI,IAAA,MAAA,uBAAa,GAAa,EAAA,CAAA;AAC9B,IAAW,KAAA,MAAA,QAAA,IAAY,aAAc,CAAA,SAAgB,CAAG,EAAA;AACtD,MAAI,IAAA,OAAO,aAAa,UAAY,EAAA;AAClC,QAAMA,MAAAA,KAAAA,GAAO,SAAS,KAAK,CAAA,CAAA;AAC3B,QAAA,KAAA,MAAW,OAAOA,KAAM,EAAA;AACtB,UAAA,MAAA,CAAO,IAAI,GAAG,CAAA,CAAA;AAAA,SAChB;AAAA,OACK,MAAA;AACL,QAAA,MAAA,CAAO,IAAI,QAAQ,CAAA,CAAA;AAAA,OACrB;AAAA,KACF;AACA,IAAA,MAAM,IAAO,GAAA,KAAA,CAAM,IAAK,CAAA,MAAM,CAAE,CAAA,GAAA,CAAI,CAAC,GAAA,KAAQ,CAAI,CAAA,EAAA,MAAA,CAAO,GAAG,CAAC,CAAE,CAAA,CAAA,CAAA;AAC9D,IAAO,OAAA,IAAA,CAAA;AAAA,GACT,CAAA;AACF;;;;"}

package/dist/es/selectors/numRange.js.map

@@ -1 +1 @@
-{"version":3,"file":"numRange.js","sources":["../../../src/selectors/numRange.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that match the prefix + num range.\n * e.g., wk, [10, 15], width=3 -> wk010, wk011, wk012, wk013, wk014, wk015\n */\nexport function numRange<T extends object>(\n  prefix: string,\n  range: [number, number],\n  width?: number\n) {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    const matchKeys: string[] = [];\n    for (let i = range[0]; i <= range[1]; ++i) {\n      const num = width == null ? i : new String('00000000' + i).slice(-width);\n      matchKeys.push(`${prefix}${num}`);\n    }\n\n    return keys.filter((d) => (matchKeys as (keyof T)[]).includes(d));\n  };\n}\n"],"names":[],"mappings":";;kBAOE,QACA,OACA;AAEA,SAAO,CAAC;AACN,UAAM,OAAO,cAAc;AAC3B,UAAM,YAAsB;AAC5B,aAAS,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI,EAAE;AACtC,YAAM,MAAM,SAAS,OAAO,IAAI,IAAI,OAAO,aAAa,GAAG,MAAM,CAAC;AAClE,gBAAU,KAAK,GAAG,SAAS;AAAA;AAG7B,WAAO,KAAK,OAAO,CAAC,MAAO,UAA0B,SAAS;AAAA;AAAA;;;;"}
+{"version":3,"file":"numRange.js","sources":["../../../src/selectors/numRange.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that match the prefix + num range.\n * e.g., wk, [10, 15], width=3 -> wk010, wk011, wk012, wk013, wk014, wk015\n */\nexport function numRange<T extends object>(\n  prefix: string,\n  range: [number, number],\n  width?: number\n) {\n  return (items: T[]) => {\n    const keys = keysFromItems(items);\n    const matchKeys: string[] = [];\n    for (let i = range[0]; i <= range[1]; ++i) {\n      const num = width == null ? i : new String('00000000' + i).slice(-width);\n      matchKeys.push(`${prefix}${num}`);\n    }\n\n    return keys.filter((d) => (matchKeys as (keyof T)[]).includes(d));\n  };\n}\n"],"names":[],"mappings":";;AAMgB,SAAA,QAAA,CACd,MACA,EAAA,KAAA,EACA,KACA,EAAA;AACA,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAA,MAAM,YAAsB,EAAC,CAAA;AAC7B,IAAS,KAAA,IAAA,CAAA,GAAI,MAAM,CAAC,CAAA,EAAG,KAAK,KAAM,CAAA,CAAC,CAAG,EAAA,EAAE,CAAG,EAAA;AACzC,MAAM,MAAA,GAAA,GAAM,KAAS,IAAA,IAAA,GAAO,CAAI,GAAA,IAAI,MAAO,CAAA,UAAA,GAAa,CAAC,CAAA,CAAE,KAAM,CAAA,CAAC,KAAK,CAAA,CAAA;AACvE,MAAA,SAAA,CAAU,IAAK,CAAA,CAAA,EAAG,MAAM,CAAA,EAAG,GAAG,CAAE,CAAA,CAAA,CAAA;AAAA,KAClC;AAEA,IAAA,OAAO,KAAK,MAAO,CAAA,CAAC,MAAO,SAA0B,CAAA,QAAA,CAAS,CAAC,CAAC,CAAA,CAAA;AAAA,GAClE,CAAA;AACF;;;;"}

package/dist/es/selectors/startsWith.js.map

@@ -1 +1 @@
-{"version":3,"file":"startsWith.js","sources":["../../../src/selectors/startsWith.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that start with the specified prefix\n */\nexport function startsWith<T extends object>(\n  prefix: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(`^${prefix}`, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;oBAME,QACA,aAAsB;AAEtB,SAAO,CAAC;AACN,UAAM,QAAQ,IAAI,OAAO,IAAI,UAAU,aAAa,MAAM;AAC1D,UAAM,OAAO,cAAc;AAC3B,WAAO,KAAK,OAAO,CAAC,MAAM,MAAM,KAAK;AAAA;AAAA;;;;"}
+{"version":3,"file":"startsWith.js","sources":["../../../src/selectors/startsWith.ts"],"sourcesContent":["import { keysFromItems } from '../helpers/keysFromItems';\n\n/**\n * Returns all keys that start with the specified prefix\n */\nexport function startsWith<T extends object>(\n  prefix: string,\n  ignoreCase: boolean = true\n) {\n  return (items: T[]) => {\n    const regex = new RegExp(`^${prefix}`, ignoreCase ? 'i' : undefined);\n    const keys = keysFromItems(items);\n    return keys.filter((d) => regex.test(d as string));\n  };\n}\n"],"names":[],"mappings":";;AAKgB,SAAA,UAAA,CACd,MACA,EAAA,UAAA,GAAsB,IACtB,EAAA;AACA,EAAA,OAAO,CAAC,KAAe,KAAA;AACrB,IAAM,MAAA,KAAA,GAAQ,IAAI,MAAO,CAAA,CAAA,CAAA,EAAI,MAAM,CAAI,CAAA,EAAA,UAAA,GAAa,MAAM,KAAS,CAAA,CAAA,CAAA;AACnE,IAAM,MAAA,IAAA,GAAO,cAAc,KAAK,CAAA,CAAA;AAChC,IAAA,OAAO,KAAK,MAAO,CAAA,CAAC,MAAM,KAAM,CAAA,IAAA,CAAK,CAAW,CAAC,CAAA,CAAA;AAAA,GACnD,CAAA;AACF;;;;"}

package/dist/es/sequences/fullSeq.js

@@ -54,7 +54,11 @@ function fullSeqDateISOString(key, granularity, period) {
     granularity = granularity != null ? granularity : "day";
     period = period != null ? period : 1;
     const keyFn = typeof key === "function" ? key : (d) => d[key];
-    return vectorSeqDate(items.map((d) => new Date(keyFn(d))), granularity, period).map((date) => date.toISOString());
+    return vectorSeqDate(
+      items.map((d) => new Date(keyFn(d))),
+      granularity,
+      period
+    ).map((date) => date.toISOString());
   };
 }
 

package/dist/es/sequences/fullSeq.js.map

@@ -1 +1 @@
-{"version":3,"file":"fullSeq.js","sources":["../../../src/sequences/fullSeq.ts"],"sourcesContent":["import { extent } from 'd3-array';\nimport { Granularity } from '../types';\n\n/**\n * Create a full sequence given a vector of values\n */\nexport function vectorSeq(values: number[], period: number = 1): number[] {\n  let [min, max] = extent(values) as [number, number];\n\n  const sequence: number[] = [];\n  let value = min;\n  while (value <= max) {\n    sequence.push(value);\n    value += period;\n  }\n\n  return sequence;\n}\n\n/**\n * Create a full sequence given a vector of values\n */\nexport function vectorSeqDate(\n  values: Date[],\n  granularity: Granularity = 'day',\n  period: number = 1\n): Date[] {\n  let [min, max] = extent(values) as [Date, Date];\n\n  const sequence: Date[] = [];\n  let value = new Date(min);\n  while (value <= max) {\n    sequence.push(new Date(value));\n\n    // increment date\n    if (\n      granularity === 'second' ||\n      granularity === 's' ||\n      granularity === 'seconds'\n    ) {\n      value.setUTCSeconds(value.getUTCSeconds() + 1 * period);\n    } else if (\n      granularity === 'minute' ||\n      granularity === 'min' ||\n      granularity === 'minutes'\n    ) {\n      value.setUTCMinutes(value.getUTCMinutes() + 1 * period);\n    } else if (\n      granularity === 'day' ||\n      granularity === 'd' ||\n      granularity === 'days'\n    ) {\n      value.setUTCDate(value.getUTCDate() + 1 * period);\n    } else if (\n      granularity === 'week' ||\n      granularity === 'w' ||\n      granularity === 'weeks'\n    ) {\n      value.setUTCDate(value.getUTCDate() + 7 * period);\n    } else if (\n      granularity === 'month' ||\n      granularity === 'm' ||\n      granularity === 'months'\n    ) {\n      value.setUTCMonth(value.getUTCMonth() + 1 * period);\n    } else if (\n      granularity === 'year' ||\n      granularity === 'y' ||\n      granularity === 'years'\n    ) {\n      value.setUTCFullYear(value.getUTCFullYear() + 1 * period);\n    } else {\n      throw new Error('Invalid granularity for date sequence: ' + granularity);\n    }\n  }\n\n  return sequence;\n}\n\n/**\n * Create a full sequence given a set of data.\n * @param items\n * @param key\n */\nexport function fullSeq<T extends object>(\n  key: keyof T | ((d: T) => number),\n  period?: number | null | undefined\n): (items: T[]) => number[] {\n  return function fullSeqInner(items: T[]): number[] {\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => (d[key] as unknown) as number;\n\n    return vectorSeq(items.map(keyFn), period);\n  };\n}\n\nexport function fullSeqDate<T extends object>(\n  key: keyof T | ((d: T) => Date),\n  granularity?: Granularity | null | undefined,\n  period?: number | null | undefined\n): (items: T[]) => Date[] {\n  return function fullSeqDateInner(items: T[]): Date[] {\n    granularity = granularity ?? 'day';\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => (d[key] as unknown) as Date;\n\n    return vectorSeqDate(items.map(keyFn), granularity, period);\n  };\n}\n\nexport function fullSeqDateISOString<T extends object>(\n  key: keyof T | ((d: T) => string),\n  granularity?: Granularity | null | undefined,\n  period?: number | null | undefined\n): (items: T[]) => string[] {\n  return function fullSeqDateISOStringInner(items: T[]): string[] {\n    granularity = granularity ?? 'day';\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => (d[key] as unknown) as string;\n\n    return vectorSeqDate(\n      items.map((d) => new Date(keyFn(d))),\n      granularity,\n      period\n    ).map((date) => date.toISOString());\n  };\n}\n"],"names":[],"mappings":";;mBAM0B,QAAkB,SAAiB;AAC3D,MAAI,CAAC,KAAK,OAAO,OAAO;AAExB,QAAM,WAAqB;AAC3B,MAAI,QAAQ;AACZ,SAAO,SAAS;AACd,aAAS,KAAK;AACd,aAAS;AAAA;AAGX,SAAO;AAAA;uBAOP,QACA,cAA2B,OAC3B,SAAiB;AAEjB,MAAI,CAAC,KAAK,OAAO,OAAO;AAExB,QAAM,WAAmB;AACzB,MAAI,QAAQ,IAAI,KAAK;AACrB,SAAO,SAAS;AACd,aAAS,KAAK,IAAI,KAAK;AAGvB,QACE,gBAAgB,YAChB,gBAAgB,OAChB,gBAAgB;AAEhB,YAAM,cAAc,MAAM,kBAAkB,IAAI;AAAA,eAEhD,gBAAgB,YAChB,gBAAgB,SAChB,gBAAgB;AAEhB,YAAM,cAAc,MAAM,kBAAkB,IAAI;AAAA,eAEhD,gBAAgB,SAChB,gBAAgB,OAChB,gBAAgB;AAEhB,YAAM,WAAW,MAAM,eAAe,IAAI;AAAA,eAE1C,gBAAgB,UAChB,gBAAgB,OAChB,gBAAgB;AAEhB,YAAM,WAAW,MAAM,eAAe,IAAI;AAAA,eAE1C,gBAAgB,WAChB,gBAAgB,OAChB,gBAAgB;AAEhB,YAAM,YAAY,MAAM,gBAAgB,IAAI;AAAA,eAE5C,gBAAgB,UAChB,gBAAgB,OAChB,gBAAgB;AAEhB,YAAM,eAAe,MAAM,mBAAmB,IAAI;AAAA;AAElD,YAAM,IAAI,MAAM,4CAA4C;AAAA;AAAA;AAIhE,SAAO;AAAA;iBASP,KACA;AAEA,SAAO,sBAAsB;AAC3B,aAAS,0BAAU;AAEnB,UAAM,QACJ,OAAO,QAAQ,aAAa,MAAM,CAAC,MAAU,EAAE;AAEjD,WAAO,UAAU,MAAM,IAAI,QAAQ;AAAA;AAAA;qBAKrC,KACA,aACA;AAEA,SAAO,0BAA0B;AAC/B,kBAAc,oCAAe;AAC7B,aAAS,0BAAU;AAEnB,UAAM,QACJ,OAAO,QAAQ,aAAa,MAAM,CAAC,MAAU,EAAE;AAEjD,WAAO,cAAc,MAAM,IAAI,QAAQ,aAAa;AAAA;AAAA;8BAKtD,KACA,aACA;AAEA,SAAO,mCAAmC;AACxC,kBAAc,oCAAe;AAC7B,aAAS,0BAAU;AAEnB,UAAM,QACJ,OAAO,QAAQ,aAAa,MAAM,CAAC,MAAU,EAAE;AAEjD,WAAO,cACL,MAAM,IAAI,CAAC,MAAM,IAAI,KAAK,MAAM,MAChC,aACA,QACA,IAAI,CAAC,SAAS,KAAK;AAAA;AAAA;;;;"}
+{"version":3,"file":"fullSeq.js","sources":["../../../src/sequences/fullSeq.ts"],"sourcesContent":["import { extent } from 'd3-array';\nimport { Granularity } from '../types';\n\n/**\n * Create a full sequence given a vector of values\n */\nexport function vectorSeq(values: number[], period: number = 1): number[] {\n  let [min, max] = extent(values) as [number, number];\n\n  const sequence: number[] = [];\n  let value = min;\n  while (value <= max) {\n    sequence.push(value);\n    value += period;\n  }\n\n  return sequence;\n}\n\n/**\n * Create a full sequence given a vector of values\n */\nexport function vectorSeqDate(\n  values: Date[],\n  granularity: Granularity = 'day',\n  period: number = 1\n): Date[] {\n  let [min, max] = extent(values) as [Date, Date];\n\n  const sequence: Date[] = [];\n  let value = new Date(min);\n  while (value <= max) {\n    sequence.push(new Date(value));\n\n    // increment date\n    if (\n      granularity === 'second' ||\n      granularity === 's' ||\n      granularity === 'seconds'\n    ) {\n      value.setUTCSeconds(value.getUTCSeconds() + 1 * period);\n    } else if (\n      granularity === 'minute' ||\n      granularity === 'min' ||\n      granularity === 'minutes'\n    ) {\n      value.setUTCMinutes(value.getUTCMinutes() + 1 * period);\n    } else if (\n      granularity === 'day' ||\n      granularity === 'd' ||\n      granularity === 'days'\n    ) {\n      value.setUTCDate(value.getUTCDate() + 1 * period);\n    } else if (\n      granularity === 'week' ||\n      granularity === 'w' ||\n      granularity === 'weeks'\n    ) {\n      value.setUTCDate(value.getUTCDate() + 7 * period);\n    } else if (\n      granularity === 'month' ||\n      granularity === 'm' ||\n      granularity === 'months'\n    ) {\n      value.setUTCMonth(value.getUTCMonth() + 1 * period);\n    } else if (\n      granularity === 'year' ||\n      granularity === 'y' ||\n      granularity === 'years'\n    ) {\n      value.setUTCFullYear(value.getUTCFullYear() + 1 * period);\n    } else {\n      throw new Error('Invalid granularity for date sequence: ' + granularity);\n    }\n  }\n\n  return sequence;\n}\n\n/**\n * Create a full sequence given a set of data.\n * @param items\n * @param key\n */\nexport function fullSeq<T extends object>(\n  key: keyof T | ((d: T) => number),\n  period?: number | null | undefined\n): (items: T[]) => number[] {\n  return function fullSeqInner(items: T[]): number[] {\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => d[key] as unknown as number;\n\n    return vectorSeq(items.map(keyFn), period);\n  };\n}\n\nexport function fullSeqDate<T extends object>(\n  key: keyof T | ((d: T) => Date),\n  granularity?: Granularity | null | undefined,\n  period?: number | null | undefined\n): (items: T[]) => Date[] {\n  return function fullSeqDateInner(items: T[]): Date[] {\n    granularity = granularity ?? 'day';\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => d[key] as unknown as Date;\n\n    return vectorSeqDate(items.map(keyFn), granularity, period);\n  };\n}\n\nexport function fullSeqDateISOString<T extends object>(\n  key: keyof T | ((d: T) => string),\n  granularity?: Granularity | null | undefined,\n  period?: number | null | undefined\n): (items: T[]) => string[] {\n  return function fullSeqDateISOStringInner(items: T[]): string[] {\n    granularity = granularity ?? 'day';\n    period = period ?? 1;\n\n    const keyFn =\n      typeof key === 'function' ? key : (d: T) => d[key] as unknown as string;\n\n    return vectorSeqDate(\n      items.map((d) => new Date(keyFn(d))),\n      granularity,\n      period\n    ).map((date) => date.toISOString());\n  };\n}\n"],"names":[],"mappings":";;AAMgB,SAAA,SAAA,CAAU,MAAkB,EAAA,MAAA,GAAiB,CAAa,EAAA;AACxE,EAAA,IAAI,CAAC,GAAA,EAAK,GAAG,CAAA,GAAI,OAAO,MAAM,CAAA,CAAA;AAE9B,EAAA,MAAM,WAAqB,EAAC,CAAA;AAC5B,EAAA,IAAI,KAAQ,GAAA,GAAA,CAAA;AACZ,EAAA,OAAO,SAAS,GAAK,EAAA;AACnB,IAAA,QAAA,CAAS,KAAK,KAAK,CAAA,CAAA;AACnB,IAAS,KAAA,IAAA,MAAA,CAAA;AAAA,GACX;AAEA,EAAO,OAAA,QAAA,CAAA;AACT,CAAA;AAKO,SAAS,aACd,CAAA,MAAA,EACA,WAA2B,GAAA,KAAA,EAC3B,SAAiB,CACT,EAAA;AACR,EAAA,IAAI,CAAC,GAAA,EAAK,GAAG,CAAA,GAAI,OAAO,MAAM,CAAA,CAAA;AAE9B,EAAA,MAAM,WAAmB,EAAC,CAAA;AAC1B,EAAI,IAAA,KAAA,GAAQ,IAAI,IAAA,CAAK,GAAG,CAAA,CAAA;AACxB,EAAA,OAAO,SAAS,GAAK,EAAA;AACnB,IAAA,QAAA,CAAS,IAAK,CAAA,IAAI,IAAK,CAAA,KAAK,CAAC,CAAA,CAAA;AAG7B,IAAA,IACE,WAAgB,KAAA,QAAA,IAChB,WAAgB,KAAA,GAAA,IAChB,gBAAgB,SAChB,EAAA;AACA,MAAA,KAAA,CAAM,aAAc,CAAA,KAAA,CAAM,aAAc,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,eAEtD,WAAgB,KAAA,QAAA,IAChB,WAAgB,KAAA,KAAA,IAChB,gBAAgB,SAChB,EAAA;AACA,MAAA,KAAA,CAAM,aAAc,CAAA,KAAA,CAAM,aAAc,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,eAEtD,WAAgB,KAAA,KAAA,IAChB,WAAgB,KAAA,GAAA,IAChB,gBAAgB,MAChB,EAAA;AACA,MAAA,KAAA,CAAM,UAAW,CAAA,KAAA,CAAM,UAAW,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,eAEhD,WAAgB,KAAA,MAAA,IAChB,WAAgB,KAAA,GAAA,IAChB,gBAAgB,OAChB,EAAA;AACA,MAAA,KAAA,CAAM,UAAW,CAAA,KAAA,CAAM,UAAW,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,eAEhD,WAAgB,KAAA,OAAA,IAChB,WAAgB,KAAA,GAAA,IAChB,gBAAgB,QAChB,EAAA;AACA,MAAA,KAAA,CAAM,WAAY,CAAA,KAAA,CAAM,WAAY,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,eAElD,WAAgB,KAAA,MAAA,IAChB,WAAgB,KAAA,GAAA,IAChB,gBAAgB,OAChB,EAAA;AACA,MAAA,KAAA,CAAM,cAAe,CAAA,KAAA,CAAM,cAAe,EAAA,GAAI,IAAI,MAAM,CAAA,CAAA;AAAA,KACnD,MAAA;AACL,MAAM,MAAA,IAAI,KAAM,CAAA,yCAAA,GAA4C,WAAW,CAAA,CAAA;AAAA,KACzE;AAAA,GACF;AAEA,EAAO,OAAA,QAAA,CAAA;AACT,CAAA;AAOgB,SAAA,OAAA,CACd,KACA,MAC0B,EAAA;AAC1B,EAAO,OAAA,SAAS,aAAa,KAAsB,EAAA;AACjD,IAAA,MAAA,GAAS,MAAU,IAAA,IAAA,GAAA,MAAA,GAAA,CAAA,CAAA;AAEnB,IAAM,MAAA,KAAA,GACJ,OAAO,GAAQ,KAAA,UAAA,GAAa,MAAM,CAAC,CAAA,KAAS,EAAE,GAAG,CAAA,CAAA;AAEnD,IAAA,OAAO,SAAU,CAAA,KAAA,CAAM,GAAI,CAAA,KAAK,GAAG,MAAM,CAAA,CAAA;AAAA,GAC3C,CAAA;AACF,CAAA;AAEgB,SAAA,WAAA,CACd,GACA,EAAA,WAAA,EACA,MACwB,EAAA;AACxB,EAAO,OAAA,SAAS,iBAAiB,KAAoB,EAAA;AACnD,IAAA,WAAA,GAAc,WAAe,IAAA,IAAA,GAAA,WAAA,GAAA,KAAA,CAAA;AAC7B,IAAA,MAAA,GAAS,MAAU,IAAA,IAAA,GAAA,MAAA,GAAA,CAAA,CAAA;AAEnB,IAAM,MAAA,KAAA,GACJ,OAAO,GAAQ,KAAA,UAAA,GAAa,MAAM,CAAC,CAAA,KAAS,EAAE,GAAG,CAAA,CAAA;AAEnD,IAAA,OAAO,cAAc,KAAM,CAAA,GAAA,CAAI,KAAK,CAAA,EAAG,aAAa,MAAM,CAAA,CAAA;AAAA,GAC5D,CAAA;AACF,CAAA;AAEgB,SAAA,oBAAA,CACd,GACA,EAAA,WAAA,EACA,MAC0B,EAAA;AAC1B,EAAO,OAAA,SAAS,0BAA0B,KAAsB,EAAA;AAC9D,IAAA,WAAA,GAAc,WAAe,IAAA,IAAA,GAAA,WAAA,GAAA,KAAA,CAAA;AAC7B,IAAA,MAAA,GAAS,MAAU,IAAA,IAAA,GAAA,MAAA,GAAA,CAAA,CAAA;AAEnB,IAAM,MAAA,KAAA,GACJ,OAAO,GAAQ,KAAA,UAAA,GAAa,MAAM,CAAC,CAAA,KAAS,EAAE,GAAG,CAAA,CAAA;AAEnD,IAAO,OAAA,aAAA;AAAA,MACL,KAAA,CAAM,IAAI,CAAC,CAAA,KAAM,IAAI,IAAK,CAAA,KAAA,CAAM,CAAC,CAAC,CAAC,CAAA;AAAA,MACnC,WAAA;AAAA,MACA,MAAA;AAAA,MACA,GAAI,CAAA,CAAC,IAAS,KAAA,IAAA,CAAK,aAAa,CAAA,CAAA;AAAA,GACpC,CAAA;AACF;;;;"}

package/dist/es/slice.js

@@ -17,10 +17,9 @@ function sliceMax(n, orderBy) {
 }
 function sliceSample(n, options) {
   options = options != null ? options : {};
-  const {replace} = options;
+  const { replace } = options;
   const _sliceSample = (items) => {
-    if (!items.length)
-      return items.slice();
+    if (!items.length) return items.slice();
     if (replace) {
       const sliced = [];
       for (let i = 0; i < n; ++i) {

package/dist/es/slice.js.map

@@ -1 +1 @@
-{"version":3,"file":"slice.js","sources":["../../src/slice.ts"],"sourcesContent":["import { shuffle } from 'd3-array';\nimport { arrange, desc } from './arrange';\nimport { SingleOrArray } from './helpers/singleOrArray';\nimport { Comparator, Key, TidyFn } from './types';\n\n/**\n * Truncates the array to the specified range\n */\nexport function slice<T extends object>(\n  start: number,\n  end?: number\n): TidyFn<T> {\n  const _slice: TidyFn<T> = (items: T[]): T[] => items.slice(start, end);\n\n  return _slice;\n}\n\n// -------------------------------------------------------------------\n/**\n * Truncates the array to the first N items\n */\nexport const sliceHead = <T extends object>(n: number) => slice<T>(0, n);\n\n// -------------------------------------------------------------------\n/**\n * Truncates the array to the last N items\n */\nexport const sliceTail = <T extends object>(n: number) => slice<T>(-n);\n\n// -------------------------------------------------------------------\n\n/**\n * Truncates the array to the first N items ordered by some key\n */\nexport function sliceMin<T extends object>(\n  n: number,\n  orderBy: SingleOrArray<Key | Comparator<T>>\n): TidyFn<T> {\n  const _sliceMin: TidyFn<T> = (items: T[]): T[] =>\n    arrange<T>(orderBy)(items).slice(0, n);\n\n  return _sliceMin;\n}\n\n// -------------------------------------------------------------------\n\n/**\n * Truncates the array to the last N items ordered by some key\n */\nexport function sliceMax<T extends object>(\n  n: number,\n  orderBy: SingleOrArray<Key | Comparator<T>>\n): TidyFn<T> {\n  // note: we use desc() so we get proper handling of nullish values\n  // unless they provided an explicit comparator.\n  const _sliceMax: TidyFn<T> = (items: T[]): T[] =>\n    typeof orderBy === 'function'\n      ? arrange<T>(orderBy)(items).slice(-n).reverse()\n      : arrange<T>(desc(orderBy as any))(items).slice(0, n);\n\n  return _sliceMax;\n}\n\n// -------------------------------------------------------------------\n\ntype SampleOptions = {\n  replace?: boolean;\n};\n/**\n * Truncates the array to the last N items ordered by some key\n */\nexport function sliceSample<T extends object>(\n  n: number,\n  options?: SampleOptions | null | undefined\n): TidyFn<T> {\n  options = options ?? {};\n  const { replace } = options;\n\n  const _sliceSample: TidyFn<T> = (items: T[]) => {\n    if (!items.length) return items.slice();\n\n    // sample items with replacement\n    if (replace) {\n      const sliced = [];\n      for (let i = 0; i < n; ++i) {\n        sliced.push(items[Math.floor(Math.random() * items.length)]);\n      }\n      return sliced;\n    }\n\n    // sample items without replacement\n    return shuffle(items.slice()).slice(0, n);\n  };\n\n  return _sliceSample;\n}\n"],"names":[],"mappings":";;;eASE,OACA;AAEA,QAAM,SAAoB,CAAC,UAAoB,MAAM,MAAM,OAAO;AAElE,SAAO;AAAA;MAOI,YAAY,CAAmB,MAAc,MAAS,GAAG;MAMzD,YAAY,CAAmB,MAAc,MAAS,CAAC;kBAQlE,GACA;AAEA,QAAM,YAAuB,CAAC,UAC5B,QAAW,SAAS,OAAO,MAAM,GAAG;AAEtC,SAAO;AAAA;kBASP,GACA;AAIA,QAAM,YAAuB,CAAC,UAC5B,OAAO,YAAY,aACf,QAAW,SAAS,OAAO,MAAM,CAAC,GAAG,YACrC,QAAW,KAAK,UAAiB,OAAO,MAAM,GAAG;AAEvD,SAAO;AAAA;qBAYP,GACA;AAEA,YAAU,4BAAW;AACrB,QAAM,CAAE,WAAY;AAEpB,QAAM,eAA0B,CAAC;AAC/B,QAAI,CAAC,MAAM;AAAQ,aAAO,MAAM;AAGhC,QAAI;AACF,YAAM,SAAS;AACf,eAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,eAAO,KAAK,MAAM,KAAK,MAAM,KAAK,WAAW,MAAM;AAAA;AAErD,aAAO;AAAA;AAIT,WAAO,QAAQ,MAAM,SAAS,MAAM,GAAG;AAAA;AAGzC,SAAO;AAAA;;;;"}
+{"version":3,"file":"slice.js","sources":["../../src/slice.ts"],"sourcesContent":["import { shuffle } from 'd3-array';\nimport { arrange, desc } from './arrange';\nimport { SingleOrArray } from './helpers/singleOrArray';\nimport { Comparator, Key, TidyFn } from './types';\n\n/**\n * Truncates the array to the specified range\n */\nexport function slice<T extends object>(\n  start: number,\n  end?: number\n): TidyFn<T> {\n  const _slice: TidyFn<T> = (items: T[]): T[] => items.slice(start, end);\n\n  return _slice;\n}\n\n// -------------------------------------------------------------------\n/**\n * Truncates the array to the first N items\n */\nexport const sliceHead = <T extends object>(n: number) => slice<T>(0, n);\n\n// -------------------------------------------------------------------\n/**\n * Truncates the array to the last N items\n */\nexport const sliceTail = <T extends object>(n: number) => slice<T>(-n);\n\n// -------------------------------------------------------------------\n\n/**\n * Truncates the array to the first N items ordered by some key\n */\nexport function sliceMin<T extends object>(\n  n: number,\n  orderBy: SingleOrArray<Key | Comparator<T>>\n): TidyFn<T> {\n  const _sliceMin: TidyFn<T> = (items: T[]): T[] =>\n    arrange<T>(orderBy)(items).slice(0, n);\n\n  return _sliceMin;\n}\n\n// -------------------------------------------------------------------\n\n/**\n * Truncates the array to the last N items ordered by some key\n */\nexport function sliceMax<T extends object>(\n  n: number,\n  orderBy: SingleOrArray<Key | Comparator<T>>\n): TidyFn<T> {\n  // note: we use desc() so we get proper handling of nullish values\n  // unless they provided an explicit comparator.\n  const _sliceMax: TidyFn<T> = (items: T[]): T[] =>\n    typeof orderBy === 'function'\n      ? arrange<T>(orderBy)(items).slice(-n).reverse()\n      : arrange<T>(desc(orderBy as any))(items).slice(0, n);\n\n  return _sliceMax;\n}\n\n// -------------------------------------------------------------------\n\ntype SampleOptions = {\n  replace?: boolean;\n};\n/**\n * Truncates the array to the last N items ordered by some key\n */\nexport function sliceSample<T extends object>(\n  n: number,\n  options?: SampleOptions | null | undefined\n): TidyFn<T> {\n  options = options ?? {};\n  const { replace } = options;\n\n  const _sliceSample: TidyFn<T> = (items: T[]) => {\n    if (!items.length) return items.slice();\n\n    // sample items with replacement\n    if (replace) {\n      const sliced = [];\n      for (let i = 0; i < n; ++i) {\n        sliced.push(items[Math.floor(Math.random() * items.length)]);\n      }\n      return sliced;\n    }\n\n    // sample items without replacement\n    return shuffle(items.slice()).slice(0, n);\n  };\n\n  return _sliceSample;\n}\n"],"names":[],"mappings":";;;AAQgB,SAAA,KAAA,CACd,OACA,GACW,EAAA;AACX,EAAA,MAAM,SAAoB,CAAC,KAAA,KAAoB,KAAM,CAAA,KAAA,CAAM,OAAO,GAAG,CAAA,CAAA;AAErE,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAMO,MAAM,SAAY,GAAA,CAAmB,CAAc,KAAA,KAAA,CAAS,GAAG,CAAC,EAAA;AAMhE,MAAM,SAAY,GAAA,CAAmB,CAAc,KAAA,KAAA,CAAS,CAAC,CAAC,EAAA;AAOrD,SAAA,QAAA,CACd,GACA,OACW,EAAA;AACX,EAAM,MAAA,SAAA,GAAuB,CAAC,KAAA,KAC5B,OAAW,CAAA,OAAO,EAAE,KAAK,CAAA,CAAE,KAAM,CAAA,CAAA,EAAG,CAAC,CAAA,CAAA;AAEvC,EAAO,OAAA,SAAA,CAAA;AACT,CAAA;AAOgB,SAAA,QAAA,CACd,GACA,OACW,EAAA;AAGX,EAAM,MAAA,SAAA,GAAuB,CAAC,KAAA,KAC5B,OAAO,OAAA,KAAY,UACf,GAAA,OAAA,CAAW,OAAO,CAAA,CAAE,KAAK,CAAA,CAAE,KAAM,CAAA,CAAC,CAAC,CAAE,CAAA,OAAA,EACrC,GAAA,OAAA,CAAW,IAAK,CAAA,OAAc,CAAC,CAAA,CAAE,KAAK,CAAA,CAAE,KAAM,CAAA,CAAA,EAAG,CAAC,CAAA,CAAA;AAExD,EAAO,OAAA,SAAA,CAAA;AACT,CAAA;AAUgB,SAAA,WAAA,CACd,GACA,OACW,EAAA;AACX,EAAA,OAAA,GAAU,4BAAW,EAAC,CAAA;AACtB,EAAM,MAAA,EAAE,SAAY,GAAA,OAAA,CAAA;AAEpB,EAAM,MAAA,YAAA,GAA0B,CAAC,KAAe,KAAA;AAC9C,IAAA,IAAI,CAAC,KAAA,CAAM,MAAQ,EAAA,OAAO,MAAM,KAAM,EAAA,CAAA;AAGtC,IAAA,IAAI,OAAS,EAAA;AACX,MAAA,MAAM,SAAS,EAAC,CAAA;AAChB,MAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,CAAA,EAAG,EAAE,CAAG,EAAA;AAC1B,QAAO,MAAA,CAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,KAAM,CAAA,IAAA,CAAK,QAAW,GAAA,KAAA,CAAM,MAAM,CAAC,CAAC,CAAA,CAAA;AAAA,OAC7D;AACA,MAAO,OAAA,MAAA,CAAA;AAAA,KACT;AAGA,IAAA,OAAO,QAAQ,KAAM,CAAA,KAAA,EAAO,CAAE,CAAA,KAAA,CAAM,GAAG,CAAC,CAAA,CAAA;AAAA,GAC1C,CAAA;AAEA,EAAO,OAAA,YAAA,CAAA;AACT;;;;"}

package/dist/es/summarize.js

@@ -9,9 +9,10 @@ function summarize(summarizeSpec, options) {
       summarized[key] = summarizeSpec[key](items);
     }
     if (options.rest && items.length) {
+      const keysSet = new Set(keys);
       const objectKeys = Object.keys(items[0]);
       for (const objKey of objectKeys) {
-        if (keys.includes(objKey)) {
+        if (keysSet.has(objKey)) {
           continue;
         }
         summarized[objKey] = options.rest(objKey)(items);
@@ -22,8 +23,7 @@ function summarize(summarizeSpec, options) {
   return _summarize;
 }
 function _summarizeHelper(items, summaryFn, predicateFn, keys) {
-  if (!items.length)
-    return [];
+  if (!items.length) return [];
   const summarized = {};
   let keysArr;
   if (keys == null) {
@@ -45,7 +45,9 @@ function _summarizeHelper(items, summaryFn, predicateFn, keys) {
         continue;
       }
     }
-    summarized[key] = summaryFn(key)(items);
+    summarized[key] = summaryFn(key)(
+      items
+    );
   }
   return [summarized];
 }

package/dist/es/summarize.js.map

@@ -1 +1 @@
-{"version":3,"file":"summarize.js","sources":["../../src/summarize.ts"],"sourcesContent":["import { A } from 'ts-toolbelt';\nimport { singleOrArray } from './helpers/singleOrArray';\nimport { Key, TidyFn, Vector } from './types';\n\nexport type SummarizeSpec<T> = Record<Key, (items: T[]) => any>;\n\nexport interface SummarizeOptions<T = any> {\n  rest?: (key: keyof T) => (items: T[]) => any;\n}\n\ntype SummarizedT<\n  T extends object,\n  SumSpec extends SummarizeSpec<T>,\n  Options extends SummarizeOptions<T> | undefined\n> = {\n  // summarized values map to return type of the spec functions\n  [K in keyof SumSpec]: ReturnType<SumSpec[K]>;\n} & // if there is a 'rest' option, add in the other values from T\n  (NonNullable<Options>['rest'] extends Function\n    ? Exclude<T, keyof SumSpec>\n    : void);\n\n/**\n * summarizes items\n */\nexport function summarize<\n  T extends object,\n  SummarizedSpec extends SummarizeSpec<T> = SummarizeSpec<T>,\n  Options extends SummarizeOptions<T> = SummarizeOptions<T>\n>(\n  summarizeSpec: SummarizedSpec,\n  options?: Options\n): TidyFn<T, A.Compute<SummarizedT<T, SummarizedSpec, Options>>> {\n  type Output = SummarizedT<T, SummarizedSpec, Options>;\n\n  const _summarize: TidyFn<T, A.Compute<Output>> = (\n    items: T[]\n  ): A.Compute<Output>[] => {\n    options = options ?? ({} as Options);\n\n    // reduce but use a loop to be more readable\n    const summarized = {} as Output;\n    const keys = Object.keys(summarizeSpec) as (keyof SummarizedSpec)[];\n\n    for (const key of keys) {\n      summarized[key as keyof Output] = summarizeSpec[key](items);\n    }\n\n    // if we a function to apply to the rest of the keys is supplied, use it\n    // TODO: improve types for rest\n    if (options.rest && items.length) {\n      const objectKeys = Object.keys(items[0]) as (keyof T)[];\n      for (const objKey of objectKeys) {\n        if (keys.includes(objKey as any)) {\n          continue;\n        }\n\n        (summarized as any)[objKey] = options.rest(objKey)(items);\n      }\n    }\n\n    return [summarized] as A.Compute<Output>[];\n  };\n\n  return _summarize;\n}\n\n/*-------- summarize helpers ----------------------------------------*/\n\nexport type SummaryKeyFn<T, K = keyof T> = (key: K) => (items: T[]) => any;\n\nfunction _summarizeHelper<\n  T extends object,\n  SummarizedT extends object = { [K in keyof T]: any }\n>(\n  items: T[],\n  summaryFn: SummaryKeyFn<T>,\n  predicateFn?: (vector: Vector<T>) => boolean,\n  keys?: Array<keyof T | ((items: T[]) => (keyof T)[])>\n): SummarizedT[] {\n  if (!items.length) return [];\n\n  // reduce but use a loop to be more readable\n  const summarized = {} as SummarizedT;\n\n  // read in keys from first object if not provided\n  let keysArr: (keyof T)[];\n  if (keys == null) {\n    keysArr = Object.keys(items[0]) as (keyof T)[];\n  } else {\n    // expand them all to a flat list of keys\n    keysArr = [];\n    for (const keyInput of singleOrArray(keys as any)) {\n      if (typeof keyInput === 'function') {\n        keysArr.push(...(keyInput(items) as (keyof T)[]));\n      } else {\n        keysArr.push(keyInput);\n      }\n    }\n  }\n\n  for (const key of keysArr) {\n    if (predicateFn) {\n      // inefficient to compute this vector here, wonder if it should\n      // be computed prior to this func being called somehow? (TODO)\n      const vector = items.map((d) => d[key]);\n      if (!predicateFn(vector)) {\n        continue;\n      }\n    }\n    summarized[(key as unknown) as keyof SummarizedT] = summaryFn(key)(\n      items\n    ) as any;\n  }\n\n  return [summarized];\n}\n\n/*---- summarizeAll() --------------------------------------------*/\n\ntype SummaryFnOutput<T extends object, F extends SummaryKeyFn<T>> = ReturnType<\n  ReturnType<F>\n>;\n\nexport function summarizeAll<T extends object, F extends SummaryKeyFn<T>>(\n  summaryFn: F\n): TidyFn<T, A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>> {\n  const _summarizeAll: TidyFn<\n    T,\n    A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>\n  > = (items: T[]): A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn);\n\n  return _summarizeAll;\n}\n\n/*---- summarizeIf() --------------------------------------------*/\n// type is not perfect since it returns all keys of T, but better to have more than less I figure\nexport function summarizeIf<T extends object, F extends SummaryKeyFn<T>>(\n  predicateFn: (vector: Vector<T>) => boolean,\n  summaryFn: F\n): TidyFn<T, A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>> {\n  const _summarizeIf: TidyFn<\n    T,\n    A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>\n  > = (items: T[]): A.Compute<Record<keyof T, SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn, predicateFn);\n\n  return _summarizeIf;\n}\n\n/*---- summarizeAt() --------------------------------------------*/\nexport function summarizeAt<\n  T extends object,\n  Keys extends (keyof T)[],\n  F extends SummaryKeyFn<T, Keys[number]>\n>(\n  keys: Keys,\n  summaryFn: F\n): TidyFn<T, A.Compute<Record<Keys[number], SummaryFnOutput<T, F>>>> {\n  const _summarizeAt: TidyFn<\n    T,\n    A.Compute<Record<Keys[number], SummaryFnOutput<T, F>>>\n  > = (items: T[]): A.Compute<Record<Keys[number], SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn, undefined, keys);\n\n  return _summarizeAt;\n}\n"],"names":[],"mappings":";;mBA8BE,eACA;AAIA,QAAM,aAA2C,CAC/C;AAEA,cAAU,4BAAY;AAGtB,UAAM,aAAa;AACnB,UAAM,OAAO,OAAO,KAAK;AAEzB,eAAW,OAAO;AAChB,iBAAW,OAAuB,cAAc,KAAK;AAAA;AAKvD,QAAI,QAAQ,QAAQ,MAAM;AACxB,YAAM,aAAa,OAAO,KAAK,MAAM;AACrC,iBAAW,UAAU;AACnB,YAAI,KAAK,SAAS;AAChB;AAAA;AAGF,QAAC,WAAmB,UAAU,QAAQ,KAAK,QAAQ;AAAA;AAAA;AAIvD,WAAO,CAAC;AAAA;AAGV,SAAO;AAAA;AAOT,0BAIE,OACA,WACA,aACA;AAEA,MAAI,CAAC,MAAM;AAAQ,WAAO;AAG1B,QAAM,aAAa;AAGnB,MAAI;AACJ,MAAI,QAAQ;AACV,cAAU,OAAO,KAAK,MAAM;AAAA;AAG5B,cAAU;AACV,eAAW,YAAY,cAAc;AACnC,UAAI,OAAO,aAAa;AACtB,gBAAQ,KAAK,GAAI,SAAS;AAAA;AAE1B,gBAAQ,KAAK;AAAA;AAAA;AAAA;AAKnB,aAAW,OAAO;AAChB,QAAI;AAGF,YAAM,SAAS,MAAM,IAAI,CAAC,MAAM,EAAE;AAClC,UAAI,CAAC,YAAY;AACf;AAAA;AAAA;AAGJ,eAAY,OAAwC,UAAU,KAC5D;AAAA;AAIJ,SAAO,CAAC;AAAA;sBAUR;AAEA,QAAM,gBAGF,CAAC,UACH,iBAAiB,OAAO;AAE1B,SAAO;AAAA;qBAMP,aACA;AAEA,QAAM,eAGF,CAAC,UACH,iBAAiB,OAAO,WAAW;AAErC,SAAO;AAAA;qBASP,MACA;AAEA,QAAM,eAGF,CAAC,UACH,iBAAiB,OAAO,WAAW,QAAW;AAEhD,SAAO;AAAA;;;;"}
+{"version":3,"file":"summarize.js","sources":["../../src/summarize.ts"],"sourcesContent":["import { Prettify } from './type-utils';\nimport { singleOrArray } from './helpers/singleOrArray';\nimport { Key, TidyFn, Vector } from './types';\n\nexport type SummarizeSpec<T> = Record<Key, (items: T[]) => any>;\n\nexport interface SummarizeOptions<T = any> {\n  rest?: (key: keyof T) => (items: T[]) => any;\n}\n\ntype SummarizedT<\n  T extends object,\n  SumSpec extends SummarizeSpec<T>,\n  Options extends SummarizeOptions<T> | undefined\n> = {\n  [K in keyof SumSpec]: ReturnType<SumSpec[K]>;\n} & (NonNullable<Options>['rest'] extends Function\n  ? Omit<T, keyof SumSpec>\n  : {});\n\n/**\n * summarizes items\n */\nexport function summarize<\n  T extends object,\n  SummarizedSpec extends SummarizeSpec<T> = SummarizeSpec<T>,\n  Options extends SummarizeOptions<T> = SummarizeOptions<T>\n>(\n  summarizeSpec: SummarizedSpec,\n  options?: Options\n): TidyFn<T, Prettify<SummarizedT<T, SummarizedSpec, Options>>> {\n  type Output = SummarizedT<T, SummarizedSpec, Options>;\n\n  const _summarize: TidyFn<T, Prettify<Output>> = (\n    items: T[]\n  ): Prettify<Output>[] => {\n    options = options ?? ({} as Options);\n\n    // reduce but use a loop to be more readable\n    const summarized = {} as Output;\n    const keys = Object.keys(summarizeSpec) as (keyof SummarizedSpec)[];\n\n    for (const key of keys) {\n      summarized[key as keyof Output] = summarizeSpec[key](items);\n    }\n\n    // if we a function to apply to the rest of the keys is supplied, use it\n    // TODO: improve types for rest\n    if (options.rest && items.length) {\n      const keysSet = new Set<string | number | symbol>(keys);\n      const objectKeys = Object.keys(items[0]) as (keyof T)[];\n      for (const objKey of objectKeys) {\n        if (keysSet.has(objKey as any)) {\n          continue;\n        }\n\n        (summarized as any)[objKey] = options.rest(objKey)(items);\n      }\n    }\n\n    return [summarized] as Prettify<Output>[];\n  };\n\n  return _summarize;\n}\n\n/*-------- summarize helpers ----------------------------------------*/\n\nexport type SummaryKeyFn<T, K = keyof T> = (key: K) => (items: T[]) => any;\n\nfunction _summarizeHelper<\n  T extends object,\n  SummarizedT extends object = { [K in keyof T]: any }\n>(\n  items: T[],\n  summaryFn: SummaryKeyFn<T>,\n  predicateFn?: (vector: Vector<T>) => boolean,\n  keys?: Array<keyof T | ((items: T[]) => (keyof T)[])>\n): SummarizedT[] {\n  if (!items.length) return [];\n\n  // reduce but use a loop to be more readable\n  const summarized = {} as SummarizedT;\n\n  // read in keys from first object if not provided\n  let keysArr: (keyof T)[];\n  if (keys == null) {\n    keysArr = Object.keys(items[0]) as (keyof T)[];\n  } else {\n    // expand them all to a flat list of keys\n    keysArr = [];\n    for (const keyInput of singleOrArray(keys as any)) {\n      if (typeof keyInput === 'function') {\n        keysArr.push(...(keyInput(items) as (keyof T)[]));\n      } else {\n        keysArr.push(keyInput);\n      }\n    }\n  }\n\n  for (const key of keysArr) {\n    if (predicateFn) {\n      // inefficient to compute this vector here, wonder if it should\n      // be computed prior to this func being called somehow? (TODO)\n      const vector = items.map((d) => d[key]);\n      if (!predicateFn(vector)) {\n        continue;\n      }\n    }\n    summarized[key as unknown as keyof SummarizedT] = summaryFn(key)(\n      items\n    ) as any;\n  }\n\n  return [summarized];\n}\n\n/*---- summarizeAll() --------------------------------------------*/\n\ntype SummaryFnOutput<T extends object, F extends SummaryKeyFn<T>> = ReturnType<\n  ReturnType<F>\n>;\n\nexport function summarizeAll<T extends object, F extends SummaryKeyFn<T>>(\n  summaryFn: F\n): TidyFn<T, Prettify<Record<keyof T, SummaryFnOutput<T, F>>>> {\n  const _summarizeAll: TidyFn<\n    T,\n    Prettify<Record<keyof T, SummaryFnOutput<T, F>>>\n  > = (items: T[]): Prettify<Record<keyof T, SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn);\n\n  return _summarizeAll;\n}\n\n/*---- summarizeIf() --------------------------------------------*/\n// type is not perfect since it returns all keys of T, but better to have more than less I figure\nexport function summarizeIf<T extends object, F extends SummaryKeyFn<T>>(\n  predicateFn: (vector: Vector<T>) => boolean,\n  summaryFn: F\n): TidyFn<T, Prettify<Record<keyof T, SummaryFnOutput<T, F>>>> {\n  const _summarizeIf: TidyFn<\n    T,\n    Prettify<Record<keyof T, SummaryFnOutput<T, F>>>\n  > = (items: T[]): Prettify<Record<keyof T, SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn, predicateFn);\n\n  return _summarizeIf;\n}\n\n/*---- summarizeAt() --------------------------------------------*/\nexport function summarizeAt<\n  T extends object,\n  Keys extends (keyof T)[],\n  F extends SummaryKeyFn<T, Keys[number]>\n>(\n  keys: Keys,\n  summaryFn: F\n): TidyFn<T, Prettify<Record<Keys[number], SummaryFnOutput<T, F>>>> {\n  const _summarizeAt: TidyFn<\n    T,\n    Prettify<Record<Keys[number], SummaryFnOutput<T, F>>>\n  > = (items: T[]): Prettify<Record<Keys[number], SummaryFnOutput<T, F>>>[] =>\n    _summarizeHelper(items, summaryFn, undefined, keys);\n\n  return _summarizeAt;\n}\n"],"names":[],"mappings":";;AAuBgB,SAAA,SAAA,CAKd,eACA,OAC8D,EAAA;AAG9D,EAAM,MAAA,UAAA,GAA0C,CAC9C,KACuB,KAAA;AACvB,IAAA,OAAA,GAAU,4BAAY,EAAC,CAAA;AAGvB,IAAA,MAAM,aAAa,EAAC,CAAA;AACpB,IAAM,MAAA,IAAA,GAAO,MAAO,CAAA,IAAA,CAAK,aAAa,CAAA,CAAA;AAEtC,IAAA,KAAA,MAAW,OAAO,IAAM,EAAA;AACtB,MAAA,UAAA,CAAW,GAAmB,CAAA,GAAI,aAAc,CAAA,GAAG,EAAE,KAAK,CAAA,CAAA;AAAA,KAC5D;AAIA,IAAI,IAAA,OAAA,CAAQ,IAAQ,IAAA,KAAA,CAAM,MAAQ,EAAA;AAChC,MAAM,MAAA,OAAA,GAAU,IAAI,GAAA,CAA8B,IAAI,CAAA,CAAA;AACtD,MAAA,MAAM,UAAa,GAAA,MAAA,CAAO,IAAK,CAAA,KAAA,CAAM,CAAC,CAAC,CAAA,CAAA;AACvC,MAAA,KAAA,MAAW,UAAU,UAAY,EAAA;AAC/B,QAAI,IAAA,OAAA,CAAQ,GAAI,CAAA,MAAa,CAAG,EAAA;AAC9B,UAAA,SAAA;AAAA,SACF;AAEA,QAAC,WAAmB,MAAM,CAAA,GAAI,QAAQ,IAAK,CAAA,MAAM,EAAE,KAAK,CAAA,CAAA;AAAA,OAC1D;AAAA,KACF;AAEA,IAAA,OAAO,CAAC,UAAU,CAAA,CAAA;AAAA,GACpB,CAAA;AAEA,EAAO,OAAA,UAAA,CAAA;AACT,CAAA;AAMA,SAAS,gBAIP,CAAA,KAAA,EACA,SACA,EAAA,WAAA,EACA,IACe,EAAA;AACf,EAAA,IAAI,CAAC,KAAA,CAAM,MAAQ,EAAA,OAAO,EAAC,CAAA;AAG3B,EAAA,MAAM,aAAa,EAAC,CAAA;AAGpB,EAAI,IAAA,OAAA,CAAA;AACJ,EAAA,IAAI,QAAQ,IAAM,EAAA;AAChB,IAAA,OAAA,GAAU,MAAO,CAAA,IAAA,CAAK,KAAM,CAAA,CAAC,CAAC,CAAA,CAAA;AAAA,GACzB,MAAA;AAEL,IAAA,OAAA,GAAU,EAAC,CAAA;AACX,IAAW,KAAA,MAAA,QAAA,IAAY,aAAc,CAAA,IAAW,CAAG,EAAA;AACjD,MAAI,IAAA,OAAO,aAAa,UAAY,EAAA;AAClC,QAAA,OAAA,CAAQ,IAAK,CAAA,GAAI,QAAS,CAAA,KAAK,CAAiB,CAAA,CAAA;AAAA,OAC3C,MAAA;AACL,QAAA,OAAA,CAAQ,KAAK,QAAQ,CAAA,CAAA;AAAA,OACvB;AAAA,KACF;AAAA,GACF;AAEA,EAAA,KAAA,MAAW,OAAO,OAAS,EAAA;AACzB,IAAA,IAAI,WAAa,EAAA;AAGf,MAAA,MAAM,SAAS,KAAM,CAAA,GAAA,CAAI,CAAC,CAAM,KAAA,CAAA,CAAE,GAAG,CAAC,CAAA,CAAA;AACtC,MAAI,IAAA,CAAC,WAAY,CAAA,MAAM,CAAG,EAAA;AACxB,QAAA,SAAA;AAAA,OACF;AAAA,KACF;AACA,IAAW,UAAA,CAAA,GAAmC,CAAI,GAAA,SAAA,CAAU,GAAG,CAAA;AAAA,MAC7D,KAAA;AAAA,KACF,CAAA;AAAA,GACF;AAEA,EAAA,OAAO,CAAC,UAAU,CAAA,CAAA;AACpB,CAAA;AAQO,SAAS,aACd,SAC6D,EAAA;AAC7D,EAAA,MAAM,aAGF,GAAA,CAAC,KACH,KAAA,gBAAA,CAAiB,OAAO,SAAS,CAAA,CAAA;AAEnC,EAAO,OAAA,aAAA,CAAA;AACT,CAAA;AAIgB,SAAA,WAAA,CACd,aACA,SAC6D,EAAA;AAC7D,EAAA,MAAM,eAGF,CAAC,KAAA,KACH,gBAAiB,CAAA,KAAA,EAAO,WAAW,WAAW,CAAA,CAAA;AAEhD,EAAO,OAAA,YAAA,CAAA;AACT,CAAA;AAGgB,SAAA,WAAA,CAKd,MACA,SACkE,EAAA;AAClE,EAAA,MAAM,eAGF,CAAC,KAAA,KACH,iBAAiB,KAAO,EAAA,SAAA,EAAW,QAAW,IAAI,CAAA,CAAA;AAEpD,EAAO,OAAA,YAAA,CAAA;AACT;;;;"}

package/dist/es/summary/deviation.js.map

@@ -1 +1 @@
-{"version":3,"file":"deviation.js","sources":["../../../src/summary/deviation.ts"],"sourcesContent":["import { deviation as d3deviation } from 'd3-array';\n\n/**\n * Returns a function that computes the deviation over an array of items\n * @param key A string key of the object or an accessor converting the object to a number\n */\nexport function deviation<T extends object>(\n  key: keyof T | ((d: T, index: number, array: Iterable<T>) => number)\n) {\n  const keyFn =\n    typeof key === 'function' ? key : (d: T) => (d[key] as unknown) as number;\n\n  return (items: T[]) => d3deviation(items, keyFn);\n}\n"],"names":["d3deviation"],"mappings":";;mBAOE;AAEA,QAAM,QACJ,OAAO,QAAQ,aAAa,MAAM,CAAC,MAAU,EAAE;AAEjD,SAAO,CAAC,UAAeA,YAAY,OAAO;AAAA;;;;"}
+{"version":3,"file":"deviation.js","sources":["../../../src/summary/deviation.ts"],"sourcesContent":["import { deviation as d3deviation } from 'd3-array';\n\n/**\n * Returns a function that computes the deviation over an array of items\n * @param key A string key of the object or an accessor converting the object to a number\n */\nexport function deviation<T extends object>(\n  key: keyof T | ((d: T, index: number, array: Iterable<T>) => number)\n) {\n  const keyFn =\n    typeof key === 'function' ? key : (d: T) => d[key] as unknown as number;\n\n  return (items: T[]) => d3deviation(items, keyFn);\n}\n"],"names":["d3deviation"],"mappings":";;AAMO,SAAS,UACd,GACA,EAAA;AACA,EAAM,MAAA,KAAA,GACJ,OAAO,GAAQ,KAAA,UAAA,GAAa,MAAM,CAAC,CAAA,KAAS,EAAE,GAAG,CAAA,CAAA;AAEnD,EAAA,OAAO,CAAC,KAAA,KAAeA,WAAY,CAAA,KAAA,EAAO,KAAK,CAAA,CAAA;AACjD;;;;"}

package/dist/es/summary/first.js.map

@@ -1 +1 @@
-{"version":3,"file":"first.js","sources":["../../../src/summary/first.ts"],"sourcesContent":["/**\n * Returns a function that returns the first value for the specified key\n * @param key A string key of the object or an accessor converting the object to a number\n */\nexport function first<T extends object>(key: keyof T | ((d: T) => any)) {\n  const keyFn = typeof key === 'function' ? key : (d: T) => d[key];\n\n  return (items: T[]) => (items.length ? keyFn(items[0]) : undefined);\n}\n"],"names":[],"mappings":"eAIwC;AACtC,QAAM,QAAQ,OAAO,QAAQ,aAAa,MAAM,CAAC,MAAS,EAAE;AAE5D,SAAO,CAAC,UAAgB,MAAM,SAAS,MAAM,MAAM,MAAM;AAAA;;;;"}
+{"version":3,"file":"first.js","sources":["../../../src/summary/first.ts"],"sourcesContent":["/**\n * Returns a function that returns the first value for the specified key\n * @param key A string key of the object or an accessor converting the object to a number\n */\nexport function first<T extends object>(key: keyof T | ((d: T) => any)) {\n  const keyFn = typeof key === 'function' ? key : (d: T) => d[key];\n\n  return (items: T[]) => (items.length ? keyFn(items[0]) : undefined);\n}\n"],"names":[],"mappings":"AAIO,SAAS,MAAwB,GAAgC,EAAA;AACtE,EAAM,MAAA,KAAA,GAAQ,OAAO,GAAQ,KAAA,UAAA,GAAa,MAAM,CAAC,CAAA,KAAS,EAAE,GAAG,CAAA,CAAA;AAE/D,EAAO,OAAA,CAAC,UAAgB,KAAM,CAAA,MAAA,GAAS,MAAM,KAAM,CAAA,CAAC,CAAC,CAAI,GAAA,KAAA,CAAA,CAAA;AAC3D;;;;"}