lsp-grid 1.0.0

package/standalone/debounce.js

@@ -0,0 +1,215 @@
+/*!
+ * Built by LevelSkill.Pro
+ */
+import { r as root, t as toNumber, c as isObject } from './toNumber.js';
+
+/**
+ * Gets the timestamp of the number of milliseconds that have elapsed since
+ * the Unix epoch (1 January 1970 00:00:00 UTC).
+ *
+ * @static
+ * @memberOf _
+ * @since 2.4.0
+ * @category Date
+ * @returns {number} Returns the timestamp.
+ * @example
+ *
+ * _.defer(function(stamp) {
+ *   console.log(_.now() - stamp);
+ * }, _.now());
+ * // => Logs the number of milliseconds it took for the deferred invocation.
+ */
+var now = function() {
+  return root.Date.now();
+};
+
+/** Error message constants. */
+var FUNC_ERROR_TEXT = 'Expected a function';
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max,
+    nativeMin = Math.min;
+
+/**
+ * Creates a debounced function that delays invoking `func` until after `wait`
+ * milliseconds have elapsed since the last time the debounced function was
+ * invoked. The debounced function comes with a `cancel` method to cancel
+ * delayed `func` invocations and a `flush` method to immediately invoke them.
+ * Provide `options` to indicate whether `func` should be invoked on the
+ * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
+ * with the last arguments provided to the debounced function. Subsequent
+ * calls to the debounced function return the result of the last `func`
+ * invocation.
+ *
+ * **Note:** If `leading` and `trailing` options are `true`, `func` is
+ * invoked on the trailing edge of the timeout only if the debounced function
+ * is invoked more than once during the `wait` timeout.
+ *
+ * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+ * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+ *
+ * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+ * for details over the differences between `_.debounce` and `_.throttle`.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Function
+ * @param {Function} func The function to debounce.
+ * @param {number} [wait=0] The number of milliseconds to delay.
+ * @param {Object} [options={}] The options object.
+ * @param {boolean} [options.leading=false]
+ *  Specify invoking on the leading edge of the timeout.
+ * @param {number} [options.maxWait]
+ *  The maximum time `func` is allowed to be delayed before it's invoked.
+ * @param {boolean} [options.trailing=true]
+ *  Specify invoking on the trailing edge of the timeout.
+ * @returns {Function} Returns the new debounced function.
+ * @example
+ *
+ * // Avoid costly calculations while the window size is in flux.
+ * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+ *
+ * // Invoke `sendMail` when clicked, debouncing subsequent calls.
+ * jQuery(element).on('click', _.debounce(sendMail, 300, {
+ *   'leading': true,
+ *   'trailing': false
+ * }));
+ *
+ * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
+ * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
+ * var source = new EventSource('/stream');
+ * jQuery(source).on('message', debounced);
+ *
+ * // Cancel the trailing debounced invocation.
+ * jQuery(window).on('popstate', debounced.cancel);
+ */
+function debounce(func, wait, options) {
+  var lastArgs,
+      lastThis,
+      maxWait,
+      result,
+      timerId,
+      lastCallTime,
+      lastInvokeTime = 0,
+      leading = false,
+      maxing = false,
+      trailing = true;
+
+  if (typeof func != 'function') {
+    throw new TypeError(FUNC_ERROR_TEXT);
+  }
+  wait = toNumber(wait) || 0;
+  if (isObject(options)) {
+    leading = !!options.leading;
+    maxing = 'maxWait' in options;
+    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
+    trailing = 'trailing' in options ? !!options.trailing : trailing;
+  }
+
+  function invokeFunc(time) {
+    var args = lastArgs,
+        thisArg = lastThis;
+
+    lastArgs = lastThis = undefined;
+    lastInvokeTime = time;
+    result = func.apply(thisArg, args);
+    return result;
+  }
+
+  function leadingEdge(time) {
+    // Reset any `maxWait` timer.
+    lastInvokeTime = time;
+    // Start the timer for the trailing edge.
+    timerId = setTimeout(timerExpired, wait);
+    // Invoke the leading edge.
+    return leading ? invokeFunc(time) : result;
+  }
+
+  function remainingWait(time) {
+    var timeSinceLastCall = time - lastCallTime,
+        timeSinceLastInvoke = time - lastInvokeTime,
+        timeWaiting = wait - timeSinceLastCall;
+
+    return maxing
+      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
+      : timeWaiting;
+  }
+
+  function shouldInvoke(time) {
+    var timeSinceLastCall = time - lastCallTime,
+        timeSinceLastInvoke = time - lastInvokeTime;
+
+    // Either this is the first call, activity has stopped and we're at the
+    // trailing edge, the system time has gone backwards and we're treating
+    // it as the trailing edge, or we've hit the `maxWait` limit.
+    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||
+      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));
+  }
+
+  function timerExpired() {
+    var time = now();
+    if (shouldInvoke(time)) {
+      return trailingEdge(time);
+    }
+    // Restart the timer.
+    timerId = setTimeout(timerExpired, remainingWait(time));
+  }
+
+  function trailingEdge(time) {
+    timerId = undefined;
+
+    // Only invoke if we have `lastArgs` which means `func` has been
+    // debounced at least once.
+    if (trailing && lastArgs) {
+      return invokeFunc(time);
+    }
+    lastArgs = lastThis = undefined;
+    return result;
+  }
+
+  function cancel() {
+    if (timerId !== undefined) {
+      clearTimeout(timerId);
+    }
+    lastInvokeTime = 0;
+    lastArgs = lastCallTime = lastThis = timerId = undefined;
+  }
+
+  function flush() {
+    return timerId === undefined ? result : trailingEdge(now());
+  }
+
+  function debounced() {
+    var time = now(),
+        isInvoking = shouldInvoke(time);
+
+    lastArgs = arguments;
+    lastThis = this;
+    lastCallTime = time;
+
+    if (isInvoking) {
+      if (timerId === undefined) {
+        return leadingEdge(lastCallTime);
+      }
+      if (maxing) {
+        // Handle invocations in a tight loop.
+        clearTimeout(timerId);
+        timerId = setTimeout(timerExpired, wait);
+        return invokeFunc(lastCallTime);
+      }
+    }
+    if (timerId === undefined) {
+      timerId = setTimeout(timerExpired, wait);
+    }
+    return result;
+  }
+  debounced.cancel = cancel;
+  debounced.flush = flush;
+  return debounced;
+}
+
+export { debounce as d };
+//# sourceMappingURL=debounce.js.map
+
+//# sourceMappingURL=debounce.js.map

