@itwin/core-bentley 3.4.0-dev.9 → 3.5.0-dev.4

package/lib/esm/OrderedSet.js

@@ -1,60 +1,60 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Collections
- */
-import { shallowClone, SortedArray } from "./SortedArray";
-/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.
- * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.
- * Implemented in terms of [[SortedArray]].
- * @public
- */
-export class ReadonlyOrderedSet {
-    /** Construct a new ReadonlyOrderedSet<T>.
-     * @param compare The function used to compare elements within the set, determining their ordering.
-     * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.
-     */
-    constructor(compare, clone = shallowClone) {
-        this._array = new SortedArray(compare, false, clone);
-    }
-    /** The number of elements in the set. */
-    get size() {
-        return this._array.length;
-    }
-    /** Returns true if `value` is present in the set. */
-    has(value) {
-        return -1 !== this._array.indexOf(value);
-    }
-    /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */
-    [Symbol.iterator]() {
-        return this._array[Symbol.iterator]();
-    }
-}
-/** A mutable [[ReadonlyOrderedSet]].
- * @public
- */
-export class OrderedSet extends ReadonlyOrderedSet {
-    /** Construct a new OrderedSet<T>.
-     * @param compare The function used to compare elements within the set, determining their ordering.
-     * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.
-     */
-    constructor(compare, clone = shallowClone) {
-        super(compare, clone);
-    }
-    /** Remove all elements from the set. */
-    clear() {
-        this._array.clear();
-    }
-    /** Add the specified element to the set. Returns this set. */
-    add(value) {
-        this._array.insert(value);
-        return this;
-    }
-    /** Removes the specified element from the set. Returns `true` if the element was present. */
-    delete(value) {
-        return -1 !== this._array.remove(value);
-    }
-}
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Collections
+ */
+import { shallowClone, SortedArray } from "./SortedArray";
+/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.
+ * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.
+ * Implemented in terms of [[SortedArray]].
+ * @public
+ */
+export class ReadonlyOrderedSet {
+    /** Construct a new ReadonlyOrderedSet<T>.
+     * @param compare The function used to compare elements within the set, determining their ordering.
+     * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.
+     */
+    constructor(compare, clone = shallowClone) {
+        this._array = new SortedArray(compare, false, clone);
+    }
+    /** The number of elements in the set. */
+    get size() {
+        return this._array.length;
+    }
+    /** Returns true if `value` is present in the set. */
+    has(value) {
+        return -1 !== this._array.indexOf(value);
+    }
+    /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */
+    [Symbol.iterator]() {
+        return this._array[Symbol.iterator]();
+    }
+}
+/** A mutable [[ReadonlyOrderedSet]].
+ * @public
+ */
+export class OrderedSet extends ReadonlyOrderedSet {
+    /** Construct a new OrderedSet<T>.
+     * @param compare The function used to compare elements within the set, determining their ordering.
+     * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.
+     */
+    constructor(compare, clone = shallowClone) {
+        super(compare, clone);
+    }
+    /** Remove all elements from the set. */
+    clear() {
+        this._array.clear();
+    }
+    /** Add the specified element to the set. Returns this set. */
+    add(value) {
+        this._array.insert(value);
+        return this;
+    }
+    /** Removes the specified element from the set. Returns `true` if the element was present. */
+    delete(value) {
+        return -1 !== this._array.remove(value);
+    }
+}
 //# sourceMappingURL=OrderedSet.js.map

package/lib/esm/OrderedSet.js.map

