@unovis/ts 1.1.1-beta.7 → 1.1.1-beta.8

package/utils/data.js

@@ -0,0 +1,274 @@
+import { mean, min, max, bisector } from 'd3-array';
+import { throttle as throttle$1 } from 'throttle-debounce';
+
+const isNumber = (a) => typeof a === 'number';
+const isFunction = (a) => typeof a === 'function';
+const isUndefined = (a) => a === undefined;
+const isNil = (a) => a == null;
+const isString = (a) => typeof a === 'string';
+const isArray = (a) => Array.isArray(a);
+const isObject = (a) => (a instanceof Object);
+const isAClassInstance = (a) => a.constructor.name !== 'Function' && a.constructor.name !== 'Object';
+const isPlainObject = (a) => isObject(a) && !isArray(a) && !isFunction(a) && !isAClassInstance(a);
+const isEmpty = (obj) => {
+    return [Object, Array].includes((obj || {}).constructor) &&
+        !Object.entries((obj || {})).length;
+};
+// Based on https://github.com/maplibre/maplibre-gl-js/blob/e78ad7944ef768e67416daa4af86b0464bd0f617/src/style-spec/util/deep_equal.ts, 3-Clause BSD license
+const isEqual = (a, b, visited = new Set()) => {
+    if (Array.isArray(a)) {
+        if (!Array.isArray(b) || a.length !== b.length)
+            return false;
+        if (visited.has(a))
+            return true;
+        else
+            visited.add(a);
+        for (let i = 0; i < a.length; i++) {
+            if (!isEqual(a[i], b[i], visited))
+                return false;
+        }
+        return true;
+    }
+    if (typeof a === 'object' && a !== null && b !== null) {
+        if (!(typeof b === 'object'))
+            return false;
+        if (a === b)
+            return true;
+        const keys = Object.keys(a);
+        if (keys.length !== Object.keys(b).length)
+            return false;
+        if (visited.has(a))
+            return true;
+        else
+            visited.add(a);
+        for (const key in a) {
+            if (!isEqual(a[key], b[key], visited))
+                return false;
+        }
+        return true;
+    }
+    return a === b;
+};
+const without = (arr, ...args) => arr.filter(item => !args.includes(item));
+const flatten = (arr) => arr.flat();
+const cloneDeep = (obj, stack = new Map()) => {
+    if (typeof obj !== 'object' || obj === null) {
+        return obj;
+    }
+    if (obj instanceof Date) {
+        return new Date(obj.getTime());
+    }
+    if (obj instanceof Array) {
+        const clone = [];
+        stack.set(obj, clone);
+        for (const item of obj) {
+            clone.push(stack.has(item) ? stack.get(item) : cloneDeep(item, stack));
+        }
+        return clone;
+    }
+    // Class instances will be copied without cloning
+    if (isAClassInstance(obj)) {
+        const clone = obj;
+        return clone;
+    }
+    if (obj instanceof Object) {
+        const clone = {};
+        stack.set(obj, clone);
+        const objAsRecord = obj;
+        Object.keys(obj)
+            .reduce((newObj, key) => {
+            newObj[key] = stack.has(objAsRecord[key]) ? stack.get(objAsRecord[key]) : cloneDeep(objAsRecord[key], stack);
+            return newObj;
+        }, clone);
+        return clone;
+    }
+    return obj;
+};
+const merge = (obj1, obj2, visited = new Map()) => {
+    if (!obj1 || !obj2)
+        return obj1;
+    if (obj1 === obj2)
+        return obj1;
+    const newObj = (isAClassInstance(obj1) ? obj1 : cloneDeep(obj1));
+    // Taking care of recursive structures
+    if (visited.has(obj2))
+        return visited.get(obj2);
+    else
+        visited.set(obj2, newObj);
+    Object.keys(obj2).forEach(key => {
+        if (isPlainObject(obj1[key]) && isPlainObject(obj2[key])) {
+            newObj[key] = merge(obj1[key], obj2[key], visited);
+        }
+        else if (isAClassInstance(obj2)) {
+            newObj[key] = obj2;
+        }
+        else {
+            newObj[key] = cloneDeep(obj2[key]);
+        }
+    });
+    return newObj;
+};
+const omit = (obj, props) => {
+    obj = Object.assign({}, obj);
+    props.forEach(prop => delete obj[prop]);
+    return obj;
+};
+const groupBy = (arr, accessor) => {
+    return arr.reduce((grouped, v, i, a, k = accessor(v)) => (((grouped[k] || (grouped[k] = [])).push(v), grouped)), {});
+};
+const sortBy = (arr, accessor) => {
+    return arr.concat() // The native sort method modifies the array in place. We use `.concat()` to copy the array first
+        .sort((a, b) => {
+        return (accessor(a) > accessor(b)) ? 1 : ((accessor(b) > accessor(a)) ? -1 : 0);
+    });
+};
+const throttle = (f, delay, options) => throttle$1(delay, f, options);
+function getValue(d, accessor, index) {
+    // eslint-disable-next-line @typescript-eslint/ban-types
+    if (isFunction(accessor))
+        return accessor(d, index);
+    else
+        return accessor;
+}
+function getString(d, accessor, i) {
+    return getValue(d, accessor, i);
+}
+function getNumber(d, accessor, i) {
+    return getValue(d, accessor, i);
+}
+function getBoolean(d, accessor, i) {
+    return getValue(d, accessor, i);
+}
+function clean(data) {
+    return data.filter(d => d && !isNumber(d));
+}
+function clamp(d, min, max) {
+    return Math.min(Math.max(d, min), max);
+}
+function unique(array) {
+    return Array.from(new Set(array));
+}
+function countUnique(array, accessor = d => d) {
+    return new Set(array.map(d => accessor(d))).size;
+}
+function arrayOfIndices(n) {
+    return [...Array(n).keys()];
+}
+function shallowDiff(o1 = {}, o2 = {}) {
+    return Object.keys(o2).reduce((diff, key) => {
+        if (o1[key] === o2[key])
+            return diff;
+        return Object.assign(Object.assign({}, diff), { [key]: o2[key] });
+    }, {});
+}
+function getStackedExtent(data, ...acs) {
+    if (!data)
+        return [undefined, undefined];
+    if (isArray(acs)) {
+        let minValue = 0;
+        let maxValue = 0;
+        data.forEach((d, i) => {
+            let positiveStack = 0;
+            let negativeStack = 0;
+            for (const a of acs) {
+                const value = getNumber(d, a, i) || 0;
+                if (value >= 0)
+                    positiveStack += value;
+                else
+                    negativeStack += value;
+            }
+            if (positiveStack > maxValue)
+                maxValue = positiveStack;
+            if (negativeStack < minValue)
+                minValue = negativeStack;
+        });
+        return [minValue, maxValue];
+    }
+}
+function getStackedValues(d, index, ...acs) {
+    const values = [];
+    let positiveStack = 0;
+    let negativeStack = 0;
+    for (const a of acs) {
+        const value = getNumber(d, a, index) || 0;
+        if (value >= 0) {
+            values.push(positiveStack += value);
+        }
+        else {
+            values.push(negativeStack += value);
+        }
+    }
+    return values;
+}
+function getStackedData(data, baseline, acs, prevNegative // to help guessing the stack direction (positive/negative) when the values are 0 or null
+) {
+    const baselineValues = data.map((d, i) => getNumber(d, baseline, i) || 0);
+    const isNegativeStack = acs.map((a, j) => {
+        const average = mean(data, (d, i) => getNumber(d, a, i) || 0);
+        return (average === 0 && Array.isArray(prevNegative)) ? prevNegative[j] : average < 0;
+    });
+    const stackedData = acs.map(() => []);
+    data.forEach((d, i) => {
+        let positiveStack = baselineValues[i];
+        let negativeStack = baselineValues[i];
+        acs.forEach((a, j) => {
+            const value = getNumber(d, a, i) || 0;
+            if (!isNegativeStack[j]) {
+                stackedData[j].push([positiveStack, positiveStack += value]);
+            }
+            else {
+                stackedData[j].push([negativeStack, negativeStack += value]);
+            }
+        });
+    });
+    // Fill in additional stack information
+    stackedData.forEach((stack, i) => {
+        stack.negative = isNegativeStack[i];
+    });
+    stackedData.filter(s => s.negative)
+        .forEach((s, i, arr) => {
+        s.ending = i === arr.length - 1;
+    });
+    stackedData.filter(s => !s.negative)
+        .forEach((s, i, arr) => {
+        s.ending = i === arr.length - 1;
+    });
+    return stackedData;
+}
+function getMin(data, ...acs) {
+    if (!data)
+        return undefined;
+    const minValue = min(data, (d, i) => min(acs, a => getNumber(d, a, i)));
+    return minValue;
+}
+function getMax(data, ...acs) {
+    if (!data)
+        return undefined;
+    const maxValue = max(data, (d, i) => max(acs, a => getNumber(d, a, i)));
+    return maxValue;
+}
+function getExtent(data, ...acs) {
+    return [getMin(data, ...acs), getMax(data, ...acs)];
+}
+function getNearest(data, value, accessor) {
+    if (data.length <= 1)
+        return data[0];
+    const values = data.map((d, i) => getNumber(d, accessor, i));
+    values.sort((a, b) => a - b);
+    const xBisector = bisector(d => d).left;
+    const index = xBisector(values, value, 1, data.length - 1);
+    return value - values[index - 1] > values[index] - value ? data[index] : data[index - 1];
+}
+function filterDataByRange(data, range, accessor) {
+    const filteredData = data.filter((d, i) => {
+        const value = getNumber(d, accessor, i);
+        return (value >= range[0]) && (value < range[1]);
+    });
+    return filteredData;
+}
+function isNumberWithinRange(value, range) {
+    return (value >= range[0]) && (value <= range[1]);
+}
+
+export { arrayOfIndices, clamp, clean, cloneDeep, countUnique, filterDataByRange, flatten, getBoolean, getExtent, getMax, getMin, getNearest, getNumber, getStackedData, getStackedExtent, getStackedValues, getString, getValue, groupBy, isAClassInstance, isArray, isEmpty, isEqual, isFunction, isNil, isNumber, isNumberWithinRange, isObject, isPlainObject, isString, isUndefined, merge, omit, shallowDiff, sortBy, throttle, unique, without };
+//# sourceMappingURL=data.js.map

