@fluidframework/core-utils 2.43.0 → 2.50.0-345060

package/dist/index.d.ts

@@ -8,6 +8,7 @@ export { delay } from "./delay.js";
 export type { IComparer, IHeapNode } from "./heap.js";
 export { Heap, NumberComparer } from "./heap.js";
 export { Lazy, LazyPromise } from "./lazy.js";
+export { DoublyLinkedList, type ListNode, type ListNodeRange, iterateListValuesWhile, walkList, } from "./list.js";
 export type { PromiseCacheExpiry, PromiseCacheOptions } from "./promiseCache.js";
 export { PromiseCache } from "./promiseCache.js";
 export { Deferred } from "./promises.js";

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC9C,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,EACN,gBAAgB,EAChB,KAAK,QAAQ,EACb,KAAK,aAAa,EAClB,sBAAsB,EACtB,QAAQ,GACR,MAAM,WAAW,CAAC;AACnB,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC"}

package/dist/index.js

@@ -4,7 +4,7 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.oob = exports.isPromiseLike = exports.isObject = exports.unreachableCase = exports.Timer = exports.setLongTimeout = exports.PromiseTimer = exports.shallowCloneObject = exports.Deferred = exports.PromiseCache = exports.LazyPromise = exports.Lazy = exports.NumberComparer = exports.Heap = exports.delay = exports.compareArrays = exports.onAssertionFailure = exports.nonProductionConditionalsIncluded = exports.configureDebugAsserts = exports.debugAssert = exports.fail = exports.assert = void 0;
+exports.oob = exports.isPromiseLike = exports.isObject = exports.unreachableCase = exports.Timer = exports.setLongTimeout = exports.PromiseTimer = exports.shallowCloneObject = exports.Deferred = exports.PromiseCache = exports.walkList = exports.iterateListValuesWhile = exports.DoublyLinkedList = exports.LazyPromise = exports.Lazy = exports.NumberComparer = exports.Heap = exports.delay = exports.compareArrays = exports.onAssertionFailure = exports.nonProductionConditionalsIncluded = exports.configureDebugAsserts = exports.debugAssert = exports.fail = exports.assert = void 0;
 var assert_js_1 = require("./assert.js");
 Object.defineProperty(exports, "assert", { enumerable: true, get: function () { return assert_js_1.assert; } });
 Object.defineProperty(exports, "fail", { enumerable: true, get: function () { return assert_js_1.fail; } });
@@ -22,6 +22,10 @@ Object.defineProperty(exports, "NumberComparer", { enumerable: true, get: functi
 var lazy_js_1 = require("./lazy.js");
 Object.defineProperty(exports, "Lazy", { enumerable: true, get: function () { return lazy_js_1.Lazy; } });
 Object.defineProperty(exports, "LazyPromise", { enumerable: true, get: function () { return lazy_js_1.LazyPromise; } });
+var list_js_1 = require("./list.js");
+Object.defineProperty(exports, "DoublyLinkedList", { enumerable: true, get: function () { return list_js_1.DoublyLinkedList; } });
+Object.defineProperty(exports, "iterateListValuesWhile", { enumerable: true, get: function () { return list_js_1.iterateListValuesWhile; } });
+Object.defineProperty(exports, "walkList", { enumerable: true, get: function () { return list_js_1.walkList; } });
 var promiseCache_js_1 = require("./promiseCache.js");
 Object.defineProperty(exports, "PromiseCache", { enumerable: true, get: function () { return promiseCache_js_1.PromiseCache; } });
 var promises_js_1 = require("./promises.js");

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,yCAOqB;AANpB,mGAAA,MAAM,OAAA;AACN,iGAAA,IAAI,OAAA;AACJ,wGAAA,WAAW,OAAA;AACX,kHAAA,qBAAqB,OAAA;AACrB,8HAAA,iCAAiC,OAAA;AACjC,+GAAA,kBAAkB,OAAA;AAEnB,2CAA6C;AAApC,2GAAA,aAAa,OAAA;AACtB,uCAAmC;AAA1B,iGAAA,KAAK,OAAA;AAEd,qCAAiD;AAAxC,+FAAA,IAAI,OAAA;AAAE,yGAAA,cAAc,OAAA;AAC7B,qCAA8C;AAArC,+FAAA,IAAI,OAAA;AAAE,sGAAA,WAAW,OAAA;AAE1B,qDAAiD;AAAxC,+GAAA,YAAY,OAAA;AACrB,6CAAyC;AAAhC,uGAAA,QAAQ,OAAA;AACjB,qDAAuD;AAA9C,qHAAA,kBAAkB,OAAA;AAE3B,uCAAiE;AAAxD,wGAAA,YAAY,OAAA;AAAE,0GAAA,cAAc,OAAA;AAAE,iGAAA,KAAK,OAAA;AAC5C,mDAAmD;AAA1C,iHAAA,eAAe,OAAA;AACxB,mDAA2D;AAAlD,0GAAA,QAAQ,OAAA;AAAE,+GAAA,aAAa,OAAA;AAChC,mCAA+B;AAAtB,6FAAA,GAAG,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tassert,\n\tfail,\n\tdebugAssert,\n\tconfigureDebugAsserts,\n\tnonProductionConditionalsIncluded,\n\tonAssertionFailure,\n} from \"./assert.js\";\nexport { compareArrays } from \"./compare.js\";\nexport { delay } from \"./delay.js\";\nexport type { IComparer, IHeapNode } from \"./heap.js\";\nexport { Heap, NumberComparer } from \"./heap.js\";\nexport { Lazy, LazyPromise } from \"./lazy.js\";\nexport type { PromiseCacheExpiry, PromiseCacheOptions } from \"./promiseCache.js\";\nexport { PromiseCache } from \"./promiseCache.js\";\nexport { Deferred } from \"./promises.js\";\nexport { shallowCloneObject } from \"./shallowClone.js\";\nexport type { IPromiseTimer, IPromiseTimerResult, ITimer } from \"./timer.js\";\nexport { PromiseTimer, setLongTimeout, Timer } from \"./timer.js\";\nexport { unreachableCase } from \"./unreachable.js\";\nexport { isObject, isPromiseLike } from \"./typesGuards.js\";\nexport { oob } from \"./oob.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,yCAOqB;AANpB,mGAAA,MAAM,OAAA;AACN,iGAAA,IAAI,OAAA;AACJ,wGAAA,WAAW,OAAA;AACX,kHAAA,qBAAqB,OAAA;AACrB,8HAAA,iCAAiC,OAAA;AACjC,+GAAA,kBAAkB,OAAA;AAEnB,2CAA6C;AAApC,2GAAA,aAAa,OAAA;AACtB,uCAAmC;AAA1B,iGAAA,KAAK,OAAA;AAEd,qCAAiD;AAAxC,+FAAA,IAAI,OAAA;AAAE,yGAAA,cAAc,OAAA;AAC7B,qCAA8C;AAArC,+FAAA,IAAI,OAAA;AAAE,sGAAA,WAAW,OAAA;AAC1B,qCAMmB;AALlB,2GAAA,gBAAgB,OAAA;AAGhB,iHAAA,sBAAsB,OAAA;AACtB,mGAAA,QAAQ,OAAA;AAGT,qDAAiD;AAAxC,+GAAA,YAAY,OAAA;AACrB,6CAAyC;AAAhC,uGAAA,QAAQ,OAAA;AACjB,qDAAuD;AAA9C,qHAAA,kBAAkB,OAAA;AAE3B,uCAAiE;AAAxD,wGAAA,YAAY,OAAA;AAAE,0GAAA,cAAc,OAAA;AAAE,iGAAA,KAAK,OAAA;AAC5C,mDAAmD;AAA1C,iHAAA,eAAe,OAAA;AACxB,mDAA2D;AAAlD,0GAAA,QAAQ,OAAA;AAAE,+GAAA,aAAa,OAAA;AAChC,mCAA+B;AAAtB,6FAAA,GAAG,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tassert,\n\tfail,\n\tdebugAssert,\n\tconfigureDebugAsserts,\n\tnonProductionConditionalsIncluded,\n\tonAssertionFailure,\n} from \"./assert.js\";\nexport { compareArrays } from \"./compare.js\";\nexport { delay } from \"./delay.js\";\nexport type { IComparer, IHeapNode } from \"./heap.js\";\nexport { Heap, NumberComparer } from \"./heap.js\";\nexport { Lazy, LazyPromise } from \"./lazy.js\";\nexport {\n\tDoublyLinkedList,\n\ttype ListNode,\n\ttype ListNodeRange,\n\titerateListValuesWhile,\n\twalkList,\n} from \"./list.js\";\nexport type { PromiseCacheExpiry, PromiseCacheOptions } from \"./promiseCache.js\";\nexport { PromiseCache } from \"./promiseCache.js\";\nexport { Deferred } from \"./promises.js\";\nexport { shallowCloneObject } from \"./shallowClone.js\";\nexport type { IPromiseTimer, IPromiseTimerResult, ITimer } from \"./timer.js\";\nexport { PromiseTimer, setLongTimeout, Timer } from \"./timer.js\";\nexport { unreachableCase } from \"./unreachable.js\";\nexport { isObject, isPromiseLike } from \"./typesGuards.js\";\nexport { oob } from \"./oob.js\";\n"]}