package/standalone/debounce.js.map

@@ -0,0 +1 @@
+{"file":"debounce.js","mappings":";;;;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,GAAG,GAAG,WAAW;AACrB,EAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;AACxB,CAAC;;AChBD;AACA,IAAI,eAAe,GAAG,qBAAqB;;AAE3C;AACA,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG;AACxB,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE;AACvC,EAAE,IAAI,QAAQ;AACd,MAAM,QAAQ;AACd,MAAM,OAAO;AACb,MAAM,MAAM;AACZ,MAAM,OAAO;AACb,MAAM,YAAY;AAClB,MAAM,cAAc,GAAG,CAAC;AACxB,MAAM,OAAO,GAAG,KAAK;AACrB,MAAM,MAAM,GAAG,KAAK;AACpB,MAAM,QAAQ,GAAG,IAAI;;AAErB,EAAE,IAAI,OAAO,IAAI,IAAI,UAAU,EAAE;AACjC,IAAI,MAAM,IAAI,SAAS,CAAC,eAAe,CAAC;AACxC;AACA,EAAE,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AAC5B,EAAE,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;AACzB,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO;AAC/B,IAAI,MAAM,GAAG,SAAS,IAAI,OAAO;AACjC,IAAI,OAAO,GAAG,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,GAAG,OAAO;AAChF,IAAI,QAAQ,GAAG,UAAU,IAAI,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,QAAQ;AACpE;;AAEA,EAAE,SAAS,UAAU,CAAC,IAAI,EAAE;AAC5B,IAAI,IAAI,IAAI,GAAG,QAAQ;AACvB,QAAQ,OAAO,GAAG,QAAQ;;AAE1B,IAAI,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACnC,IAAI,cAAc,GAAG,IAAI;AACzB,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC;AACtC,IAAI,OAAO,MAAM;AACjB;;AAEA,EAAE,SAAS,WAAW,CAAC,IAAI,EAAE;AAC7B;AACA,IAAI,cAAc,GAAG,IAAI;AACzB;AACA,IAAI,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC;AAC5C;AACA,IAAI,OAAO,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,MAAM;AAC9C;;AAEA,EAAE,SAAS,aAAa,CAAC,IAAI,EAAE;AAC/B,IAAI,IAAI,iBAAiB,GAAG,IAAI,GAAG,YAAY;AAC/C,QAAQ,mBAAmB,GAAG,IAAI,GAAG,cAAc;AACnD,QAAQ,WAAW,GAAG,IAAI,GAAG,iBAAiB;;AAE9C,IAAI,OAAO;AACX,QAAQ,SAAS,CAAC,WAAW,EAAE,OAAO,GAAG,mBAAmB;AAC5D,QAAQ,WAAW;AACnB;;AAEA,EAAE,SAAS,YAAY,CAAC,IAAI,EAAE;AAC9B,IAAI,IAAI,iBAAiB,GAAG,IAAI,GAAG,YAAY;AAC/C,QAAQ,mBAAmB,GAAG,IAAI,GAAG,cAAc;;AAEnD;AACA;AACA;AACA,IAAI,QAAQ,YAAY,KAAK,SAAS,KAAK,iBAAiB,IAAI,IAAI,CAAC;AACrE,OAAO,iBAAiB,GAAG,CAAC,CAAC,KAAK,MAAM,IAAI,mBAAmB,IAAI,OAAO,CAAC;AAC3E;;AAEA,EAAE,SAAS,YAAY,GAAG;AAC1B,IAAI,IAAI,IAAI,GAAG,GAAG,EAAE;AACpB,IAAI,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE;AAC5B,MAAM,OAAO,YAAY,CAAC,IAAI,CAAC;AAC/B;AACA;AACA,IAAI,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;AAC3D;;AAEA,EAAE,SAAS,YAAY,CAAC,IAAI,EAAE;AAC9B,IAAI,OAAO,GAAG,SAAS;;AAEvB;AACA;AACA,IAAI,IAAI,QAAQ,IAAI,QAAQ,EAAE;AAC9B,MAAM,OAAO,UAAU,CAAC,IAAI,CAAC;AAC7B;AACA,IAAI,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACnC,IAAI,OAAO,MAAM;AACjB;;AAEA,EAAE,SAAS,MAAM,GAAG;AACpB,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE;AAC/B,MAAM,YAAY,CAAC,OAAO,CAAC;AAC3B;AACA,IAAI,cAAc,GAAG,CAAC;AACtB,IAAI,QAAQ,GAAG,YAAY,GAAG,QAAQ,GAAG,OAAO,GAAG,SAAS;AAC5D;;AAEA,EAAE,SAAS,KAAK,GAAG;AACnB,IAAI,OAAO,OAAO,KAAK,SAAS,GAAG,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC;AAC/D;;AAEA,EAAE,SAAS,SAAS,GAAG;AACvB,IAAI,IAAI,IAAI,GAAG,GAAG,EAAE;AACpB,QAAQ,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC;;AAEvC,IAAI,QAAQ,GAAG,SAAS;AACxB,IAAI,QAAQ,GAAG,IAAI;AACnB,IAAI,YAAY,GAAG,IAAI;;AAEvB,IAAI,IAAI,UAAU,EAAE;AACpB,MAAM,IAAI,OAAO,KAAK,SAAS,EAAE;AACjC,QAAQ,OAAO,WAAW,CAAC,YAAY,CAAC;AACxC;AACA,MAAM,IAAI,MAAM,EAAE;AAClB;AACA,QAAQ,YAAY,CAAC,OAAO,CAAC;AAC7B,QAAQ,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC;AAChD,QAAQ,OAAO,UAAU,CAAC,YAAY,CAAC;AACvC;AACA;AACA,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE;AAC/B,MAAM,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC;AAC9C;AACA,IAAI,OAAO,MAAM;AACjB;AACA,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM;AAC3B,EAAE,SAAS,CAAC,KAAK,GAAG,KAAK;AACzB,EAAE,OAAO,SAAS;AAClB;;;;","names":[],"sources":["node_modules/lodash/now.js","node_modules/lodash/debounce.js"],"sourcesContent":["import root from './_root.js';\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nexport default now;\n","import isObject from './isObject.js';\nimport now from './now.js';\nimport toNumber from './toNumber.js';\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nexport default debounce;\n"],"version":3}