package/utils/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sources":["../../src/utils/data.ts"],"sourcesContent":["import { max, min, mean, bisector } from 'd3-array'\nimport { throttle as _throttle } from 'throttle-debounce'\n\n// Types\nimport { NumericAccessor, StringAccessor, BooleanAccessor, ColorAccessor, GenericAccessor } from 'types/accessor'\nimport { StackValuesRecord } from 'types/data'\n\nexport const isNumber = <T>(a: T): boolean => typeof a === 'number'\nexport const isFunction = <T>(a: T): boolean => typeof a === 'function'\nexport const isUndefined = <T>(a: T): boolean => a === undefined\nexport const isNil = <T>(a: T): boolean => a == null\nexport const isString = <T>(a: T): boolean => typeof a === 'string'\nexport const isArray = <T>(a: T): boolean => Array.isArray(a)\nexport const isObject = <T>(a: T): boolean => (a instanceof Object)\nexport const isAClassInstance = <T>(a: T): boolean => a.constructor.name !== 'Function' && a.constructor.name !== 'Object'\nexport const isPlainObject = <T>(a: T): boolean => isObject(a) && !isArray(a) && !isFunction(a) && !isAClassInstance(a)\n\nexport const isEmpty = <T>(obj: T): boolean => {\n  return [Object, Array].includes((obj || {}).constructor as ArrayConstructor | ObjectConstructor) &&\n    !Object.entries((obj || {})).length\n}\n\n// Based on https://github.com/maplibre/maplibre-gl-js/blob/e78ad7944ef768e67416daa4af86b0464bd0f617/src/style-spec/util/deep_equal.ts, 3-Clause BSD license\nexport const isEqual = (a?: unknown | null, b?: unknown | null, visited: Set<any> = new Set()): boolean => {\n  if (Array.isArray(a)) {\n    if (!Array.isArray(b) || a.length !== b.length) return false\n\n    if (visited.has(a)) return true\n    else visited.add(a)\n\n    for (let i = 0; i < a.length; i++) {\n      if (!isEqual(a[i], b[i], visited)) return false\n    }\n\n    return true\n  }\n\n  if (typeof a === 'object' && a !== null && b !== null) {\n    if (!(typeof b === 'object')) return false\n    if (a === b) return true\n\n    const keys = Object.keys(a)\n    if (keys.length !== Object.keys(b).length) return false\n\n    if (visited.has(a)) return true\n    else visited.add(a)\n\n    for (const key in a) {\n      if (!isEqual(a[key], b[key], visited)) return false\n    }\n\n    return true\n  }\n\n  return a === b\n}\n\nexport const without = <T>(arr: Array<T>, ...args: T[]): Array<T> => arr.filter(item => !args.includes(item))\nexport const flatten = <T>(arr: Array<T | T[]>): Array<T> => arr.flat() as T[]\nexport const cloneDeep = <T>(obj: T, stack: Map<any, any> = new Map()): T => {\n  if (typeof obj !== 'object' || obj === null) {\n    return obj\n  }\n\n  if (obj instanceof Date) {\n    return new Date(obj.getTime()) as unknown as T\n  }\n\n  if (obj instanceof Array) {\n    const clone: unknown[] = []\n    stack.set(obj, clone)\n    for (const item of obj) {\n      clone.push(stack.has(item) ? stack.get(item) : cloneDeep(item, stack))\n    }\n    return clone as unknown as T\n  }\n\n  // Class instances will be copied without cloning\n  if (isAClassInstance(obj)) {\n    const clone = obj\n    return clone\n  }\n\n  if (obj instanceof Object) {\n    const clone = {} as T\n    stack.set(obj, clone)\n    const objAsRecord = obj as Record<string | number, unknown>\n    Object.keys(obj)\n      .reduce((newObj: typeof objAsRecord, key: string | number): typeof objAsRecord => {\n        newObj[key] = stack.has(objAsRecord[key]) ? stack.get(objAsRecord[key]) : cloneDeep(objAsRecord[key], stack)\n        return newObj\n      }, clone as typeof objAsRecord)\n\n    return clone\n  }\n\n  return obj\n}\n\n\nexport const merge = <T, K>(obj1: T, obj2: K, visited: Map<any, any> = new Map()): T & K => {\n  type Rec = Record<string | number, unknown>\n\n  if (!obj1 || !obj2) return obj1 as T & K\n  if ((obj1 as unknown) === (obj2 as unknown)) return obj1 as T & K\n\n  const newObj = (isAClassInstance(obj1 as Rec) ? obj1 : cloneDeep(obj1)) as T & K\n\n  // Taking care of recursive structures\n  if (visited.has(obj2)) return visited.get(obj2)\n  else visited.set(obj2, newObj)\n\n  Object.keys(obj2 as Rec).forEach(key => {\n    if (isPlainObject((obj1 as Rec)[key]) && isPlainObject((obj2 as Rec)[key])) {\n      (newObj as Rec)[key] = merge((obj1 as Rec)[key], (obj2 as Rec)[key], visited)\n    } else if (isAClassInstance(obj2 as Rec)) {\n      (newObj as Rec)[key] = obj2\n    } else {\n      (newObj as Rec)[key] = cloneDeep((obj2 as Rec)[key])\n    }\n  })\n\n  return newObj\n}\n\nexport const omit = <T extends Record<string | number | symbol, unknown>>(obj: T, props: Array<keyof T>): Partial<T> => {\n  obj = { ...obj }\n  props.forEach(prop => delete obj[prop])\n  return obj\n}\n\nexport const groupBy = <T extends Record<string | number, any>> (arr: T[], accessor: (a: T) => string | number): Record<string | number, T[]> => {\n  return arr.reduce(\n    (grouped, v, i, a, k = accessor(v)) => (((grouped[k] || (grouped[k] = [])).push(v), grouped)),\n    {} as Record<string | number, T[]>\n  )\n}\n\nexport const sortBy = <T>(arr: Array<T>, accessor: (a: T) => string | number): Array<T> => {\n  return arr.concat() // The native sort method modifies the array in place. We use `.concat()` to copy the array first\n    .sort((a, b): number => {\n      return (accessor(a) > accessor(b)) ? 1 : ((accessor(b) > accessor(a)) ? -1 : 0)\n    })\n}\n\nexport const throttle = <T extends (...args: any[]) => any>(\n  f: T,\n  delay: number,\n  options?: {\n    noTrailing?: boolean;\n    noLeading?: boolean;\n    debounceMode?: boolean;\n  }\n): _throttle<T> => _throttle(delay, f, options)\n\nexport function getValue<T, ReturnType> (\n  d: T,\n  accessor: NumericAccessor<T> | StringAccessor<T> | BooleanAccessor<T> | ColorAccessor<T> | GenericAccessor<ReturnType, T>,\n  index?: number\n): ReturnType {\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  if (isFunction(accessor)) return (accessor as Function)(d, index) as (ReturnType | null | undefined)\n  else return accessor as unknown as (ReturnType | null | undefined)\n}\n\nexport function getString<T> (d: T, accessor: StringAccessor<T>, i?: number): string | null | undefined {\n  return getValue<T, string>(d, accessor, i)\n}\n\nexport function getNumber<T> (d: T, accessor: NumericAccessor<T>, i?: number): number | null | undefined {\n  return getValue<T, number>(d, accessor, i)\n}\n\nexport function getBoolean<T> (d: T, accessor: BooleanAccessor<T>, i?: number): boolean | null | undefined {\n  return getValue<T, boolean>(d, accessor, i)\n}\n\nexport function clean<T> (data: T[]): T[] {\n  return data.filter(d => d && !isNumber(d))\n}\n\nexport function clamp (d: number, min: number, max: number): number {\n  return Math.min(Math.max(d, min), max)\n}\n\nexport function unique<T> (array: T[]): T[] {\n  return Array.from(new Set(array))\n}\n\nexport function countUnique<T> (array: T[], accessor = d => d): number {\n  return new Set(array.map(d => accessor(d))).size\n}\n\nexport function arrayOfIndices (n: number): number[] {\n  return [...Array(n).keys()]\n}\n\nexport function shallowDiff (o1: Record<string, unknown> = {}, o2: Record<string, unknown> = {}): Record<string, unknown> {\n  return Object.keys(o2).reduce((diff, key) => {\n    if (o1[key] === o2[key]) return diff\n    return {\n      ...diff,\n      [key]: o2[key],\n    }\n  }, {})\n}\n\nexport function getStackedExtent<Datum> (data: Datum[], ...acs: NumericAccessor<Datum>[]): (number | undefined)[] {\n  if (!data) return [undefined, undefined]\n  if (isArray(acs)) {\n    let minValue = 0\n    let maxValue = 0\n    data.forEach((d, i) => {\n      let positiveStack = 0\n      let negativeStack = 0\n      for (const a of acs as NumericAccessor<Datum>[]) {\n        const value = getNumber(d, a, i) || 0\n        if (value >= 0) positiveStack += value\n        else negativeStack += value\n      }\n\n      if (positiveStack > maxValue) maxValue = positiveStack\n      if (negativeStack < minValue) minValue = negativeStack\n    })\n    return [minValue, maxValue]\n  }\n}\n\nexport function getStackedValues<Datum> (d: Datum, index: number, ...acs: NumericAccessor<Datum>[]): (number | undefined)[] {\n  const values = []\n\n  let positiveStack = 0\n  let negativeStack = 0\n  for (const a of acs as NumericAccessor<Datum>[]) {\n    const value = getNumber(d, a, index) || 0\n    if (value >= 0) {\n      values.push(positiveStack += value)\n    } else {\n      values.push(negativeStack += value)\n    }\n  }\n\n  return values\n}\n\nexport function getStackedData<Datum> (\n  data: Datum[],\n  baseline: NumericAccessor<Datum>,\n  acs: NumericAccessor<Datum>[],\n  prevNegative?: boolean[] // to help guessing the stack direction (positive/negative) when the values are 0 or null\n): StackValuesRecord[] {\n  const baselineValues = data.map((d, i) => getNumber(d, baseline, i) || 0)\n  const isNegativeStack = acs.map((a, j) => {\n    const average = mean(data, (d, i) => getNumber(d, a, i) || 0)\n    return (average === 0 && Array.isArray(prevNegative)) ? prevNegative[j] : average < 0\n  })\n\n  const stackedData: StackValuesRecord[] = acs.map(() => [])\n  data.forEach((d, i) => {\n    let positiveStack = baselineValues[i]\n    let negativeStack = baselineValues[i]\n    acs.forEach((a, j) => {\n      const value = getNumber(d, a, i) || 0\n      if (!isNegativeStack[j]) {\n        stackedData[j].push([positiveStack, positiveStack += value])\n      } else {\n        stackedData[j].push([negativeStack, negativeStack += value])\n      }\n    })\n  })\n\n  // Fill in additional stack information\n  stackedData.forEach((stack, i) => {\n    stack.negative = isNegativeStack[i]\n  })\n\n  stackedData.filter(s => s.negative)\n    .forEach((s, i, arr) => {\n      s.ending = i === arr.length - 1\n    })\n\n  stackedData.filter(s => !s.negative)\n    .forEach((s, i, arr) => {\n      s.ending = i === arr.length - 1\n    })\n\n  return stackedData\n}\n\nexport function getMin<Datum> (data: Datum[], ...acs: NumericAccessor<Datum>[]): number | undefined {\n  if (!data) return undefined\n  const minValue = min(data, (d, i) => min(acs as NumericAccessor<Datum>[], a => getNumber(d, a, i)))\n  return minValue\n}\n\nexport function getMax<Datum> (data: Datum[], ...acs: NumericAccessor<Datum>[]): number | undefined {\n  if (!data) return undefined\n  const maxValue = max(data, (d, i) => max(acs as NumericAccessor<Datum>[], a => getNumber(d, a, i)))\n  return maxValue\n}\n\nexport function getExtent<Datum> (data: Datum[], ...acs: NumericAccessor<Datum>[]): (number | undefined)[] {\n  return [getMin(data, ...acs), getMax(data, ...acs)]\n}\n\nexport function getNearest<Datum> (data: Datum[], value: number, accessor: NumericAccessor<Datum>): Datum {\n  if (data.length <= 1) return data[0]\n\n  const values = data.map((d, i) => getNumber(d, accessor, i))\n  values.sort((a, b) => a - b)\n\n  const xBisector = bisector(d => d).left\n  const index = xBisector(values, value, 1, data.length - 1)\n  return value - values[index - 1] > values[index] - value ? data[index] : data[index - 1]\n}\n\nexport function filterDataByRange<Datum> (data: Datum[], range: [number, number], accessor: NumericAccessor<Datum>): Datum[] {\n  const filteredData = data.filter((d, i) => {\n    const value = getNumber(d, accessor, i)\n    return (value >= range[0]) && (value < range[1])\n  })\n\n  return filteredData\n}\n\nexport function isNumberWithinRange (value: number, range: [number, number]): boolean {\n  return (value >= range[0]) && (value <= range[1])\n}\n"],"names":["_throttle"],"mappings":";;;AAOO,MAAM,QAAQ,GAAG,CAAI,CAAI,KAAc,OAAO,CAAC,KAAK,SAAQ;AAC5D,MAAM,UAAU,GAAG,CAAI,CAAI,KAAc,OAAO,CAAC,KAAK,WAAU;AAChE,MAAM,WAAW,GAAG,CAAI,CAAI,KAAc,CAAC,KAAK,UAAS;AACzD,MAAM,KAAK,GAAG,CAAI,CAAI,KAAc,CAAC,IAAI,KAAI;AAC7C,MAAM,QAAQ,GAAG,CAAI,CAAI,KAAc,OAAO,CAAC,KAAK,SAAQ;AAC5D,MAAM,OAAO,GAAG,CAAI,CAAI,KAAc,KAAK,CAAC,OAAO,CAAC,CAAC,EAAC;AACtD,MAAM,QAAQ,GAAG,CAAI,CAAI,MAAe,CAAC,YAAY,MAAM,EAAC;AACtD,MAAA,gBAAgB,GAAG,CAAI,CAAI,KAAc,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,WAAW,CAAC,IAAI,KAAK,SAAQ;AACnH,MAAM,aAAa,GAAG,CAAI,CAAI,KAAc,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAC;AAE1G,MAAA,OAAO,GAAG,CAAI,GAAM,KAAa;AAC5C,IAAA,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,EAAE,EAAE,WAAmD,CAAC;AAC9F,QAAA,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC,MAAM,CAAA;AACvC,EAAC;AAED;AACO,MAAM,OAAO,GAAG,CAAC,CAAkB,EAAE,CAAkB,EAAE,OAAoB,GAAA,IAAI,GAAG,EAAE,KAAa;AACxG,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;AACpB,QAAA,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;AAAE,YAAA,OAAO,KAAK,CAAA;AAE5D,QAAA,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI,CAAA;;AAC1B,YAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAEnB,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACjC,YAAA,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC;AAAE,gBAAA,OAAO,KAAK,CAAA;AAChD,SAAA;AAED,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;AAED,IAAA,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,EAAE;AACrD,QAAA,IAAI,EAAE,OAAO,CAAC,KAAK,QAAQ,CAAC;AAAE,YAAA,OAAO,KAAK,CAAA;QAC1C,IAAI,CAAC,KAAK,CAAC;AAAE,YAAA,OAAO,IAAI,CAAA;QAExB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;AAAE,YAAA,OAAO,KAAK,CAAA;AAEvD,QAAA,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;AAAE,YAAA,OAAO,IAAI,CAAA;;AAC1B,YAAA,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAEnB,QAAA,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE;AACnB,YAAA,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC;AAAE,gBAAA,OAAO,KAAK,CAAA;AACpD,SAAA;AAED,QAAA,OAAO,IAAI,CAAA;AACZ,KAAA;IAED,OAAO,CAAC,KAAK,CAAC,CAAA;AAChB,EAAC;AAEM,MAAM,OAAO,GAAG,CAAI,GAAa,EAAE,GAAG,IAAS,KAAe,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAC;AACtG,MAAM,OAAO,GAAG,CAAI,GAAmB,KAAe,GAAG,CAAC,IAAI,GAAS;AACvE,MAAM,SAAS,GAAG,CAAI,GAAM,EAAE,KAAA,GAAuB,IAAI,GAAG,EAAE,KAAO;IAC1E,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE;AAC3C,QAAA,OAAO,GAAG,CAAA;AACX,KAAA;IAED,IAAI,GAAG,YAAY,IAAI,EAAE;QACvB,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAiB,CAAA;AAC/C,KAAA;IAED,IAAI,GAAG,YAAY,KAAK,EAAE;QACxB,MAAM,KAAK,GAAc,EAAE,CAAA;AAC3B,QAAA,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AACrB,QAAA,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE;AACtB,YAAA,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;AACvE,SAAA;AACD,QAAA,OAAO,KAAqB,CAAA;AAC7B,KAAA;;AAGD,IAAA,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE;QACzB,MAAM,KAAK,GAAG,GAAG,CAAA;AACjB,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;IAED,IAAI,GAAG,YAAY,MAAM,EAAE;QACzB,MAAM,KAAK,GAAG,EAAO,CAAA;AACrB,QAAA,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QACrB,MAAM,WAAW,GAAG,GAAuC,CAAA;AAC3D,QAAA,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;AACb,aAAA,MAAM,CAAC,CAAC,MAA0B,EAAE,GAAoB,KAAwB;AAC/E,YAAA,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;AAC5G,YAAA,OAAO,MAAM,CAAA;SACd,EAAE,KAA2B,CAAC,CAAA;AAEjC,QAAA,OAAO,KAAK,CAAA;AACb,KAAA;AAED,IAAA,OAAO,GAAG,CAAA;AACZ,EAAC;AAGM,MAAM,KAAK,GAAG,CAAO,IAAO,EAAE,IAAO,EAAE,OAAyB,GAAA,IAAI,GAAG,EAAE,KAAW;AAGzF,IAAA,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,IAAa,CAAA;IACxC,IAAK,IAAgB,KAAM,IAAgB;AAAE,QAAA,OAAO,IAAa,CAAA;AAEjE,IAAA,MAAM,MAAM,IAAI,gBAAgB,CAAC,IAAW,CAAC,GAAG,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAU,CAAA;;AAGhF,IAAA,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;AAAE,QAAA,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;;AAC1C,QAAA,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAE9B,MAAM,CAAC,IAAI,CAAC,IAAW,CAAC,CAAC,OAAO,CAAC,GAAG,IAAG;AACrC,QAAA,IAAI,aAAa,CAAE,IAAY,CAAC,GAAG,CAAC,CAAC,IAAI,aAAa,CAAE,IAAY,CAAC,GAAG,CAAC,CAAC,EAAE;AACzE,YAAA,MAAc,CAAC,GAAG,CAAC,GAAG,KAAK,CAAE,IAAY,CAAC,GAAG,CAAC,EAAG,IAAY,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAA;AAC9E,SAAA;AAAM,aAAA,IAAI,gBAAgB,CAAC,IAAW,CAAC,EAAE;AACvC,YAAA,MAAc,CAAC,GAAG,CAAC,GAAG,IAAI,CAAA;AAC5B,SAAA;AAAM,aAAA;YACJ,MAAc,CAAC,GAAG,CAAC,GAAG,SAAS,CAAE,IAAY,CAAC,GAAG,CAAC,CAAC,CAAA;AACrD,SAAA;AACH,KAAC,CAAC,CAAA;AAEF,IAAA,OAAO,MAAM,CAAA;AACf,EAAC;MAEY,IAAI,GAAG,CAAsD,GAAM,EAAE,KAAqB,KAAgB;IACrH,GAAG,GAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAQ,GAAG,CAAE,CAAA;AAChB,IAAA,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAA;AACvC,IAAA,OAAO,GAAG,CAAA;AACZ,EAAC;MAEY,OAAO,GAAG,CAA0C,GAAQ,EAAE,QAAmC,KAAkC;IAC9I,OAAO,GAAG,CAAC,MAAM,CACf,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAC7F,EAAkC,CACnC,CAAA;AACH,EAAC;MAEY,MAAM,GAAG,CAAI,GAAa,EAAE,QAAmC,KAAc;AACxF,IAAA,OAAO,GAAG,CAAC,MAAM,EAAE;AAChB,SAAA,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAY;AACrB,QAAA,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACjF,KAAC,CAAC,CAAA;AACN,EAAC;MAEY,QAAQ,GAAG,CACtB,CAAI,EACJ,KAAa,EACb,OAIC,KACgBA,UAAS,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAC;SAE/B,QAAQ,CACtB,CAAI,EACJ,QAAyH,EACzH,KAAc,EAAA;;IAGd,IAAI,UAAU,CAAC,QAAQ,CAAC;AAAE,QAAA,OAAQ,QAAqB,CAAC,CAAC,EAAE,KAAK,CAAoC,CAAA;;AAC/F,QAAA,OAAO,QAAsD,CAAA;AACpE,CAAC;SAEe,SAAS,CAAK,CAAI,EAAE,QAA2B,EAAE,CAAU,EAAA;IACzE,OAAO,QAAQ,CAAY,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;AAC5C,CAAC;SAEe,SAAS,CAAK,CAAI,EAAE,QAA4B,EAAE,CAAU,EAAA;IAC1E,OAAO,QAAQ,CAAY,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;AAC5C,CAAC;SAEe,UAAU,CAAK,CAAI,EAAE,QAA4B,EAAE,CAAU,EAAA;IAC3E,OAAO,QAAQ,CAAa,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;AAC7C,CAAC;AAEK,SAAU,KAAK,CAAK,IAAS,EAAA;AACjC,IAAA,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;AAC5C,CAAC;SAEe,KAAK,CAAE,CAAS,EAAE,GAAW,EAAE,GAAW,EAAA;AACxD,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;AACxC,CAAC;AAEK,SAAU,MAAM,CAAK,KAAU,EAAA;IACnC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;AACnC,CAAC;AAEK,SAAU,WAAW,CAAK,KAAU,EAAE,QAAQ,GAAG,CAAC,IAAI,CAAC,EAAA;AAC3D,IAAA,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;AAClD,CAAC;AAEK,SAAU,cAAc,CAAE,CAAS,EAAA;IACvC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;AAC7B,CAAC;SAEe,WAAW,CAAE,KAA8B,EAAE,EAAE,KAA8B,EAAE,EAAA;AAC7F,IAAA,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,GAAG,KAAI;QAC1C,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC;AAAE,YAAA,OAAO,IAAI,CAAA;QACpC,OACK,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAA,IAAI,CACP,EAAA,EAAA,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EACf,CAAA,CAAA;KACF,EAAE,EAAE,CAAC,CAAA;AACR,CAAC;SAEe,gBAAgB,CAAS,IAAa,EAAE,GAAG,GAA6B,EAAA;AACtF,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;AACxC,IAAA,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE;QAChB,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;YACpB,IAAI,aAAa,GAAG,CAAC,CAAA;YACrB,IAAI,aAAa,GAAG,CAAC,CAAA;AACrB,YAAA,KAAK,MAAM,CAAC,IAAI,GAA+B,EAAE;AAC/C,gBAAA,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;gBACrC,IAAI,KAAK,IAAI,CAAC;oBAAE,aAAa,IAAI,KAAK,CAAA;;oBACjC,aAAa,IAAI,KAAK,CAAA;AAC5B,aAAA;YAED,IAAI,aAAa,GAAG,QAAQ;gBAAE,QAAQ,GAAG,aAAa,CAAA;YACtD,IAAI,aAAa,GAAG,QAAQ;gBAAE,QAAQ,GAAG,aAAa,CAAA;AACxD,SAAC,CAAC,CAAA;AACF,QAAA,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;AAC5B,KAAA;AACH,CAAC;AAEK,SAAU,gBAAgB,CAAS,CAAQ,EAAE,KAAa,EAAE,GAAG,GAA6B,EAAA;IAChG,MAAM,MAAM,GAAG,EAAE,CAAA;IAEjB,IAAI,aAAa,GAAG,CAAC,CAAA;IACrB,IAAI,aAAa,GAAG,CAAC,CAAA;AACrB,IAAA,KAAK,MAAM,CAAC,IAAI,GAA+B,EAAE;AAC/C,QAAA,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAA;QACzC,IAAI,KAAK,IAAI,CAAC,EAAE;AACd,YAAA,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,CAAA;AACpC,SAAA;AAAM,aAAA;AACL,YAAA,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,CAAA;AACpC,SAAA;AACF,KAAA;AAED,IAAA,OAAO,MAAM,CAAA;AACf,CAAC;AAEK,SAAU,cAAc,CAC5B,IAAa,EACb,QAAgC,EAChC,GAA6B,EAC7B,YAAwB;;IAExB,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;IACzE,MAAM,eAAe,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC7D,OAAO,CAAC,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO,GAAG,CAAC,CAAA;AACvF,KAAC,CAAC,CAAA;IAEF,MAAM,WAAW,GAAwB,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;IAC1D,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AACpB,QAAA,IAAI,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAA;AACrC,QAAA,IAAI,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,CAAA;QACrC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AACnB,YAAA,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAA;AACrC,YAAA,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE;AACvB,gBAAA,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,aAAa,IAAI,KAAK,CAAC,CAAC,CAAA;AAC7D,aAAA;AAAM,iBAAA;AACL,gBAAA,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,aAAa,IAAI,KAAK,CAAC,CAAC,CAAA;AAC7D,aAAA;AACH,SAAC,CAAC,CAAA;AACJ,KAAC,CAAC,CAAA;;IAGF,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,KAAI;AAC/B,QAAA,KAAK,CAAC,QAAQ,GAAG,eAAe,CAAC,CAAC,CAAC,CAAA;AACrC,KAAC,CAAC,CAAA;IAEF,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;SAChC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,KAAI;QACrB,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;AACjC,KAAC,CAAC,CAAA;IAEJ,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;SACjC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,KAAI;QACrB,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;AACjC,KAAC,CAAC,CAAA;AAEJ,IAAA,OAAO,WAAW,CAAA;AACpB,CAAC;SAEe,MAAM,CAAS,IAAa,EAAE,GAAG,GAA6B,EAAA;AAC5E,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,SAAS,CAAA;AAC3B,IAAA,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,GAA+B,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AACnG,IAAA,OAAO,QAAQ,CAAA;AACjB,CAAC;SAEe,MAAM,CAAS,IAAa,EAAE,GAAG,GAA6B,EAAA;AAC5E,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,SAAS,CAAA;AAC3B,IAAA,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,GAAG,CAAC,GAA+B,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;AACnG,IAAA,OAAO,QAAQ,CAAA;AACjB,CAAC;SAEe,SAAS,CAAS,IAAa,EAAE,GAAG,GAA6B,EAAA;AAC/E,IAAA,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;AACrD,CAAC;SAEe,UAAU,CAAS,IAAa,EAAE,KAAa,EAAE,QAAgC,EAAA;AAC/F,IAAA,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AAAE,QAAA,OAAO,IAAI,CAAC,CAAC,CAAC,CAAA;IAEpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAA;AAC5D,IAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAA;AAE5B,IAAA,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;AACvC,IAAA,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AAC1D,IAAA,OAAO,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;AAC1F,CAAC;SAEe,iBAAiB,CAAS,IAAa,EAAE,KAAuB,EAAE,QAAgC,EAAA;IAChH,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;QACxC,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAA;AACvC,QAAA,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AAClD,KAAC,CAAC,CAAA;AAEF,IAAA,OAAO,YAAY,CAAA;AACrB,CAAC;AAEe,SAAA,mBAAmB,CAAE,KAAa,EAAE,KAAuB,EAAA;AACzE,IAAA,OAAO,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;AACnD;;;;"}

