@revolist/revogrid 4.0.2-next → 4.0.2

package/standalone/data.store.js

@@ -0,0 +1,705 @@
+/*!
+ * Built by Revolist OU ❤️
+ */
+import { getRenderingRef, forceUpdate } from '@stencil/core/internal/client';
+import { _ as _baseIteratee } from './_baseIteratee.js';
+import { t as toNumber_1 } from './toNumber.js';
+import { e as eq_1 } from './_stringToPath.js';
+import { i as isArrayLike_1, b as _isIndex } from './identity.js';
+import { a as isObject_1 } from './isObjectLike.js';
+
+/**
+ * All items
+ * Used as proxy for sorting
+ * Keep order but do not modify final source
+ */
+const proxyPlugin = (store) => ({
+    set(k, newVal) {
+        if (!isProxy(k)) {
+            return;
+        }
+        /**
+         * Getting existing collection of items
+         * Mark indexes as visible
+         */
+        const oldItems = store.get('items').reduce((r, v) => {
+            r[v] = true;
+            return r;
+        }, {});
+        /**
+         * Check if new values where present in items
+         * Filter item collection according presense
+         */
+        const newItems = newVal.reduce((r, i) => {
+            if (oldItems[i]) {
+                r.push(i);
+            }
+            return r;
+        }, []);
+        store.set('items', newItems);
+    },
+});
+function isProxy(k) {
+    return k === 'proxyItems';
+}
+
+const appendToMap = (map, propName, value) => {
+    const items = map.get(propName);
+    if (!items) {
+        map.set(propName, [value]);
+    }
+    else if (!items.includes(value)) {
+        items.push(value);
+    }
+};
+const debounce = (fn, ms) => {
+    let timeoutId;
+    return (...args) => {
+        if (timeoutId) {
+            clearTimeout(timeoutId);
+        }
+        timeoutId = setTimeout(() => {
+            timeoutId = 0;
+            fn(...args);
+        }, ms);
+    };
+};
+
+/**
+ * Check if a possible element isConnected.
+ * The property might not be there, so we check for it.
+ *
+ * We want it to return true if isConnected is not a property,
+ * otherwise we would remove these elements and would not update.
+ *
+ * Better leak in Edge than to be useless.
+ */
+const isConnected = (maybeElement) => !('isConnected' in maybeElement) || maybeElement.isConnected;
+const cleanupElements = debounce((map) => {
+    for (let key of map.keys()) {
+        map.set(key, map.get(key).filter(isConnected));
+    }
+}, 2000);
+const stencilSubscription = () => {
+    if (typeof getRenderingRef !== 'function') {
+        // If we are not in a stencil project, we do nothing.
+        // This function is not really exported by @stencil/core.
+        return {};
+    }
+    const elmsToUpdate = new Map();
+    return {
+        dispose: () => elmsToUpdate.clear(),
+        get: (propName) => {
+            const elm = getRenderingRef();
+            if (elm) {
+                appendToMap(elmsToUpdate, propName, elm);
+            }
+        },
+        set: (propName) => {
+            const elements = elmsToUpdate.get(propName);
+            if (elements) {
+                elmsToUpdate.set(propName, elements.filter(forceUpdate));
+            }
+            cleanupElements(elmsToUpdate);
+        },
+        reset: () => {
+            elmsToUpdate.forEach((elms) => elms.forEach(forceUpdate));
+            cleanupElements(elmsToUpdate);
+        },
+    };
+};
+
+const unwrap = (val) => (typeof val === 'function' ? val() : val);
+const createObservableMap = (defaultState, shouldUpdate = (a, b) => a !== b) => {
+    const unwrappedState = unwrap(defaultState);
+    let states = new Map(Object.entries(unwrappedState !== null && unwrappedState !== void 0 ? unwrappedState : {}));
+    const handlers = {
+        dispose: [],
+        get: [],
+        set: [],
+        reset: [],
+    };
+    const reset = () => {
+        var _a;
+        // When resetting the state, the default state may be a function - unwrap it to invoke it.
+        // otherwise, the state won't be properly reset
+        states = new Map(Object.entries((_a = unwrap(defaultState)) !== null && _a !== void 0 ? _a : {}));
+        handlers.reset.forEach((cb) => cb());
+    };
+    const dispose = () => {
+        // Call first dispose as resetting the state would
+        // cause less updates ;)
+        handlers.dispose.forEach((cb) => cb());
+        reset();
+    };
+    const get = (propName) => {
+        handlers.get.forEach((cb) => cb(propName));
+        return states.get(propName);
+    };
+    const set = (propName, value) => {
+        const oldValue = states.get(propName);
+        if (shouldUpdate(value, oldValue, propName)) {
+            states.set(propName, value);
+            handlers.set.forEach((cb) => cb(propName, value, oldValue));
+        }
+    };
+    const state = (typeof Proxy === 'undefined'
+        ? {}
+        : new Proxy(unwrappedState, {
+            get(_, propName) {
+                return get(propName);
+            },
+            ownKeys(_) {
+                return Array.from(states.keys());
+            },
+            getOwnPropertyDescriptor() {
+                return {
+                    enumerable: true,
+                    configurable: true,
+                };
+            },
+            has(_, propName) {
+                return states.has(propName);
+            },
+            set(_, propName, value) {
+                set(propName, value);
+                return true;
+            },
+        }));
+    const on = (eventName, callback) => {
+        handlers[eventName].push(callback);
+        return () => {
+            removeFromArray(handlers[eventName], callback);
+        };
+    };
+    const onChange = (propName, cb) => {
+        const unSet = on('set', (key, newValue) => {
+            if (key === propName) {
+                cb(newValue);
+            }
+        });
+        // We need to unwrap the defaultState because it might be a function.
+        // Otherwise we might not be sending the right reset value.
+        const unReset = on('reset', () => cb(unwrap(defaultState)[propName]));
+        return () => {
+            unSet();
+            unReset();
+        };
+    };
+    const use = (...subscriptions) => {
+        const unsubs = subscriptions.reduce((unsubs, subscription) => {
+            if (subscription.set) {
+                unsubs.push(on('set', subscription.set));
+            }
+            if (subscription.get) {
+                unsubs.push(on('get', subscription.get));
+            }
+            if (subscription.reset) {
+                unsubs.push(on('reset', subscription.reset));
+            }
+            if (subscription.dispose) {
+                unsubs.push(on('dispose', subscription.dispose));
+            }
+            return unsubs;
+        }, []);
+        return () => unsubs.forEach((unsub) => unsub());
+    };
+    const forceUpdate = (key) => {
+        const oldValue = states.get(key);
+        handlers.set.forEach((cb) => cb(key, oldValue, oldValue));
+    };
+    return {
+        state,
+        get,
+        set,
+        on,
+        onChange,
+        use,
+        dispose,
+        reset,
+        forceUpdate,
+    };
+};
+const removeFromArray = (array, item) => {
+    const index = array.indexOf(item);
+    if (index >= 0) {
+        array[index] = array[array.length - 1];
+        array.length--;
+    }
+};
+
+const createStore = (defaultState, shouldUpdate) => {
+    const map = createObservableMap(defaultState, shouldUpdate);
+    map.use(stencilSubscription());
+    return map;
+};
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+
+function baseFindIndex$1(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+      index = fromIndex + (fromRight ? 1 : -1);
+
+  while ((fromRight ? index-- : ++index < length)) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
+  }
+  return -1;
+}
+
+var _baseFindIndex = baseFindIndex$1;
+
+var toNumber = toNumber_1;
+
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0,
+    MAX_INTEGER = 1.7976931348623157e+308;
+
+/**
+ * Converts `value` to a finite number.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.12.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {number} Returns the converted number.
+ * @example
+ *
+ * _.toFinite(3.2);
+ * // => 3.2
+ *
+ * _.toFinite(Number.MIN_VALUE);
+ * // => 5e-324
+ *
+ * _.toFinite(Infinity);
+ * // => 1.7976931348623157e+308
+ *
+ * _.toFinite('3.2');
+ * // => 3.2
+ */
+function toFinite$2(value) {
+  if (!value) {
+    return value === 0 ? value : 0;
+  }
+  value = toNumber(value);
+  if (value === INFINITY || value === -INFINITY) {
+    var sign = (value < 0 ? -1 : 1);
+    return sign * MAX_INTEGER;
+  }
+  return value === value ? value : 0;
+}
+
+var toFinite_1 = toFinite$2;
+
+var toFinite$1 = toFinite_1;
+
+/**
+ * Converts `value` to an integer.
+ *
+ * **Note:** This method is loosely based on
+ * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {number} Returns the converted integer.
+ * @example
+ *
+ * _.toInteger(3.2);
+ * // => 3
+ *
+ * _.toInteger(Number.MIN_VALUE);
+ * // => 0
+ *
+ * _.toInteger(Infinity);
+ * // => 1.7976931348623157e+308
+ *
+ * _.toInteger('3.2');
+ * // => 3
+ */
+function toInteger$1(value) {
+  var result = toFinite$1(value),
+      remainder = result % 1;
+
+  return result === result ? (remainder ? result - remainder : result) : 0;
+}
+
+var toInteger_1 = toInteger$1;
+
+var baseFindIndex = _baseFindIndex,
+    baseIteratee = _baseIteratee,
+    toInteger = toInteger_1;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax$1 = Math.max;
+
+/**
+ * This method is like `_.find` except that it returns the index of the first
+ * element `predicate` returns truthy for instead of the element itself.
+ *
+ * @static
+ * @memberOf _
+ * @since 1.1.0
+ * @category Array
+ * @param {Array} array The array to inspect.
+ * @param {Function} [predicate=_.identity] The function invoked per iteration.
+ * @param {number} [fromIndex=0] The index to search from.
+ * @returns {number} Returns the index of the found element, else `-1`.
+ * @example
+ *
+ * var users = [
+ *   { 'user': 'barney',  'active': false },
+ *   { 'user': 'fred',    'active': false },
+ *   { 'user': 'pebbles', 'active': true }
+ * ];
+ *
+ * _.findIndex(users, function(o) { return o.user == 'barney'; });
+ * // => 0
+ *
+ * // The `_.matches` iteratee shorthand.
+ * _.findIndex(users, { 'user': 'fred', 'active': false });
+ * // => 1
+ *
+ * // The `_.matchesProperty` iteratee shorthand.
+ * _.findIndex(users, ['active', false]);
+ * // => 0
+ *
+ * // The `_.property` iteratee shorthand.
+ * _.findIndex(users, 'active');
+ * // => 2
+ */
+function findIndex(array, predicate, fromIndex) {
+  var length = array == null ? 0 : array.length;
+  if (!length) {
+    return -1;
+  }
+  var index = fromIndex == null ? 0 : toInteger(fromIndex);
+  if (index < 0) {
+    index = nativeMax$1(length + index, 0);
+  }
+  return baseFindIndex(array, baseIteratee(predicate), index);
+}
+
+var findIndex_1 = findIndex;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+
+var nativeCeil = Math.ceil,
+    nativeMax = Math.max;
+
+/**
+ * The base implementation of `_.range` and `_.rangeRight` which doesn't
+ * coerce arguments.
+ *
+ * @private
+ * @param {number} start The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} step The value to increment or decrement by.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Array} Returns the range of numbers.
+ */
+function baseRange$1(start, end, step, fromRight) {
+  var index = -1,
+      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
+      result = Array(length);
+
+  while (length--) {
+    result[fromRight ? length : ++index] = start;
+    start += step;
+  }
+  return result;
+}
+
+var _baseRange = baseRange$1;
+
+var eq = eq_1,
+    isArrayLike = isArrayLike_1,
+    isIndex = _isIndex,
+    isObject = isObject_1;
+
+/**
+ * Checks if the given arguments are from an iteratee call.
+ *
+ * @private
+ * @param {*} value The potential iteratee value argument.
+ * @param {*} index The potential iteratee index or key argument.
+ * @param {*} object The potential iteratee object argument.
+ * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
+ *  else `false`.
+ */
+function isIterateeCall$1(value, index, object) {
+  if (!isObject(object)) {
+    return false;
+  }
+  var type = typeof index;
+  if (type == 'number'
+        ? (isArrayLike(object) && isIndex(index, object.length))
+        : (type == 'string' && index in object)
+      ) {
+    return eq(object[index], value);
+  }
+  return false;
+}
+
+var _isIterateeCall = isIterateeCall$1;
+
+var baseRange = _baseRange,
+    isIterateeCall = _isIterateeCall,
+    toFinite = toFinite_1;
+
+/**
+ * Creates a `_.range` or `_.rangeRight` function.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new range function.
+ */
+function createRange$1(fromRight) {
+  return function(start, end, step) {
+    if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
+      end = step = undefined;
+    }
+    // Ensure the sign of `-0` is preserved.
+    start = toFinite(start);
+    if (end === undefined) {
+      end = start;
+      start = 0;
+    } else {
+      end = toFinite(end);
+    }
+    step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);
+    return baseRange(start, end, step, fromRight);
+  };
+}
+
+var _createRange = createRange$1;
+
+var createRange = _createRange;
+
+/**
+ * Creates an array of numbers (positive and/or negative) progressing from
+ * `start` up to, but not including, `end`. A step of `-1` is used if a negative
+ * `start` is specified without an `end` or `step`. If `end` is not specified,
+ * it's set to `start` with `start` then set to `0`.
+ *
+ * **Note:** JavaScript follows the IEEE-754 standard for resolving
+ * floating-point values which can produce unexpected results.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Util
+ * @param {number} [start=0] The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} [step=1] The value to increment or decrement by.
+ * @returns {Array} Returns the range of numbers.
+ * @see _.inRange, _.rangeRight
+ * @example
+ *
+ * _.range(4);
+ * // => [0, 1, 2, 3]
+ *
+ * _.range(-4);
+ * // => [0, -1, -2, -3]
+ *
+ * _.range(1, 5);
+ * // => [1, 2, 3, 4]
+ *
+ * _.range(0, 20, 5);
+ * // => [0, 5, 10, 15]
+ *
+ * _.range(0, -4, -1);
+ * // => [0, -1, -2, -3]
+ *
+ * _.range(1, 4, 0);
+ * // => [1, 1, 1]
+ *
+ * _.range(0);
+ * // => []
+ */
+var range = createRange();
+
+var range_1 = range;
+
+/**
+ * Hide items from main collection
+ * But keep them in store
+ */
+const trimmedPlugin = (store) => ({
+    set(k, newVal) {
+        switch (k) {
+            case 'trimmed':
+                const proxy = store.get('proxyItems');
+                const trimmed = gatherTrimmedItems(newVal);
+                const newItems = proxy.reduce((result, v) => {
+                    // check if present in new trimmed remove from items (filter)
+                    if (!trimmed[v]) {
+                        result.push(v);
+                    }
+                    return result;
+                }, []);
+                store.set('items', newItems);
+                break;
+        }
+    },
+});
+function gatherTrimmedItems(trimmedItems) {
+    const trimmed = {};
+    for (let trimmedKey in trimmedItems) {
+        // trimmed overweight not trimmed
+        for (let t in trimmedItems[trimmedKey]) {
+            trimmed[t] = trimmed[t] || trimmedItems[trimmedKey][t];
+        }
+    }
+    return trimmed;
+}
+
+/** Set stores data */
+function setStore(store, data) {
+    for (let key in data) {
+        store.set(key, data[key]);
+    }
+}
+
+/**
+ * Data store
+ * Manage the state of a data source and provide methods for updating, adding, and refreshing the data.
+ */
+class DataStore {
+    get store() {
+        return this.dataStore;
+    }
+    constructor(type, storeData) {
+        const store = (this.dataStore = createStore(Object.assign({ items: [], proxyItems: [], source: [], groupingDepth: 0, groups: {}, type, trimmed: {}, groupingCustomRenderer: undefined }, storeData)));
+        store.use(proxyPlugin(store));
+        store.use(trimmedPlugin(store));
+    }
+    /**
+     * full data source update
+     * @param source - data column/rgRow source
+     * @param grouping - grouping information if present
+     */
+    updateData(source, grouping, silent = false) {
+        // during full update we do drop trim
+        if (!silent) {
+            this.store.set('trimmed', {});
+        }
+        // clear items
+        this.store.set('items', []);
+        const items = range_1(0, (source === null || source === void 0 ? void 0 : source.length) || 0);
+        // set proxy first
+        setStore(this.store, {
+            source,
+            proxyItems: [...items],
+        });
+        // update data items
+        this.store.set('items', items);
+        // apply grouping if present
+        if (grouping) {
+            setStore(this.store, {
+                groupingDepth: grouping.depth,
+                groups: grouping.groups,
+                groupingCustomRenderer: grouping.customRenderer,
+            });
+        }
+    }
+    addTrimmed(some) {
+        let trimmed = this.store.get('trimmed');
+        trimmed = Object.assign(Object.assign({}, trimmed), some);
+        setStore(this.store, { trimmed });
+    }
+    // local data update
+    setData(input) {
+        const data = Object.assign({}, input);
+        setStore(this.store, data);
+    }
+    refresh() {
+        const source = this.store.get('source');
+        this.store.set('source', [...source]);
+    }
+}
+/**
+ * get physical index by virtual
+ * @param store - store to process
+ */
+function getPhysical(store, virtualIndex) {
+    const items = store.get('items');
+    return items[virtualIndex];
+}
+/**
+ * get all visible items
+ * @param store - store to process
+ */
+function getVisibleSourceItem(store) {
+    const source = store.get('source');
+    return store.get('items').map(v => source[v]);
+}
+/**
+ * get mapped item from source
+ * @param store - store to process
+ * @param virtualIndex - virtual index to process
+ */
+const getSourceItem = (store, virtualIndex) => {
+    const items = store.get('items');
+    const source = store.get('source');
+    return source[items[virtualIndex]];
+};
+/**
+ * Apple item/model/row value to data source
+ * @param store  - data source with changes
+ * @param modelByIndex - collection of rows/values with virtual indexes to setup/replace in store/data source
+ * @param mutate - if true, store will be mutated and whole viewport will be re-rendered
+ */
+function setSourceByVirtualIndex(store, modelByIndex, mutate = true) {
+    const items = store.get('items');
+    const source = store.get('source');
+    for (let virtualIndex in modelByIndex) {
+        const realIndex = items[virtualIndex];
+        source[realIndex] = modelByIndex[virtualIndex];
+    }
+    if (mutate) {
+        store.set('source', [...source]);
+    }
+}
+/**
+ * set item to source
+ * @param store  - store to process
+ * @param modelByIndex - collection of rows with physical indexes to setup
+ * @param mutate - if true, store will be mutated and whole viewport will be re-rendered
+ */
+function setSourceByPhysicalIndex(store, modelByIndex, mutate = true) {
+    const source = store.get('source');
+    for (let index in modelByIndex) {
+        source[index] = modelByIndex[index];
+    }
+    if (mutate) {
+        store.set('source', [...source]);
+    }
+}
+function setItems(store, items) {
+    store.set('items', items);
+}
+function getSourceItemVirtualIndexByProp(store, prop) {
+    const items = store.get('items');
+    const source = store.get('source');
+    const physicalIndex = findIndex_1(source, { prop });
+    return items.indexOf(physicalIndex);
+}
+
+export { DataStore as D, _isIterateeCall as _, getVisibleSourceItem as a, getSourceItem as b, setSourceByPhysicalIndex as c, setItems as d, getSourceItemVirtualIndexByProp as e, gatherTrimmedItems as f, getPhysical as g, createStore as h, setStore as i, findIndex_1 as j, toInteger_1 as k, proxyPlugin as p, range_1 as r, setSourceByVirtualIndex as s, trimmedPlugin as t };
+
+//# sourceMappingURL=data.store.js.map