package/dist/list.d.ts

@@ -0,0 +1,163 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Represents a node in a doubly linked list.
+ * @internal
+ */
+export interface ListNode<T> {
+    /**
+     * The list this node belongs to, or undefined if not attached.
+     */
+    readonly list: DoublyLinkedList<T> | undefined;
+    /**
+     * The data value stored in this node.
+     */
+    readonly data: T;
+    /**
+     * The next node in the list, or undefined if this is the last node.
+     */
+    readonly next: ListNode<T> | undefined;
+    /**
+     * The previous node in the list, or undefined if this is the first node.
+     */
+    readonly prev: ListNode<T> | undefined;
+    /**
+     * Removes this node from its list.
+     * @returns The removed node, or undefined if not in a list.
+     */
+    remove(): ListNode<T> | undefined;
+}
+/**
+ * Represents a range of nodes in a doubly linked list.
+ * @internal
+ */
+export interface ListNodeRange<T> {
+    /**
+     * The first node in the range.
+     */
+    first: ListNode<T>;
+    /**
+     * The last node in the range.
+     */
+    last: ListNode<T>;
+}
+/**
+ * A doubly linked list implementation with array-like methods and node access.
+ * @typeParam T - The type of data stored in the list nodes.
+ * @internal
+ */
+export declare class DoublyLinkedList<T> implements Iterable<ListNode<T>>, // try to match array signature and semantics where possible
+Pick<ListNode<T>[], "pop" | "shift" | "length" | "includes"> {
+    /**
+     * Creates a new doubly linked list optionally initialized with values.
+     * @param values - Optional iterable of values to populate the list.
+     */
+    constructor(values?: Iterable<T>);
+    /**
+     * Finds the first node matching the predicate.
+     * @param predicate - Function to test each node.
+     * @returns The first matching node, or undefined if none found.
+     */
+    find(predicate: (value: ListNode<T>, obj: DoublyLinkedList<T>) => boolean): ListNode<T> | undefined;
+    /**
+     * Returns an iterable that maps each node to a new value.
+     * @param callbackfn - Function to produce a new value for each node.
+     */
+    map<U>(callbackfn: (value: ListNode<T>) => U): Iterable<U>;
+    /**
+     * Inserts items after the specified node.
+     * @param preceding - The node to insert after.
+     * @param items - Items to insert.
+     * @returns The range of newly inserted nodes.
+     */
+    insertAfter(preceding: ListNode<T>, ...items: T[]): ListNodeRange<T>;
+    /**
+     * Removes and returns the last node in the list.
+     * @returns The removed node, or undefined if the list is empty.
+     */
+    pop(): ListNode<T> | undefined;
+    /**
+     * Appends items to the end of the list.
+     * @param items - Items to append.
+     * @returns The range of newly inserted nodes.
+     */
+    push(...items: T[]): ListNodeRange<T>;
+    /**
+     * Removes and returns the first node in the list.
+     * @returns The removed node, or undefined if the list is empty.
+     */
+    shift(): ListNode<T> | undefined;
+    /**
+     * Inserts items at the start of the list.
+     * @param items - Items to insert.
+     * @returns The range of newly inserted nodes.
+     */
+    unshift(...items: T[]): ListNodeRange<T>;
+    /**
+     * Removes nodes starting at `start` until `end` or `count` is reached.
+     * @param start - The node to start removing from.
+     * @param countOrEnd - The number of nodes to remove or the end node.
+     * @returns A new list containing the removed nodes.
+     */
+    splice(start: ListNode<T>, countOrEnd?: ListNode<T> | number): DoublyLinkedList<T>;
+    /**
+     * Checks if the node is in this list.
+     * @param node - The node to check.
+     * @returns True if the node is in the list.
+     */
+    includes(node: ListNode<T> | undefined): node is ListNode<T>;
+    private _includes;
+    private _remove;
+    /**
+     * Removes the specified node from the list.
+     * @param node - The node to remove.
+     * @returns The removed node, or undefined if not in the list.
+     */
+    remove(node: ListNode<T> | undefined): ListNode<T> | undefined;
+    [Symbol.iterator](): IterableIterator<ListNode<T>>;
+    private _len;
+    private readonly headNode;
+    /**
+     * The number of nodes in the list.
+     */
+    get length(): number;
+    /**
+     * Whether the list is empty.
+     */
+    get empty(): boolean;
+    /**
+     * The first node in the list, or undefined if empty.
+     */
+    get first(): ListNode<T> | undefined;
+    /**
+     * The last node in the list, or undefined if empty.
+     */
+    get last(): ListNode<T> | undefined;
+}
+/**
+ * Iterates over the nodes of a `DoublyLinkedList`, calling the provided visitor function for each node.
+ * Iteration starts at the specified node (or at the head/tail if not provided) and proceeds forward or backward.
+ * If the visitor returns `false`, iteration stops early.
+ *
+ * @typeParam T - The type of data stored in the list nodes.
+ * @param list - The list to walk.
+ * @param visitor - Function called for each node. If it returns `false`, iteration stops.
+ * @param start - Optional node to start iteration from. If not provided, starts at the first (or last if `forward` is false) node.
+ * @param forward - If `true` (default), iterates forward; if `false`, iterates backward.
+ * @returns `false` if iteration was stopped early by the visitor, otherwise `true`.
+ *
+ * @internal
+ */
+export declare function walkList<T>(list: DoublyLinkedList<T>, visitor: (node: ListNode<T>) => boolean | void, start?: ListNode<T>, forward?: boolean): boolean;
+/**
+ * Creates a lazily evaluated iterable which returns values while the predicate returns true,
+ * and stops iterating at the first value where the predicate is false.
+ * @param start - the node to start the iteration from
+ * @param includePredicate - determine if the current value be included in the iteration or stop if iteration
+ *
+ * @internal
+ */
+export declare function iterateListValuesWhile<T>(start: ListNode<T> | undefined, includePredicate: (n: ListNode<T>) => boolean): Iterable<T>;
+//# sourceMappingURL=list.d.ts.map