package/standalone/dimension.helpers.js

@@ -0,0 +1,229 @@
+/*!
+ * Built by LevelSkill.Pro
+ */
+import { a as isSymbol } from './toNumber.js';
+import { k as identity } from './data.store.js';
+
+/** Used as references for the maximum length and index of an array. */
+var MAX_ARRAY_LENGTH$1 = 4294967295,
+    MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH$1 - 1;
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeFloor = Math.floor,
+    nativeMin = Math.min;
+
+/**
+ * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
+ * which invokes `iteratee` for `value` and each element of `array` to compute
+ * their sort ranking. The iteratee is invoked with one argument; (value).
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {Function} iteratee The iteratee invoked per element.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
+ */
+function baseSortedIndexBy(array, value, iteratee, retHighest) {
+  var low = 0,
+      high = array == null ? 0 : array.length;
+  if (high === 0) {
+    return 0;
+  }
+
+  value = iteratee(value);
+  var valIsNaN = value !== value,
+      valIsNull = value === null,
+      valIsSymbol = isSymbol(value),
+      valIsUndefined = value === undefined;
+
+  while (low < high) {
+    var mid = nativeFloor((low + high) / 2),
+        computed = iteratee(array[mid]),
+        othIsDefined = computed !== undefined,
+        othIsNull = computed === null,
+        othIsReflexive = computed === computed,
+        othIsSymbol = isSymbol(computed);
+
+    if (valIsNaN) {
+      var setLow = othIsReflexive;
+    } else if (valIsUndefined) {
+      setLow = othIsReflexive && (othIsDefined);
+    } else if (valIsNull) {
+      setLow = othIsReflexive && othIsDefined && (!othIsNull);
+    } else if (valIsSymbol) {
+      setLow = othIsReflexive && othIsDefined && !othIsNull && (!othIsSymbol);
+    } else if (othIsNull || othIsSymbol) {
+      setLow = false;
+    } else {
+      setLow = (computed < value);
+    }
+    if (setLow) {
+      low = mid + 1;
+    } else {
+      high = mid;
+    }
+  }
+  return nativeMin(high, MAX_ARRAY_INDEX);
+}
+
+/** Used as references for the maximum length and index of an array. */
+var MAX_ARRAY_LENGTH = 4294967295,
+    HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+
+/**
+ * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
+ * performs a binary search of `array` to determine the index at which `value`
+ * should be inserted into `array` in order to maintain its sort order.
+ *
+ * @private
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @param {boolean} [retHighest] Specify returning the highest qualified index.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
+ */
+function baseSortedIndex(array, value, retHighest) {
+  var low = 0,
+      high = array == null ? low : array.length;
+
+  if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
+    while (low < high) {
+      var mid = (low + high) >>> 1,
+          computed = array[mid];
+
+      if (computed !== null && !isSymbol(computed) &&
+          ((computed < value))) {
+        low = mid + 1;
+      } else {
+        high = mid;
+      }
+    }
+    return high;
+  }
+  return baseSortedIndexBy(array, value, identity);
+}
+
+/**
+ * Uses a binary search to determine the lowest index at which `value`
+ * should be inserted into `array` in order to maintain its sort order.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Array
+ * @param {Array} array The sorted array to inspect.
+ * @param {*} value The value to evaluate.
+ * @returns {number} Returns the index at which `value` should be inserted
+ *  into `array`.
+ * @example
+ *
+ * _.sortedIndex([30, 50], 40);
+ * // => 1
+ */
+function sortedIndex(array, value) {
+  return baseSortedIndex(array, value);
+}
+
+/**
+ * Pre-calculation
+ * Dimension custom sizes for each cell
+ * Keeps only changed sizes, skips origin size
+ */
+function calculateDimensionData(originItemSize, newSizes = {}) {
+    const positionIndexes = [];
+    const positionIndexToItem = {};
+    const indexToItem = {};
+    // prepare order sorted new sizes and calculate changed real size
+    const newIndexes = Object.keys(newSizes).map(Number).sort((a, b) => a - b);
+    let previous;
+    for (let i = 0; i < newIndexes.length; i++) {
+        const itemIndex = newIndexes[i];
+        const newItem = {
+            itemIndex,
+            start: 0,
+            end: 0,
+        };
+        // if previous item was changed too
+        if (previous) {
+            const itemsBetween = (itemIndex - previous.itemIndex - 1) * originItemSize;
+            newItem.start = itemsBetween + previous.end;
+        }
+        else {
+            newItem.start = itemIndex * originItemSize;
+        }
+        newItem.end = newItem.start + newSizes[itemIndex];
+        positionIndexes.push(newItem.start);
+        indexToItem[itemIndex] = positionIndexToItem[i] = newItem;
+        previous = newItem;
+    }
+    return {
+        indexes: newIndexes,
+        positionIndexes: [...positionIndexes],
+        positionIndexToItem: Object.assign({}, positionIndexToItem),
+        indexToItem,
+    };
+}
+/**
+ * Calculate item by position
+ */
+const getItemByPosition = ({ indexes, positionIndexes, originItemSize, positionIndexToItem, }, pos) => {
+    const item = {
+        itemIndex: 0,
+        start: 0,
+        end: 0,
+    };
+    const currentPlace = indexes.length ? sortedIndex(positionIndexes, pos) : 0;
+    // not found or first index
+    if (!currentPlace) {
+        item.itemIndex = Math.floor(pos / originItemSize);
+        item.start = item.itemIndex * originItemSize;
+        item.end = item.start + originItemSize;
+        return item;
+    }
+    const positionItem = positionIndexToItem[currentPlace - 1];
+    // if item has specified size
+    if (positionItem.end > pos) {
+        return positionItem;
+    }
+    // special size item was present before
+    const relativePos = pos - positionItem.end;
+    const relativeIndex = Math.floor(relativePos / originItemSize);
+    item.itemIndex = positionItem.itemIndex + 1 + relativeIndex;
+    item.start = positionItem.end + relativeIndex * originItemSize;
+    item.end = item.start + originItemSize;
+    return item;
+};
+function getItemByIndex(dimension, index) {
+    let item = {
+        itemIndex: index,
+        start: 0,
+        end: 0,
+    };
+    // if item has specified size
+    if (dimension.indexToItem[index]) {
+        return dimension.indexToItem[index];
+    }
+    const currentPlace = dimension.indexes.length
+        ? sortedIndex(dimension.indexes, index)
+        : 0;
+    // not found or first index
+    if (!currentPlace) {
+        item.start = item.itemIndex * dimension.originItemSize;
+        item.end = item.start + dimension.originItemSize;
+        return item;
+    }
+    // special size item was present before
+    const positionItem = dimension.indexToItem[dimension.indexes[currentPlace - 1]];
+    item.start =
+        positionItem.end +
+            (index - positionItem.itemIndex - 1) * dimension.originItemSize;
+    item.end = item.start + dimension.originItemSize;
+    return item;
+}
+
+export { getItemByIndex as a, calculateDimensionData as c, getItemByPosition as g };
+//# sourceMappingURL=dimension.helpers.js.map
+
+//# sourceMappingURL=dimension.helpers.js.map