package/utils/html.d.ts

@@ -0,0 +1 @@
+export declare function getHTMLTransform(el: HTMLElement): number[];

package/utils/html.js

@@ -0,0 +1,16 @@
+import { select } from 'd3-selection';
+
+function getHTMLTransform(el) {
+    const results = select(el).style('transform')
+        // eslint-disable-next-line max-len
+        .match(/matrix(?:(3d)\(-{0,1}\d+\.?\d*(?:, -{0,1}\d+\.?\d*)*(?:, (-{0,1}\d+\.?\d*))(?:, (-{0,1}\d+\.?\d*))(?:, (-{0,1}\d+\.?\d*)), -{0,1}\d+\.?\d*\)|\(-{0,1}\d+\.?\d*(?:, -{0,1}\d+\.?\d*)*(?:, (-{0,1}\d+\.?\d*))(?:, (-{0,1}\d+\.?\d*))\))/);
+    if (!results)
+        return [0, 0, 0];
+    if (results[1] === '3d')
+        return results.slice(2, 5).map(d => +d);
+    results.push('0');
+    return results.slice(5, 8).map(d => +d);
+}
+
+export { getHTMLTransform };
+//# sourceMappingURL=html.js.map

package/utils/html.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"html.js","sources":["../../src/utils/html.ts"],"sourcesContent":["import { select } from 'd3-selection'\n\nexport function getHTMLTransform (el: HTMLElement): number[] {\n  const results = select(el).style('transform')\n    // eslint-disable-next-line max-len\n    .match(/matrix(?:(3d)\\(-{0,1}\\d+\\.?\\d*(?:, -{0,1}\\d+\\.?\\d*)*(?:, (-{0,1}\\d+\\.?\\d*))(?:, (-{0,1}\\d+\\.?\\d*))(?:, (-{0,1}\\d+\\.?\\d*)), -{0,1}\\d+\\.?\\d*\\)|\\(-{0,1}\\d+\\.?\\d*(?:, -{0,1}\\d+\\.?\\d*)*(?:, (-{0,1}\\d+\\.?\\d*))(?:, (-{0,1}\\d+\\.?\\d*))\\))/)\n\n  if (!results) return [0, 0, 0]\n  if (results[1] === '3d') return results.slice(2, 5).map(d => +d)\n\n  results.push('0')\n  return results.slice(5, 8).map(d => +d)\n}\n"],"names":[],"mappings":";;AAEM,SAAU,gBAAgB,CAAE,EAAe,EAAA;IAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC;;SAE1C,KAAK,CAAC,uOAAuO,CAAC,CAAA;AAEjP,IAAA,IAAI,CAAC,OAAO;AAAE,QAAA,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;AAC9B,IAAA,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI;AAAE,QAAA,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AAEhE,IAAA,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACjB,IAAA,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACzC;;;;"}