package/dist/list.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.d.ts","sourceRoot":"","sources":["../src/list.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACH,MAAM,WAAW,QAAQ,CAAC,CAAC;IAC1B;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAC/C;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IACjB;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACvC;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACvC;;;OAGG;IACH,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;CAClC;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B;;OAEG;IACH,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACnB;;OAEG;IACH,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;CAClB;AAoED;;;;GAIG;AACH,qBAAa,gBAAgB,CAAC,CAAC,CAC9B,YACC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,4DAA4D;AACnF,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,GAAG,OAAO,GAAG,QAAQ,GAAG,UAAU,CAAC;IAE7D;;;OAGG;gBACgB,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAKvC;;;;OAIG;IACI,IAAI,CACV,SAAS,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,gBAAgB,CAAC,CAAC,CAAC,KAAK,OAAO,GAClE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;IAW1B;;;OAGG;IACI,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAkBjE;;;;;OAKG;IACI,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC;IAQ3E;;;OAGG;IACI,GAAG,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;IAIrC;;;;OAIG;IACI,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC;IAM5C;;;OAGG;IACI,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;IAIvC;;;;OAIG;IACI,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC;IAK/C;;;;;OAKG;IACI,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC;IAyBzF;;;;OAIG;IACI,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC;IAInE,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,OAAO;IAYf;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;IAI9D,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAkBzD,OAAO,CAAC,IAAI,CAAa;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAiD;IAE1E;;OAEG;IACH,IAAW,MAAM,IAAI,MAAM,CAE1B;IAED;;OAEG;IACH,IAAW,KAAK,IAAI,OAAO,CAE1B;IAED;;OAEG;IACH,IAAW,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAE1C;IAED;;OAEG;IACH,IAAW,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAEzC;CACD;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EACzB,IAAI,EAAE,gBAAgB,CAAC,CAAC,CAAC,EACzB,OAAO,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,GAAG,IAAI,EAC9C,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EACnB,OAAO,GAAE,OAAc,GACrB,OAAO,CAqBT;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,CAAC,EACvC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,EAC9B,gBAAgB,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,OAAO,GAC3C,QAAQ,CAAC,CAAC,CAAC,CAkBb"}

package/dist/list.js

