list-toolkit 2.2.6 → 2.3.0

package/cjs/queue.js

@@ -1,58 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = exports.Queue = 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 Queue {
-  constructor(underlyingList = new _valueList.default()) {
-    this.list = underlyingList;
-    this.size = this.list.getLength();
-  }
-  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;
-  }
-  add(value) {
-    this.list.pushBack(value);
-    ++this.size;
-    return this;
-  }
-  remove() {
-    if (!this.list.isEmpty) {
-      --this.size;
-      return this.list.popFront();
-    }
-    // return undefined;
-  }
-  addValues(values) {
-    (0, _listUtils.pushValuesBack)(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.Queue = Queue;
-(0, _metaUtils.addAliases)(Queue.prototype, {
-  add: 'push, pushBack, enqueue',
-  remove: 'pop, popFront, dequeue'
-});
-var _default = exports.default = Queue;

package/cjs/slist/basics.js

@@ -1,71 +0,0 @@
-'use strict';
-
-// useful low-level operations on singly linked lists
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.splice = exports.pop = exports.extract = exports.append = void 0;
-const extract = ({
-  nextName
-}, {
-  prevFrom,
-  to = prevFrom[nextName]
-}) => {
-  const node = prevFrom[nextName],
-    next = to[nextName];
-
-  // exclude the range
-  prevFrom[nextName] = to[nextName];
-
-  // circle the range
-  to[nextName] = node;
-  return {
-    extracted: {
-      prevFrom: to,
-      to
-    },
-    rest: next === node ? null : next
-  };
-};
-
-// pop(options, prev).node === extract(options, {prevFrom: prev}).prevFrom[options.nextName]
-exports.extract = extract;
-const pop = ({
-  nextName
-}, prev) => {
-  const node = prev[nextName],
-    next = node[nextName];
-
-  // exclude the node
-  prev[nextName] = next;
-
-  // circle the node
-  node[nextName] = node;
-  return {
-    extracted: {
-      prevFrom: node,
-      to: node
-    },
-    rest: next === node ? null : next
-  };
-};
-exports.pop = pop;
-const splice = ({
-  nextName
-}, target, {
-  prevFrom,
-  to = prevFrom[nextName]
-}) => {
-  // form the combined head
-  const next = target[nextName];
-  target[nextName] = prevFrom[nextName];
-
-  // finish the combined  tail
-  prevFrom[nextName] = to[nextName];
-  to[nextName] = next;
-  return target;
-};
-
-// append(options, target, range) === splice(options, target, extract(options, range))
-exports.splice = splice;
-const append = exports.append = splice;

package/cjs/slist/core.js

@@ -1,362 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-Object.defineProperty(exports, "Ptr", {
-  enumerable: true,
-  get: function () {
-    return _ptr.default;
-  }
-});
-exports.default = exports.SList = void 0;
-var _metaUtils = require("../meta-utils.js");
-var _nodes = require("./nodes.js");
-var _basics = require("./basics.js");
-var _ptr = _interopRequireDefault(require("./ptr.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
-class SList extends _nodes.HeadNode {
-  get frontPtr() {
-    return new _ptr.default(this);
-  }
-  get ptrRange() {
-    return this.isEmpty ? null : {
-      from: new _ptr.default(this),
-      to: this.last
-    };
-  }
-  makePtr(node) {
-    if (node && !this.isNodeLike(node)) throw new Error('"node" is not a compatible node');
-    return new _ptr.default(this, node);
-  }
-  makePtrFromPrev(prev) {
-    if (prev && !this.isNodeLike(prev)) throw new Error('"prev" is not a compatible node');
-    return new _ptr.default(this, null, prev || this);
-  }
-  popFrontNode() {
-    if (this[this.nextName] === this) return undefined;
-    const node = this[this.nextName];
-    this[this.nextName] = node[this.nextName];
-    if (this[this.nextName] === this) this.last = this;
-    return node[this.nextName] = node;
-  }
-  pushFront(value) {
-    const node = this.adoptValue(value);
-    node[this.nextName] = this[this.nextName];
-    this[this.nextName] = node;
-    if (node[this.nextName] === this) this.last = node;
-    return this.makePtr();
-  }
-  pushBack(value) {
-    const node = this.adoptValue(value);
-    node[this.nextName] = this;
-    const last = this.last;
-    this.last = last[this.nextName] = node;
-    return this.makePtrFromPrev(last);
-  }
-  pushFrontNode(nodeOrPtr) {
-    const node = this.adoptNode(nodeOrPtr);
-    node[this.nextName] = this[this.nextName];
-    this[this.nextName] = node;
-    if (node[this.nextName] === this) this.last = node;
-    return this.makePtr();
-  }
-  pushBackNode(nodeOrPtr) {
-    const node = this.adoptNode(nodeOrPtr);
-    node[this.nextName] = this;
-    const last = this.last;
-    this.last = last[this.nextName] = node;
-    return this.makePtrFromPrev(last);
-  }
-  appendFront(list) {
-    if (!this.isCompatible(list)) throw new Error('Incompatible lists');
-    if (list.isEmpty) return this;
-    list.last[this.nextName] = this[this.nextName];
-    this[this.nextName] = list[this.nextName];
-    if (list.last[this.nextName] === this) this.last = list.last;
-    list[this.nextName] = list.last = list; // clear the list
-    return this.makePtr();
-  }
-  appendBack(list) {
-    if (!this.isCompatible(list)) throw new Error('Incompatible lists');
-    if (list.isEmpty) return this;
-    this.last[this.nextName] = list[this.nextName];
-    list.last[this.nextName] = this;
-    const last = this.last;
-    this.last = list.last;
-    list[this.nextName] = list.last = list; // clear the list
-    return this.makePtrFromPrev(last);
-  }
-  moveToFront(ptr) {
-    if (!this.isCompatiblePtr(ptr)) throw new Error('Incompatible pointer');
-    ptr.list = this;
-    if (ptr.isHead) return this;
-    const node = ptr.removeCurrent();
-    ptr.prevNode = this;
-    return this.pushFrontNode(node);
-  }
-  moveToBack(ptr) {
-    if (!this.isCompatiblePtr(ptr)) throw new Error('Incompatible pointer');
-    ptr.list = this;
-    if (ptr.isHead) return this;
-    const node = ptr.removeCurrent();
-    ptr.prevNode = this.last;
-    return this.pushBackNode(node);
-  }
-  clear(drop) {
-    if (drop) {
-      let current = this;
-      do {
-        const next = current[this.nextName];
-        current[this.nextName] = current;
-        current = next;
-      } while (current !== this);
-    } else {
-      this[this.nextName] = this;
-    }
-    this.last = this;
-    return this;
-  }
-  removeNode(ptr) {
-    if (!ptr.isPrevNodeValid()) throw new Error('Cannot remove node: "prevNode" is invalid');
-    if (!this.isCompatiblePtr(ptr)) throw new Error('Incompatible pointer');
-    const node = ptr.prevNode[this.nextName];
-    if (node === this || node === ptr.prevNode) return null;
-    if (this.last === node) this.last = ptr.prevNode;
-    ptr.prevNode[this.nextName] = node[this.nextName];
-    ptr.list = this;
-    node[this.nextName] = node;
-    return node;
-  }
-  removeRange(ptrRange, drop) {
-    return this.extractRange(ptrRange).clear(drop);
-  }
-  extractRange(ptrRange = {}) {
-    const originalTo = ptrRange.to;
-    ptrRange = this.normalizePtrRange(ptrRange.from ? ptrRange : {
-      ...ptrRange,
-      from: this.frontPtr
-    });
-    if (!ptrRange.from.isPrevNodeValid()) throw new Error('Cannot extract range: "prevNode" is invalid');
-    ptrRange.to ||= this.last;
-    const extracted = this.make();
-    (0, _basics.append)(this, extracted, {
-      prevFrom: ptrRange.from.prevNode,
-      to: ptrRange.to
-    });
-    extracted.last = ptrRange.to;
-    ptrRange.from.list = extracted;
-    if (originalTo instanceof _ptr.default) originalTo.list = extracted;
-    if (ptrRange.to === this.last) this.last = ptrRange.from.prevNode;
-    return extracted;
-  }
-  extractBy(condition) {
-    const extracted = this.make();
-    if (this.isEmpty) return extracted;
-    for (const ptr = this.frontPtr; !ptr.isHead;) {
-      if (condition(ptr.node)) {
-        extracted.pushBackNode(ptr.removeCurrent());
-      } else {
-        ptr.next();
-      }
-    }
-    return extracted;
-  }
-  reverse() {
-    if (this.isOneOrEmpty) return this;
-    this.last = this[this.nextName];
-    let prev = this,
-      current = prev[this.nextName];
-    do {
-      const next = current[this.nextName];
-      current[this.nextName] = prev;
-      prev = current;
-      current = next;
-    } while (current !== this);
-    this[this.nextName] = prev;
-    return this;
-  }
-  sort(lessFn) {
-    if (this.isOneOrEmpty) return this;
-    const left = this.make(),
-      right = this.make();
-
-    // split into two sublists
-    for (let isLeft = true; !this.isEmpty; isLeft = !isLeft) {
-      (isLeft ? left : right).pushBackNode(this.popFrontNode());
-    }
-    // the list is empty now
-
-    // sort sublists
-    left.sort(lessFn);
-    right.sort(lessFn);
-
-    // merge sublists
-    while (!left.isEmpty && !right.isEmpty) {
-      this.pushBackNode((lessFn(left.front, right.front) ? left : right).popFrontNode());
-    }
-    if (!left.isEmpty) this.appendBack(left);
-    if (!right.isEmpty) this.appendBack(right);
-    return this;
-  }
-  releaseAsPtrRange() {
-    if (this.isEmpty) return null;
-    const head = this[this.nextName],
-      tail = this.last;
-    this.clear();
-    tail[this.nextName] = head;
-    return {
-      from: new _ptr.default(this, null, tail),
-      to: tail
-    };
-  }
-  releaseRawList() {
-    if (this.isEmpty) return null;
-    const head = this[this.nextName],
-      tail = this.last;
-    this.clear();
-    tail[this.nextName] = head;
-    return head;
-  }
-  releaseNTList() {
-    if (this.isEmpty) return null;
-    const head = this[this.nextName],
-      tail = this.last;
-    this.clear();
-    tail[this.nextName] = null;
-    return {
-      head,
-      tail
-    };
-  }
-  validateRange(range = {}) {
-    range = this.normalizeRange(range);
-    let current = range.from;
-    do {
-      if (current === this) return false;
-      current = current[this.nextName];
-    } while (current !== range.to);
-    return true;
-  }
-
-  // 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;
-        current = current[this.nextName];
-        return {
-          value
-        };
-      }
-    });
-  }
-  getNodeIterator(range = {}) {
-    range = this.normalizeRange(range);
-    const {
-      from,
-      to
-    } = range;
-    return {
-      [Symbol.iterator]: () => {
-        let current = from || this[this.nextName],
-          readyToStop = this.isEmpty;
-        const stop = to ? to[this.nextName] : this;
-        return (0, _metaUtils.normalizeIterator)({
-          next: () => {
-            if (readyToStop && current === stop) return {
-              done: true
-            };
-            readyToStop = true;
-            const value = current;
-            current = current[this.nextName];
-            return {
-              value
-            };
-          }
-        });
-      }
-    };
-  }
-  getPtrIterator(ptrRange = {}) {
-    if (!ptrRange.from) ptrRange = Object.assign({
-      from: this.frontPtr
-    }, ptrRange);
-    ptrRange = this.normalizePtrRange(ptrRange);
-    const {
-      from: fromPtr,
-      to
-    } = ptrRange;
-    return {
-      [Symbol.iterator]: () => {
-        let current = fromPtr.clone(),
-          readyToStop = this.isEmpty;
-        const stop = to ? to[this.nextName] : this;
-        return (0, _metaUtils.normalizeIterator)({
-          next: () => {
-            if (readyToStop && current.node === stop) return {
-              done: true
-            };
-            readyToStop = true;
-            const value = current.clone();
-            current = current.next();
-            return {
-              value
-            };
-          }
-        });
-      }
-    };
-  }
-
-  // meta helpers
-
-  make() {
-    return new SList(this);
-  }
-  makeFrom(values) {
-    return SList.from(values, this);
-  }
-  makeFromRange(range) {
-    return SList.fromRange(range, this);
-  }
-  static from(values, options) {
-    const list = new SList(options);
-    for (const value of values) list.pushBack(value);
-    return list;
-  }
-  static fromPtrRange(ptrRange, options) {
-    const list = new SList(options);
-    if (!list.isCompatiblePtrRange(ptrRange)) throw new Error('"range" is not a compatible range');
-    if (ptrRange) (0, _basics.append)(list, list, ptrRange);
-    return list;
-  }
-  static fromExtList(extList) {
-    if (!(extList instanceof _nodes.ExtListBase)) throw new Error('Not a circular list');
-    const list = new SList(extList);
-    if (extList.isEmpty) return list;
-    const range = extList.range;
-    if (range) {
-      (0, _basics.append)(list, list, range);
-      extList.clear();
-    }
-    return list;
-  }
-}
-exports.SList = SList;
-SList.Ptr = _ptr.default;
-(0, _metaUtils.addAliases)(SList.prototype, {
-  popFrontNode: 'popFront, pop',
-  popBackNode: 'popBack',
-  pushFront: 'push',
-  appendBack: 'append',
-  getNodeIterator: 'getIterator'
-});
-var _default = exports.default = SList;