@@ -1 +1 @@
-{"version":3,"file":"OrderedSet.js","sourceRoot":"","sources":["../../src/OrderedSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEzE;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAI,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,yCAAyC;IACzC,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qDAAqD;IAC9C,GAAG,CAAC,KAAQ;QACjB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,6HAA6H;IACtH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAc,SAAQ,kBAAqB;IACtD;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,wCAAwC;IACjC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,8DAA8D;IACvD,GAAG,CAAC,KAAQ;QACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6FAA6F;IACtF,MAAM,CAAC,KAAQ;QACpB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\nimport { CloneFunction, shallowClone, SortedArray } from \"./SortedArray\";\r\n\r\n/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.\r\n * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.\r\n * Implemented in terms of [[SortedArray]].\r\n * @public\r\n */\r\nexport class ReadonlyOrderedSet<T> implements Iterable<T> {\r\n  protected readonly _array: SortedArray<T>;\r\n\r\n  /** Construct a new ReadonlyOrderedSet<T>.\r\n   * @param compare The function used to compare elements within the set, determining their ordering.\r\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    this._array = new SortedArray<T>(compare, false, clone);\r\n  }\r\n\r\n  /** The number of elements in the set. */\r\n  public get size(): number {\r\n    return this._array.length;\r\n  }\r\n\r\n  /** Returns true if `value` is present in the set. */\r\n  public has(value: T): boolean {\r\n    return -1 !== this._array.indexOf(value);\r\n  }\r\n\r\n  /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */\r\n  public [Symbol.iterator](): Iterator<T> {\r\n    return this._array[Symbol.iterator]();\r\n  }\r\n}\r\n\r\n/** A mutable [[ReadonlyOrderedSet]].\r\n * @public\r\n */\r\nexport class OrderedSet<T> extends ReadonlyOrderedSet<T> {\r\n  /** Construct a new OrderedSet<T>.\r\n   * @param compare The function used to compare elements within the set, determining their ordering.\r\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    super(compare, clone);\r\n  }\r\n\r\n  /** Remove all elements from the set. */\r\n  public clear(): void {\r\n    this._array.clear();\r\n  }\r\n\r\n  /** Add the specified element to the set. Returns this set. */\r\n  public add(value: T): this {\r\n    this._array.insert(value);\r\n    return this;\r\n  }\r\n\r\n  /** Removes the specified element from the set. Returns `true` if the element was present. */\r\n  public delete(value: T): boolean {\r\n    return -1 !== this._array.remove(value);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"OrderedSet.js","sourceRoot":"","sources":["../../src/OrderedSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAEzE;;;;GAIG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAI,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,yCAAyC;IACzC,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qDAAqD;IAC9C,GAAG,CAAC,KAAQ;QACjB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED,6HAA6H;IACtH,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACxC,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,UAAc,SAAQ,kBAAqB;IACtD;;;OAGG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QACtF,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,wCAAwC;IACjC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,8DAA8D;IACvD,GAAG,CAAC,KAAQ;QACjB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6FAA6F;IACtF,MAAM,CAAC,KAAQ;QACpB,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, shallowClone, SortedArray } from \"./SortedArray\";\n\n/** A read-only equivalent of `Set<T>` that maintains its elements in sorted order as specified by a comparison function.\n * Iteration returns elements in the order specified by the comparison function, as opposed to `Set` which returns elements in insertion order.\n * Implemented in terms of [[SortedArray]].\n * @public\n */\nexport class ReadonlyOrderedSet<T> implements Iterable<T> {\n  protected readonly _array: SortedArray<T>;\n\n  /** Construct a new ReadonlyOrderedSet<T>.\n   * @param compare The function used to compare elements within the set, determining their ordering.\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    this._array = new SortedArray<T>(compare, false, clone);\n  }\n\n  /** The number of elements in the set. */\n  public get size(): number {\n    return this._array.length;\n  }\n\n  /** Returns true if `value` is present in the set. */\n  public has(value: T): boolean {\n    return -1 !== this._array.indexOf(value);\n  }\n\n  /** Iterate over the elements in sorted order (as opposed to `Set`'s iterator, which returns elements in insertion order). */\n  public [Symbol.iterator](): Iterator<T> {\n    return this._array[Symbol.iterator]();\n  }\n}\n\n/** A mutable [[ReadonlyOrderedSet]].\n * @public\n */\nexport class OrderedSet<T> extends ReadonlyOrderedSet<T> {\n  /** Construct a new OrderedSet<T>.\n   * @param compare The function used to compare elements within the set, determining their ordering.\n   * @param clone The function invoked to clone a new element for insertion into the set. The default implementation simply returns its input.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    super(compare, clone);\n  }\n\n  /** Remove all elements from the set. */\n  public clear(): void {\n    this._array.clear();\n  }\n\n  /** Add the specified element to the set. Returns this set. */\n  public add(value: T): this {\n    this._array.insert(value);\n    return this;\n  }\n\n  /** Removes the specified element from the set. Returns `true` if the element was present. */\n  public delete(value: T): boolean {\n    return -1 !== this._array.remove(value);\n  }\n}\n"]}