@@ -0,0 +1,332 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.iterateListValuesWhile = exports.walkList = exports.DoublyLinkedList = void 0;
+class HeadNode {
+    constructor(list) {
+        this._next = this;
+        this._prev = this;
+        this.headNode = this;
+        if (list) {
+            this._list = list;
+        }
+    }
+    get next() {
+        return this._next === this.headNode ? undefined : this._next;
+    }
+    get prev() {
+        return this._prev === this.headNode ? undefined : this._prev;
+    }
+    get list() {
+        return this.headNode._list;
+    }
+}
+// The any is needed for use in the remove function, where the nodes are defined with a generic type.
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+const DeadHead = new HeadNode(undefined);
+class DataNode extends HeadNode {
+    constructor(headNode, data) {
+        super(undefined);
+        this.data = data;
+        this.headNode = headNode;
+    }
+    remove() {
+        return this.list?.remove(this);
+    }
+}
+function insertAfter(node, items) {
+    let previousNode = node;
+    const oldNext = previousNode._next;
+    let newRange;
+    for (const n of items) {
+        const newNode = new DataNode(node.headNode, n);
+        if (newRange === undefined) {
+            newRange = { first: newNode, last: newNode };
+        }
+        else {
+            newRange.last = newNode;
+        }
+        newNode._prev = previousNode;
+        previousNode._next = newNode;
+        previousNode = newNode;
+    }
+    oldNext._prev = previousNode;
+    previousNode._next = oldNext;
+    // explicitly prevent newRange from being undefined without casting,
+    // and without additional conditionals, as this is used in some perf critical areas.
+    // i could have just asserted, but that throws a non-user friendly error,
+    // so i went with a more user-friendly error, which describes the
+    // only condition that could lead to this being undefined in the current code.
+    if (newRange === undefined) {
+        throw new Error("items must not be empty");
+    }
+    return newRange;
+}
+/**
+ * A doubly linked list implementation with array-like methods and node access.
+ * @typeParam T - The type of data stored in the list nodes.
+ * @internal
+ */
+class DoublyLinkedList {
+    /**
+     * Creates a new doubly linked list optionally initialized with values.
+     * @param values - Optional iterable of values to populate the list.
+     */
+    constructor(values) {
+        this._len = 0;
+        this.headNode = new HeadNode(this);
+        if (values !== undefined) {
+            this.push(...values);
+        }
+    }
+    /**
+     * Finds the first node matching the predicate.
+     * @param predicate - Function to test each node.
+     * @returns The first matching node, or undefined if none found.
+     */
+    find(predicate) {
+        let found;
+        walkList(this, (node) => {
+            if (predicate(node, this)) {
+                found = node;
+                return false;
+            }
+        });
+        return found;
+    }
+    /**
+     * Returns an iterable that maps each node to a new value.
+     * @param callbackfn - Function to produce a new value for each node.
+     */
+    map(callbackfn) {
+        let node = this.first;
+        const iterator = {
+            next() {
+                if (node === undefined) {
+                    return { done: true, value: undefined };
+                }
+                const rtn = { value: callbackfn(node), done: false };
+                node = node.next;
+                return rtn;
+            },
+            [Symbol.iterator]() {
+                return this;
+            },
+        };
+        return iterator;
+    }
+    /**
+     * Inserts items after the specified node.
+     * @param preceding - The node to insert after.
+     * @param items - Items to insert.
+     * @returns The range of newly inserted nodes.
+     */
+    insertAfter(preceding, ...items) {
+        if (!this._includes(preceding)) {
+            throw new Error("preceding not in list");
+        }
+        this._len += items.length;
+        return insertAfter(preceding, items);
+    }
+    /**
+     * Removes and returns the last node in the list.
+     * @returns The removed node, or undefined if the list is empty.
+     */
+    pop() {
+        return this.remove(this.last);
+    }
+    /**
+     * Appends items to the end of the list.
+     * @param items - Items to append.
+     * @returns The range of newly inserted nodes.
+     */
+    push(...items) {
+        this._len += items.length;
+        const start = this.headNode._prev;
+        return insertAfter(start, items);
+    }
+    /**
+     * Removes and returns the first node in the list.
+     * @returns The removed node, or undefined if the list is empty.
+     */
+    shift() {
+        return this.remove(this.first);
+    }
+    /**
+     * Inserts items at the start of the list.
+     * @param items - Items to insert.
+     * @returns The range of newly inserted nodes.
+     */
+    unshift(...items) {
+        this._len += items.length;
+        return insertAfter(this.headNode, items);
+    }
+    /**
+     * Removes nodes starting at `start` until `end` or `count` is reached.
+     * @param start - The node to start removing from.
+     * @param countOrEnd - The number of nodes to remove or the end node.
+     * @returns A new list containing the removed nodes.
+     */
+    splice(start, countOrEnd) {
+        const newList = new DoublyLinkedList();
+        walkList(this, (node) => {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            const removedNode = this._remove(node);
+            // whats special here is we preserve the node
+            // this allow looking up the old node in the new list
+            // when something preserves a reference
+            removedNode.headNode = newList.headNode;
+            removedNode._next = newList.headNode;
+            removedNode._prev = newList.headNode._prev;
+            newList.headNode._prev._next = removedNode;
+            newList.headNode._prev = removedNode;
+            newList._len++;
+            if (node === countOrEnd || newList.length === countOrEnd) {
+                return false;
+            }
+        }, start);
+        return newList;
+    }
+    /**
+     * Checks if the node is in this list.
+     * @param node - The node to check.
+     * @returns True if the node is in the list.
+     */
+    includes(node) {
+        return this._includes(node);
+    }
+    _includes(node) {
+        return node instanceof DataNode && node.headNode === this.headNode;
+    }
+    _remove(node) {
+        if (this._includes(node)) {
+            node._prev._next = node._next;
+            node._next._prev = node._prev;
+            // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment
+            node.headNode = node._next = node._prev = DeadHead;
+            this._len--;
+            return node;
+        }
+        return undefined;
+    }
+    /**
+     * Removes the specified node from the list.
+     * @param node - The node to remove.
+     * @returns The removed node, or undefined if not in the list.
+     */
+    remove(node) {
+        return this._remove(node);
+    }
+    [Symbol.iterator]() {
+        let value = this.first;
+        const iterator = {
+            next() {
+                if (value !== undefined) {
+                    const rtn = { value, done: false };
+                    value = value.next;
+                    return rtn;
+                }
+                return { value: undefined, done: true };
+            },
+            [Symbol.iterator]() {
+                return this;
+            },
+        };
+        return iterator;
+    }
+    /**
+     * The number of nodes in the list.
+     */
+    get length() {
+        return this._len;
+    }
+    /**
+     * Whether the list is empty.
+     */
+    get empty() {
+        return this._len === 0;
+    }
+    /**
+     * The first node in the list, or undefined if empty.
+     */
+    get first() {
+        return this.headNode.next;
+    }
+    /**
+     * The last node in the list, or undefined if empty.
+     */
+    get last() {
+        return this.headNode.prev;
+    }
+}
+exports.DoublyLinkedList = DoublyLinkedList;
+/**
+ * Iterates over the nodes of a `DoublyLinkedList`, calling the provided visitor function for each node.
+ * Iteration starts at the specified node (or at the head/tail if not provided) and proceeds forward or backward.
+ * If the visitor returns `false`, iteration stops early.
+ *
+ * @typeParam T - The type of data stored in the list nodes.
+ * @param list - The list to walk.
+ * @param visitor - Function called for each node. If it returns `false`, iteration stops.
+ * @param start - Optional node to start iteration from. If not provided, starts at the first (or last if `forward` is false) node.
+ * @param forward - If `true` (default), iterates forward; if `false`, iterates backward.
+ * @returns `false` if iteration was stopped early by the visitor, otherwise `true`.
+ *
+ * @internal
+ */
+function walkList(list, visitor, start, forward = true) {
+    let current;
+    if (start) {
+        if (!list.includes(start)) {
+            throw new Error("start must be in the provided list");
+        }
+        current = start;
+    }
+    else {
+        current = forward ? list.first : list.last;
+    }
+    // cache the next node, incase the visitor mutates the list
+    // need this to support splice
+    let next = forward ? current?.next : current?.prev;
+    while (current !== undefined) {
+        if (visitor(current) === false) {
+            return false;
+        }
+        current = next;
+        next = forward ? next?.next : next?.prev;
+    }
+    return true;
+}
+exports.walkList = walkList;
+/**
+ * Creates a lazily evaluated iterable which returns values while the predicate returns true,
+ * and stops iterating at the first value where the predicate is false.
+ * @param start - the node to start the iteration from
+ * @param includePredicate - determine if the current value be included in the iteration or stop if iteration
+ *
+ * @internal
+ */
+function iterateListValuesWhile(start, includePredicate) {
+    let next = start;
+    const iterator = {
+        next: () => {
+            if (next !== undefined) {
+                const current = next;
+                next = current.next;
+                if (includePredicate(current) === true) {
+                    return { value: current.data, done: false };
+                }
+            }
+            return { done: true, value: undefined };
+        },
+        [Symbol.iterator]() {
+            return this;
+        },
+    };
+    return iterator;
+}
+exports.iterateListValuesWhile = iterateListValuesWhile;
+//# sourceMappingURL=list.js.map