package/utils/map.d.ts

@@ -0,0 +1,2 @@
+import { NumericAccessor } from "../types/accessor";
+export declare function getDataLatLngBounds<D>(data: D[], pointLatitude: NumericAccessor<D>, pointLongitude: NumericAccessor<D>, paddingDegrees?: number): [[number, number], [number, number]];

package/utils/map.js

@@ -0,0 +1,20 @@
+import { max, min } from 'd3-array';
+import { getNumber } from './data.js';
+
+function getDataLatLngBounds(data, pointLatitude, pointLongitude, paddingDegrees = 1) {
+    const northWest = {
+        lat: max(data !== null && data !== void 0 ? data : [], d => getNumber(d, pointLatitude)),
+        lng: min(data !== null && data !== void 0 ? data : [], d => getNumber(d, pointLongitude)),
+    };
+    const southEast = {
+        lat: min(data !== null && data !== void 0 ? data : [], d => getNumber(d, pointLatitude)),
+        lng: max(data !== null && data !== void 0 ? data : [], d => getNumber(d, pointLongitude)),
+    };
+    return [
+        [northWest.lat + paddingDegrees || 90, northWest.lng - paddingDegrees || -180],
+        [southEast.lat - paddingDegrees || -70, southEast.lng + paddingDegrees || 180],
+    ];
+}
+
+export { getDataLatLngBounds };
+//# sourceMappingURL=map.js.map