package/lib/esm/PriorityQueue.d.ts

@@ -1,71 +1,71 @@
-/** @packageDocumentation
- * @module Collections
- */
-import { OrderedComparator } from "./Compare";
-import { CloneFunction } from "./SortedArray";
-/** @public */
-export declare type ComputePriorityFunction<T> = (value: T) => number;
-/**
- * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.
- * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.
- * @public
- */
-export declare class PriorityQueue<T> implements Iterable<T> {
-    protected _array: T[];
-    protected readonly _compare: OrderedComparator<T>;
-    protected readonly _clone: CloneFunction<T>;
-    /**
-     * Constructor
-     * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.
-     * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.
-     * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.
-     */
-    constructor(compare: OrderedComparator<T>, clone?: CloneFunction<T>);
-    /** The number of values in the queue. */
-    get length(): number;
-    /** Returns true if the queue contains no values. */
-    get isEmpty(): boolean;
-    /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */
-    [Symbol.iterator](): Iterator<T>;
-    protected _swap(a: number, b: number): void;
-    protected _heapify(index: number): void;
-    /**
-     * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.
-     * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.
-     */
-    sort(): void;
-    /**
-     * Pushes a value onto the queue according to the sorting criterion.
-     * @param value The value to insert
-     * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
-     */
-    push(value: T): T;
-    /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.
-     * After using this function, you must manually invoke sort() to ensure the queue is sorted again.
-     * @param value The value to append
-     * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
-     */
-    append(value: T): T;
-    /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */
-    get front(): T | undefined;
-    /**
-     * Removes the front-most element off of the queue and returns it.
-     * @returns The front-most element, or undefined if the queue is empty.
-     */
-    pop(): T | undefined;
-    /** Removes all values from the queue. */
-    clear(): void;
-    /**
-     * Removes the value at the specified index from the queue and reorders the queue.
-     * @param index The index of the value to remove
-     * @returns the value at the specified index, or undefined if the index is out of range.
-     */
-    protected _pop(index: number): T | undefined;
-    /**
-     * Returns the value at the specified index in the queue.
-     * @param index The index of the value to retrieve
-     * @returns the value at the specified index, or undefined if the index is out of range.
-     */
-    protected _peek(index: number): T | undefined;
-}
+/** @packageDocumentation
+ * @module Collections
+ */
+import { OrderedComparator } from "./Compare";
+import { CloneFunction } from "./SortedArray";
+/** @public */
+export declare type ComputePriorityFunction<T> = (value: T) => number;
+/**
+ * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.
+ * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.
+ * @public
+ */
+export declare class PriorityQueue<T> implements Iterable<T> {
+    protected _array: T[];
+    protected readonly _compare: OrderedComparator<T>;
+    protected readonly _clone: CloneFunction<T>;
+    /**
+     * Constructor
+     * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.
+     * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.
+     * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.
+     */
+    constructor(compare: OrderedComparator<T>, clone?: CloneFunction<T>);
+    /** The number of values in the queue. */
+    get length(): number;
+    /** Returns true if the queue contains no values. */
+    get isEmpty(): boolean;
+    /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */
+    [Symbol.iterator](): Iterator<T>;
+    protected _swap(a: number, b: number): void;
+    protected _heapify(index: number): void;
+    /**
+     * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.
+     * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.
+     */
+    sort(): void;
+    /**
+     * Pushes a value onto the queue according to the sorting criterion.
+     * @param value The value to insert
+     * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
+     */
+    push(value: T): T;
+    /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.
+     * After using this function, you must manually invoke sort() to ensure the queue is sorted again.
+     * @param value The value to append
+     * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
+     */
+    append(value: T): T;
+    /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */
+    get front(): T | undefined;
+    /**
+     * Removes the front-most element off of the queue and returns it.
+     * @returns The front-most element, or undefined if the queue is empty.
+     */
+    pop(): T | undefined;
+    /** Removes all values from the queue. */
+    clear(): void;
+    /**
+     * Removes the value at the specified index from the queue and reorders the queue.
+     * @param index The index of the value to remove
+     * @returns the value at the specified index, or undefined if the index is out of range.
+     */
+    protected _pop(index: number): T | undefined;
+    /**
+     * Returns the value at the specified index in the queue.
+     * @param index The index of the value to retrieve
+     * @returns the value at the specified index, or undefined if the index is out of range.
+     */
+    protected _peek(index: number): T | undefined;
+}
 //# sourceMappingURL=PriorityQueue.d.ts.map