package/cjs/slist/ext-value.js

@@ -1,82 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.ExtValueSList = void 0;
-Object.defineProperty(exports, "ValueNode", {
-  enumerable: true,
-  get: function () {
-    return _nodes.ValueNode;
-  }
-});
-exports.default = void 0;
-var _ext = _interopRequireWildcard(require("./ext.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 ExtValueSList extends _ext.default {
-  adoptValue(value) {
-    if (value instanceof _ext.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.head,
-      readyToStop = this.isEmpty;
-    return (0, _metaUtils.normalizeIterator)({
-      next: () => {
-        if (readyToStop && current === this.head) 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 new ExtValueSList(this);
-  }
-  make(head = null) {
-    return new ExtValueSList(head, this);
-  }
-  makeFrom(values) {
-    return ExtValueSList.from(values, this);
-  }
-  static from(values, options) {
-    const list = new ExtValueSList(null, options);
-    for (const value of values) {
-      list.addAfter(value);
-      list.next();
-    }
-    return list.next();
-  }
-}
-exports.ExtValueSList = ExtValueSList;
-ExtValueSList.Ptr = _ext.Ptr;
-ExtValueSList.ValueNode = _nodes.ValueNode;
-(0, _metaUtils.addAlias)(ExtValueSList.prototype, 'getIterator', 'getValueIterator');
-var _default = exports.default = ExtValueSList;