package/utils/map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map.js","sources":["../../src/utils/map.ts"],"sourcesContent":["import { min, max } from 'd3-array'\n\n// Types\nimport { NumericAccessor } from 'types/accessor'\n\n// Utils\nimport { getNumber } from 'utils/data'\n\nexport function getDataLatLngBounds<D> (\n  data: D[],\n  pointLatitude: NumericAccessor<D>,\n  pointLongitude: NumericAccessor<D>,\n  paddingDegrees = 1\n): [[number, number], [number, number]] {\n  const northWest = {\n    lat: max(data ?? [], d => getNumber(d, pointLatitude)),\n    lng: min(data ?? [], d => getNumber(d, pointLongitude)),\n  }\n\n  const southEast = {\n    lat: min(data ?? [], d => getNumber(d, pointLatitude)),\n    lng: max(data ?? [], d => getNumber(d, pointLongitude)),\n  }\n\n  return [\n    [northWest.lat + paddingDegrees || 90, northWest.lng - paddingDegrees || -180],\n    [southEast.lat - paddingDegrees || -70, southEast.lng + paddingDegrees || 180],\n  ]\n}\n"],"names":[],"mappings":";;;AAQM,SAAU,mBAAmB,CACjC,IAAS,EACT,aAAiC,EACjC,cAAkC,EAClC,cAAc,GAAG,CAAC,EAAA;AAElB,IAAA,MAAM,SAAS,GAAG;QAChB,GAAG,EAAE,GAAG,CAAC,IAAI,aAAJ,IAAI,KAAA,KAAA,CAAA,GAAJ,IAAI,GAAI,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;QACtD,GAAG,EAAE,GAAG,CAAC,IAAI,aAAJ,IAAI,KAAA,KAAA,CAAA,GAAJ,IAAI,GAAI,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;KACxD,CAAA;AAED,IAAA,MAAM,SAAS,GAAG;QAChB,GAAG,EAAE,GAAG,CAAC,IAAI,aAAJ,IAAI,KAAA,KAAA,CAAA,GAAJ,IAAI,GAAI,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;QACtD,GAAG,EAAE,GAAG,CAAC,IAAI,aAAJ,IAAI,KAAA,KAAA,CAAA,GAAJ,IAAI,GAAI,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;KACxD,CAAA;IAED,OAAO;AACL,QAAA,CAAC,SAAS,CAAC,GAAG,GAAG,cAAc,IAAI,EAAE,EAAE,SAAS,CAAC,GAAG,GAAG,cAAc,IAAI,CAAC,GAAG,CAAC;AAC9E,QAAA,CAAC,SAAS,CAAC,GAAG,GAAG,cAAc,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,GAAG,cAAc,IAAI,GAAG,CAAC;KAC/E,CAAA;AACH;;;;"}

package/utils/misc.d.ts

@@ -0,0 +1,9 @@
+import { StringAccessor } from "../types/accessor";
+import { Rect } from "../types/misc";
+export declare function guid(): string;
+export declare function stringToHtmlId(str: string): string;
+export declare function isStringCSSVariable(s: string): boolean;
+export declare function getCSSVariableValue(s: string, context: HTMLElement | SVGElement): string;
+export declare function getCSSVariableValueInPixels(s: string, context: HTMLElement | SVGElement): number;
+export declare function rectIntersect(rect1: Rect, rect2: Rect, tolerancePx?: number): boolean;
+export declare function getHref<T>(d: T, identifier: StringAccessor<T>): string;

package/utils/misc.js

@@ -0,0 +1,47 @@
+import { isString, getString } from './data.js';
+import toPx from 'to-px';
+
+function guid() {
+    const s4 = () => Math.floor((1 + Math.random()) * 0x10000)
+        .toString(16)
+        .substring(1);
+    return `${s4() + s4()}-${s4()}-${s4()}-${s4()}-${s4()}${s4()}${s4()}`;
+}
+function stringToHtmlId(str) {
+    return (str || '').replace(/\W/g, '_');
+}
+function isStringCSSVariable(s) {
+    return isString(s) ? (s.substring(0, 6) === 'var(--') : false;
+}
+function getCSSVariableValue(s, context) {
+    if (!isString(s))
+        return '';
+    const variableName = s.substr(4, s.length - 5);
+    return getComputedStyle(context).getPropertyValue(variableName);
+}
+function getCSSVariableValueInPixels(s, context) {
+    const val = getCSSVariableValue(s, context);
+    return toPx(val);
+}
+function rectIntersect(rect1, rect2, tolerancePx = 0) {
+    const [left1, top1, right1, bottom1] = [
+        rect1.x + tolerancePx,
+        rect1.y + rect1.height - 2 * tolerancePx,
+        rect1.x + rect1.width - 2 * tolerancePx,
+        rect1.y + tolerancePx,
+    ];
+    const [left2, top2, right2, bottom2] = [
+        rect2.x + tolerancePx,
+        rect2.y + rect2.height - 2 * tolerancePx,
+        rect2.x + rect2.width - 2 * tolerancePx,
+        rect2.y + tolerancePx,
+    ];
+    return !(top1 < bottom2 || top2 < bottom1 || right1 < left2 || right2 < left1);
+}
+function getHref(d, identifier) {
+    const id = getString(d, identifier);
+    return id ? `url(#${id})` : null;
+}
+
+export { getCSSVariableValue, getCSSVariableValueInPixels, getHref, guid, isStringCSSVariable, rectIntersect, stringToHtmlId };
+//# sourceMappingURL=misc.js.map