package/dist/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../src/list.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AA6CH,MAAM,QAAQ;IAKb,YAAmB,IAAqC;QAJjD,UAAK,GAA8B,IAAI,CAAC;QACxC,UAAK,GAA8B,IAAI,CAAC;QACxC,aAAQ,GAAgB,IAAI,CAAC;QAGnC,IAAI,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACnB,CAAC;IACF,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,KAAqB,CAAC;IAC/E,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,KAAqB,CAAC;IAC/E,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;IAC5B,CAAC;CACD;AAED,qGAAqG;AACrG,8DAA8D;AAC9D,MAAM,QAAQ,GAAG,IAAI,QAAQ,CAAM,SAAS,CAAC,CAAC;AAE9C,MAAM,QAAY,SAAQ,QAAW;IACpC,YACC,QAAqB,EACL,IAAO;QAEvB,KAAK,CAAC,SAAS,CAAC,CAAC;QAFD,SAAI,GAAJ,IAAI,CAAG;QAGvB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;IACM,MAAM;QACZ,OAAO,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;CACD;AAED,SAAS,WAAW,CAAI,IAA+B,EAAE,KAAU;IAClE,IAAI,YAAY,GAAG,IAAI,CAAC;IACxB,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC;IACnC,IAAI,QAAsC,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,IAAI,QAAQ,CAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAClD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5B,QAAQ,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;QAC9C,CAAC;aAAM,CAAC;YACP,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC;QACzB,CAAC;QACD,OAAO,CAAC,KAAK,GAAG,YAAY,CAAC;QAC7B,YAAY,CAAC,KAAK,GAAG,OAAO,CAAC;QAC7B,YAAY,GAAG,OAAO,CAAC;IACxB,CAAC;IACD,OAAO,CAAC,KAAK,GAAG,YAAY,CAAC;IAC7B,YAAY,CAAC,KAAK,GAAG,OAAO,CAAC;IAC7B,oEAAoE;IACpE,oFAAoF;IACpF,yEAAyE;IACzE,iEAAiE;IACjE,8EAA8E;IAC9E,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAa,gBAAgB;IAK5B;;;OAGG;IACH,YAAmB,MAAoB;QAmL/B,SAAI,GAAW,CAAC,CAAC;QACR,aAAQ,GAA8B,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC;QAnLzE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QACtB,CAAC;IACF,CAAC;IACD;;;;OAIG;IACI,IAAI,CACV,SAAoE;QAEpE,IAAI,KAA8B,CAAC;QACnC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACvB,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC3B,KAAK,GAAG,IAAI,CAAC;gBACb,OAAO,KAAK,CAAC;YACd,CAAC;QACF,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,GAAG,CAAI,UAAqC;QAClD,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACtB,MAAM,QAAQ,GAAwB;YACrC,IAAI;gBACH,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACxB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;gBACzC,CAAC;gBACD,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;gBACrD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACjB,OAAO,GAAG,CAAC;YACZ,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAChB,OAAO,IAAI,CAAC;YACb,CAAC;SACD,CAAC;QACF,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;OAKG;IACI,WAAW,CAAC,SAAsB,EAAE,GAAG,KAAU;QACvD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC1C,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC;QAC1B,OAAO,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;;OAGG;IACI,GAAG;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,GAAG,KAAU;QACxB,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;QAClC,OAAO,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACI,KAAK;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,GAAG,KAAU;QAC3B,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC;QAC1B,OAAO,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,KAAkB,EAAE,UAAiC;QAClE,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAK,CAAC;QAC1C,QAAQ,CACP,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE;YACR,oEAAoE;YACpE,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAE,CAAC;YACxC,6CAA6C;YAC7C,qDAAqD;YACrD,uCAAuC;YACvC,WAAW,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;YACxC,WAAW,CAAC,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC;YACrC,WAAW,CAAC,KAAK,GAAG,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;YAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC;YAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,GAAG,WAAW,CAAC;YACrC,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBAC1D,OAAO,KAAK,CAAC;YACd,CAAC;QACF,CAAC,EACD,KAAK,CACL,CAAC;QACF,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,IAA6B;QAC5C,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAEO,SAAS,CAAC,IAA6B;QAC9C,OAAO,IAAI,YAAY,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC;IACpE,CAAC;IAEO,OAAO,CAAC,IAA6B;QAC5C,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YAC9B,mEAAmE;YACnE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;YACnD,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAA6B;QAC1C,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,MAAM,QAAQ,GAAkC;YAC/C,IAAI;gBACH,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACnC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC;oBACnB,OAAO,GAAG,CAAC;gBACZ,CAAC;gBACD,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;YACzC,CAAC;YACD,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAChB,OAAO,IAAI,CAAC;YACb,CAAC;SACD,CAAC;QACF,OAAO,QAAQ,CAAC;IACjB,CAAC;IAKD;;OAEG;IACH,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAW,KAAK;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC3B,CAAC;CACD;AA1ND,4CA0NC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,QAAQ,CACvB,IAAyB,EACzB,OAA8C,EAC9C,KAAmB,EACnB,UAAmB,IAAI;IAEvB,IAAI,OAAgC,CAAC;IACrC,IAAI,KAAK,EAAE,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,GAAG,KAAK,CAAC;IACjB,CAAC;SAAM,CAAC;QACP,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IAC5C,CAAC;IACD,2DAA2D;IAC3D,8BAA8B;IAC9B,IAAI,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC;IACnD,OAAO,OAAO,KAAK,SAAS,EAAE,CAAC;QAC9B,IAAI,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,EAAE,CAAC;YAChC,OAAO,KAAK,CAAC;QACd,CAAC;QACD,OAAO,GAAG,IAAI,CAAC;QACf,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC;IAC1C,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AA1BD,4BA0BC;AAED;;;;;;;GAOG;AACH,SAAgB,sBAAsB,CACrC,KAA8B,EAC9B,gBAA6C;IAE7C,IAAI,IAAI,GAA4B,KAAK,CAAC;IAC1C,MAAM,QAAQ,GAAwB;QACrC,IAAI,EAAE,GAAsB,EAAE;YAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACxB,MAAM,OAAO,GAAG,IAAI,CAAC;gBACrB,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;gBACpB,IAAI,gBAAgB,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;oBACxC,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;gBAC7C,CAAC;YACF,CAAC;YACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QACzC,CAAC;QACD,CAAC,MAAM,CAAC,QAAQ,CAAC;YAChB,OAAO,IAAI,CAAC;QACb,CAAC;KACD,CAAC;IACF,OAAO,QAAQ,CAAC;AACjB,CAAC;AArBD,wDAqBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Represents a node in a doubly linked list.\n * @internal\n */\nexport interface ListNode<T> {\n\t/**\n\t * The list this node belongs to, or undefined if not attached.\n\t */\n\treadonly list: DoublyLinkedList<T> | undefined;\n\t/**\n\t * The data value stored in this node.\n\t */\n\treadonly data: T;\n\t/**\n\t * The next node in the list, or undefined if this is the last node.\n\t */\n\treadonly next: ListNode<T> | undefined;\n\t/**\n\t * The previous node in the list, or undefined if this is the first node.\n\t */\n\treadonly prev: ListNode<T> | undefined;\n\t/**\n\t * Removes this node from its list.\n\t * @returns The removed node, or undefined if not in a list.\n\t */\n\tremove(): ListNode<T> | undefined;\n}\n\n/**\n * Represents a range of nodes in a doubly linked list.\n * @internal\n */\nexport interface ListNodeRange<T> {\n\t/**\n\t * The first node in the range.\n\t */\n\tfirst: ListNode<T>;\n\t/**\n\t * The last node in the range.\n\t */\n\tlast: ListNode<T>;\n}\n\nclass HeadNode<T> {\n\tpublic _next: HeadNode<T> | DataNode<T> = this;\n\tpublic _prev: HeadNode<T> | DataNode<T> = this;\n\tpublic headNode: HeadNode<T> = this;\n\tprivate readonly _list?: DoublyLinkedList<T>;\n\tpublic constructor(list: DoublyLinkedList<T> | undefined) {\n\t\tif (list) {\n\t\t\tthis._list = list;\n\t\t}\n\t}\n\tpublic get next(): DataNode<T> | undefined {\n\t\treturn this._next === this.headNode ? undefined : (this._next as DataNode<T>);\n\t}\n\tpublic get prev(): DataNode<T> | undefined {\n\t\treturn this._prev === this.headNode ? undefined : (this._prev as DataNode<T>);\n\t}\n\tpublic get list(): DoublyLinkedList<T> | undefined {\n\t\treturn this.headNode._list;\n\t}\n}\n\n// The any is needed for use in the remove function, where the nodes are defined with a generic type.\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nconst DeadHead = new HeadNode<any>(undefined);\n\nclass DataNode<T> extends HeadNode<T> implements ListNode<T> {\n\tpublic constructor(\n\t\theadNode: HeadNode<T>,\n\t\tpublic readonly data: T,\n\t) {\n\t\tsuper(undefined);\n\t\tthis.headNode = headNode;\n\t}\n\tpublic remove(): ListNode<T> | undefined {\n\t\treturn this.list?.remove(this);\n\t}\n}\n\nfunction insertAfter<T>(node: DataNode<T> | HeadNode<T>, items: T[]): ListNodeRange<T> {\n\tlet previousNode = node;\n\tconst oldNext = previousNode._next;\n\tlet newRange: ListNodeRange<T> | undefined;\n\tfor (const n of items) {\n\t\tconst newNode = new DataNode<T>(node.headNode, n);\n\t\tif (newRange === undefined) {\n\t\t\tnewRange = { first: newNode, last: newNode };\n\t\t} else {\n\t\t\tnewRange.last = newNode;\n\t\t}\n\t\tnewNode._prev = previousNode;\n\t\tpreviousNode._next = newNode;\n\t\tpreviousNode = newNode;\n\t}\n\toldNext._prev = previousNode;\n\tpreviousNode._next = oldNext;\n\t// explicitly prevent newRange from being undefined without casting,\n\t// and without additional conditionals, as this is used in some perf critical areas.\n\t// i could have just asserted, but that throws a non-user friendly error,\n\t// so i went with a more user-friendly error, which describes the\n\t// only condition that could lead to this being undefined in the current code.\n\tif (newRange === undefined) {\n\t\tthrow new Error(\"items must not be empty\");\n\t}\n\treturn newRange;\n}\n\n/**\n * A doubly linked list implementation with array-like methods and node access.\n * @typeParam T - The type of data stored in the list nodes.\n * @internal\n */\nexport class DoublyLinkedList<T>\n\timplements\n\t\tIterable<ListNode<T>>, // try to match array signature and semantics where possible\n\t\tPick<ListNode<T>[], \"pop\" | \"shift\" | \"length\" | \"includes\">\n{\n\t/**\n\t * Creates a new doubly linked list optionally initialized with values.\n\t * @param values - Optional iterable of values to populate the list.\n\t */\n\tpublic constructor(values?: Iterable<T>) {\n\t\tif (values !== undefined) {\n\t\t\tthis.push(...values);\n\t\t}\n\t}\n\t/**\n\t * Finds the first node matching the predicate.\n\t * @param predicate - Function to test each node.\n\t * @returns The first matching node, or undefined if none found.\n\t */\n\tpublic find(\n\t\tpredicate: (value: ListNode<T>, obj: DoublyLinkedList<T>) => boolean,\n\t): ListNode<T> | undefined {\n\t\tlet found: ListNode<T> | undefined;\n\t\twalkList(this, (node) => {\n\t\t\tif (predicate(node, this)) {\n\t\t\t\tfound = node;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t});\n\t\treturn found;\n\t}\n\n\t/**\n\t * Returns an iterable that maps each node to a new value.\n\t * @param callbackfn - Function to produce a new value for each node.\n\t */\n\tpublic map<U>(callbackfn: (value: ListNode<T>) => U): Iterable<U> {\n\t\tlet node = this.first;\n\t\tconst iterator: IterableIterator<U> = {\n\t\t\tnext(): IteratorResult<U> {\n\t\t\t\tif (node === undefined) {\n\t\t\t\t\treturn { done: true, value: undefined };\n\t\t\t\t}\n\t\t\t\tconst rtn = { value: callbackfn(node), done: false };\n\t\t\t\tnode = node.next;\n\t\t\t\treturn rtn;\n\t\t\t},\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn this;\n\t\t\t},\n\t\t};\n\t\treturn iterator;\n\t}\n\n\t/**\n\t * Inserts items after the specified node.\n\t * @param preceding - The node to insert after.\n\t * @param items - Items to insert.\n\t * @returns The range of newly inserted nodes.\n\t */\n\tpublic insertAfter(preceding: ListNode<T>, ...items: T[]): ListNodeRange<T> {\n\t\tif (!this._includes(preceding)) {\n\t\t\tthrow new Error(\"preceding not in list\");\n\t\t}\n\t\tthis._len += items.length;\n\t\treturn insertAfter(preceding, items);\n\t}\n\n\t/**\n\t * Removes and returns the last node in the list.\n\t * @returns The removed node, or undefined if the list is empty.\n\t */\n\tpublic pop(): ListNode<T> | undefined {\n\t\treturn this.remove(this.last);\n\t}\n\n\t/**\n\t * Appends items to the end of the list.\n\t * @param items - Items to append.\n\t * @returns The range of newly inserted nodes.\n\t */\n\tpublic push(...items: T[]): ListNodeRange<T> {\n\t\tthis._len += items.length;\n\t\tconst start = this.headNode._prev;\n\t\treturn insertAfter(start, items);\n\t}\n\n\t/**\n\t * Removes and returns the first node in the list.\n\t * @returns The removed node, or undefined if the list is empty.\n\t */\n\tpublic shift(): ListNode<T> | undefined {\n\t\treturn this.remove(this.first);\n\t}\n\n\t/**\n\t * Inserts items at the start of the list.\n\t * @param items - Items to insert.\n\t * @returns The range of newly inserted nodes.\n\t */\n\tpublic unshift(...items: T[]): ListNodeRange<T> {\n\t\tthis._len += items.length;\n\t\treturn insertAfter(this.headNode, items);\n\t}\n\n\t/**\n\t * Removes nodes starting at `start` until `end` or `count` is reached.\n\t * @param start - The node to start removing from.\n\t * @param countOrEnd - The number of nodes to remove or the end node.\n\t * @returns A new list containing the removed nodes.\n\t */\n\tpublic splice(start: ListNode<T>, countOrEnd?: ListNode<T> | number): DoublyLinkedList<T> {\n\t\tconst newList = new DoublyLinkedList<T>();\n\t\twalkList(\n\t\t\tthis,\n\t\t\t(node) => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tconst removedNode = this._remove(node)!;\n\t\t\t\t// whats special here is we preserve the node\n\t\t\t\t// this allow looking up the old node in the new list\n\t\t\t\t// when something preserves a reference\n\t\t\t\tremovedNode.headNode = newList.headNode;\n\t\t\t\tremovedNode._next = newList.headNode;\n\t\t\t\tremovedNode._prev = newList.headNode._prev;\n\t\t\t\tnewList.headNode._prev._next = removedNode;\n\t\t\t\tnewList.headNode._prev = removedNode;\n\t\t\t\tnewList._len++;\n\t\t\t\tif (node === countOrEnd || newList.length === countOrEnd) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t},\n\t\t\tstart,\n\t\t);\n\t\treturn newList;\n\t}\n\n\t/**\n\t * Checks if the node is in this list.\n\t * @param node - The node to check.\n\t * @returns True if the node is in the list.\n\t */\n\tpublic includes(node: ListNode<T> | undefined): node is ListNode<T> {\n\t\treturn this._includes(node);\n\t}\n\n\tprivate _includes(node: ListNode<T> | undefined): node is DataNode<T> {\n\t\treturn node instanceof DataNode && node.headNode === this.headNode;\n\t}\n\n\tprivate _remove(node: ListNode<T> | undefined): DataNode<T> | undefined {\n\t\tif (this._includes(node)) {\n\t\t\tnode._prev._next = node._next;\n\t\t\tnode._next._prev = node._prev;\n\t\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n\t\t\tnode.headNode = node._next = node._prev = DeadHead;\n\t\t\tthis._len--;\n\t\t\treturn node;\n\t\t}\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * Removes the specified node from the list.\n\t * @param node - The node to remove.\n\t * @returns The removed node, or undefined if not in the list.\n\t */\n\tpublic remove(node: ListNode<T> | undefined): ListNode<T> | undefined {\n\t\treturn this._remove(node);\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<ListNode<T>> {\n\t\tlet value = this.first;\n\t\tconst iterator: IterableIterator<ListNode<T>> = {\n\t\t\tnext(): IteratorResult<ListNode<T>> {\n\t\t\t\tif (value !== undefined) {\n\t\t\t\t\tconst rtn = { value, done: false };\n\t\t\t\t\tvalue = value.next;\n\t\t\t\t\treturn rtn;\n\t\t\t\t}\n\t\t\t\treturn { value: undefined, done: true };\n\t\t\t},\n\t\t\t[Symbol.iterator]() {\n\t\t\t\treturn this;\n\t\t\t},\n\t\t};\n\t\treturn iterator;\n\t}\n\n\tprivate _len: number = 0;\n\tprivate readonly headNode: HeadNode<T> | DataNode<T> = new HeadNode(this);\n\n\t/**\n\t * The number of nodes in the list.\n\t */\n\tpublic get length(): number {\n\t\treturn this._len;\n\t}\n\n\t/**\n\t * Whether the list is empty.\n\t */\n\tpublic get empty(): boolean {\n\t\treturn this._len === 0;\n\t}\n\n\t/**\n\t * The first node in the list, or undefined if empty.\n\t */\n\tpublic get first(): ListNode<T> | undefined {\n\t\treturn this.headNode.next;\n\t}\n\n\t/**\n\t * The last node in the list, or undefined if empty.\n\t */\n\tpublic get last(): ListNode<T> | undefined {\n\t\treturn this.headNode.prev;\n\t}\n}\n\n/**\n * Iterates over the nodes of a `DoublyLinkedList`, calling the provided visitor function for each node.\n * Iteration starts at the specified node (or at the head/tail if not provided) and proceeds forward or backward.\n * If the visitor returns `false`, iteration stops early.\n *\n * @typeParam T - The type of data stored in the list nodes.\n * @param list - The list to walk.\n * @param visitor - Function called for each node. If it returns `false`, iteration stops.\n * @param start - Optional node to start iteration from. If not provided, starts at the first (or last if `forward` is false) node.\n * @param forward - If `true` (default), iterates forward; if `false`, iterates backward.\n * @returns `false` if iteration was stopped early by the visitor, otherwise `true`.\n *\n * @internal\n */\nexport function walkList<T>(\n\tlist: DoublyLinkedList<T>,\n\tvisitor: (node: ListNode<T>) => boolean | void,\n\tstart?: ListNode<T>,\n\tforward: boolean = true,\n): boolean {\n\tlet current: ListNode<T> | undefined;\n\tif (start) {\n\t\tif (!list.includes(start)) {\n\t\t\tthrow new Error(\"start must be in the provided list\");\n\t\t}\n\t\tcurrent = start;\n\t} else {\n\t\tcurrent = forward ? list.first : list.last;\n\t}\n\t// cache the next node, incase the visitor mutates the list\n\t// need this to support splice\n\tlet next = forward ? current?.next : current?.prev;\n\twhile (current !== undefined) {\n\t\tif (visitor(current) === false) {\n\t\t\treturn false;\n\t\t}\n\t\tcurrent = next;\n\t\tnext = forward ? next?.next : next?.prev;\n\t}\n\treturn true;\n}\n\n/**\n * Creates a lazily evaluated iterable which returns values while the predicate returns true,\n * and stops iterating at the first value where the predicate is false.\n * @param start - the node to start the iteration from\n * @param includePredicate - determine if the current value be included in the iteration or stop if iteration\n *\n * @internal\n */\nexport function iterateListValuesWhile<T>(\n\tstart: ListNode<T> | undefined,\n\tincludePredicate: (n: ListNode<T>) => boolean,\n): Iterable<T> {\n\tlet next: ListNode<T> | undefined = start;\n\tconst iterator: IterableIterator<T> = {\n\t\tnext: (): IteratorResult<T> => {\n\t\t\tif (next !== undefined) {\n\t\t\t\tconst current = next;\n\t\t\t\tnext = current.next;\n\t\t\t\tif (includePredicate(current) === true) {\n\t\t\t\t\treturn { value: current.data, done: false };\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn { done: true, value: undefined };\n\t\t},\n\t\t[Symbol.iterator]() {\n\t\t\treturn this;\n\t\t},\n\t};\n\treturn iterator;\n}\n"]}