package/standalone/dimension.helpers.js.map

@@ -0,0 +1 @@
+{"file":"dimension.helpers.js","mappings":";;;;;;AAEA;AACA,IAAIA,kBAAgB,GAAG,UAAU;AACjC,IAAI,eAAe,GAAGA,kBAAgB,GAAG,CAAC;;AAE1C;AACA,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK;AAC5B,IAAI,SAAS,GAAG,IAAI,CAAC,GAAG;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE;AAC/D,EAAE,IAAI,GAAG,GAAG,CAAC;AACb,MAAM,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM;AAC7C,EAAE,IAAI,IAAI,KAAK,CAAC,EAAE;AAClB,IAAI,OAAO,CAAC;AACZ;;AAEA,EAAE,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;AACzB,EAAE,IAAI,QAAQ,GAAG,KAAK,KAAK,KAAK;AAChC,MAAM,SAAS,GAAG,KAAK,KAAK,IAAI;AAChC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC;AACnC,MAAM,cAAc,GAAG,KAAK,KAAK,SAAS;;AAE1C,EAAE,OAAO,GAAG,GAAG,IAAI,EAAE;AACrB,IAAI,IAAI,GAAG,GAAG,WAAW,CAAC,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC;AAC3C,QAAQ,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AACvC,QAAQ,YAAY,GAAG,QAAQ,KAAK,SAAS;AAC7C,QAAQ,SAAS,GAAG,QAAQ,KAAK,IAAI;AACrC,QAAQ,cAAc,GAAG,QAAQ,KAAK,QAAQ;AAC9C,QAAQ,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC;;AAExC,IAAI,IAAI,QAAQ,EAAE;AAClB,MAAM,IAAI,MAAM,GAAiB,cAAc;AAC/C,KAAK,MAAM,IAAI,cAAc,EAAE;AAC/B,MAAM,MAAM,GAAG,cAAc,KAAmB,YAAY,CAAC;AAC7D,KAAK,MAAM,IAAI,SAAS,EAAE;AAC1B,MAAM,MAAM,GAAG,cAAc,IAAI,YAAY,KAAmB,CAAC,SAAS,CAAC;AAC3E,KAAK,MAAM,IAAI,WAAW,EAAE;AAC5B,MAAM,MAAM,GAAG,cAAc,IAAI,YAAY,IAAI,CAAC,SAAS,KAAmB,CAAC,WAAW,CAAC;AAC3F,KAAK,MAAM,IAAI,SAAS,IAAI,WAAW,EAAE;AACzC,MAAM,MAAM,GAAG,KAAK;AACpB,KAAK,MAAM;AACX,MAAM,MAAM,GAAsC,CAAC,QAAQ,GAAG,KAAK,CAAC;AACpE;AACA,IAAI,IAAI,MAAM,EAAE;AAChB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC;AACnB,KAAK,MAAM;AACX,MAAM,IAAI,GAAG,GAAG;AAChB;AACA;AACA,EAAE,OAAO,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC;AACzC;;AC5DA;AACA,IAAI,gBAAgB,GAAG,UAAU;AACjC,IAAI,qBAAqB,GAAG,gBAAgB,KAAK,CAAC;;AAElD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,eAAe,CAAC,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE;AACnD,EAAE,IAAI,GAAG,GAAG,CAAC;AACb,MAAM,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC,MAAM;;AAE/C,EAAE,IAAI,OAAO,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,KAAK,IAAI,IAAI,IAAI,qBAAqB,EAAE;AACpF,IAAI,OAAO,GAAG,GAAG,IAAI,EAAE;AACvB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,MAAM,CAAC;AAClC,UAAU,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC;;AAE/B,MAAM,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;AAClD,WAA8C,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,EAAE;AACnE,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;AACrB,OAAO,MAAM;AACb,QAAQ,IAAI,GAAG,GAAG;AAClB;AACA;AACA,IAAI,OAAO,IAAI;AACf;AACA,EAAE,OAAO,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAoB,CAAC;AAC9D;;ACrCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE;AACnC,EAAE,OAAO,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;AACtC;;ACIA;;;;AAIG;SACa,sBAAsB,CACpC,cAAsB,EACtB,WAAgC,EAAE,EAAA;IAElC,MAAM,eAAe,GAAa,EAAE;IACpC,MAAM,mBAAmB,GAAyC,EAAE;IACpE,MAAM,WAAW,GAAsC,EAAE;;IAGzD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAC1E,IAAA,IAAI,QAAkC;AACtC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC1C,QAAA,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC;AAC/B,QAAA,MAAM,OAAO,GAAiB;YAC5B,SAAS;AACT,YAAA,KAAK,EAAE,CAAC;AACR,YAAA,GAAG,EAAE,CAAC;SACP;;QAED,IAAI,QAAQ,EAAE;AACZ,YAAA,MAAM,YAAY,GAChB,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,GAAG,CAAC,IAAI,cAAc;YACvD,OAAO,CAAC,KAAK,GAAG,YAAY,GAAG,QAAQ,CAAC,GAAG;;aACtC;AACL,YAAA,OAAO,CAAC,KAAK,GAAG,SAAS,GAAG,cAAc;;QAE5C,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC;AACjD,QAAA,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACnC,WAAW,CAAC,SAAS,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,GAAG,OAAO;QACzD,QAAQ,GAAG,OAAO;;IAEpB,OAAO;AACL,QAAA,OAAO,EAAE,UAAU;AACnB,QAAA,eAAe,EAAE,CAAC,GAAG,eAAe,CAAC;QACrC,mBAAmB,EAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAO,mBAAmB,CAAE;QAC/C,WAAW;KACZ;AACH;AAEA;;AAEG;AACU,MAAA,iBAAiB,GAAG,CAC/B,EACE,OAAO,EACP,eAAe,EACf,cAAc,EACd,mBAAmB,GAC+E,EACpG,GAAW,KACT;AACF,IAAA,MAAM,IAAI,GAAiB;AACzB,QAAA,SAAS,EAAE,CAAC;AACZ,QAAA,KAAK,EAAE,CAAC;AACR,QAAA,GAAG,EAAE,CAAC;KACP;AACD,IAAA,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,GAAG,WAAW,CAAC,eAAe,EAAE,GAAG,CAAC,GAAG,CAAC;;IAE3E,IAAI,CAAC,YAAY,EAAE;QACjB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,cAAc,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,cAAc;QAC5C,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,cAAc;AACtC,QAAA,OAAO,IAAI;;IAEb,MAAM,YAAY,GAAG,mBAAmB,CAAC,YAAY,GAAG,CAAC,CAAC;;AAE1D,IAAA,IAAI,YAAY,CAAC,GAAG,GAAG,GAAG,EAAE;AAC1B,QAAA,OAAO,YAAY;;;AAGrB,IAAA,MAAM,WAAW,GAAG,GAAG,GAAG,YAAY,CAAC,GAAG;IAC1C,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,cAAc,CAAC;IAC9D,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC,SAAS,GAAG,CAAC,GAAG,aAAa;IAC3D,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,GAAG,aAAa,GAAG,cAAc;IAC9D,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,cAAc;AACtC,IAAA,OAAO,IAAI;AACb;AAEgB,SAAA,cAAc,CAC5B,SAGC,EACD,KAAa,EAAA;AAEb,IAAA,IAAI,IAAI,GAAiB;AACvB,QAAA,SAAS,EAAE,KAAK;AAChB,QAAA,KAAK,EAAE,CAAC;AACR,QAAA,GAAG,EAAE,CAAC;KACP;;AAED,IAAA,IAAI,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE;AAChC,QAAA,OAAO,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC;;AAGrC,IAAA,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC;UACnC,WAAW,CAAC,SAAS,CAAC,OAAO,EAAE,KAAK;UACpC,CAAC;;IAEL,IAAI,CAAC,YAAY,EAAE;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,cAAc;QACtD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,cAAc;AAChD,QAAA,OAAO,IAAI;;;AAGb,IAAA,MAAM,YAAY,GAChB,SAAS,CAAC,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;AAC5D,IAAA,IAAI,CAAC,KAAK;AACR,QAAA,YAAY,CAAC,GAAG;AAChB,YAAA,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS,GAAG,CAAC,IAAI,SAAS,CAAC,cAAc;IACjE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,cAAc;AAChD,IAAA,OAAO,IAAI;AACb;;;;","names":["MAX_ARRAY_LENGTH"],"sources":["node_modules/lodash/_baseSortedIndexBy.js","node_modules/lodash/_baseSortedIndex.js","node_modules/lodash/sortedIndex.js","src/store/dimension/dimension.helpers.ts"],"sourcesContent":["import isSymbol from './isSymbol.js';\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295,\n    MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeFloor = Math.floor,\n    nativeMin = Math.min;\n\n/**\n * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n * which invokes `iteratee` for `value` and each element of `array` to compute\n * their sort ranking. The iteratee is invoked with one argument; (value).\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {Function} iteratee The iteratee invoked per element.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n */\nfunction baseSortedIndexBy(array, value, iteratee, retHighest) {\n  var low = 0,\n      high = array == null ? 0 : array.length;\n  if (high === 0) {\n    return 0;\n  }\n\n  value = iteratee(value);\n  var valIsNaN = value !== value,\n      valIsNull = value === null,\n      valIsSymbol = isSymbol(value),\n      valIsUndefined = value === undefined;\n\n  while (low < high) {\n    var mid = nativeFloor((low + high) / 2),\n        computed = iteratee(array[mid]),\n        othIsDefined = computed !== undefined,\n        othIsNull = computed === null,\n        othIsReflexive = computed === computed,\n        othIsSymbol = isSymbol(computed);\n\n    if (valIsNaN) {\n      var setLow = retHighest || othIsReflexive;\n    } else if (valIsUndefined) {\n      setLow = othIsReflexive && (retHighest || othIsDefined);\n    } else if (valIsNull) {\n      setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n    } else if (valIsSymbol) {\n      setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n    } else if (othIsNull || othIsSymbol) {\n      setLow = false;\n    } else {\n      setLow = retHighest ? (computed <= value) : (computed < value);\n    }\n    if (setLow) {\n      low = mid + 1;\n    } else {\n      high = mid;\n    }\n  }\n  return nativeMin(high, MAX_ARRAY_INDEX);\n}\n\nexport default baseSortedIndexBy;\n","import baseSortedIndexBy from './_baseSortedIndexBy.js';\nimport identity from './identity.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for the maximum length and index of an array. */\nvar MAX_ARRAY_LENGTH = 4294967295,\n    HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n/**\n * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n * performs a binary search of `array` to determine the index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @private\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @param {boolean} [retHighest] Specify returning the highest qualified index.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n */\nfunction baseSortedIndex(array, value, retHighest) {\n  var low = 0,\n      high = array == null ? low : array.length;\n\n  if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n    while (low < high) {\n      var mid = (low + high) >>> 1,\n          computed = array[mid];\n\n      if (computed !== null && !isSymbol(computed) &&\n          (retHighest ? (computed <= value) : (computed < value))) {\n        low = mid + 1;\n      } else {\n        high = mid;\n      }\n    }\n    return high;\n  }\n  return baseSortedIndexBy(array, value, identity, retHighest);\n}\n\nexport default baseSortedIndex;\n","import baseSortedIndex from './_baseSortedIndex.js';\n\n/**\n * Uses a binary search to determine the lowest index at which `value`\n * should be inserted into `array` in order to maintain its sort order.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The sorted array to inspect.\n * @param {*} value The value to evaluate.\n * @returns {number} Returns the index at which `value` should be inserted\n *  into `array`.\n * @example\n *\n * _.sortedIndex([30, 50], 40);\n * // => 1\n */\nfunction sortedIndex(array, value) {\n  return baseSortedIndex(array, value);\n}\n\nexport default sortedIndex;\n","import sortedIndex from 'lodash/sortedIndex';\r\n\r\nimport type {\r\n  DimensionSettingsState,\r\n  PositionItem,\r\n  ViewSettingSizeProp,\r\n} from '@type';\r\n\r\nexport type DimensionPosition = Pick<\r\n  DimensionSettingsState,\r\n  'indexes' | 'positionIndexes' | 'originItemSize' | 'positionIndexToItem'\r\n>;\r\nexport type DimensionIndexInput = Pick<\r\n  DimensionSettingsState,\r\n  'indexes' | 'originItemSize' | 'indexToItem'\r\n>;\r\nexport type DimensionSize = Pick<\r\n  DimensionSettingsState,\r\n  | 'indexes'\r\n  | 'positionIndexes'\r\n  | 'positionIndexToItem'\r\n  | 'indexToItem'\r\n  | 'realSize'\r\n  | 'sizes'\r\n>;\r\n/**\r\n * Pre-calculation\r\n * Dimension custom sizes for each cell\r\n * Keeps only changed sizes, skips origin size\r\n */\r\nexport function calculateDimensionData(\r\n  originItemSize: number,\r\n  newSizes: ViewSettingSizeProp = {},\r\n) {\r\n  const positionIndexes: number[] = [];\r\n  const positionIndexToItem: { [position: number]: PositionItem } = {};\r\n  const indexToItem: { [index: number]: PositionItem } = {};\r\n\r\n  // prepare order sorted new sizes and calculate changed real size\r\n  const newIndexes = Object.keys(newSizes).map(Number).sort((a, b) => a - b);\r\n  let previous: PositionItem | undefined;\r\n  for (let i = 0; i < newIndexes.length; i++) {\r\n    const itemIndex = newIndexes[i];\r\n    const newItem: PositionItem = {\r\n      itemIndex,\r\n      start: 0,\r\n      end: 0,\r\n    };\r\n    // if previous item was changed too\r\n    if (previous) {\r\n      const itemsBetween =\r\n        (itemIndex - previous.itemIndex - 1) * originItemSize;\r\n      newItem.start = itemsBetween + previous.end;\r\n    } else {\r\n      newItem.start = itemIndex * originItemSize;\r\n    }\r\n    newItem.end = newItem.start + newSizes[itemIndex];\r\n    positionIndexes.push(newItem.start);\r\n    indexToItem[itemIndex] = positionIndexToItem[i] = newItem;\r\n    previous = newItem;\r\n  }\r\n  return {\r\n    indexes: newIndexes,\r\n    positionIndexes: [...positionIndexes],\r\n    positionIndexToItem: { ...positionIndexToItem },\r\n    indexToItem,\r\n  };\r\n}\r\n\r\n/**\r\n * Calculate item by position\r\n */\r\nexport const getItemByPosition = (\r\n  {\r\n    indexes,\r\n    positionIndexes,\r\n    originItemSize,\r\n    positionIndexToItem,\r\n  }: Pick<DimensionPosition, 'indexes' | 'positionIndexes' | 'originItemSize' | 'positionIndexToItem'>,\r\n  pos: number,\r\n) => {\r\n  const item: PositionItem = {\r\n    itemIndex: 0,\r\n    start: 0,\r\n    end: 0,\r\n  };\r\n  const currentPlace = indexes.length ? sortedIndex(positionIndexes, pos) : 0;\r\n  // not found or first index\r\n  if (!currentPlace) {\r\n    item.itemIndex = Math.floor(pos / originItemSize);\r\n    item.start = item.itemIndex * originItemSize;\r\n    item.end = item.start + originItemSize;\r\n    return item;\r\n  }\r\n  const positionItem = positionIndexToItem[currentPlace - 1];\r\n  // if item has specified size\r\n  if (positionItem.end > pos) {\r\n    return positionItem;\r\n  }\r\n  // special size item was present before\r\n  const relativePos = pos - positionItem.end;\r\n  const relativeIndex = Math.floor(relativePos / originItemSize);\r\n  item.itemIndex = positionItem.itemIndex + 1 + relativeIndex;\r\n  item.start = positionItem.end + relativeIndex * originItemSize;\r\n  item.end = item.start + originItemSize;\r\n  return item;\r\n};\r\n\r\nexport function getItemByIndex(\r\n  dimension: Pick<\r\n    DimensionIndexInput,\r\n    'indexToItem' | 'indexes' | 'originItemSize'\r\n  >,\r\n  index: number,\r\n) {\r\n  let item: PositionItem = {\r\n    itemIndex: index,\r\n    start: 0,\r\n    end: 0,\r\n  };\r\n  // if item has specified size\r\n  if (dimension.indexToItem[index]) {\r\n    return dimension.indexToItem[index];\r\n  }\r\n\r\n  const currentPlace = dimension.indexes.length\r\n    ? sortedIndex(dimension.indexes, index)\r\n    : 0;\r\n  // not found or first index\r\n  if (!currentPlace) {\r\n    item.start = item.itemIndex * dimension.originItemSize;\r\n    item.end = item.start + dimension.originItemSize;\r\n    return item;\r\n  }\r\n  // special size item was present before\r\n  const positionItem =\r\n    dimension.indexToItem[dimension.indexes[currentPlace - 1]];\r\n  item.start =\r\n    positionItem.end +\r\n    (index - positionItem.itemIndex - 1) * dimension.originItemSize;\r\n  item.end = item.start + dimension.originItemSize;\r\n  return item;\r\n}\r\n"],"version":3}

