list-toolkit 2.2.5 → 2.3.0

package/cjs/slist/value.js

@@ -1,90 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-Object.defineProperty(exports, "Ptr", {
-  enumerable: true,
-  get: function () {
-    return _core.Ptr;
-  }
-});
-Object.defineProperty(exports, "ValueNode", {
-  enumerable: true,
-  get: function () {
-    return _nodes.ValueNode;
-  }
-});
-exports.default = exports.ValueSList = void 0;
-var _core = _interopRequireWildcard(require("./core.js"));
-var _nodes = require("./nodes.js");
-var _metaUtils = require("../meta-utils.js");
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
-class ValueSList extends _core.default {
-  popFront() {
-    return this.popFrontNode()?.value;
-  }
-  adoptValue(value) {
-    if (value instanceof _core.Ptr) {
-      if (!this.isCompatiblePtr(value)) throw new Error('Incompatible pointer');
-      if (value.node instanceof _nodes.ValueNode) {
-        value.list = this;
-        return super.adoptNode(value);
-      }
-      return new _nodes.ValueNode(value.node, this);
-    }
-    if (value instanceof _nodes.ValueNode) {
-      if (!this.isNodeLike(value)) throw new Error('Incompatible node');
-      return super.adoptNode(value);
-    }
-    return new _nodes.ValueNode(value, this);
-  }
-
-  // iterators
-
-  [Symbol.iterator]() {
-    let current = this[this.nextName],
-      readyToStop = this.isEmpty;
-    return (0, _metaUtils.normalizeIterator)({
-      next: () => {
-        if (readyToStop && current === this) return {
-          done: true
-        };
-        readyToStop = true;
-        const value = current.value;
-        current = current[this.nextName];
-        return {
-          value
-        };
-      }
-    });
-  }
-  getValueIterator(range) {
-    return (0, _metaUtils.mapIterator)(this.getNodeIterator(range), node => node.value);
-  }
-
-  // meta helpers
-
-  clone() {
-    return ValueSList.from(this, this);
-  }
-  make() {
-    return new ValueSList(this);
-  }
-  makeFrom(values) {
-    return ValueSList.from(values, this);
-  }
-  static from(values, options) {
-    const list = new ValueSList(options);
-    for (const value of values) list.pushBack(value);
-    return list;
-  }
-}
-exports.ValueSList = ValueSList;
-ValueSList.Ptr = _core.Ptr;
-ValueSList.ValueNode = _nodes.ValueNode;
-(0, _metaUtils.addAliases)(ValueSList.prototype, {
-  popFront: 'pop',
-  getValueIterator: 'getIterator'
-}, true);
-var _default = exports.default = ValueSList;

package/cjs/slist.js

@@ -1,21 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-var _exportNames = {};
-exports.default = void 0;
-var _core = _interopRequireWildcard(require("./slist/core.js"));
-Object.keys(_core).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
-  if (key in exports && exports[key] === _core[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _core[key];
-    }
-  });
-});
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
-var _default = exports.default = _core.default;

package/cjs/stack.js

@@ -1,55 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = exports.Stack = void 0;
-var _valueList = _interopRequireDefault(require("./value-list.js"));
-var _metaUtils = require("./meta-utils.js");
-var _listUtils = require("./list-utils.js");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
-class Stack {
-  constructor(UnderlyingList = _valueList.default) {
-    this.size = 0;
-    this.list = new UnderlyingList();
-  }
-  get isEmpty() {
-    return this.list.isEmpty;
-  }
-  get top() {
-    return this.list.isEmpty ? undefined : this.list.front.value;
-  }
-  peek() {
-    return this.list.isEmpty ? undefined : this.list.front.value;
-  }
-  push(value) {
-    this.list.pushFront(value);
-    ++this.size;
-    return this;
-  }
-  pop() {
-    if (!this.list.isEmpty) {
-      --this.size;
-      return this.list.popFront().value;
-    }
-    // return undefined;
-  }
-  pushValues(values) {
-    (0, _listUtils.pushValuesFront)(this, values);
-    return this;
-  }
-  clear() {
-    this.list.clear();
-    this.size = 0;
-    return this;
-  }
-  [Symbol.iterator]() {
-    return this.list[Symbol.iterator]();
-  }
-  getReverseIterator() {
-    return this.list.getReverseIterator?.();
-  }
-}
-exports.Stack = Stack;
-(0, _metaUtils.addAlias)(Stack.prototype, 'push', 'pushFront');
-var _default = exports.default = Stack;