package/lib/index.d.ts

@@ -8,6 +8,7 @@ export { delay } from "./delay.js";
 export type { IComparer, IHeapNode } from "./heap.js";
 export { Heap, NumberComparer } from "./heap.js";
 export { Lazy, LazyPromise } from "./lazy.js";
+export { DoublyLinkedList, type ListNode, type ListNodeRange, iterateListValuesWhile, walkList, } from "./list.js";
 export type { PromiseCacheExpiry, PromiseCacheOptions } from "./promiseCache.js";
 export { PromiseCache } from "./promiseCache.js";
 export { Deferred } from "./promises.js";

package/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC9C,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACtD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,EACN,gBAAgB,EAChB,KAAK,QAAQ,EACb,KAAK,aAAa,EAClB,sBAAsB,EACtB,QAAQ,GACR,MAAM,WAAW,CAAC;AACnB,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACjF,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC"}

package/lib/index.js

@@ -7,6 +7,7 @@ export { compareArrays } from "./compare.js";
 export { delay } from "./delay.js";
 export { Heap, NumberComparer } from "./heap.js";
 export { Lazy, LazyPromise } from "./lazy.js";
+export { DoublyLinkedList, iterateListValuesWhile, walkList, } from "./list.js";
 export { PromiseCache } from "./promiseCache.js";
 export { Deferred } from "./promises.js";
 export { shallowCloneObject } from "./shallowClone.js";