package/standalone/filter.button.js

@@ -0,0 +1,39 @@
+/*!
+ * Built by LevelSkill.Pro
+ */
+import { h } from '@stencil/core/internal/client';
+
+const FILTER_BUTTON_CLASS = 'rv-filter';
+const FILTER_BUTTON_ACTIVE = 'active';
+const FILTER_PROP = 'hasFilter';
+const AND_OR_BUTTON = 'and-or-button';
+const TRASH_BUTTON = 'trash-button';
+const FilterButton = ({ column }) => {
+    return (h("span", null,
+        h("button", { class: {
+                [FILTER_BUTTON_CLASS]: true,
+                [FILTER_BUTTON_ACTIVE]: column && !!column[FILTER_PROP],
+            } },
+            h("svg", { class: "filter-img", viewBox: "0 0 64 64" },
+                h("g", { stroke: "none", "stroke-width": "1", fill: "none", "fill-rule": "evenodd" },
+                    h("path", { d: "M43,48 L43,56 L21,56 L21,48 L43,48 Z M53,28 L53,36 L12,36 L12,28 L53,28 Z M64,8 L64,16 L0,16 L0,8 L64,8 Z", fill: "currentColor" }))))));
+};
+const TrashButton = () => {
+    return (h("div", { class: { [TRASH_BUTTON]: true } },
+        h("svg", { class: "trash-img", viewBox: "0 0 24 24" },
+            h("path", { fill: "currentColor", d: "M9,3V4H4V6H5V19A2,2 0 0,0 7,21H17A2,2 0 0,0 19,19V6H20V4H15V3H9M7,6H17V19H7V6M9,8V17H11V8H9M13,8V17H15V8H13Z" }))));
+};
+const AndOrButton = ({ text }) => {
+    return h("button", { class: { [AND_OR_BUTTON]: true, 'light revo-button': true } }, text);
+};
+function isFilterBtn(e) {
+    if (e.classList.contains(FILTER_BUTTON_CLASS)) {
+        return true;
+    }
+    return e === null || e === void 0 ? void 0 : e.closest(`.${FILTER_BUTTON_CLASS}`);
+}
+
+export { AND_OR_BUTTON as A, FILTER_BUTTON_CLASS as F, TRASH_BUTTON as T, FILTER_BUTTON_ACTIVE as a, FILTER_PROP as b, FilterButton as c, TrashButton as d, AndOrButton as e, isFilterBtn as i };
+//# sourceMappingURL=filter.button.js.map
+
+//# sourceMappingURL=filter.button.js.map