package/utils/misc.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"misc.js","sources":["../../src/utils/misc.ts"],"sourcesContent":["import { StringAccessor } from 'types/accessor'\nimport { Rect } from 'types/misc'\nimport { getString, isString } from 'utils/data'\nimport toPx from 'to-px'\n\nexport function guid (): string {\n  const s4 = (): string =>\n    Math.floor((1 + Math.random()) * 0x10000)\n      .toString(16)\n      .substring(1)\n\n  return `${s4() + s4()}-${s4()}-${s4()}-${s4()}-${s4()}${s4()}${s4()}`\n}\n\nexport function stringToHtmlId (str: string): string {\n  return (str || '').replace(/\\W/g, '_')\n}\n\nexport function isStringCSSVariable (s: string): boolean {\n  return isString(s) ? (s.substring(0, 6) === 'var(--') : false\n}\n\nexport function getCSSVariableValue (s: string, context: HTMLElement | SVGElement): string {\n  if (!isString(s)) return ''\n  const variableName = s.substr(4, s.length - 5)\n  return getComputedStyle(context).getPropertyValue(variableName)\n}\n\nexport function getCSSVariableValueInPixels (s: string, context: HTMLElement | SVGElement): number {\n  const val = getCSSVariableValue(s, context)\n  return toPx(val)\n}\n\nexport function rectIntersect (rect1: Rect, rect2: Rect, tolerancePx = 0): boolean {\n  const [left1, top1, right1, bottom1] = [\n    rect1.x + tolerancePx,\n    rect1.y + rect1.height - 2 * tolerancePx,\n    rect1.x + rect1.width - 2 * tolerancePx,\n    rect1.y + tolerancePx,\n  ]\n  const [left2, top2, right2, bottom2] = [\n    rect2.x + tolerancePx,\n    rect2.y + rect2.height - 2 * tolerancePx,\n    rect2.x + rect2.width - 2 * tolerancePx,\n    rect2.y + tolerancePx,\n  ]\n\n  return !(top1 < bottom2 || top2 < bottom1 || right1 < left2 || right2 < left1)\n}\n\nexport function getHref<T> (d: T, identifier: StringAccessor<T>): string {\n  const id = getString(d, identifier)\n  return id ? `url(#${id})` : null\n}\n"],"names":[],"mappings":";;;SAKgB,IAAI,GAAA;AAClB,IAAA,MAAM,EAAE,GAAG,MACT,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,IAAI,OAAO,CAAC;SACtC,QAAQ,CAAC,EAAE,CAAC;SACZ,SAAS,CAAC,CAAC,CAAC,CAAA;IAEjB,OAAO,CAAA,EAAG,EAAE,EAAE,GAAG,EAAE,EAAE,CAAI,CAAA,EAAA,EAAE,EAAE,CAAA,CAAA,EAAI,EAAE,EAAE,IAAI,EAAE,EAAE,CAAI,CAAA,EAAA,EAAE,EAAE,CAAA,EAAG,EAAE,EAAE,CAAG,EAAA,EAAE,EAAE,CAAA,CAAE,CAAA;AACvE,CAAC;AAEK,SAAU,cAAc,CAAE,GAAW,EAAA;AACzC,IAAA,OAAO,CAAC,GAAG,IAAI,EAAE,EAAE,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AACxC,CAAC;AAEK,SAAU,mBAAmB,CAAE,CAAS,EAAA;IAC5C,OAAO,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAA;AAC/D,CAAC;AAEe,SAAA,mBAAmB,CAAE,CAAS,EAAE,OAAiC,EAAA;AAC/E,IAAA,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AAAE,QAAA,OAAO,EAAE,CAAA;AAC3B,IAAA,MAAM,YAAY,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAC9C,OAAO,gBAAgB,CAAC,OAAO,CAAC,CAAC,gBAAgB,CAAC,YAAY,CAAC,CAAA;AACjE,CAAC;AAEe,SAAA,2BAA2B,CAAE,CAAS,EAAE,OAAiC,EAAA;IACvF,MAAM,GAAG,GAAG,mBAAmB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;AAC3C,IAAA,OAAO,IAAI,CAAC,GAAG,CAAC,CAAA;AAClB,CAAC;AAEK,SAAU,aAAa,CAAE,KAAW,EAAE,KAAW,EAAE,WAAW,GAAG,CAAC,EAAA;IACtE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG;QACrC,KAAK,CAAC,CAAC,GAAG,WAAW;QACrB,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,WAAW;QACxC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,WAAW;QACvC,KAAK,CAAC,CAAC,GAAG,WAAW;KACtB,CAAA;IACD,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,GAAG;QACrC,KAAK,CAAC,CAAC,GAAG,WAAW;QACrB,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,WAAW;QACxC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,GAAG,WAAW;QACvC,KAAK,CAAC,CAAC,GAAG,WAAW;KACtB,CAAA;AAED,IAAA,OAAO,EAAE,IAAI,GAAG,OAAO,IAAI,IAAI,GAAG,OAAO,IAAI,MAAM,GAAG,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,CAAA;AAChF,CAAC;AAEe,SAAA,OAAO,CAAK,CAAI,EAAE,UAA6B,EAAA;IAC7D,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC,CAAA;IACnC,OAAO,EAAE,GAAG,CAAA,KAAA,EAAQ,EAAE,CAAA,CAAA,CAAG,GAAG,IAAI,CAAA;AAClC;;;;"}

package/utils/path.d.ts

@@ -0,0 +1,23 @@
+export declare type RoundedRectPathOptions = {
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+    r: number;
+    tl: boolean;
+    tr: boolean;
+    bl: boolean;
+    br: boolean;
+};
+export declare function roundedRectPath({ x, y, w, h, tl, tr, bl, br, r, }: RoundedRectPathOptions): string;
+export declare function polygon(size: number, n?: number, endAngle?: number, open?: boolean): string;
+export declare function circlePath(cx: number, cy: number, r: number): string;
+export declare type ScoreRectPathOptions = {
+    x: number;
+    y: number;
+    w: number;
+    h: number;
+    r: number;
+    score: number;
+};
+export declare function scoreRectPath({ x, y, w, h, r, score }: ScoreRectPathOptions): string;

package/utils/path.js