package/cjs/tree/splay-tree.js

@@ -1,362 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = exports.SplayTreeNode = exports.SplayTree = void 0;
-var _metaUtils = require("../meta-utils.js");
-const defaultLess = (a, b) => a < b;
-const zig = tree => {
-  const newTree = tree.left,
-    parent = newTree.parent = tree.parent;
-  if (parent) {
-    if (parent.left === tree) parent.left = newTree;else parent.right = newTree;
-  }
-  tree.parent = newTree;
-  const child = tree.left = newTree.right;
-  if (child) child.parent = tree;
-  newTree.right = tree;
-  return newTree;
-};
-const zag = tree => {
-  const newTree = tree.right,
-    parent = newTree.parent = tree.parent;
-  if (parent) {
-    if (parent.left === tree) parent.left = newTree;else parent.right = newTree;
-  }
-  tree.parent = newTree;
-  const child = tree.right = newTree.left;
-  if (child) child.parent = tree;
-  newTree.left = tree;
-  return newTree;
-};
-const splay = node => {
-  while (node.parent) {
-    if (!node.parent.parent) {
-      node.parent.left === node ? zig(node.parent) : zag(node.parent);
-    } else if (node.parent.left === node && node.parent.parent.left === node.parent) {
-      zig(node.parent.parent);
-      zig(node.parent);
-    } else if (node.parent.right === node && node.parent.parent.right === node.parent) {
-      zag(node.parent.parent);
-      zag(node.parent);
-    } else if (node.parent.left === node && node.parent.parent.right === node.parent) {
-      zig(node.parent);
-      zag(node.parent);
-    } else {
-      zag(node.parent);
-      zig(node.parent);
-    }
-  }
-  return node;
-};
-const count = tree => tree ? count(tree.left) + count(tree.right) + 1 : 0;
-class SplayTreeNode {
-  constructor(value) {
-    this.left = this.right = this.parent = null;
-    this.value = value;
-  }
-  getMin() {
-    let z = this;
-    while (z.left) z = z.left;
-    return z;
-  }
-  getMax() {
-    let z = this;
-    while (z.right) z = z.right;
-    return z;
-  }
-}
-exports.SplayTreeNode = SplayTreeNode;
-class SplayTree {
-  constructor(options) {
-    (0, _metaUtils.copyOptions)(this, SplayTree.defaults, options);
-    if (typeof this.compare == 'function') {
-      this.less = (a, b) => this.compare(a, b) < 0;
-      this.find = this.findWithCompare;
-      this.insert = this.insertWithCompare;
-      this.splitMaxTree = this.splitMaxTreeWithCompare;
-    }
-    this.root = null;
-    this.size = 0;
-  }
-  get isEmpty() {
-    return !this.root;
-  }
-  get length() {
-    return this.size;
-  }
-  getMin() {
-    return this.root.getMin();
-  }
-  getMax() {
-    return this.root.getMax();
-  }
-  find(value) {
-    for (let z = this.root; z;) {
-      if (this.less(z.value, value)) z = z.right;else if (this.less(value, z.value)) z = z.left;else return z;
-    }
-    return null;
-  }
-  findWithCompare(value) {
-    for (let z = this.root; z;) {
-      const cmp = this.compare(value, z.value);
-      if (cmp < 0) z = z.left;else if (cmp > 0) z = z.right;else return z;
-    }
-    return null;
-  }
-  promote(value) {
-    const z = this.find(value);
-    if (z) {
-      this.root = splay(z);
-    }
-    return z;
-  }
-  splay(node) {
-    this.root = splay(node);
-    return this;
-  }
-  insert(value) {
-    let z = this.root,
-      parent = null;
-    while (z) {
-      parent = z;
-      if (this.less(z.value, value)) z = z.right;else if (this.less(value, z.value)) z = z.left;else break;
-    }
-    if (!z) {
-      z = new SplayTreeNode(value);
-      z.parent = parent;
-      if (parent) {
-        if (this.less(parent.value, value)) parent.right = z;else parent.left = z;
-      }
-      ++this.size;
-    }
-    this.root = splay(z);
-    return this;
-  }
-  insertWithCompare(value) {
-    let z = this.root,
-      parent = null;
-    while (z) {
-      parent = z;
-      const cmp = this.compare(value, z.value);
-      if (cmp < 0) z = z.left;else if (cmp > 0) z = z.right;else break;
-    }
-    if (!z) {
-      z = new SplayTreeNode(value);
-      z.parent = parent;
-      if (parent) {
-        if (this.compare(parent.value, value) < 0) parent.right = z;else parent.left = z;
-      }
-      ++this.size;
-    }
-    this.root = splay(z);
-    return this;
-  }
-  remove(value) {
-    const z = this.find(value);
-    if (!z) return this;
-    splay(z);
-    this.root = null;
-    let maxNode = null;
-    if (z.left) {
-      z.left.parent = null;
-      maxNode = z.left.getMax();
-      this.root = splay(maxNode);
-    }
-    if (z.right) {
-      if (maxNode) maxNode.right = z.right;else this.root = z.right;
-      z.right.parent = maxNode;
-    }
-    --this.size;
-    return this;
-  }
-  clear() {
-    this.root = null;
-    this.size = 0;
-    return this;
-  }
-  splitMaxTree(value) {
-    if (!this.root) return new SplayTree(this);
-    let z = this.root,
-      parent = null,
-      right;
-    while (z) {
-      parent = z;
-      if (this.less(z.value, value)) {
-        z = z.right;
-        right = true;
-      } else if (this.less(value, z.value)) {
-        z = z.left;
-        right = false;
-      } else break;
-    }
-    this.root = splay(z || parent);
-    const newTree = new SplayTree(this);
-    if (z || right) {
-      newTree.root = this.root.right;
-      if (newTree.root) {
-        newTree.root.parent = null;
-        newTree.size = count(newTree.root);
-        this.root.right = null;
-        this.size -= newTree.size;
-      }
-    } else {
-      newTree.root = this.root;
-      newTree.size = this.size;
-      this.root = this.root.left;
-      if (this.root) {
-        this.root.parent = null;
-        this.size = count(this.root);
-        newTree.root.left = null;
-        newTree.size -= this.size;
-      }
-    }
-    return newTree;
-  }
-  splitMaxTreeWithCompare(value) {
-    if (!this.root) return new SplayTree(this);
-    let z = this.root,
-      parent = null,
-      right;
-    while (z) {
-      parent = z;
-      const cmp = this.compare(value, z.value);
-      if (cmp < 0) {
-        z = z.left;
-        right = false;
-      } else if (cmp > 0) {
-        z = z.right;
-        right = true;
-      } else break;
-    }
-    this.root = splay(z || parent);
-    const newTree = new SplayTree(this);
-    if (z || right) {
-      newTree.root = this.root.right;
-      if (newTree.root) {
-        newTree.root.parent = null;
-        newTree.size = count(newTree.root);
-        this.root.right = null;
-        this.size -= newTree.size;
-      }
-    } else {
-      newTree.root = this.root;
-      newTree.size = this.size;
-      this.root = this.root.left;
-      if (this.root) {
-        this.root.parent = null;
-        this.size = count(this.root);
-        newTree.root.left = null;
-        newTree.size -= this.size;
-      }
-    }
-    return newTree;
-  }
-  joinMaxTreeUnsafe(tree) {
-    if (this.root.right) {
-      this.splay(this.getMax());
-    }
-    this.root.right = tree.root;
-    tree.root.parent = this.root;
-    this.size += tree.size;
-    tree.clear();
-    return this;
-  }
-  join(tree) {
-    if (!tree.root) return this;
-    if (!this.root) {
-      this.root = tree.root;
-      this.size = tree.size;
-      tree.clear();
-      return this;
-    }
-    const leftMax = this.getMax(),
-      rightMin = tree.getMin();
-    if (this.less(leftMax.value, rightMin.value)) {
-      return this.splay(leftMax).joinMaxTreeUnsafe(tree);
-    }
-    for (const value of tree) {
-      this.insert(value);
-    }
-    tree.clear();
-    return this;
-  }
-  [Symbol.iterator]() {
-    let current = this.root ? this.root.getMin() : null;
-    return {
-      next: () => {
-        if (!current) return {
-          done: true
-        };
-        const last = current;
-        if (current.right) {
-          current = current.right.getMin();
-        } else {
-          for (;;) {
-            const parent = current.parent;
-            if (!parent) {
-              current = null;
-              break;
-            }
-            if (parent.left === current) {
-              current = parent;
-              break;
-            }
-            current = parent;
-          }
-        }
-        return {
-          value: last.value
-        };
-      }
-    };
-  }
-  getReverseIterator() {
-    return {
-      [Symbol.iterator]: () => {
-        let current = this.root ? this.root.getMax() : null;
-        return {
-          next: () => {
-            if (!current) return {
-              done: true
-            };
-            const last = current;
-            if (current.left) {
-              current = current.left.getMax();
-            } else {
-              for (;;) {
-                const parent = current.parent;
-                if (!parent) {
-                  current = null;
-                  break;
-                }
-                if (parent.right === current) {
-                  current = parent;
-                  break;
-                }
-                current = parent;
-              }
-            }
-            return {
-              value: last.value
-            };
-          }
-        };
-      }
-    };
-  }
-  static from(values, options) {
-    const tree = new SplayTree(options);
-    for (const value of values) {
-      tree.insert(value);
-    }
-    return tree;
-  }
-}
-exports.SplayTree = SplayTree;
-SplayTree.defaults = {
-  less: defaultLess,
-  compare: null
-};
-var _default = exports.default = SplayTree;