package/standalone/filter.button.js.map

@@ -0,0 +1 @@
+{"file":"filter.button.js","mappings":";;;;;AAGO,MAAM,mBAAmB,GAAG;AAC5B,MAAM,oBAAoB,GAAG;AAE7B,MAAM,WAAW,GAAG;AACpB,MAAM,aAAa,GAAG;AACtB,MAAM,YAAY,GAAG;MAKf,YAAY,GAAG,CAAC,EAAE,MAAM,EAAS,KAAI;AAChD,IAAA,QACE,CAAA,CAAA,MAAA,EAAA,IAAA;AACE,QAAA,CAAA,CAAA,QAAA,EAAA,EACE,KAAK,EAAE;gBACL,CAAC,mBAAmB,GAAG,IAAI;gBAC3B,CAAC,oBAAoB,GAAG,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC;AACxD,aAAA,EAAA;AAED,YAAA,CAAA,CAAA,KAAA,EAAA,EAAK,KAAK,EAAC,YAAY,EAAC,OAAO,EAAC,WAAW,EAAA;gBACzC,CAAG,CAAA,GAAA,EAAA,EAAA,MAAM,EAAC,MAAM,EAAc,cAAA,EAAA,GAAG,EAAC,IAAI,EAAC,MAAM,EAAA,WAAA,EAAW,SAAS,EAAA;AAC/D,oBAAA,CAAA,CAAA,MAAA,EAAA,EAAM,CAAC,EAAC,2GAA2G,EAAC,IAAI,EAAC,cAAc,EAAA,CAAQ,CAC7I,CACA,CACC,CACJ;AAEX;AAEO,MAAM,WAAW,GAAG,MAAK;IAC9B,QACE,CAAK,CAAA,KAAA,EAAA,EAAA,KAAK,EAAE,EAAE,CAAC,YAAY,GAAG,IAAI,EAAE,EAAA;AAClC,QAAA,CAAA,CAAA,KAAA,EAAA,EAAK,KAAK,EAAC,WAAW,EAAC,OAAO,EAAC,WAAW,EAAA;YACxC,CAAM,CAAA,MAAA,EAAA,EAAA,IAAI,EAAC,cAAc,EAAC,CAAC,EAAC,8GAA8G,EAAG,CAAA,CACzI,CACF;AAEV;MACa,WAAW,GAAG,CAAC,EAAE,IAAI,EAAO,KAAI;AAC3C,IAAA,OAAO,cAAQ,KAAK,EAAE,EAAE,CAAC,aAAa,GAAG,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,EAAG,EAAA,IAAI,CAAU;AAC7F;AAEM,SAAU,WAAW,CAAC,CAAc,EAAA;IACxC,IAAI,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EAAE;AAC7C,QAAA,OAAO,IAAI;;AAEb,IAAA,OAAO,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,OAAO,CAAC,CAAI,CAAA,EAAA,mBAAmB,CAAE,CAAA,CAAC;AAC9C;;;;","names":[],"sources":["src/plugins/filter/filter.button.tsx"],"sourcesContent":["import { h } from '@stencil/core';\r\nimport { ColumnRegular } from '@type';\r\n\r\nexport const FILTER_BUTTON_CLASS = 'rv-filter';\r\nexport const FILTER_BUTTON_ACTIVE = 'active';\r\n\r\nexport const FILTER_PROP = 'hasFilter';\r\nexport const AND_OR_BUTTON = 'and-or-button';\r\nexport const TRASH_BUTTON = 'trash-button';\r\n\r\ntype Props = {\r\n  column: ColumnRegular;\r\n};\r\nexport const FilterButton = ({ column }: Props) => {\r\n  return (\r\n    <span>\r\n      <button\r\n        class={{\r\n          [FILTER_BUTTON_CLASS]: true,\r\n          [FILTER_BUTTON_ACTIVE]: column && !!column[FILTER_PROP],\r\n        }}\r\n      >\r\n        <svg class=\"filter-img\" viewBox=\"0 0 64 64\">\r\n          <g stroke=\"none\" stroke-width=\"1\" fill=\"none\" fill-rule=\"evenodd\">\r\n            <path d=\"M43,48 L43,56 L21,56 L21,48 L43,48 Z M53,28 L53,36 L12,36 L12,28 L53,28 Z M64,8 L64,16 L0,16 L0,8 L64,8 Z\" fill=\"currentColor\"></path>\r\n          </g>\r\n        </svg>\r\n      </button>\r\n    </span>\r\n  );\r\n};\r\n\r\nexport const TrashButton = () => {\r\n  return (\r\n    <div class={{ [TRASH_BUTTON]: true }}>\r\n      <svg class=\"trash-img\" viewBox=\"0 0 24 24\">\r\n        <path fill=\"currentColor\" d=\"M9,3V4H4V6H5V19A2,2 0 0,0 7,21H17A2,2 0 0,0 19,19V6H20V4H15V3H9M7,6H17V19H7V6M9,8V17H11V8H9M13,8V17H15V8H13Z\" />\r\n      </svg>\r\n    </div>\r\n  );\r\n};\r\nexport const AndOrButton = ({ text }: any) => {\r\n  return <button class={{ [AND_OR_BUTTON]: true, 'light revo-button': true }}>{text}</button>;\r\n};\r\n\r\nexport function isFilterBtn(e: HTMLElement) {\r\n  if (e.classList.contains(FILTER_BUTTON_CLASS)) {\r\n    return true;\r\n  }\r\n  return e?.closest(`.${FILTER_BUTTON_CLASS}`);\r\n}\r\n"],"version":3}