package/lib/esm/PriorityQueue.js

@@ -1,137 +1,137 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/** @packageDocumentation
- * @module Collections
- */
-import { shallowClone } from "./SortedArray";
-/**
- * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.
- * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.
- * @public
- */
-export class PriorityQueue {
-    /**
-     * Constructor
-     * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.
-     * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.
-     * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.
-     */
-    constructor(compare, clone = shallowClone) {
-        this._array = [];
-        this._compare = compare;
-        this._clone = clone;
-    }
-    /** The number of values in the queue. */
-    get length() { return this._array.length; }
-    /** Returns true if the queue contains no values. */
-    get isEmpty() { return 0 === this.length; }
-    /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */
-    [Symbol.iterator]() { return this._array[Symbol.iterator](); }
-    _swap(a, b) {
-        const temp = this._array[a];
-        this._array[a] = this._array[b];
-        this._array[b] = temp;
-    }
-    _heapify(index) {
-        let candidate = -1;
-        while (true) {
-            const right = 2 * (index + 1);
-            const left = right - 1;
-            if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)
-                candidate = left;
-            else
-                candidate = index;
-            if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)
-                candidate = right;
-            if (candidate !== index) {
-                this._swap(candidate, index);
-                index = candidate;
-            }
-            else {
-                break;
-            }
-        }
-    }
-    /**
-     * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.
-     * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.
-     */
-    sort() {
-        for (let i = Math.ceil(this.length / 2); i >= 0; i--)
-            this._heapify(i);
-    }
-    /**
-     * Pushes a value onto the queue according to the sorting criterion.
-     * @param value The value to insert
-     * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
-     */
-    push(value) {
-        const clone = this._clone(value);
-        let index = this.length;
-        this._array.push(clone);
-        while (index !== 0) {
-            const parent = Math.floor((index - 1) / 2);
-            if (this._compare(this._array[index], this._array[parent]) < 0) {
-                this._swap(index, parent);
-                index = parent;
-            }
-            else {
-                break;
-            }
-        }
-        return clone;
-    }
-    /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.
-     * After using this function, you must manually invoke sort() to ensure the queue is sorted again.
-     * @param value The value to append
-     * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
-     */
-    append(value) {
-        const clone = this._clone(value);
-        this._array.push(clone);
-        return clone;
-    }
-    /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */
-    get front() {
-        return this._peek(0);
-    }
-    /**
-     * Removes the front-most element off of the queue and returns it.
-     * @returns The front-most element, or undefined if the queue is empty.
-     */
-    pop() {
-        return this._pop(0);
-    }
-    /** Removes all values from the queue. */
-    clear() {
-        this._array.length = 0;
-    }
-    /**
-     * Removes the value at the specified index from the queue and reorders the queue.
-     * @param index The index of the value to remove
-     * @returns the value at the specified index, or undefined if the index is out of range.
-     */
-    _pop(index) {
-        if (index < 0 || index >= this.length)
-            return undefined;
-        const root = this._array[index];
-        this._swap(index, this.length - 1);
-        this._array.length--;
-        this._heapify(index);
-        return root;
-    }
-    /**
-     * Returns the value at the specified index in the queue.
-     * @param index The index of the value to retrieve
-     * @returns the value at the specified index, or undefined if the index is out of range.
-     */
-    _peek(index) {
-        if (index < 0 || index >= this.length)
-            return undefined;
-        else
-            return this._array[index];
-    }
-}
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Collections
+ */
+import { shallowClone } from "./SortedArray";
+/**
+ * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.
+ * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.
+ * @public
+ */
+export class PriorityQueue {
+    /**
+     * Constructor
+     * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.
+     * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.
+     * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.
+     */
+    constructor(compare, clone = shallowClone) {
+        this._array = [];
+        this._compare = compare;
+        this._clone = clone;
+    }
+    /** The number of values in the queue. */
+    get length() { return this._array.length; }
+    /** Returns true if the queue contains no values. */
+    get isEmpty() { return 0 === this.length; }
+    /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */
+    [Symbol.iterator]() { return this._array[Symbol.iterator](); }
+    _swap(a, b) {
+        const temp = this._array[a];
+        this._array[a] = this._array[b];
+        this._array[b] = temp;
+    }
+    _heapify(index) {
+        let candidate = -1;
+        while (true) {
+            const right = 2 * (index + 1);
+            const left = right - 1;
+            if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)
+                candidate = left;
+            else
+                candidate = index;
+            if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)
+                candidate = right;
+            if (candidate !== index) {
+                this._swap(candidate, index);
+                index = candidate;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    /**
+     * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.
+     * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.
+     */
+    sort() {
+        for (let i = Math.ceil(this.length / 2); i >= 0; i--)
+            this._heapify(i);
+    }
+    /**
+     * Pushes a value onto the queue according to the sorting criterion.
+     * @param value The value to insert
+     * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
+     */
+    push(value) {
+        const clone = this._clone(value);
+        let index = this.length;
+        this._array.push(clone);
+        while (index !== 0) {
+            const parent = Math.floor((index - 1) / 2);
+            if (this._compare(this._array[index], this._array[parent]) < 0) {
+                this._swap(index, parent);
+                index = parent;
+            }
+            else {
+                break;
+            }
+        }
+        return clone;
+    }
+    /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.
+     * After using this function, you must manually invoke sort() to ensure the queue is sorted again.
+     * @param value The value to append
+     * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.
+     */
+    append(value) {
+        const clone = this._clone(value);
+        this._array.push(clone);
+        return clone;
+    }
+    /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */
+    get front() {
+        return this._peek(0);
+    }
+    /**
+     * Removes the front-most element off of the queue and returns it.
+     * @returns The front-most element, or undefined if the queue is empty.
+     */
+    pop() {
+        return this._pop(0);
+    }
+    /** Removes all values from the queue. */
+    clear() {
+        this._array.length = 0;
+    }
+    /**
+     * Removes the value at the specified index from the queue and reorders the queue.
+     * @param index The index of the value to remove
+     * @returns the value at the specified index, or undefined if the index is out of range.
+     */
+    _pop(index) {
+        if (index < 0 || index >= this.length)
+            return undefined;
+        const root = this._array[index];
+        this._swap(index, this.length - 1);
+        this._array.length--;
+        this._heapify(index);
+        return root;
+    }
+    /**
+     * Returns the value at the specified index in the queue.
+     * @param index The index of the value to retrieve
+     * @returns the value at the specified index, or undefined if the index is out of range.
+     */
+    _peek(index) {
+        if (index < 0 || index >= this.length)
+            return undefined;
+        else
+            return this._array[index];
+    }
+}
 //# sourceMappingURL=PriorityQueue.js.map

package/lib/esm/PriorityQueue.js.map

@@ -1 +1 @@
-{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,MAAM,eAAe,CAAC;AAK5D;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAKxB;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QAV9E,WAAM,GAAQ,EAAE,CAAC;QAWzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,4FAA4F;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAExE,KAAK,CAAC,CAAS,EAAE,CAAS;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACxB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,EAAE;YACX,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;gBAChF,SAAS,GAAG,IAAI,CAAC;;gBAEjB,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC;gBACtF,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC7B,KAAK,GAAG,SAAS,CAAC;aACnB;iBAAM;gBACL,MAAM;aACP;SACF;IACH,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,KAAQ;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAExB,OAAO,KAAK,KAAK,CAAC,EAAE;YAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC9D,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1B,KAAK,GAAG,MAAM,CAAC;aAChB;iBAAM;gBACL,MAAM;aACP;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAQ;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2FAA2F;IAC3F,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,yCAAyC;IAClC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,IAAI,CAAC,KAAa;QAC1B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAErB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Collections\r\n */\r\n\r\nimport { OrderedComparator } from \"./Compare\";\r\nimport { CloneFunction, shallowClone } from \"./SortedArray\";\r\n\r\n/** @public */\r\nexport type ComputePriorityFunction<T> = (value: T) => number;\r\n\r\n/**\r\n * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.\r\n * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.\r\n * @public\r\n */\r\nexport class PriorityQueue<T> implements Iterable<T> {\r\n  protected _array: T[] = [];\r\n  protected readonly _compare: OrderedComparator<T>;\r\n  protected readonly _clone: CloneFunction<T>;\r\n\r\n  /**\r\n   * Constructor\r\n   * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.\r\n   * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.\r\n   * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.\r\n   */\r\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\r\n    this._compare = compare;\r\n    this._clone = clone;\r\n  }\r\n\r\n  /** The number of values in the queue. */\r\n  public get length(): number { return this._array.length; }\r\n\r\n  /** Returns true if the queue contains no values. */\r\n  public get isEmpty(): boolean { return 0 === this.length; }\r\n\r\n  /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */\r\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\r\n\r\n  protected _swap(a: number, b: number) {\r\n    const temp = this._array[a];\r\n    this._array[a] = this._array[b];\r\n    this._array[b] = temp;\r\n  }\r\n\r\n  protected _heapify(index: number): void {\r\n    let candidate = -1;\r\n    while (true) {\r\n      const right = 2 * (index + 1);\r\n      const left = right - 1;\r\n      if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)\r\n        candidate = left;\r\n      else\r\n        candidate = index;\r\n\r\n      if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)\r\n        candidate = right;\r\n\r\n      if (candidate !== index) {\r\n        this._swap(candidate, index);\r\n        index = candidate;\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.\r\n   * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.\r\n   */\r\n  public sort(): void {\r\n    for (let i = Math.ceil(this.length / 2); i >= 0; i--)\r\n      this._heapify(i);\r\n  }\r\n\r\n  /**\r\n   * Pushes a value onto the queue according to the sorting criterion.\r\n   * @param value The value to insert\r\n   * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\r\n   */\r\n  public push(value: T): T {\r\n    const clone = this._clone(value);\r\n\r\n    let index = this.length;\r\n    this._array.push(clone);\r\n\r\n    while (index !== 0) {\r\n      const parent = Math.floor((index - 1) / 2);\r\n      if (this._compare(this._array[index], this._array[parent]) < 0) {\r\n        this._swap(index, parent);\r\n        index = parent;\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n\r\n    return clone;\r\n  }\r\n\r\n  /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.\r\n   * After using this function, you must manually invoke sort() to ensure the queue is sorted again.\r\n   * @param value The value to append\r\n   * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\r\n   */\r\n  public append(value: T): T {\r\n    const clone = this._clone(value);\r\n    this._array.push(clone);\r\n    return clone;\r\n  }\r\n\r\n  /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */\r\n  public get front(): T | undefined {\r\n    return this._peek(0);\r\n  }\r\n\r\n  /**\r\n   * Removes the front-most element off of the queue and returns it.\r\n   * @returns The front-most element, or undefined if the queue is empty.\r\n   */\r\n  public pop(): T | undefined {\r\n    return this._pop(0);\r\n  }\r\n\r\n  /** Removes all values from the queue. */\r\n  public clear(): void {\r\n    this._array.length = 0;\r\n  }\r\n\r\n  /**\r\n   * Removes the value at the specified index from the queue and reorders the queue.\r\n   * @param index The index of the value to remove\r\n   * @returns the value at the specified index, or undefined if the index is out of range.\r\n   */\r\n  protected _pop(index: number): T | undefined {\r\n    if (index < 0 || index >= this.length)\r\n      return undefined;\r\n\r\n    const root = this._array[index];\r\n    this._swap(index, this.length - 1);\r\n    this._array.length--;\r\n\r\n    this._heapify(index);\r\n    return root;\r\n  }\r\n\r\n  /**\r\n   * Returns the value at the specified index in the queue.\r\n   * @param index The index of the value to retrieve\r\n   * @returns the value at the specified index, or undefined if the index is out of range.\r\n   */\r\n  protected _peek(index: number): T | undefined {\r\n    if (index < 0 || index >= this.length)\r\n      return undefined;\r\n    else\r\n      return this._array[index];\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAiB,YAAY,EAAE,MAAM,eAAe,CAAC;AAK5D;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAKxB;;;;;OAKG;IACH,YAAmB,OAA6B,EAAE,QAA0B,YAAY;QAV9E,WAAM,GAAQ,EAAE,CAAC;QAWzB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,yCAAyC;IACzC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAE1D,oDAAoD;IACpD,IAAW,OAAO,KAAc,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE3D,4FAA4F;IACrF,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAkB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAExE,KAAK,CAAC,CAAS,EAAE,CAAS;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACxB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,OAAO,IAAI,EAAE;YACX,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;gBAChF,SAAS,GAAG,IAAI,CAAC;;gBAEjB,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC;gBACtF,SAAS,GAAG,KAAK,CAAC;YAEpB,IAAI,SAAS,KAAK,KAAK,EAAE;gBACvB,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;gBAC7B,KAAK,GAAG,SAAS,CAAC;aACnB;iBAAM;gBACL,MAAM;aACP;SACF;IACH,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,IAAI,CAAC,KAAQ;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEjC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAExB,OAAO,KAAK,KAAK,CAAC,EAAE;YAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC9D,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC1B,KAAK,GAAG,MAAM,CAAC;aAChB;iBAAM;gBACL,MAAM;aACP;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAQ;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2FAA2F;IAC3F,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED;;;OAGG;IACI,GAAG;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,yCAAyC;IAClC,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACO,IAAI,CAAC,KAAa;QAC1B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;QAEnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QAErB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,KAAa;QAC3B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YACnC,OAAO,SAAS,CAAC;;YAEjB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Collections\n */\n\nimport { OrderedComparator } from \"./Compare\";\nimport { CloneFunction, shallowClone } from \"./SortedArray\";\n\n/** @public */\nexport type ComputePriorityFunction<T> = (value: T) => number;\n\n/**\n * A [priority queue](https://en.wikipedia.org/wiki/Priority_queue) implemented as a heap array.\n * The queue is ordered by an [[OrderedComparator]] function supplied by the user such that the value in the queue that compares less than all other values is always located at the front of the queue.\n * @public\n */\nexport class PriorityQueue<T> implements Iterable<T> {\n  protected _array: T[] = [];\n  protected readonly _compare: OrderedComparator<T>;\n  protected readonly _clone: CloneFunction<T>;\n\n  /**\n   * Constructor\n   * @param compare The function used to compare values in the queue. If `compare(x, y)` returns a negative value, then x is placed before y in the queue.\n   * @param clone The function used to clone a value for insertion onto the queue. The default implementation simply returns its input.\n   * @note If the criterion which control the result of the `compare` function changes, then [[PriorityQueue.sort]] should be used to reorder the queue according to the new criterion.\n   */\n  public constructor(compare: OrderedComparator<T>, clone: CloneFunction<T> = shallowClone) {\n    this._compare = compare;\n    this._clone = clone;\n  }\n\n  /** The number of values in the queue. */\n  public get length(): number { return this._array.length; }\n\n  /** Returns true if the queue contains no values. */\n  public get isEmpty(): boolean { return 0 === this.length; }\n\n  /** Returns an iterator over the contents of the heap suitable for use in `for-of` loops. */\n  public [Symbol.iterator](): Iterator<T> { return this._array[Symbol.iterator](); }\n\n  protected _swap(a: number, b: number) {\n    const temp = this._array[a];\n    this._array[a] = this._array[b];\n    this._array[b] = temp;\n  }\n\n  protected _heapify(index: number): void {\n    let candidate = -1;\n    while (true) {\n      const right = 2 * (index + 1);\n      const left = right - 1;\n      if (left < this.length && this._compare(this._array[left], this._array[index]) < 0)\n        candidate = left;\n      else\n        candidate = index;\n\n      if (right < this.length && this._compare(this._array[right], this._array[candidate]) < 0)\n        candidate = right;\n\n      if (candidate !== index) {\n        this._swap(candidate, index);\n        index = candidate;\n      } else {\n        break;\n      }\n    }\n  }\n\n  /**\n   * Reorders the queue. This function should only (and *always*) be called when the criteria governing the ordering of items on the queue have changed.\n   * For example, a priority queue containing graphics sorted by their distance from the camera would need to be reordered when the position of the camera changes.\n   */\n  public sort(): void {\n    for (let i = Math.ceil(this.length / 2); i >= 0; i--)\n      this._heapify(i);\n  }\n\n  /**\n   * Pushes a value onto the queue according to the sorting criterion.\n   * @param value The value to insert\n   * @returns The inserted value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\n   */\n  public push(value: T): T {\n    const clone = this._clone(value);\n\n    let index = this.length;\n    this._array.push(clone);\n\n    while (index !== 0) {\n      const parent = Math.floor((index - 1) / 2);\n      if (this._compare(this._array[index], this._array[parent]) < 0) {\n        this._swap(index, parent);\n        index = parent;\n      } else {\n        break;\n      }\n    }\n\n    return clone;\n  }\n\n  /** Pushes a value onto the back of the queue without making any attempt to enforce ordering.\n   * After using this function, you must manually invoke sort() to ensure the queue is sorted again.\n   * @param value The value to append\n   * @returns The appended value, cloned according to the [[CloneFunction]] supplied to this queue's constructor.\n   */\n  public append(value: T): T {\n    const clone = this._clone(value);\n    this._array.push(clone);\n    return clone;\n  }\n\n  /** Returns the element at the front of the queue, or `undefined` if the queue is empty. */\n  public get front(): T | undefined {\n    return this._peek(0);\n  }\n\n  /**\n   * Removes the front-most element off of the queue and returns it.\n   * @returns The front-most element, or undefined if the queue is empty.\n   */\n  public pop(): T | undefined {\n    return this._pop(0);\n  }\n\n  /** Removes all values from the queue. */\n  public clear(): void {\n    this._array.length = 0;\n  }\n\n  /**\n   * Removes the value at the specified index from the queue and reorders the queue.\n   * @param index The index of the value to remove\n   * @returns the value at the specified index, or undefined if the index is out of range.\n   */\n  protected _pop(index: number): T | undefined {\n    if (index < 0 || index >= this.length)\n      return undefined;\n\n    const root = this._array[index];\n    this._swap(index, this.length - 1);\n    this._array.length--;\n\n    this._heapify(index);\n    return root;\n  }\n\n  /**\n   * Returns the value at the specified index in the queue.\n   * @param index The index of the value to retrieve\n   * @returns the value at the specified index, or undefined if the index is out of range.\n   */\n  protected _peek(index: number): T | undefined {\n    if (index < 0 || index >= this.length)\n      return undefined;\n    else\n      return this._array[index];\n  }\n}\n"]}