package/cjs/value-list.js

@@ -1,21 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-var _exportNames = {};
-exports.default = void 0;
-var _value = _interopRequireWildcard(require("./list/value.js"));
-Object.keys(_value).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
-  if (key in exports && exports[key] === _value[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _value[key];
-    }
-  });
-});
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
-var _default = exports.default = _value.default;

package/cjs/value-slist.js

@@ -1,21 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-var _exportNames = {};
-exports.default = void 0;
-var _value = _interopRequireWildcard(require("./slist/value.js"));
-Object.keys(_value).forEach(function (key) {
-  if (key === "default" || key === "__esModule") return;
-  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
-  if (key in exports && exports[key] === _value[key]) return;
-  Object.defineProperty(exports, key, {
-    enumerable: true,
-    get: function () {
-      return _value[key];
-    }
-  });
-});
-function _interopRequireWildcard(e, t) { if ("function" == typeof WeakMap) var r = new WeakMap(), n = new WeakMap(); return (_interopRequireWildcard = function (e, t) { if (!t && e && e.__esModule) return e; var o, i, f = { __proto__: null, default: e }; if (null === e || "object" != typeof e && "function" != typeof e) return f; if (o = t ? n : r) { if (o.has(e)) return o.get(e); o.set(e, f); } for (const t in e) "default" !== t && {}.hasOwnProperty.call(e, t) && ((i = (o = Object.defineProperty) && Object.getOwnPropertyDescriptor(e, t)) && (i.get || i.set) ? o(f, t, i) : f[t] = e[t]); return f; })(e, t); }
-var _default = exports.default = _value.default;