package/standalone/index.d.ts

@@ -0,0 +1,68 @@
+/* RevoGrid custom elements */
+export { RevoGridComponent as RevoGrid } from '../dist/types/components/revoGrid/revo-grid';
+export { defineCustomElement as defineCustomElementRevoGrid } from './revo-grid';
+export { Attribution as RevogrAttribution } from '../dist/types/components/attribution/revogr-attribution';
+export { defineCustomElement as defineCustomElementRevogrAttribution } from './revogr-attribution';
+export { Clipboard as RevogrClipboard } from '../dist/types/components/clipboard/revogr-clipboard';
+export { defineCustomElement as defineCustomElementRevogrClipboard } from './revogr-clipboard';
+export { RevogrData as RevogrData } from '../dist/types/components/data/revogr-data';
+export { defineCustomElement as defineCustomElementRevogrData } from './revogr-data';
+export { RevoEdit as RevogrEdit } from '../dist/types/components/editors/revogr-edit';
+export { defineCustomElement as defineCustomElementRevogrEdit } from './revogr-edit';
+export { RevoGridExtra as RevogrExtra } from '../dist/types/components/extra/revogr-extra';
+export { defineCustomElement as defineCustomElementRevogrExtra } from './revogr-extra';
+export { FilterPanel as RevogrFilterPanel } from '../dist/types/plugins/filter/filter.panel';
+export { defineCustomElement as defineCustomElementRevogrFilterPanel } from './revogr-filter-panel';
+export { RevogrFocus as RevogrFocus } from '../dist/types/components/selectionFocus/revogr-focus';
+export { defineCustomElement as defineCustomElementRevogrFocus } from './revogr-focus';
+export { RevogrHeaderComponent as RevogrHeader } from '../dist/types/components/header/revogr-header';
+export { defineCustomElement as defineCustomElementRevogrHeader } from './revogr-header';
+export { OrderEditor as RevogrOrderEditor } from '../dist/types/components/order/revogr-order-editor';
+export { defineCustomElement as defineCustomElementRevogrOrderEditor } from './revogr-order-editor';
+export { OverlaySelection as RevogrOverlaySelection } from '../dist/types/components/overlay/revogr-overlay-selection';
+export { defineCustomElement as defineCustomElementRevogrOverlaySelection } from './revogr-overlay-selection';
+export { RevogrRowHeaders as RevogrRowHeaders } from '../dist/types/components/rowHeaders/revogr-row-headers';
+export { defineCustomElement as defineCustomElementRevogrRowHeaders } from './revogr-row-headers';
+export { RevogrScrollVirtual as RevogrScrollVirtual } from '../dist/types/components/scrollable/revogr-scroll-virtual';
+export { defineCustomElement as defineCustomElementRevogrScrollVirtual } from './revogr-scroll-virtual';
+export { RevogrFocus as RevogrTempRange } from '../dist/types/components/selectionTempRange/revogr-temp-range';
+export { defineCustomElement as defineCustomElementRevogrTempRange } from './revogr-temp-range';
+export { RevogrViewportScroll as RevogrViewportScroll } from '../dist/types/components/scroll/revogr-viewport-scroll';
+export { defineCustomElement as defineCustomElementRevogrViewportScroll } from './revogr-viewport-scroll';
+export { VNodeToHtml as VnodeHtml } from '../dist/types/components/vnode/vnode-converter';
+export { defineCustomElement as defineCustomElementVnodeHtml } from './vnode-html';
+
+/**
+ * Get the base path to where the assets can be found. Use "setAssetPath(path)"
+ * if the path needs to be customized.
+ */
+export declare const getAssetPath: (path: string) => string;
+
+/**
+ * Used to manually set the base path where assets can be found.
+ * If the script is used as "module", it's recommended to use "import.meta.url",
+ * such as "setAssetPath(import.meta.url)". Other options include
+ * "setAssetPath(document.currentScript.src)", or using a bundler's replace plugin to
+ * dynamically set the path at build time, such as "setAssetPath(process.env.ASSET_PATH)".
+ * But do note that this configuration depends on how your script is bundled, or lack of
+ * bundling, and where your assets can be loaded from. Additionally custom bundling
+ * will have to ensure the static assets are copied to its build directory.
+ */
+export declare const setAssetPath: (path: string) => void;
+
+/**
+ * Used to specify a nonce value that corresponds with an application's CSP.
+ * When set, the nonce will be added to all dynamically created script and style tags at runtime.
+ * Alternatively, the nonce value can be set on a meta tag in the DOM head
+ * (<meta name="csp-nonce" content="{ nonce value here }" />) which
+ * will result in the same behavior.
+ */
+export declare const setNonce: (nonce: string) => void
+
+export interface SetPlatformOptions {
+  raf?: (c: FrameRequestCallback) => number;
+  ael?: (el: EventTarget, eventName: string, listener: EventListenerOrEventListenerObject, options: boolean | AddEventListenerOptions) => void;
+  rel?: (el: EventTarget, eventName: string, listener: EventListenerOrEventListenerObject, options: boolean | AddEventListenerOptions) => void;
+}
+export declare const setPlatformOptions: (opts: SetPlatformOptions) => void;
+export * from '../dist/types';