package/lib/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tassert,\n\tfail,\n\tdebugAssert,\n\tconfigureDebugAsserts,\n\tnonProductionConditionalsIncluded,\n\tonAssertionFailure,\n} from \"./assert.js\";\nexport { compareArrays } from \"./compare.js\";\nexport { delay } from \"./delay.js\";\nexport type { IComparer, IHeapNode } from \"./heap.js\";\nexport { Heap, NumberComparer } from \"./heap.js\";\nexport { Lazy, LazyPromise } from \"./lazy.js\";\nexport type { PromiseCacheExpiry, PromiseCacheOptions } from \"./promiseCache.js\";\nexport { PromiseCache } from \"./promiseCache.js\";\nexport { Deferred } from \"./promises.js\";\nexport { shallowCloneObject } from \"./shallowClone.js\";\nexport type { IPromiseTimer, IPromiseTimerResult, ITimer } from \"./timer.js\";\nexport { PromiseTimer, setLongTimeout, Timer } from \"./timer.js\";\nexport { unreachableCase } from \"./unreachable.js\";\nexport { isObject, isPromiseLike } from \"./typesGuards.js\";\nexport { oob } from \"./oob.js\";\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,qBAAqB,EACrB,iCAAiC,EACjC,kBAAkB,GAClB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAC7C,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC9C,OAAO,EACN,gBAAgB,EAGhB,sBAAsB,EACtB,QAAQ,GACR,MAAM,WAAW,CAAC;AAEnB,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,YAAY,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACjE,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tassert,\n\tfail,\n\tdebugAssert,\n\tconfigureDebugAsserts,\n\tnonProductionConditionalsIncluded,\n\tonAssertionFailure,\n} from \"./assert.js\";\nexport { compareArrays } from \"./compare.js\";\nexport { delay } from \"./delay.js\";\nexport type { IComparer, IHeapNode } from \"./heap.js\";\nexport { Heap, NumberComparer } from \"./heap.js\";\nexport { Lazy, LazyPromise } from \"./lazy.js\";\nexport {\n\tDoublyLinkedList,\n\ttype ListNode,\n\ttype ListNodeRange,\n\titerateListValuesWhile,\n\twalkList,\n} from \"./list.js\";\nexport type { PromiseCacheExpiry, PromiseCacheOptions } from \"./promiseCache.js\";\nexport { PromiseCache } from \"./promiseCache.js\";\nexport { Deferred } from \"./promises.js\";\nexport { shallowCloneObject } from \"./shallowClone.js\";\nexport type { IPromiseTimer, IPromiseTimerResult, ITimer } from \"./timer.js\";\nexport { PromiseTimer, setLongTimeout, Timer } from \"./timer.js\";\nexport { unreachableCase } from \"./unreachable.js\";\nexport { isObject, isPromiseLike } from \"./typesGuards.js\";\nexport { oob } from \"./oob.js\";\n"]}