@@ -0,0 +1,144 @@
+import { range, min, max } from 'd3-array';
+import { line, curveCardinal, curveCardinalClosed } from 'd3-shape';
+import { clamp } from './data.js';
+
+/*
+ * Generate SVG path for rectangle with rounded corners
+ *
+ * @param {Object} props - Configuration object
+ * @param {Number} props.x - Rect top left X coordinate
+ * @param {Number} props.y - Rect top left Y coordinate
+ * @param {Number} props.w - Rect width
+ * @param {Number} props.h - Rect height
+ * @param {Bool} [props.tl=false] - Round top left corner
+ * @param {Bool} [props.tr=false] - Round top right corner
+ * @param {Bool} [props.bl=false] - Round bottom left corner
+ * @param {Bool} [props.br=false] - Round bottom right corner
+ * @param {Number} [props.r=0] - Corner Radius
+ * @return {String} Path string for the `d` attribute
+ */
+function roundedRectPath({ x, y, w, h, tl = false, tr = false, bl = false, br = false, r = 0, }) {
+    let path;
+    path = `M${x + r},${y}h${w - 2 * r}`;
+    let roundedR = tr ? r : 0;
+    let angularR = tr ? 0 : r;
+    path += `a${roundedR},${roundedR} 0 0 1 ${roundedR},${roundedR}`;
+    path += `h${angularR}v${angularR}`;
+    path += `v${h - 2 * r}`;
+    roundedR = br ? r : 0;
+    angularR = br ? 0 : r;
+    path += `a${roundedR},${roundedR} 0 0 1 ${-roundedR},${roundedR}`;
+    path += `v${angularR}h${-angularR}`;
+    path += `h${2 * r - w}`;
+    roundedR = bl ? r : 0;
+    angularR = bl ? 0 : r;
+    path += `a${roundedR},${roundedR} 0 0 1 ${-roundedR},${-roundedR}`;
+    path += `h${-angularR}v${-angularR}`;
+    path += `v${2 * r - h}`;
+    roundedR = tl ? r : 0;
+    angularR = tl ? 0 : r;
+    path += `a${roundedR},${roundedR} 0 0 1 ${roundedR},${-roundedR}`;
+    path += `v${-angularR}h${angularR}`;
+    path += 'z';
+    return path;
+}
+function polygon(size, n = 6, endAngle = 2 * Math.PI, open = false) {
+    const r = n === 4 ? Math.sqrt(0.5) * size : size / 3.6 * 2;
+    const deltaAngle = n === 4 ? Math.PI / 4 : 0; // rotate to 45 grads if shape is a rectangle
+    const shiftedEndAngle = endAngle - deltaAngle;
+    const completion = (shiftedEndAngle < 0 ? endAngle : shiftedEndAngle) / (2 * Math.PI);
+    const nSegments = Math.ceil(n * completion);
+    const centerAngle = 1 / n * Math.PI * 2; //          /\
+    const baseAngle = (Math.PI - centerAngle) / 2; //   /__\
+    const data = range(nSegments + (shiftedEndAngle >= 0 ? 1 : 0))
+        .map((d, i) => {
+        const isLastSegment = i === nSegments || (nSegments === 1 && shiftedEndAngle < 0);
+        let mult = isLastSegment ? ((completion * n) % 1 || 1) : 1; // Handle partial shape
+        if (shiftedEndAngle < 0) {
+            mult += 0.5;
+        }
+        const angle = centerAngle * (i - 1 + mult);
+        let radius;
+        if (isLastSegment) {
+            const thirdAngle = Math.PI - baseAngle - centerAngle * mult;
+            radius = r * Math.sin(baseAngle) / Math.sin(thirdAngle); // Law of sines
+        }
+        else {
+            radius = r;
+        }
+        return {
+            x: Math.sin(angle + deltaAngle) * radius,
+            y: -Math.cos(angle + deltaAngle) * radius,
+        };
+    });
+    if (n === 4) {
+        const angle = centerAngle * (-1 + 0.5);
+        const thirdAngle = Math.PI * 0.5;
+        const radius = r * Math.sin(baseAngle) / Math.sin(thirdAngle); // Law of sines
+        data.unshift({
+            x: Math.sin(angle + deltaAngle) * radius,
+            y: -Math.cos(angle + deltaAngle) * radius,
+        });
+    }
+    const path = line()
+        /* eslint-disable-next-line dot-notation */
+        .x(d => d['x'])
+        /* eslint-disable-next-line dot-notation */
+        .y(d => d['y'])
+        .curve((open ? curveCardinal : curveCardinalClosed).tension(0.95));
+    return path(data);
+}
+function circlePath(cx, cy, r) {
+    return `
+    M ${cx} ${cy}
+    m ${-r}, 0
+    a ${r},${r} 0 1,1 ${r * 2},0
+    a ${r},${r} 0 1,1 ${-r * 2},0`;
+}
+function scoreRectPath({ x, y, w, h, r = 0, score = 1 }) {
+    let path;
+    const side = 1 / 4;
+    const halfSide = side / 2;
+    let part = score;
+    //    8 1
+    //    - -
+    // 7 |   | 2
+    // 6 |   | 3
+    //    - -
+    //    5 4
+    // 1
+    const hLength = min([w * 0.5 * (part / halfSide) + r, w * 0.5 - r]);
+    path = `M${x + w * 0.5},${y}h${hLength}`;
+    // 2, 3
+    part = score - 1 / 8;
+    if (part > 0) {
+        path += `a${r},${r} 0 0 1 ${r},${r}`;
+        const vLength = clamp(h * (part / side) - r, 0, h - 2 * r);
+        path += `v${vLength}`;
+    }
+    // 4, 5
+    part = score - 3 / 8;
+    if (part > 0) {
+        path += `a${r},${r} 0 0 1 ${-r},${r}`;
+        const hLength = clamp(r - w * (part / side), 2 * r - w, 0);
+        path += `h${hLength}`;
+    }
+    // 6, 7
+    part = score - 5 / 8;
+    if (part > 0) {
+        path += `a${r},${r} 0 0 1 ${-r},${-r}`;
+        const vLength = clamp(r - h * (part / side), 2 * r - h, 0);
+        path += `v${vLength}`;
+    }
+    // 8
+    part = score - 7 / 8;
+    if (part > 0) {
+        path += `a${r},${r} 0 0 1 ${r},${-r}`;
+        const hLength = max([w * 0.5 * (part / halfSide) - r, 0]);
+        path += `h${hLength}`;
+    }
+    return path;
+}
+
+export { circlePath, polygon, roundedRectPath, scoreRectPath };
+//# sourceMappingURL=path.js.map

package/utils/path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path.js","sources":["../../src/utils/path.ts"],"sourcesContent":["import { range, min, max } from 'd3-array'\nimport { line, curveCardinal, curveCardinalClosed } from 'd3-shape'\n\n// Utils\nimport { clamp } from 'utils/data'\n\nexport type RoundedRectPathOptions = {\n  x: number;\n  y: number;\n  w: number;\n  h: number;\n  r: number;\n  tl: boolean;\n  tr: boolean;\n  bl: boolean;\n  br: boolean;\n}\n\n/*\n * Generate SVG path for rectangle with rounded corners\n *\n * @param {Object} props - Configuration object\n * @param {Number} props.x - Rect top left X coordinate\n * @param {Number} props.y - Rect top left Y coordinate\n * @param {Number} props.w - Rect width\n * @param {Number} props.h - Rect height\n * @param {Bool} [props.tl=false] - Round top left corner\n * @param {Bool} [props.tr=false] - Round top right corner\n * @param {Bool} [props.bl=false] - Round bottom left corner\n * @param {Bool} [props.br=false] - Round bottom right corner\n * @param {Number} [props.r=0] - Corner Radius\n * @return {String} Path string for the `d` attribute\n */\nexport function roundedRectPath ({\n  x,\n  y,\n  w,\n  h,\n  tl = false,\n  tr = false,\n  bl = false,\n  br = false,\n  r = 0,\n}: RoundedRectPathOptions): string {\n  let path\n  path = `M${x + r},${y}h${w - 2 * r}`\n\n  let roundedR = tr ? r : 0\n  let angularR = tr ? 0 : r\n  path += `a${roundedR},${roundedR} 0 0 1 ${roundedR},${roundedR}`\n  path += `h${angularR}v${angularR}`\n  path += `v${h - 2 * r}`\n\n  roundedR = br ? r : 0\n  angularR = br ? 0 : r\n  path += `a${roundedR},${roundedR} 0 0 1 ${-roundedR},${roundedR}`\n  path += `v${angularR}h${-angularR}`\n  path += `h${2 * r - w}`\n\n  roundedR = bl ? r : 0\n  angularR = bl ? 0 : r\n  path += `a${roundedR},${roundedR} 0 0 1 ${-roundedR},${-roundedR}`\n  path += `h${-angularR}v${-angularR}`\n  path += `v${2 * r - h}`\n\n  roundedR = tl ? r : 0\n  angularR = tl ? 0 : r\n  path += `a${roundedR},${roundedR} 0 0 1 ${roundedR},${-roundedR}`\n  path += `v${-angularR}h${angularR}`\n\n  path += 'z'\n  return path\n}\n\nexport function polygon (size: number, n = 6, endAngle = 2 * Math.PI, open = false): string {\n  const r = n === 4 ? Math.sqrt(0.5) * size : size / 3.6 * 2\n  const deltaAngle = n === 4 ? Math.PI / 4 : 0 // rotate to 45 grads if shape is a rectangle\n  const shiftedEndAngle = endAngle - deltaAngle\n\n  const completion = (shiftedEndAngle < 0 ? endAngle : shiftedEndAngle) / (2 * Math.PI)\n  const nSegments = Math.ceil(n * completion)\n\n  const centerAngle = 1 / n * Math.PI * 2 //          /\\\n  const baseAngle = (Math.PI - centerAngle) / 2 //   /__\\\n\n  const data = range(nSegments + (shiftedEndAngle >= 0 ? 1 : 0))\n    .map((d, i) => {\n      const isLastSegment = i === nSegments || (nSegments === 1 && shiftedEndAngle < 0)\n      let mult = isLastSegment ? ((completion * n) % 1 || 1) : 1 // Handle partial shape\n      if (shiftedEndAngle < 0) {\n        mult += 0.5\n      }\n      const angle = centerAngle * (i - 1 + mult)\n\n      let radius\n      if (isLastSegment) {\n        const thirdAngle = Math.PI - baseAngle - centerAngle * mult\n        radius = r * Math.sin(baseAngle) / Math.sin(thirdAngle) // Law of sines\n      } else {\n        radius = r\n      }\n\n      return {\n        x: Math.sin(angle + deltaAngle) * radius,\n        y: -Math.cos(angle + deltaAngle) * radius,\n      }\n    })\n\n  if (n === 4) {\n    const angle = centerAngle * (-1 + 0.5)\n    const thirdAngle = Math.PI * 0.5\n    const radius = r * Math.sin(baseAngle) / Math.sin(thirdAngle) // Law of sines\n    data.unshift({\n      x: Math.sin(angle + deltaAngle) * radius,\n      y: -Math.cos(angle + deltaAngle) * radius,\n    })\n  }\n\n  const path = line<any>()\n    /* eslint-disable-next-line dot-notation */\n    .x(d => d['x'])\n    /* eslint-disable-next-line dot-notation */\n    .y(d => d['y'])\n    .curve((open ? curveCardinal : curveCardinalClosed).tension(0.95))\n\n  return path(data)\n}\n\nexport function circlePath (cx: number, cy: number, r: number): string {\n  return `\n    M ${cx} ${cy}\n    m ${-r}, 0\n    a ${r},${r} 0 1,1 ${r * 2},0\n    a ${r},${r} 0 1,1 ${-r * 2},0`\n}\n\nexport type ScoreRectPathOptions = {\n  x: number;\n  y: number;\n  w: number;\n  h: number;\n  r: number;\n  score: number;\n}\n\nexport function scoreRectPath ({ x, y, w, h, r = 0, score = 1 }: ScoreRectPathOptions): string {\n  let path\n  const side = 1 / 4\n  const halfSide = side / 2\n  let part = score\n\n  //    8 1\n  //    - -\n  // 7 |   | 2\n  // 6 |   | 3\n  //    - -\n  //    5 4\n\n  // 1\n  const hLength = min([w * 0.5 * (part / halfSide) + r, w * 0.5 - r])\n  path = `M${x + w * 0.5},${y}h${hLength}`\n\n  // 2, 3\n  part = score - 1 / 8\n  if (part > 0) {\n    path += `a${r},${r} 0 0 1 ${r},${r}`\n    const vLength = clamp(h * (part / side) - r, 0, h - 2 * r)\n    path += `v${vLength}`\n  }\n\n  // 4, 5\n  part = score - 3 / 8\n  if (part > 0) {\n    path += `a${r},${r} 0 0 1 ${-r},${r}`\n    const hLength = clamp(r - w * (part / side), 2 * r - w, 0)\n    path += `h${hLength}`\n  }\n\n  // 6, 7\n  part = score - 5 / 8\n  if (part > 0) {\n    path += `a${r},${r} 0 0 1 ${-r},${-r}`\n    const vLength = clamp(r - h * (part / side), 2 * r - h, 0)\n    path += `v${vLength}`\n  }\n\n  // 8\n  part = score - 7 / 8\n  if (part > 0) {\n    path += `a${r},${r} 0 0 1 ${r},${-r}`\n    const hLength = max([w * 0.5 * (part / halfSide) - r, 0])\n    path += `h${hLength}`\n  }\n\n  return path\n}\n"],"names":[],"mappings":";;;;AAkBA;;;;;;;;;;;;;;AAcG;AACa,SAAA,eAAe,CAAE,EAC/B,CAAC,EACD,CAAC,EACD,CAAC,EACD,CAAC,EACD,EAAE,GAAG,KAAK,EACV,EAAE,GAAG,KAAK,EACV,EAAE,GAAG,KAAK,EACV,EAAE,GAAG,KAAK,EACV,CAAC,GAAG,CAAC,GACkB,EAAA;AACvB,IAAA,IAAI,IAAI,CAAA;AACR,IAAA,IAAI,GAAG,CAAA,CAAA,EAAI,CAAC,GAAG,CAAC,CAAI,CAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;IAEpC,IAAI,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACzB,IAAI,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACzB,IAAI,IAAI,CAAI,CAAA,EAAA,QAAQ,CAAI,CAAA,EAAA,QAAQ,UAAU,QAAQ,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,CAAA;AAChE,IAAA,IAAI,IAAI,CAAI,CAAA,EAAA,QAAQ,CAAI,CAAA,EAAA,QAAQ,EAAE,CAAA;IAClC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;IAEvB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,IAAI,IAAI,CAAI,CAAA,EAAA,QAAQ,CAAI,CAAA,EAAA,QAAQ,CAAU,OAAA,EAAA,CAAC,QAAQ,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAE,CAAA;AACjE,IAAA,IAAI,IAAI,CAAI,CAAA,EAAA,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAA;IACnC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;IAEvB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;AACrB,IAAA,IAAI,IAAI,CAAA,CAAA,EAAI,QAAQ,CAAA,CAAA,EAAI,QAAQ,CAAA,OAAA,EAAU,CAAC,QAAQ,CAAI,CAAA,EAAA,CAAC,QAAQ,CAAA,CAAE,CAAA;IAClE,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAA;IACpC,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAA;IAEvB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;IACrB,IAAI,IAAI,CAAI,CAAA,EAAA,QAAQ,CAAI,CAAA,EAAA,QAAQ,CAAU,OAAA,EAAA,QAAQ,CAAI,CAAA,EAAA,CAAC,QAAQ,CAAA,CAAE,CAAA;AACjE,IAAA,IAAI,IAAI,CAAI,CAAA,EAAA,CAAC,QAAQ,CAAI,CAAA,EAAA,QAAQ,EAAE,CAAA;IAEnC,IAAI,IAAI,GAAG,CAAA;AACX,IAAA,OAAO,IAAI,CAAA;AACb,CAAC;SAEe,OAAO,CAAE,IAAY,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,KAAK,EAAA;IAChF,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;AAC1D,IAAA,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAA;AAC5C,IAAA,MAAM,eAAe,GAAG,QAAQ,GAAG,UAAU,CAAA;IAE7C,MAAM,UAAU,GAAG,CAAC,eAAe,GAAG,CAAC,GAAG,QAAQ,GAAG,eAAe,KAAK,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAA;IACrF,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,UAAU,CAAC,CAAA;AAE3C,IAAA,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAA;AACvC,IAAA,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,WAAW,IAAI,CAAC,CAAA;AAE7C,IAAA,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,IAAI,eAAe,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3D,SAAA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAI;AACZ,QAAA,MAAM,aAAa,GAAG,CAAC,KAAK,SAAS,KAAK,SAAS,KAAK,CAAC,IAAI,eAAe,GAAG,CAAC,CAAC,CAAA;QACjF,IAAI,IAAI,GAAG,aAAa,IAAI,CAAC,UAAU,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC1D,IAAI,eAAe,GAAG,CAAC,EAAE;YACvB,IAAI,IAAI,GAAG,CAAA;AACZ,SAAA;QACD,MAAM,KAAK,GAAG,WAAW,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAA;AAE1C,QAAA,IAAI,MAAM,CAAA;AACV,QAAA,IAAI,aAAa,EAAE;YACjB,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,GAAG,SAAS,GAAG,WAAW,GAAG,IAAI,CAAA;AAC3D,YAAA,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;AACxD,SAAA;AAAM,aAAA;YACL,MAAM,GAAG,CAAC,CAAA;AACX,SAAA;QAED,OAAO;YACL,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,MAAM;YACxC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,MAAM;SAC1C,CAAA;AACH,KAAC,CAAC,CAAA;IAEJ,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,MAAM,KAAK,GAAG,WAAW,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;AACtC,QAAA,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAA;AAChC,QAAA,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QAC7D,IAAI,CAAC,OAAO,CAAC;YACX,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,MAAM;YACxC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,MAAM;AAC1C,SAAA,CAAC,CAAA;AACH,KAAA;IAED,MAAM,IAAI,GAAG,IAAI,EAAO;;SAErB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;;SAEd,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AACd,SAAA,KAAK,CAAC,CAAC,IAAI,GAAG,aAAa,GAAG,mBAAmB,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;AAEpE,IAAA,OAAO,IAAI,CAAC,IAAI,CAAC,CAAA;AACnB,CAAC;SAEe,UAAU,CAAE,EAAU,EAAE,EAAU,EAAE,CAAS,EAAA;IAC3D,OAAO,CAAA;AACD,MAAA,EAAA,EAAE,IAAI,EAAE,CAAA;AACR,MAAA,EAAA,CAAC,CAAC,CAAA;AACF,MAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,CAAU,OAAA,EAAA,CAAC,GAAG,CAAC,CAAA;QACrB,CAAC,CAAA,CAAA,EAAI,CAAC,CAAU,OAAA,EAAA,CAAC,CAAC,GAAG,CAAC,IAAI,CAAA;AAClC,CAAC;SAWe,aAAa,CAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAwB,EAAA;AACnF,IAAA,IAAI,IAAI,CAAA;AACR,IAAA,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAA;AAClB,IAAA,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAA;IACzB,IAAI,IAAI,GAAG,KAAK,CAAA;;;;;;;;IAUhB,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;AACnE,IAAA,IAAI,GAAG,CAAA,CAAA,EAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,OAAO,CAAA,CAAE,CAAA;;AAGxC,IAAA,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAA;IACpB,IAAI,IAAI,GAAG,CAAC,EAAE;QACZ,IAAI,IAAI,CAAI,CAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,UAAU,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;QACpC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC1D,QAAA,IAAI,IAAI,CAAA,CAAA,EAAI,OAAO,CAAA,CAAE,CAAA;AACtB,KAAA;;AAGD,IAAA,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAA;IACpB,IAAI,IAAI,GAAG,CAAC,EAAE;QACZ,IAAI,IAAI,CAAI,CAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,CAAU,OAAA,EAAA,CAAC,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,CAAE,CAAA;QACrC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1D,QAAA,IAAI,IAAI,CAAA,CAAA,EAAI,OAAO,CAAA,CAAE,CAAA;AACtB,KAAA;;AAGD,IAAA,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAA;IACpB,IAAI,IAAI,GAAG,CAAC,EAAE;AACZ,QAAA,IAAI,IAAI,CAAA,CAAA,EAAI,CAAC,CAAA,CAAA,EAAI,CAAC,CAAA,OAAA,EAAU,CAAC,CAAC,CAAI,CAAA,EAAA,CAAC,CAAC,CAAA,CAAE,CAAA;QACtC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1D,QAAA,IAAI,IAAI,CAAA,CAAA,EAAI,OAAO,CAAA,CAAE,CAAA;AACtB,KAAA;;AAGD,IAAA,IAAI,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAA;IACpB,IAAI,IAAI,GAAG,CAAC,EAAE;QACZ,IAAI,IAAI,CAAI,CAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,CAAU,OAAA,EAAA,CAAC,CAAI,CAAA,EAAA,CAAC,CAAC,CAAA,CAAE,CAAA;QACrC,MAAM,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;AACzD,QAAA,IAAI,IAAI,CAAA,CAAA,EAAI,OAAO,CAAA,CAAE,CAAA;AACtB,KAAA;AAED,IAAA,OAAO,IAAI,CAAA;AACb;;;;"}

package/utils/scale.d.ts

@@ -0,0 +1 @@
+export declare const DefaultRange: number[];