@rocicorp/zero 0.26.1 → 0.26.2-canary.1

package/out/shared/src/btree-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"btree-set.js","sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    i < leaf.keys.length &&\n    // +1 because we did -1 above.\n    comparator(leaf.keys[i + 1], lowestKey!) === 0\n  ) {\n    i++;\n  }\n\n  return iterator<K>(() => {\n    for (;;) {\n      if (++i < leaf.keys.length) {\n        return {done: false, value: leaf.keys[i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= nodeQueue.length) {\n          return {done: true, value: undefined};\n        }\n        if (++nodeIndex[level] < nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        nodeQueue[level - 1] = (\n          nodeQueue[level][nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        nodeIndex[level - 1] = 0;\n      }\n      leaf = nodeQueue[0][nodeIndex[0]];\n      i = -1;\n    }\n  });\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined)\n      return iterator<K>(() => ({done: true, value: undefined})); // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return iterator<K>(() => {\n    for (;;) {\n      if (--i >= 0) {\n        return {done: false, value: leaf.keys[i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ; ) {\n        if (++level >= nodeQueue.length) {\n          return {done: true, value: undefined};\n        }\n        if (--nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        nodeQueue[level - 1] = (\n          nodeQueue[level][nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        nodeIndex[level - 1] = nodeQueue[level - 1].length - 1;\n      }\n      leaf = nodeQueue[0][nodeIndex[0]];\n      i = leaf.keys.length;\n    }\n  });\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    return this.keys[this.keys.length - 1];\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (children[i].isShared)\n          // cloned already UNLESS i is outside scan range\n          children[i] = children[i].clone();\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"names":["key"],"mappings":";AAEA,MAAM,gBAAgB;AAGf,MAAM,SAAY;AAAA,EACvB,QAAkB;AAAA,EAClB,OAAe;AAAA,EAEN;AAAA,EAET,YAAY,YAA2B,SAA+B;AACpE,SAAK,aAAa;AAClB,QAAI,SAAS;AACX,iBAAW,OAAO,SAAS;AACzB,aAAK,IAAI,GAAG;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,QAAQ;AACN,SAAK,QAAQ;AACb,SAAK,OAAO;AAAA,EACd;AAAA,EAEA,QAAQ;AACN,SAAK,MAAM,WAAW;AACtB,UAAM,MAAM,IAAI,SAAY,KAAK,UAAU;AAC3C,QAAI,QAAQ,KAAK;AACjB,QAAI,OAAO,KAAK;AAChB,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,KAAuB;AACzB,WAAO,KAAK,MAAM,IAAI,KAAK,IAAI;AAAA,EACjC;AAAA,EAEA,IAAI,KAAc;AAChB,QAAI,KAAK,MAAM,eAAe,QAAQ,KAAK,MAAM,MAAA;AACjD,UAAM,SAAS,KAAK,MAAM,IAAI,KAAK,IAAI;AACvC,QAAI,WAAW,KAAM,QAAO;AAE5B,SAAK,QAAQ,IAAI,cAAiB,CAAC,KAAK,OAAO,MAAM,CAAC;AACtD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,IAAI,KAAiB;AACnB,WAAO,KAAK,MAAM,IAAI,KAAK,IAAI;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO,KAAiB;AACtB,WAAO,KAAK,QAAQ,GAAG;AAAA,EACzB;AAAA,EAEA,QAAQ,KAAiB;AACvB,QAAI,OAAO,KAAK;AAChB,QAAI,KAAK,UAAU;AACjB,WAAK,QAAQ,OAAO,KAAK,MAAA;AAAA,IAC3B;AACA,QAAI;AACF,aAAO,KAAK,OAAO,KAAK,IAAI;AAAA,IAC9B,UAAA;AACE,UAAI;AACJ,aAAO,KAAK,KAAK,UAAU,KAAK,KAAK,cAAc;AACjD,qBAAa,KAAK;AAClB,aAAK,QAAQ,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS,CAAC;AAAA,MACxD;AAEA,UAAI,UAAU;AACZ,aAAK,WAAW;AAAA,MAClB;AAAA,IACF;AAAA,EACF;AAAA,EAEA,OAA4B;AAC1B,WAAO,WAAW,KAAK,OAAO,KAAK,YAAY,QAAW,IAAI;AAAA,EAChE;AAAA,EAEA,SAA8B;AAC5B,WAAO,WAAW,KAAK,OAAO,KAAK,YAAY,QAAW,IAAI;AAAA,EAChE;AAAA,EAEA,WAAW,WAAe,YAAqB,MAA2B;AACxE,WAAO,WAAW,KAAK,OAAO,KAAK,YAAY,WAAW,SAAS;AAAA,EACrE;AAAA,EAEA,iBAAsC;AACpC,WAAO;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA,EAEA,mBACE,YACA,YAAqB,MACA;AACrB,WAAO;AAAA,MACL,KAAK,QAAA;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,MACA;AAAA,IAAA;AAAA,EAEJ;AAAA;AAAA,EAGA,UAAyB;AACvB,WAAO,KAAK,MAAM,OAAA;AAAA,EACpB;AAAA,EAEA,CAAC,OAAO,QAAQ,IAAyB;AACvC,WAAO,KAAK,KAAA;AAAA,EACd;AACF;AAEA,SAAS,WACP,MACA,YACA,WACA,WACqB;AACrB,QAAM,OAAO,SAAS,WAAW,MAAM,UAAU;AACjD,MAAI,SAAS,QAAW;AACtB,WAAO,SAAY,OAAO,EAAC,MAAM,MAAM,OAAO,SAAW;AAAA,EAC3D;AAEA,MAAI,CAAC,WAAW,WAAW,IAAI,IAAI;AACnC,MAAI,IACF,cAAc,SACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,UAAU,IAAI;AAErD,MACE,CAAC,aACD,IAAI,KAAK,KAAK;AAAA,EAEd,WAAW,KAAK,KAAK,IAAI,CAAC,GAAG,SAAU,MAAM,GAC7C;AACA;AAAA,EACF;AAEA,SAAO,SAAY,MAAM;AACvB,eAAS;AACP,UAAI,EAAE,IAAI,KAAK,KAAK,QAAQ;AAC1B,eAAO,EAAC,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,EAAA;AAAA,MACzC;AAEA,UAAI,QAAQ;AACZ,iBAAS;AACP,YAAI,EAAE,SAAS,UAAU,QAAQ;AAC/B,iBAAO,EAAC,MAAM,MAAM,OAAO,OAAA;AAAA,QAC7B;AACA,YAAI,EAAE,UAAU,KAAK,IAAI,UAAU,KAAK,EAAE,QAAQ;AAChD;AAAA,QACF;AAAA,MACF;AACA,aAAO,QAAQ,GAAG,SAAS;AACzB,kBAAU,QAAQ,CAAC,IACjB,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,EACjC;AACF,kBAAU,QAAQ,CAAC,IAAI;AAAA,MACzB;AACA,aAAO,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;AAChC,UAAI;AAAA,IACN;AAAA,EACF,CAAC;AACH;AAEA,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;AACrB,MAAI,eAAe,QAAW;AAC5B,iBAAa;AACb,QAAI,eAAe;AACjB,aAAO,SAAY,OAAO,EAAC,MAAM,MAAM,OAAO,SAAW;AAAA,EAC7D;AACA,MAAI,CAAC,WAAW,WAAW,IAAI,IAC7B,SAAS,YAAY,MAAM,UAAU,KACrC,SAAS,QAAQ,MAAM,UAAU;AACnC;AAAA,IACE,CAAC,UAAU,CAAC,KAAK,SAAS,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;AAAA,IACnD;AAAA,EAAA;AAEF,MAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,UAAU;AACpD,MACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,CAAC,GAAG,UAAU,KAAK,GACxC;AACA;AAAA,EACF;AAEA,SAAO,SAAY,MAAM;AACvB,eAAS;AACP,UAAI,EAAE,KAAK,GAAG;AACZ,eAAO,EAAC,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,EAAA;AAAA,MACzC;AAEA,UAAI;AAEJ,WAAK,QAAQ,QAAQ;AACnB,YAAI,EAAE,SAAS,UAAU,QAAQ;AAC/B,iBAAO,EAAC,MAAM,MAAM,OAAO,OAAA;AAAA,QAC7B;AACA,YAAI,EAAE,UAAU,KAAK,KAAK,GAAG;AAC3B;AAAA,QACF;AAAA,MACF;AACA,aAAO,QAAQ,GAAG,SAAS;AACzB,kBAAU,QAAQ,CAAC,IACjB,UAAU,KAAK,EAAE,UAAU,KAAK,CAAC,EACjC;AACF,kBAAU,QAAQ,CAAC,IAAI,UAAU,QAAQ,CAAC,EAAE,SAAS;AAAA,MACvD;AACA,aAAO,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;AAChC,UAAI,KAAK,KAAK;AAAA,IAChB;AAAA,EACF,CAAC;AACH;AAEA,SAAS,SACP,KACA,MACA,YAC4E;AAC5E,MAAI,WAAW;AACf,QAAM,YAA0B,CAAA;AAChC,QAAM,YAAsB,CAAA;AAE5B,MAAI,SAAS,cAAc;AACzB,aAAS,IAAI,GAAG,SAAS,WAAA,GAAc,KAAK;AAC1C,gBAAU,CAAC,IAAI,SAAS;AACxB,gBAAU,CAAC,IACT,QAAQ,SAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,UAAU;AACnE,UAAI,UAAU,CAAC,KAAK,UAAU,CAAC,EAAE,OAAQ;AACzC,iBAAW,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC;AAAA,IACtC;AACA,cAAU,QAAA;AACV,cAAU,QAAA;AAAA,EACZ;AACA,SAAO,CAAC,WAAW,WAAW,QAAQ;AACxC;AAEA,SAAS,SAAY,MAAoD;AACvE,SAAO;AAAA,IACL;AAAA,IACA,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,EAAA;AAEJ;AAGA,MAAM,MAAS;AAAA;AAAA,EAEb;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA;AAAA,EAEA,YAAY,MAAW;AACrB,SAAK,OAAO;AACZ,SAAK,WAAW;AAAA,EAClB;AAAA,EAEA,aAAuC;AACrC,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,WAAO,KAAK,KAAK,KAAK,KAAK,SAAS,CAAC;AAAA,EACvC;AAAA,EAEA,SAAwB;AACtB,WAAO,KAAK,KAAK,CAAC;AAAA,EACpB;AAAA,EAEA,QAAkB;AAChB,WAAO,IAAI,MAAS,KAAK,KAAK,MAAM,CAAC,CAAC;AAAA,EACxC;AAAA,EAEA,IAAI,KAAQ,MAAkC;AAC5C,UAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;AACrD,WAAO,IAAI,IAAI,SAAY,KAAK,KAAK,CAAC;AAAA,EACxC;AAAA,EAEA,IAAI,KAAQ,MAA4B;AACtC,UAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;AACrD,WAAO,KAAK,KAAK,IAAI,KAAK,KAAK;AAAA,EACjC;AAAA,EAEA,IAAI,KAAQ,MAAoC;AAC9C,QAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,UAAU;AACnD,QAAI,IAAI,GAAG;AAET,UAAI,CAAC;AACL,WAAK;AAEL,UAAI,KAAK,KAAK,SAAS,eAAe;AACpC,aAAK,KAAK,OAAO,GAAG,GAAG,GAAG;AAC1B,eAAO;AAAA,MACT;AAEA,YAAM,kBAAkB,KAAK,kBAAA;AAE7B,UAAI,SAAmB;AACvB,UAAI,IAAI,KAAK,KAAK,QAAQ;AACxB,aAAK,KAAK,KAAK;AACf,iBAAS;AAAA,MACX;AAEA,aAAO,KAAK,OAAO,GAAG,GAAG,GAAG;AAE5B,aAAO;AAAA,IACT;AAGA,SAAK,KAAK,CAAC,IAAI;AACf,WAAO;AAAA,EACT;AAAA,EAEA,cAAc,KAAe;AAC3B,SAAK,KAAK,KAAK,IAAI,KAAK,OAAQ;AAAA,EAClC;AAAA,EAEA,aAAa,KAAe;AAC1B,SAAK,KAAK,QAAQ,IAAI,KAAK,KAAM;AAAA,EACnC;AAAA,EAEA,oBAA8B;AAC5B,UAAM,OAAO,KAAK,KAAK,UAAU;AACjC,UAAM,OAAO,KAAK,KAAK,OAAO,IAAI;AAClC,WAAO,IAAI,MAAS,IAAI;AAAA,EAC1B;AAAA,EAEA,OAAO,KAAQ,MAA4B;AACzC,UAAM,MAAM,KAAK;AACjB,UAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,GAAG;AAC5C,UAAM,QAAQ,OAAO;AAErB,QAAI,OAAO,GAAG;AACZ,aAAO;AAAA,IACT;AAEA,UAAM,EAAC,SAAQ;AACf,aAAS,IAAI,MAAM,IAAI,OAAO,KAAK;AACjC,YAAMA,OAAM,KAAK,CAAC;AAElB,UAAIA,SAAQ,KAAK,CAAC,KAAK,KAAK,aAAa,MAAM;AAC7C,cAAM,IAAI,MAAM,6CAA6C;AAAA,MAC/D;AAEA,WAAK,KAAK,OAAO,GAAG,CAAC;AACrB,WAAK;AACL,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,aAAa,KAAe,GAAW;AACrC,SAAK,KAAK,KAAK,GAAG,IAAI,IAAI;AAAA,EAC5B;AACF;AAGA,MAAM,sBAAyB,MAAS;AAAA;AAAA;AAAA;AAAA,EAItC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY,UAAsB,MAAY;AAC5C,QAAI,CAAC,MAAM;AACT,aAAO,CAAA;AACP,eAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,aAAK,CAAC,IAAI,SAAS,CAAC,EAAE,OAAA;AAAA,MACxB;AAAA,IACF;AACA,UAAM,IAAI;AACV,SAAK,WAAW;AAAA,EAClB;AAAA,EAEA,aAAuC;AACrC,WAAO;AAAA,EACT;AAAA,EAEA,QAAkB;AAChB,UAAM,WAAW,KAAK,SAAS,MAAM,CAAC;AACtC,aAAS,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;AACxC,eAAS,CAAC,EAAE,WAAW;AAAA,IACzB;AACA,WAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,CAAC,CAAC;AAAA,EAC1D;AAAA,EAEA,SAAS;AACP,WAAO,KAAK,SAAS,CAAC,EAAE,OAAA;AAAA,EAC1B;AAAA,EAEA,IAAI,KAAQ,MAAkC;AAC5C,UAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;AACpD,UAAM,EAAC,aAAY;AACnB,WAAO,IAAI,SAAS,SAAS,SAAS,CAAC,EAAE,IAAI,KAAK,IAAI,IAAI;AAAA,EAC5D;AAAA,EAEA,IAAI,KAAQ,MAA4B;AACtC,UAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,UAAU;AACpD,UAAM,EAAC,aAAY;AACnB,WAAO,IAAI,SAAS,SAAS,SAAS,CAAC,EAAE,IAAI,KAAK,IAAI,IAAI;AAAA,EAC5D;AAAA,EAEA,IAAI,KAAQ,MAAoC;AAC9C,UAAM,IAAI,KAAK;AACf,UAAM,MAAM,KAAK;AACjB,QAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG,GAAG,EAAE,SAAS,CAAC;AAC9D,QAAI,QAAQ,EAAE,CAAC;AAEf,QAAI,MAAM,UAAU;AAClB,QAAE,CAAC,IAAI,QAAQ,MAAM,MAAA;AAAA,IACvB;AACA,QAAI,MAAM,KAAK,UAAU,eAAe;AAKtC,UAAI;AACJ,UACE,IAAI,MACH,QAAQ,EAAE,IAAI,CAAC,GAAG,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,CAAC,GAAG,GAAG,IAAI,GAC1B;AACA,YAAI,MAAM,UAAU;AAClB,YAAE,IAAI,CAAC,IAAI,QAAQ,MAAM,MAAA;AAAA,QAC3B;AACA,cAAM,cAAc,KAAK;AACzB,aAAK,KAAK,IAAI,CAAC,IAAI,MAAM,OAAA;AAAA,MAC3B,YACG,QAAQ,EAAE,IAAI,CAAC,OAAO,UACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,UAAU,GAAG,IAAI,GAC3B;AACA,YAAI,MAAM,SAAU,GAAE,IAAI,CAAC,IAAI,QAAQ,MAAM,MAAA;AAC7C,cAAM,aAAa,KAAK;AACxB,aAAK,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,OAAA;AAAA,MACtB;AAAA,IACF;AAEA,UAAM,SAAS,MAAM,IAAI,KAAK,IAAI;AAClC,SAAK,KAAK,CAAC,IAAI,MAAM,OAAA;AACrB,QAAI,WAAW,KAAM,QAAO;AAG5B,QAAI,KAAK,KAAK,SAAS,eAAe;AAEpC,WAAK,OAAO,IAAI,GAAG,MAAM;AACzB,aAAO;AAAA,IACT;AAEA,UAAM,kBAAkB,KAAK,kBAAA;AAE7B,QAAI,SAA2B;AAC/B,QAAI,IAAI,OAAO,OAAA,GAAU,KAAK,OAAA,CAAQ,IAAI,GAAG;AAC3C,eAAS;AACT,WAAK,KAAK,KAAK;AAAA,IACjB;AACA,WAAO,OAAO,IAAI,GAAG,MAAM;AAC3B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,GAAW,OAAiB;AACjC,SAAK,SAAS,OAAO,GAAG,GAAG,KAAK;AAChC,SAAK,KAAK,OAAO,GAAG,GAAG,MAAM,QAAQ;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAoB;AAClB,UAAM,OAAO,KAAK,SAAS,UAAU;AACrC,WAAO,IAAI;AAAA,MACT,KAAK,SAAS,OAAO,IAAI;AAAA,MACzB,KAAK,KAAK,OAAO,IAAI;AAAA,IAAA;AAAA,EAEzB;AAAA,EAEA,cAAc,KAAe;AAC3B,SAAK,KAAK,KAAK,IAAI,KAAK,OAAQ;AAChC,SAAK,SAAS,KAAM,IAAyB,SAAS,OAAQ;AAAA,EAChE;AAAA,EAEA,aAAa,KAAe;AAC1B,SAAK,KAAK,QAAQ,IAAI,KAAK,KAAM;AACjC,SAAK,SAAS,QAAS,IAAyB,SAAS,KAAM;AAAA,EACjE;AAAA,EAEA,OAAO,KAAQ,MAA4B;AACzC,UAAM,MAAM,KAAK;AACjB,UAAM,EAAC,SAAQ;AACf,UAAM,EAAC,aAAY;AACnB,QAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,GAAG;AACzC,QAAI,IAAI;AACR,UAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,CAAC;AAC5C,QAAI,KAAK,OAAO;AACd,UAAI;AACF,YAAI,SAAS,CAAC,EAAE,UAAU;AACxB,mBAAS,CAAC,IAAI,SAAS,CAAC,EAAE,MAAA;AAAA,QAC5B;AACA,cAAM,SAAS,SAAS,CAAC,EAAE,OAAO,KAAK,IAAI;AAG3C,aAAK,CAAC,IAAI,SAAS,CAAC,EAAE,OAAA;AACtB,eAAO;AAAA,MACT,UAAA;AAEE,cAAM,OAAO,iBAAiB;AAC9B,YAAI,OAAO,EAAG;AACd,aAAK,IAAI,OAAO,KAAK,MAAM,KAAK;AAC9B,cAAI,SAAS,CAAC,EAAE,KAAK,UAAU,MAAM;AACnC,gBAAI,SAAS,CAAC,EAAE,KAAK,WAAW,GAAG;AACjC,mBAAK,SAAS,GAAG,aAAa;AAAA,YAChC,OAAO;AAEL,mBAAK,OAAO,GAAG,CAAC;AAChB,uBAAS,OAAO,GAAG,CAAC;AAAA,YACtB;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,SAAS,GAAW,SAA0B;AAC5C,UAAM,EAAC,aAAY;AACnB,QAAI,KAAK,KAAK,IAAI,IAAI,SAAS,QAAQ;AACrC,UAAI,SAAS,CAAC,EAAE,KAAK,SAAS,SAAS,IAAI,CAAC,EAAE,KAAK,UAAU,SAAS;AACpE,YAAI,SAAS,CAAC,EAAE;AAEd,mBAAS,CAAC,IAAI,SAAS,CAAC,EAAE,MAAA;AAC5B,iBAAS,CAAC,EAAE,aAAa,SAAS,IAAI,CAAC,GAAG,OAAO;AACjD,iBAAS,OAAO,IAAI,GAAG,CAAC;AACxB,aAAK,KAAK,OAAO,IAAI,GAAG,CAAC;AACzB,aAAK,KAAK,CAAC,IAAI,SAAS,CAAC,EAAE,OAAA;AAC3B,eAAO;AAAA,MACT;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa,KAAe,aAAqB;AAE/C,UAAM,YAAY,KAAK,KAAK;AAC5B,SAAK,KAAK,KAAK,GAAG,IAAI,IAAI;AAC1B,UAAM,cAAe,IAAoC;AACzD,SAAK,SAAS,KAAK,GAAG,WAAW;AAEjC,QAAI,IAAI,YAAY,CAAC,KAAK,UAAU;AAGlC,eAAS,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK;AAC3C,oBAAY,CAAC,EAAE,WAAW;AAAA,MAC5B;AAAA,IACF;AAKA,SAAK,SAAS,YAAY,GAAG,WAAW;AAAA,EAC1C;AACF;AAIA,SAAS,QACP,KACA,MACA,SACA,YACQ;AACR,MAAI,KAAK;AACT,MAAI,KAAK,KAAK;AACd,MAAI,MAAM,MAAM;AAChB,SAAO,KAAK,IAAI;AACd,UAAM,IAAI,WAAW,KAAK,GAAG,GAAG,GAAG;AACnC,QAAI,IAAI,GAAG;AACT,WAAK,MAAM;AAAA,IACb,WAAW,IAAI,GAAG;AAEhB,WAAK;AAAA,IACP,WAAW,MAAM,GAAG;AAClB,aAAO;AAAA,IACT,OAAO;AAEL,UAAI,QAAQ,KAAK;AAEf,eAAO,KAAK;AAAA,MACd;AACA,YAAM,IAAI,MAAM,uBAAuB;AAAA,IACzC;AACA,UAAO,KAAK,MAAO;AAAA,EACrB;AACA,SAAO,MAAM;AACf;AAGA,MAAM,YAAY,IAAI,MAAW,EAAE;AACnC,UAAU,WAAW;"}
+{"version":3,"file":"btree-set.js","names":["#root","#delete","#maxKey"],"sources":["../../../../shared/src/btree-set.ts"],"sourcesContent":["import {assert} from './asserts.ts';\n\nconst MAX_NODE_SIZE = 32;\n\ntype Comparator<K> = (a: K, b: K) => number;\nexport class BTreeSet<K> {\n  #root: BNode<K> = emptyLeaf as BNode<K>;\n  size: number = 0;\n\n  readonly comparator: Comparator<K>;\n\n  constructor(comparator: Comparator<K>, entries?: IterableIterator<K>) {\n    this.comparator = comparator;\n    if (entries) {\n      for (const key of entries) {\n        this.add(key);\n      }\n    }\n  }\n\n  /** Releases the tree so that its size is 0. */\n  clear() {\n    this.#root = emptyLeaf as BNode<K>;\n    this.size = 0;\n  }\n\n  clone() {\n    this.#root.isShared = true;\n    const ret = new BTreeSet<K>(this.comparator);\n    ret.#root = this.#root;\n    ret.size = this.size;\n    return ret;\n  }\n\n  get(key: K): K | undefined {\n    return this.#root.get(key, this);\n  }\n\n  add(key: K): this {\n    if (this.#root.isShared) this.#root = this.#root.clone();\n    const result = this.#root.set(key, this);\n    if (result === null) return this;\n    // Root node has split, so create a new root node.\n    this.#root = new BNodeInternal<K>([this.#root, result]);\n    return this;\n  }\n\n  /**\n   * Returns true if the key exists in the B+ tree, false if not.\n   * Use get() for best performance; use has() if you need to\n   * distinguish between \"undefined value\" and \"key not present\".\n   * @param key Key to detect\n   * @description Computational complexity: O(log size)\n   */\n  has(key: K): boolean {\n    return this.#root.has(key, this);\n  }\n\n  /**\n   * Removes a single key-value pair from the B+ tree.\n   * @param key Key to find\n   * @returns true if a pair was found and removed, false otherwise.\n   * @description Computational complexity: O(log size)\n   */\n  delete(key: K): boolean {\n    return this.#delete(key);\n  }\n\n  #delete(key: K): boolean {\n    let root = this.#root;\n    if (root.isShared) {\n      this.#root = root = root.clone();\n    }\n    try {\n      return root.delete(key, this);\n    } finally {\n      let isShared;\n      while (root.keys.length <= 1 && root.isInternal()) {\n        isShared ||= root.isShared;\n        this.#root = root =\n          root.keys.length === 0 ? emptyLeaf : root.children[0];\n      }\n      // If any ancestor of the new root was shared, the new root must also be shared\n      if (isShared) {\n        root.isShared = true;\n      }\n    }\n  }\n\n  keys(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  values(): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, undefined, true);\n  }\n\n  valuesFrom(lowestKey?: K, inclusive: boolean = true): IterableIterator<K> {\n    return valuesFrom(this.#root, this.comparator, lowestKey, inclusive);\n  }\n\n  valuesReversed(): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      undefined,\n      true,\n    );\n  }\n\n  valuesFromReversed(\n    highestKey?: K,\n    inclusive: boolean = true,\n  ): IterableIterator<K> {\n    return valuesFromReversed(\n      this.#maxKey(),\n      this.#root,\n      this.comparator,\n      highestKey,\n      inclusive,\n    );\n  }\n\n  /** Gets the highest key in the tree. Complexity: O(1) */\n  #maxKey(): K | undefined {\n    return this.#root.maxKey();\n  }\n\n  [Symbol.iterator](): IterableIterator<K> {\n    return this.keys();\n  }\n}\n\nfunction valuesFrom<K>(\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  lowestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  const info = findPath(lowestKey, root, comparator);\n  if (info === undefined) {\n    return iterator<K>(() => ({done: true, value: undefined}));\n  }\n\n  let [nodeQueue, nodeIndex, leaf] = info;\n  let i =\n    lowestKey === undefined\n      ? -1\n      : indexOf(lowestKey, leaf.keys, 0, comparator) - 1;\n\n  if (\n    !inclusive &&\n    i < leaf.keys.length &&\n    // +1 because we did -1 above.\n    comparator(leaf.keys[i + 1], lowestKey!) === 0\n  ) {\n    i++;\n  }\n\n  return iterator<K>(() => {\n    for (;;) {\n      if (++i < leaf.keys.length) {\n        return {done: false, value: leaf.keys[i]};\n      }\n\n      let level = -1;\n      for (;;) {\n        if (++level >= nodeQueue.length) {\n          return {done: true, value: undefined};\n        }\n        if (++nodeIndex[level] < nodeQueue[level].length) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        nodeQueue[level - 1] = (\n          nodeQueue[level][nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        nodeIndex[level - 1] = 0;\n      }\n      leaf = nodeQueue[0][nodeIndex[0]];\n      i = -1;\n    }\n  });\n}\n\nfunction valuesFromReversed<K>(\n  maxKey: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n  highestKey: K | undefined,\n  inclusive: boolean,\n): IterableIterator<K> {\n  if (highestKey === undefined) {\n    highestKey = maxKey;\n    if (highestKey === undefined)\n      return iterator<K>(() => ({done: true, value: undefined})); // collection is empty\n  }\n  let [nodeQueue, nodeIndex, leaf] =\n    findPath(highestKey, root, comparator) ||\n    findPath(maxKey, root, comparator)!;\n  assert(\n    !nodeQueue[0] || leaf === nodeQueue[0][nodeIndex[0]],\n    'BTreeSet: leaf node mismatch in iteration',\n  );\n  let i = indexOf(highestKey, leaf.keys, 0, comparator);\n  if (\n    inclusive &&\n    i < leaf.keys.length &&\n    comparator(leaf.keys[i], highestKey) <= 0\n  ) {\n    i++;\n  }\n\n  return iterator<K>(() => {\n    for (;;) {\n      if (--i >= 0) {\n        return {done: false, value: leaf.keys[i]};\n      }\n\n      let level;\n      // Advance to the next leaf node\n      for (level = -1; ; ) {\n        if (++level >= nodeQueue.length) {\n          return {done: true, value: undefined};\n        }\n        if (--nodeIndex[level] >= 0) {\n          break;\n        }\n      }\n      for (; level > 0; level--) {\n        nodeQueue[level - 1] = (\n          nodeQueue[level][nodeIndex[level]] as BNodeInternal<K>\n        ).children;\n        nodeIndex[level - 1] = nodeQueue[level - 1].length - 1;\n      }\n      leaf = nodeQueue[0][nodeIndex[0]];\n      i = leaf.keys.length;\n    }\n  });\n}\n\nfunction findPath<K>(\n  key: K | undefined,\n  root: BNode<K>,\n  comparator: Comparator<K>,\n): [nodeQueue: BNode<K>[][], nodeIndex: number[], leaf: BNode<K>] | undefined {\n  let nextNode = root;\n  const nodeQueue: BNode<K>[][] = [];\n  const nodeIndex: number[] = [];\n\n  if (nextNode.isInternal()) {\n    for (let d = 0; nextNode.isInternal(); d++) {\n      nodeQueue[d] = nextNode.children;\n      nodeIndex[d] =\n        key === undefined ? 0 : indexOf(key, nextNode.keys, 0, comparator);\n      if (nodeIndex[d] >= nodeQueue[d].length) return; // first key > maxKey()\n      nextNode = nodeQueue[d][nodeIndex[d]];\n    }\n    nodeQueue.reverse();\n    nodeIndex.reverse();\n  }\n  return [nodeQueue, nodeIndex, nextNode];\n}\n\nfunction iterator<T>(next: () => IteratorResult<T>): IterableIterator<T> {\n  return {\n    next,\n    [Symbol.iterator]() {\n      return this;\n    },\n  };\n}\n\n/** Leaf node / base class. **************************************************/\nclass BNode<K> {\n  // If this is an internal node, _keys[i] is the highest key in children[i].\n  keys: K[];\n  // True if this node might be within multiple `BTree`s (or have multiple parents).\n  // If so, it must be cloned before being mutated to avoid changing an unrelated tree.\n  // This is transitive: if it's true, children are also shared even if `isShared!=true`\n  // in those children. (Certain operations will propagate isShared=true to children.)\n  isShared: true | undefined;\n\n  constructor(keys: K[]) {\n    this.keys = keys;\n    this.isShared = undefined;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return false;\n  }\n\n  maxKey() {\n    return this.keys[this.keys.length - 1];\n  }\n\n  minKey(): K | undefined {\n    return this.keys[0];\n  }\n\n  clone(): BNode<K> {\n    return new BNode<K>(this.keys.slice(0));\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i < 0 ? undefined : this.keys[i];\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, -1, tree.comparator);\n    return i >= 0 && i < this.keys.length;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    let i = indexOf(key, this.keys, -1, tree.comparator);\n    if (i < 0) {\n      // key does not exist yet\n      i = ~i;\n      tree.size++;\n\n      if (this.keys.length < MAX_NODE_SIZE) {\n        this.keys.splice(i, 0, key);\n        return null;\n      }\n      // This leaf node is full and must split\n      const newRightSibling = this.splitOffRightSide();\n      // oxlint-disable-next-line @typescript-eslint/no-this-alias\n      let target: BNode<K> = this;\n      if (i > this.keys.length) {\n        i -= this.keys.length;\n        target = newRightSibling;\n      }\n      // target.#insertInLeaf(i, key);\n      target.keys.splice(i, 0, key);\n\n      return newRightSibling;\n    }\n\n    // usually this is a no-op, but some users may wish to edit the key\n    this.keys[i] = key;\n    return null;\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n  }\n\n  splitOffRightSide(): BNode<K> {\n    const half = this.keys.length >> 1;\n    const keys = this.keys.splice(half);\n    return new BNode<K>(keys);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const iLow = indexOf(key, this.keys, -1, cmp);\n    const iHigh = iLow + 1;\n\n    if (iLow < 0) {\n      return false;\n    }\n\n    const {keys} = this;\n    for (let i = iLow; i < iHigh; i++) {\n      const key = keys[i];\n\n      if (key !== keys[i] || this.isShared === true) {\n        throw new Error('BTree illegally changed or cloned in delete');\n      }\n\n      this.keys.splice(i, 1);\n      tree.size--;\n      return true;\n    }\n\n    return false;\n  }\n\n  mergeSibling(rhs: BNode<K>, _: number) {\n    this.keys.push(...rhs.keys);\n  }\n}\n\n/** Internal node (non-leaf node) ********************************************/\nclass BNodeInternal<K> extends BNode<K> {\n  // Note: conventionally B+ trees have one fewer key than the number of\n  // children, but I find it easier to keep the array lengths equal: each\n  // keys[i] caches the value of children[i].maxKey().\n  children: BNode<K>[];\n\n  /**\n   * This does not mark `children` as shared, so it is the responsibility of the caller\n   * to ensure children are either marked shared, or aren't included in another tree.\n   */\n  constructor(children: BNode<K>[], keys?: K[]) {\n    if (!keys) {\n      keys = [];\n      for (let i = 0; i < children.length; i++) {\n        keys[i] = children[i].maxKey();\n      }\n    }\n    super(keys);\n    this.children = children;\n  }\n\n  isInternal(): this is BNodeInternal<K> {\n    return true;\n  }\n\n  clone(): BNode<K> {\n    const children = this.children.slice(0);\n    for (let i = 0; i < children.length; i++) {\n      children[i].isShared = true;\n    }\n    return new BNodeInternal<K>(children, this.keys.slice(0));\n  }\n\n  minKey() {\n    return this.children[0].minKey();\n  }\n\n  get(key: K, tree: BTreeSet<K>): K | undefined {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].get(key, tree) : undefined;\n  }\n\n  has(key: K, tree: BTreeSet<K>): boolean {\n    const i = indexOf(key, this.keys, 0, tree.comparator);\n    const {children} = this;\n    return i < children.length ? children[i].has(key, tree) : false;\n  }\n\n  set(key: K, tree: BTreeSet<K>): null | BNode<K> {\n    const c = this.children;\n    const cmp = tree.comparator;\n    let i = Math.min(indexOf(key, this.keys, 0, cmp), c.length - 1);\n    let child = c[i];\n\n    if (child.isShared) {\n      c[i] = child = child.clone();\n    }\n    if (child.keys.length >= MAX_NODE_SIZE) {\n      // child is full; inserting anything else will cause a split.\n      // Shifting an item to the left or right sibling may avoid a split.\n      // We can do a shift if the adjacent node is not full and if the\n      // current key can still be placed in the same node after the shift.\n      let other: BNode<K>;\n      if (\n        i > 0 &&\n        (other = c[i - 1]).keys.length < MAX_NODE_SIZE &&\n        cmp(child.keys[0], key) < 0\n      ) {\n        if (other.isShared) {\n          c[i - 1] = other = other.clone();\n        }\n        other.takeFromRight(child);\n        this.keys[i - 1] = other.maxKey();\n      } else if (\n        (other = c[i + 1]) !== undefined &&\n        other.keys.length < MAX_NODE_SIZE &&\n        cmp(child.maxKey(), key) < 0\n      ) {\n        if (other.isShared) c[i + 1] = other = other.clone();\n        other.takeFromLeft(child);\n        this.keys[i] = c[i].maxKey();\n      }\n    }\n\n    const result = child.set(key, tree);\n    this.keys[i] = child.maxKey();\n    if (result === null) return null;\n\n    // The child has split and `result` is a new right child... does it fit?\n    if (this.keys.length < MAX_NODE_SIZE) {\n      // yes\n      this.insert(i + 1, result);\n      return null;\n    }\n    // no, we must split also\n    const newRightSibling = this.splitOffRightSide();\n    // oxlint-disable-next-line @typescript-eslint/no-this-alias\n    let target: BNodeInternal<K> = this;\n    if (cmp(result.maxKey(), this.maxKey()) > 0) {\n      target = newRightSibling;\n      i -= this.keys.length;\n    }\n    target.insert(i + 1, result);\n    return newRightSibling;\n  }\n\n  /**\n   * Inserts `child` at index `i`.\n   * This does not mark `child` as shared, so it is the responsibility of the caller\n   * to ensure that either child is marked shared, or it is not included in another tree.\n   */\n  insert(i: number, child: BNode<K>) {\n    this.children.splice(i, 0, child);\n    this.keys.splice(i, 0, child.maxKey());\n  }\n\n  /**\n   * Split this node.\n   * Modifies this to remove the second half of the items, returning a separate node containing them.\n   */\n  splitOffRightSide() {\n    const half = this.children.length >> 1;\n    return new BNodeInternal<K>(\n      this.children.splice(half),\n      this.keys.splice(half),\n    );\n  }\n\n  takeFromRight(rhs: BNode<K>) {\n    this.keys.push(rhs.keys.shift()!);\n    this.children.push((rhs as BNodeInternal<K>).children.shift()!);\n  }\n\n  takeFromLeft(lhs: BNode<K>) {\n    this.keys.unshift(lhs.keys.pop()!);\n    this.children.unshift((lhs as BNodeInternal<K>).children.pop()!);\n  }\n\n  delete(key: K, tree: BTreeSet<K>): boolean {\n    const cmp = tree.comparator;\n    const {keys} = this;\n    const {children} = this;\n    let iLow = indexOf(key, this.keys, 0, cmp);\n    let i = iLow;\n    const iHigh = Math.min(iLow, keys.length - 1);\n    if (i <= iHigh) {\n      try {\n        if (children[i].isShared) {\n          children[i] = children[i].clone();\n        }\n        const result = children[i].delete(key, tree);\n        // Note: if children[i] is empty then keys[i]=undefined.\n        //       This is an invalid state, but it is fixed below.\n        keys[i] = children[i].maxKey();\n        return result;\n      } finally {\n        // Deletions may have occurred, so look for opportunities to merge nodes.\n        const half = MAX_NODE_SIZE >> 1;\n        if (iLow > 0) iLow--;\n        for (i = iHigh; i >= iLow; i--) {\n          if (children[i].keys.length <= half) {\n            if (children[i].keys.length !== 0) {\n              this.tryMerge(i, MAX_NODE_SIZE);\n            } else {\n              // child is empty! delete it!\n              keys.splice(i, 1);\n              children.splice(i, 1);\n            }\n          }\n        }\n      }\n    }\n    return false;\n  }\n\n  /** Merges child i with child i+1 if their combined size is not too large */\n  tryMerge(i: number, maxSize: number): boolean {\n    const {children} = this;\n    if (i >= 0 && i + 1 < children.length) {\n      if (children[i].keys.length + children[i + 1].keys.length <= maxSize) {\n        if (children[i].isShared)\n          // cloned already UNLESS i is outside scan range\n          children[i] = children[i].clone();\n        children[i].mergeSibling(children[i + 1], maxSize);\n        children.splice(i + 1, 1);\n        this.keys.splice(i + 1, 1);\n        this.keys[i] = children[i].maxKey();\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Move children from `rhs` into this.\n   * `rhs` must be part of this tree, and be removed from it after this call\n   * (otherwise isShared for its children could be incorrect).\n   */\n  mergeSibling(rhs: BNode<K>, maxNodeSize: number) {\n    // assert !this.isShared;\n    const oldLength = this.keys.length;\n    this.keys.push(...rhs.keys);\n    const rhsChildren = (rhs as unknown as BNodeInternal<K>).children;\n    this.children.push(...rhsChildren);\n\n    if (rhs.isShared && !this.isShared) {\n      // All children of a shared node are implicitly shared, and since their new\n      // parent is not shared, they must now be explicitly marked as shared.\n      for (let i = 0; i < rhsChildren.length; i++) {\n        rhsChildren[i].isShared = true;\n      }\n    }\n\n    // If our children are themselves almost empty due to a mass-delete,\n    // they may need to be merged too (but only the oldLength-1 and its\n    // right sibling should need this).\n    this.tryMerge(oldLength - 1, maxNodeSize);\n  }\n}\n\n// If key not found, returns i^failXor where i is the insertion index.\n// Callers that don't care whether there was a match will set failXor=0.\nfunction indexOf<K>(\n  key: K,\n  keys: K[],\n  failXor: number,\n  comparator: Comparator<K>,\n): number {\n  let lo = 0;\n  let hi = keys.length;\n  let mid = hi >> 1;\n  while (lo < hi) {\n    const c = comparator(keys[mid], key);\n    if (c < 0) {\n      lo = mid + 1;\n    } else if (c > 0) {\n      // key < keys[mid]\n      hi = mid;\n    } else if (c === 0) {\n      return mid;\n    } else {\n      // c is NaN or otherwise invalid\n      if (key === key) {\n        // at least the search key is not NaN\n        return keys.length;\n      }\n      throw new Error('NaN was used as a key');\n    }\n    mid = (lo + hi) >> 1;\n  }\n  return mid ^ failXor;\n}\n\n// oxlint-disable-next-line @typescript-eslint/no-explicit-any\nconst emptyLeaf = new BNode<any>([]);\nemptyLeaf.isShared = true;\n"],"mappings":";;AAEA,IAAM,gBAAgB;AAGtB,IAAa,WAAb,MAAa,SAAY;CACvB,QAAkB;CAClB,OAAe;CAEf;CAEA,YAAY,YAA2B,SAA+B;AACpE,OAAK,aAAa;AAClB,MAAI,QACF,MAAK,MAAM,OAAO,QAChB,MAAK,IAAI,IAAI;;;CAMnB,QAAQ;AACN,QAAA,OAAa;AACb,OAAK,OAAO;;CAGd,QAAQ;AACN,QAAA,KAAW,WAAW;EACtB,MAAM,MAAM,IAAI,SAAY,KAAK,WAAW;AAC5C,OAAA,OAAY,MAAA;AACZ,MAAI,OAAO,KAAK;AAChB,SAAO;;CAGT,IAAI,KAAuB;AACzB,SAAO,MAAA,KAAW,IAAI,KAAK,KAAK;;CAGlC,IAAI,KAAc;AAChB,MAAI,MAAA,KAAW,SAAU,OAAA,OAAa,MAAA,KAAW,OAAO;EACxD,MAAM,SAAS,MAAA,KAAW,IAAI,KAAK,KAAK;AACxC,MAAI,WAAW,KAAM,QAAO;AAE5B,QAAA,OAAa,IAAI,cAAiB,CAAC,MAAA,MAAY,OAAO,CAAC;AACvD,SAAO;;;;;;;;;CAUT,IAAI,KAAiB;AACnB,SAAO,MAAA,KAAW,IAAI,KAAK,KAAK;;;;;;;;CASlC,OAAO,KAAiB;AACtB,SAAO,MAAA,OAAa,IAAI;;CAG1B,QAAQ,KAAiB;EACvB,IAAI,OAAO,MAAA;AACX,MAAI,KAAK,SACP,OAAA,OAAa,OAAO,KAAK,OAAO;AAElC,MAAI;AACF,UAAO,KAAK,OAAO,KAAK,KAAK;YACrB;GACR,IAAI;AACJ,UAAO,KAAK,KAAK,UAAU,KAAK,KAAK,YAAY,EAAE;AACjD,iBAAa,KAAK;AAClB,UAAA,OAAa,OACX,KAAK,KAAK,WAAW,IAAI,YAAY,KAAK,SAAS;;AAGvD,OAAI,SACF,MAAK,WAAW;;;CAKtB,OAA4B;AAC1B,SAAO,WAAW,MAAA,MAAY,KAAK,YAAY,KAAA,GAAW,KAAK;;CAGjE,SAA8B;AAC5B,SAAO,WAAW,MAAA,MAAY,KAAK,YAAY,KAAA,GAAW,KAAK;;CAGjE,WAAW,WAAe,YAAqB,MAA2B;AACxE,SAAO,WAAW,MAAA,MAAY,KAAK,YAAY,WAAW,UAAU;;CAGtE,iBAAsC;AACpC,SAAO,mBACL,MAAA,QAAc,EACd,MAAA,MACA,KAAK,YACL,KAAA,GACA,KACD;;CAGH,mBACE,YACA,YAAqB,MACA;AACrB,SAAO,mBACL,MAAA,QAAc,EACd,MAAA,MACA,KAAK,YACL,YACA,UACD;;;CAIH,UAAyB;AACvB,SAAO,MAAA,KAAW,QAAQ;;CAG5B,CAAC,OAAO,YAAiC;AACvC,SAAO,KAAK,MAAM;;;AAItB,SAAS,WACP,MACA,YACA,WACA,WACqB;CACrB,MAAM,OAAO,SAAS,WAAW,MAAM,WAAW;AAClD,KAAI,SAAS,KAAA,EACX,QAAO,gBAAmB;EAAC,MAAM;EAAM,OAAO,KAAA;EAAU,EAAE;CAG5D,IAAI,CAAC,WAAW,WAAW,QAAQ;CACnC,IAAI,IACF,cAAc,KAAA,IACV,KACA,QAAQ,WAAW,KAAK,MAAM,GAAG,WAAW,GAAG;AAErD,KACE,CAAC,aACD,IAAI,KAAK,KAAK,UAEd,WAAW,KAAK,KAAK,IAAI,IAAI,UAAW,KAAK,EAE7C;AAGF,QAAO,eAAkB;AACvB,WAAS;AACP,OAAI,EAAE,IAAI,KAAK,KAAK,OAClB,QAAO;IAAC,MAAM;IAAO,OAAO,KAAK,KAAK;IAAG;GAG3C,IAAI,QAAQ;AACZ,YAAS;AACP,QAAI,EAAE,SAAS,UAAU,OACvB,QAAO;KAAC,MAAM;KAAM,OAAO,KAAA;KAAU;AAEvC,QAAI,EAAE,UAAU,SAAS,UAAU,OAAO,OACxC;;AAGJ,UAAO,QAAQ,GAAG,SAAS;AACzB,cAAU,QAAQ,KAChB,UAAU,OAAO,UAAU,QAC3B;AACF,cAAU,QAAQ,KAAK;;AAEzB,UAAO,UAAU,GAAG,UAAU;AAC9B,OAAI;;GAEN;;AAGJ,SAAS,mBACP,QACA,MACA,YACA,YACA,WACqB;AACrB,KAAI,eAAe,KAAA,GAAW;AAC5B,eAAa;AACb,MAAI,eAAe,KAAA,EACjB,QAAO,gBAAmB;GAAC,MAAM;GAAM,OAAO,KAAA;GAAU,EAAE;;CAE9D,IAAI,CAAC,WAAW,WAAW,QACzB,SAAS,YAAY,MAAM,WAAW,IACtC,SAAS,QAAQ,MAAM,WAAW;AACpC,QACE,CAAC,UAAU,MAAM,SAAS,UAAU,GAAG,UAAU,KACjD,4CACD;CACD,IAAI,IAAI,QAAQ,YAAY,KAAK,MAAM,GAAG,WAAW;AACrD,KACE,aACA,IAAI,KAAK,KAAK,UACd,WAAW,KAAK,KAAK,IAAI,WAAW,IAAI,EAExC;AAGF,QAAO,eAAkB;AACvB,WAAS;AACP,OAAI,EAAE,KAAK,EACT,QAAO;IAAC,MAAM;IAAO,OAAO,KAAK,KAAK;IAAG;GAG3C,IAAI;AAEJ,QAAK,QAAQ,MAAQ;AACnB,QAAI,EAAE,SAAS,UAAU,OACvB,QAAO;KAAC,MAAM;KAAM,OAAO,KAAA;KAAU;AAEvC,QAAI,EAAE,UAAU,UAAU,EACxB;;AAGJ,UAAO,QAAQ,GAAG,SAAS;AACzB,cAAU,QAAQ,KAChB,UAAU,OAAO,UAAU,QAC3B;AACF,cAAU,QAAQ,KAAK,UAAU,QAAQ,GAAG,SAAS;;AAEvD,UAAO,UAAU,GAAG,UAAU;AAC9B,OAAI,KAAK,KAAK;;GAEhB;;AAGJ,SAAS,SACP,KACA,MACA,YAC4E;CAC5E,IAAI,WAAW;CACf,MAAM,YAA0B,EAAE;CAClC,MAAM,YAAsB,EAAE;AAE9B,KAAI,SAAS,YAAY,EAAE;AACzB,OAAK,IAAI,IAAI,GAAG,SAAS,YAAY,EAAE,KAAK;AAC1C,aAAU,KAAK,SAAS;AACxB,aAAU,KACR,QAAQ,KAAA,IAAY,IAAI,QAAQ,KAAK,SAAS,MAAM,GAAG,WAAW;AACpE,OAAI,UAAU,MAAM,UAAU,GAAG,OAAQ;AACzC,cAAW,UAAU,GAAG,UAAU;;AAEpC,YAAU,SAAS;AACnB,YAAU,SAAS;;AAErB,QAAO;EAAC;EAAW;EAAW;EAAS;;AAGzC,SAAS,SAAY,MAAoD;AACvE,QAAO;EACL;EACA,CAAC,OAAO,YAAY;AAClB,UAAO;;EAEV;;;AAIH,IAAM,QAAN,MAAM,MAAS;CAEb;CAKA;CAEA,YAAY,MAAW;AACrB,OAAK,OAAO;AACZ,OAAK,WAAW,KAAA;;CAGlB,aAAuC;AACrC,SAAO;;CAGT,SAAS;AACP,SAAO,KAAK,KAAK,KAAK,KAAK,SAAS;;CAGtC,SAAwB;AACtB,SAAO,KAAK,KAAK;;CAGnB,QAAkB;AAChB,SAAO,IAAI,MAAS,KAAK,KAAK,MAAM,EAAE,CAAC;;CAGzC,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,WAAW;AACtD,SAAO,IAAI,IAAI,KAAA,IAAY,KAAK,KAAK;;CAGvC,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,WAAW;AACtD,SAAO,KAAK,KAAK,IAAI,KAAK,KAAK;;CAGjC,IAAI,KAAQ,MAAoC;EAC9C,IAAI,IAAI,QAAQ,KAAK,KAAK,MAAM,IAAI,KAAK,WAAW;AACpD,MAAI,IAAI,GAAG;AAET,OAAI,CAAC;AACL,QAAK;AAEL,OAAI,KAAK,KAAK,SAAS,eAAe;AACpC,SAAK,KAAK,OAAO,GAAG,GAAG,IAAI;AAC3B,WAAO;;GAGT,MAAM,kBAAkB,KAAK,mBAAmB;GAEhD,IAAI,SAAmB;AACvB,OAAI,IAAI,KAAK,KAAK,QAAQ;AACxB,SAAK,KAAK,KAAK;AACf,aAAS;;AAGX,UAAO,KAAK,OAAO,GAAG,GAAG,IAAI;AAE7B,UAAO;;AAIT,OAAK,KAAK,KAAK;AACf,SAAO;;CAGT,cAAc,KAAe;AAC3B,OAAK,KAAK,KAAK,IAAI,KAAK,OAAO,CAAE;;CAGnC,aAAa,KAAe;AAC1B,OAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,CAAE;;CAGpC,oBAA8B;EAC5B,MAAM,OAAO,KAAK,KAAK,UAAU;AAEjC,SAAO,IAAI,MADE,KAAK,KAAK,OAAO,KAAK,CACV;;CAG3B,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,OAAO,QAAQ,KAAK,KAAK,MAAM,IAAI,IAAI;EAC7C,MAAM,QAAQ,OAAO;AAErB,MAAI,OAAO,EACT,QAAO;EAGT,MAAM,EAAC,SAAQ;AACf,OAAK,IAAI,IAAI,MAAM,IAAI,OAAO,KAAK;AAGjC,OAFY,KAAK,OAEL,KAAK,MAAM,KAAK,aAAa,KACvC,OAAM,IAAI,MAAM,8CAA8C;AAGhE,QAAK,KAAK,OAAO,GAAG,EAAE;AACtB,QAAK;AACL,UAAO;;AAGT,SAAO;;CAGT,aAAa,KAAe,GAAW;AACrC,OAAK,KAAK,KAAK,GAAG,IAAI,KAAK;;;;AAK/B,IAAM,gBAAN,MAAM,sBAAyB,MAAS;CAItC;;;;;CAMA,YAAY,UAAsB,MAAY;AAC5C,MAAI,CAAC,MAAM;AACT,UAAO,EAAE;AACT,QAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,MAAK,KAAK,SAAS,GAAG,QAAQ;;AAGlC,QAAM,KAAK;AACX,OAAK,WAAW;;CAGlB,aAAuC;AACrC,SAAO;;CAGT,QAAkB;EAChB,MAAM,WAAW,KAAK,SAAS,MAAM,EAAE;AACvC,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,UAAS,GAAG,WAAW;AAEzB,SAAO,IAAI,cAAiB,UAAU,KAAK,KAAK,MAAM,EAAE,CAAC;;CAG3D,SAAS;AACP,SAAO,KAAK,SAAS,GAAG,QAAQ;;CAGlC,IAAI,KAAQ,MAAkC;EAC5C,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,WAAW;EACrD,MAAM,EAAC,aAAY;AACnB,SAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,KAAK,GAAG,KAAA;;CAG5D,IAAI,KAAQ,MAA4B;EACtC,MAAM,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,KAAK,WAAW;EACrD,MAAM,EAAC,aAAY;AACnB,SAAO,IAAI,SAAS,SAAS,SAAS,GAAG,IAAI,KAAK,KAAK,GAAG;;CAG5D,IAAI,KAAQ,MAAoC;EAC9C,MAAM,IAAI,KAAK;EACf,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,KAAK,IAAI,QAAQ,KAAK,KAAK,MAAM,GAAG,IAAI,EAAE,EAAE,SAAS,EAAE;EAC/D,IAAI,QAAQ,EAAE;AAEd,MAAI,MAAM,SACR,GAAE,KAAK,QAAQ,MAAM,OAAO;AAE9B,MAAI,MAAM,KAAK,UAAU,eAAe;GAKtC,IAAI;AACJ,OACE,IAAI,MACH,QAAQ,EAAE,IAAI,IAAI,KAAK,SAAS,iBACjC,IAAI,MAAM,KAAK,IAAI,IAAI,GAAG,GAC1B;AACA,QAAI,MAAM,SACR,GAAE,IAAI,KAAK,QAAQ,MAAM,OAAO;AAElC,UAAM,cAAc,MAAM;AAC1B,SAAK,KAAK,IAAI,KAAK,MAAM,QAAQ;eAEhC,QAAQ,EAAE,IAAI,QAAQ,KAAA,KACvB,MAAM,KAAK,SAAS,iBACpB,IAAI,MAAM,QAAQ,EAAE,IAAI,GAAG,GAC3B;AACA,QAAI,MAAM,SAAU,GAAE,IAAI,KAAK,QAAQ,MAAM,OAAO;AACpD,UAAM,aAAa,MAAM;AACzB,SAAK,KAAK,KAAK,EAAE,GAAG,QAAQ;;;EAIhC,MAAM,SAAS,MAAM,IAAI,KAAK,KAAK;AACnC,OAAK,KAAK,KAAK,MAAM,QAAQ;AAC7B,MAAI,WAAW,KAAM,QAAO;AAG5B,MAAI,KAAK,KAAK,SAAS,eAAe;AAEpC,QAAK,OAAO,IAAI,GAAG,OAAO;AAC1B,UAAO;;EAGT,MAAM,kBAAkB,KAAK,mBAAmB;EAEhD,IAAI,SAA2B;AAC/B,MAAI,IAAI,OAAO,QAAQ,EAAE,KAAK,QAAQ,CAAC,GAAG,GAAG;AAC3C,YAAS;AACT,QAAK,KAAK,KAAK;;AAEjB,SAAO,OAAO,IAAI,GAAG,OAAO;AAC5B,SAAO;;;;;;;CAQT,OAAO,GAAW,OAAiB;AACjC,OAAK,SAAS,OAAO,GAAG,GAAG,MAAM;AACjC,OAAK,KAAK,OAAO,GAAG,GAAG,MAAM,QAAQ,CAAC;;;;;;CAOxC,oBAAoB;EAClB,MAAM,OAAO,KAAK,SAAS,UAAU;AACrC,SAAO,IAAI,cACT,KAAK,SAAS,OAAO,KAAK,EAC1B,KAAK,KAAK,OAAO,KAAK,CACvB;;CAGH,cAAc,KAAe;AAC3B,OAAK,KAAK,KAAK,IAAI,KAAK,OAAO,CAAE;AACjC,OAAK,SAAS,KAAM,IAAyB,SAAS,OAAO,CAAE;;CAGjE,aAAa,KAAe;AAC1B,OAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,CAAE;AAClC,OAAK,SAAS,QAAS,IAAyB,SAAS,KAAK,CAAE;;CAGlE,OAAO,KAAQ,MAA4B;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,EAAC,SAAQ;EACf,MAAM,EAAC,aAAY;EACnB,IAAI,OAAO,QAAQ,KAAK,KAAK,MAAM,GAAG,IAAI;EAC1C,IAAI,IAAI;EACR,MAAM,QAAQ,KAAK,IAAI,MAAM,KAAK,SAAS,EAAE;AAC7C,MAAI,KAAK,MACP,KAAI;AACF,OAAI,SAAS,GAAG,SACd,UAAS,KAAK,SAAS,GAAG,OAAO;GAEnC,MAAM,SAAS,SAAS,GAAG,OAAO,KAAK,KAAK;AAG5C,QAAK,KAAK,SAAS,GAAG,QAAQ;AAC9B,UAAO;YACC;GAER,MAAM,OAAO,iBAAiB;AAC9B,OAAI,OAAO,EAAG;AACd,QAAK,IAAI,OAAO,KAAK,MAAM,IACzB,KAAI,SAAS,GAAG,KAAK,UAAU,KAC7B,KAAI,SAAS,GAAG,KAAK,WAAW,EAC9B,MAAK,SAAS,GAAG,cAAc;QAC1B;AAEL,SAAK,OAAO,GAAG,EAAE;AACjB,aAAS,OAAO,GAAG,EAAE;;;AAM/B,SAAO;;;CAIT,SAAS,GAAW,SAA0B;EAC5C,MAAM,EAAC,aAAY;AACnB,MAAI,KAAK,KAAK,IAAI,IAAI,SAAS;OACzB,SAAS,GAAG,KAAK,SAAS,SAAS,IAAI,GAAG,KAAK,UAAU,SAAS;AACpE,QAAI,SAAS,GAAG,SAEd,UAAS,KAAK,SAAS,GAAG,OAAO;AACnC,aAAS,GAAG,aAAa,SAAS,IAAI,IAAI,QAAQ;AAClD,aAAS,OAAO,IAAI,GAAG,EAAE;AACzB,SAAK,KAAK,OAAO,IAAI,GAAG,EAAE;AAC1B,SAAK,KAAK,KAAK,SAAS,GAAG,QAAQ;AACnC,WAAO;;;AAGX,SAAO;;;;;;;CAQT,aAAa,KAAe,aAAqB;EAE/C,MAAM,YAAY,KAAK,KAAK;AAC5B,OAAK,KAAK,KAAK,GAAG,IAAI,KAAK;EAC3B,MAAM,cAAe,IAAoC;AACzD,OAAK,SAAS,KAAK,GAAG,YAAY;AAElC,MAAI,IAAI,YAAY,CAAC,KAAK,SAGxB,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,IACtC,aAAY,GAAG,WAAW;AAO9B,OAAK,SAAS,YAAY,GAAG,YAAY;;;AAM7C,SAAS,QACP,KACA,MACA,SACA,YACQ;CACR,IAAI,KAAK;CACT,IAAI,KAAK,KAAK;CACd,IAAI,MAAM,MAAM;AAChB,QAAO,KAAK,IAAI;EACd,MAAM,IAAI,WAAW,KAAK,MAAM,IAAI;AACpC,MAAI,IAAI,EACN,MAAK,MAAM;WACF,IAAI,EAEb,MAAK;WACI,MAAM,EACf,QAAO;OACF;AAEL,OAAI,QAAQ,IAEV,QAAO,KAAK;AAEd,SAAM,IAAI,MAAM,wBAAwB;;AAE1C,QAAO,KAAK,MAAO;;AAErB,QAAO,MAAM;;AAIf,IAAM,YAAY,IAAI,MAAW,EAAE,CAAC;AACpC,UAAU,WAAW"}

package/out/shared/src/cache.js

@@ -1,37 +1,44 @@
-class TimedCache {
-  #cache;
-  #ttlMs;
-  #intervalHandle;
-  constructor(ttlMs) {
-    this.#cache = /* @__PURE__ */ new Map();
-    this.#ttlMs = ttlMs;
-    this.#intervalHandle = setInterval(() => {
-      const now = Date.now();
-      for (const [key, entry] of this.#cache.entries()) {
-        if (entry.expiresAt < now) {
-          this.#cache.delete(key);
-        }
-      }
-    }, ttlMs * 2);
-  }
-  set(key, value) {
-    const entry = { value, expiresAt: Date.now() + this.#ttlMs };
-    this.#cache.set(key, entry);
-  }
-  get(key) {
-    const entry = this.#cache.get(key);
-    if (entry === void 0 || entry.expiresAt < Date.now()) {
-      this.#cache.delete(key);
-      return void 0;
-    }
-    return entry.value;
-  }
-  destroy() {
-    clearInterval(this.#intervalHandle);
-    this.#cache.clear();
-  }
-}
-export {
-  TimedCache
+//#region ../shared/src/cache.ts
+/**
+* Stores values with an expiration time at time of insertion.
+* Does not update the expiration time on retrieval.
+* Values are automatically removed from the cache after the TTL expires.
+* The cache is cleaned up periodically based on the TTL so it does
+* not grow indefinitely.
+*/
+var TimedCache = class {
+	#cache;
+	#ttlMs;
+	#intervalHandle;
+	constructor(ttlMs) {
+		this.#cache = /* @__PURE__ */ new Map();
+		this.#ttlMs = ttlMs;
+		this.#intervalHandle = setInterval(() => {
+			const now = Date.now();
+			for (const [key, entry] of this.#cache.entries()) if (entry.expiresAt < now) this.#cache.delete(key);
+		}, ttlMs * 2);
+	}
+	set(key, value) {
+		const entry = {
+			value,
+			expiresAt: Date.now() + this.#ttlMs
+		};
+		this.#cache.set(key, entry);
+	}
+	get(key) {
+		const entry = this.#cache.get(key);
+		if (entry === void 0 || entry.expiresAt < Date.now()) {
+			this.#cache.delete(key);
+			return;
+		}
+		return entry.value;
+	}
+	destroy() {
+		clearInterval(this.#intervalHandle);
+		this.#cache.clear();
+	}
 };
-//# sourceMappingURL=cache.js.map
+//#endregion
+export { TimedCache };
+
+//# sourceMappingURL=cache.js.map

package/out/shared/src/cache.js.map

@@ -1 +1 @@
-{"version":3,"file":"cache.js","sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/**\n * Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely.\n */\nexport class TimedCache<T> {\n  readonly #cache: Map<string, {value: T; expiresAt: number}>;\n  readonly #ttlMs: number;\n  readonly #intervalHandle: NodeJS.Timeout;\n\n  constructor(ttlMs: number) {\n    this.#cache = new Map();\n    this.#ttlMs = ttlMs;\n    this.#intervalHandle = setInterval(() => {\n      const now = Date.now();\n      for (const [key, entry] of this.#cache.entries()) {\n        if (entry.expiresAt < now) {\n          this.#cache.delete(key);\n        }\n      }\n    }, ttlMs * 2);\n  }\n\n  set(key: string, value: T): void {\n    const entry = {value, expiresAt: Date.now() + this.#ttlMs};\n    this.#cache.set(key, entry);\n  }\n\n  get(key: string): T | undefined {\n    const entry = this.#cache.get(key);\n    if (entry === undefined || entry.expiresAt < Date.now()) {\n      this.#cache.delete(key);\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  destroy(): void {\n    clearInterval(this.#intervalHandle);\n    this.#cache.clear();\n  }\n}\n"],"names":[],"mappings":"AAOO,MAAM,WAAc;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,OAAe;AACzB,SAAK,6BAAa,IAAA;AAClB,SAAK,SAAS;AACd,SAAK,kBAAkB,YAAY,MAAM;AACvC,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,CAAC,KAAK,KAAK,KAAK,KAAK,OAAO,WAAW;AAChD,YAAI,MAAM,YAAY,KAAK;AACzB,eAAK,OAAO,OAAO,GAAG;AAAA,QACxB;AAAA,MACF;AAAA,IACF,GAAG,QAAQ,CAAC;AAAA,EACd;AAAA,EAEA,IAAI,KAAa,OAAgB;AAC/B,UAAM,QAAQ,EAAC,OAAO,WAAW,KAAK,IAAA,IAAQ,KAAK,OAAA;AACnD,SAAK,OAAO,IAAI,KAAK,KAAK;AAAA,EAC5B;AAAA,EAEA,IAAI,KAA4B;AAC9B,UAAM,QAAQ,KAAK,OAAO,IAAI,GAAG;AACjC,QAAI,UAAU,UAAa,MAAM,YAAY,KAAK,OAAO;AACvD,WAAK,OAAO,OAAO,GAAG;AACtB,aAAO;AAAA,IACT;AACA,WAAO,MAAM;AAAA,EACf;AAAA,EAEA,UAAgB;AACd,kBAAc,KAAK,eAAe;AAClC,SAAK,OAAO,MAAA;AAAA,EACd;AACF;"}
+{"version":3,"file":"cache.js","names":["#cache","#ttlMs","#intervalHandle"],"sources":["../../../../shared/src/cache.ts"],"sourcesContent":["/**\n * Stores values with an expiration time at time of insertion.\n * Does not update the expiration time on retrieval.\n * Values are automatically removed from the cache after the TTL expires.\n * The cache is cleaned up periodically based on the TTL so it does\n * not grow indefinitely.\n */\nexport class TimedCache<T> {\n  readonly #cache: Map<string, {value: T; expiresAt: number}>;\n  readonly #ttlMs: number;\n  readonly #intervalHandle: NodeJS.Timeout;\n\n  constructor(ttlMs: number) {\n    this.#cache = new Map();\n    this.#ttlMs = ttlMs;\n    this.#intervalHandle = setInterval(() => {\n      const now = Date.now();\n      for (const [key, entry] of this.#cache.entries()) {\n        if (entry.expiresAt < now) {\n          this.#cache.delete(key);\n        }\n      }\n    }, ttlMs * 2);\n  }\n\n  set(key: string, value: T): void {\n    const entry = {value, expiresAt: Date.now() + this.#ttlMs};\n    this.#cache.set(key, entry);\n  }\n\n  get(key: string): T | undefined {\n    const entry = this.#cache.get(key);\n    if (entry === undefined || entry.expiresAt < Date.now()) {\n      this.#cache.delete(key);\n      return undefined;\n    }\n    return entry.value;\n  }\n\n  destroy(): void {\n    clearInterval(this.#intervalHandle);\n    this.#cache.clear();\n  }\n}\n"],"mappings":";;;;;;;;AAOA,IAAa,aAAb,MAA2B;CACzB;CACA;CACA;CAEA,YAAY,OAAe;AACzB,QAAA,wBAAc,IAAI,KAAK;AACvB,QAAA,QAAc;AACd,QAAA,iBAAuB,kBAAkB;GACvC,MAAM,MAAM,KAAK,KAAK;AACtB,QAAK,MAAM,CAAC,KAAK,UAAU,MAAA,MAAY,SAAS,CAC9C,KAAI,MAAM,YAAY,IACpB,OAAA,MAAY,OAAO,IAAI;KAG1B,QAAQ,EAAE;;CAGf,IAAI,KAAa,OAAgB;EAC/B,MAAM,QAAQ;GAAC;GAAO,WAAW,KAAK,KAAK,GAAG,MAAA;GAAY;AAC1D,QAAA,MAAY,IAAI,KAAK,MAAM;;CAG7B,IAAI,KAA4B;EAC9B,MAAM,QAAQ,MAAA,MAAY,IAAI,IAAI;AAClC,MAAI,UAAU,KAAA,KAAa,MAAM,YAAY,KAAK,KAAK,EAAE;AACvD,SAAA,MAAY,OAAO,IAAI;AACvB;;AAEF,SAAO,MAAM;;CAGf,UAAgB;AACd,gBAAc,MAAA,eAAqB;AACnC,QAAA,MAAY,OAAO"}

package/out/shared/src/centroid.js

@@ -1,28 +1,26 @@
-class Centroid {
-  mean;
-  weight;
-  constructor(mean, weight) {
-    this.mean = mean;
-    this.weight = weight;
-  }
-  add(r) {
-    if (r.weight < 0) {
-      throw new Error("centroid weight cannot be less than zero");
-    }
-    if (this.weight !== 0) {
-      this.weight += r.weight;
-      this.mean += r.weight * (r.mean - this.mean) / this.weight;
-    } else {
-      this.weight = r.weight;
-      this.mean = r.mean;
-    }
-  }
-}
+//#region ../shared/src/centroid.ts
+var Centroid = class {
+	mean;
+	weight;
+	constructor(mean, weight) {
+		this.mean = mean;
+		this.weight = weight;
+	}
+	add(r) {
+		if (r.weight < 0) throw new Error("centroid weight cannot be less than zero");
+		if (this.weight !== 0) {
+			this.weight += r.weight;
+			this.mean += r.weight * (r.mean - this.mean) / this.weight;
+		} else {
+			this.weight = r.weight;
+			this.mean = r.mean;
+		}
+	}
+};
 function sortCentroidList(centroids) {
-  centroids.sort((a, b) => a.mean - b.mean);
+	centroids.sort((a, b) => a.mean - b.mean);
 }
-export {
-  Centroid,
-  sortCentroidList
-};
-//# sourceMappingURL=centroid.js.map
+//#endregion
+export { Centroid, sortCentroidList };
+
+//# sourceMappingURL=centroid.js.map

package/out/shared/src/centroid.js.map

@@ -1 +1 @@
-{"version":3,"file":"centroid.js","sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n\nexport function sortCentroidList(centroids: CentroidList): void {\n  centroids.sort((a, b) => a.mean - b.mean);\n}\n"],"names":[],"mappings":"AAIO,MAAM,SAAS;AAAA,EACpB;AAAA,EACA;AAAA,EAEA,YAAY,MAAc,QAAgB;AACxC,SAAK,OAAO;AACZ,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,IAAI,GAAmB;AACrB,QAAI,EAAE,SAAS,GAAG;AAChB,YAAM,IAAI,MAAM,0CAA0C;AAAA,IAC5D;AACA,QAAI,KAAK,WAAW,GAAG;AACrB,WAAK,UAAU,EAAE;AACjB,WAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;AAAA,IACxD,OAAO;AACL,WAAK,SAAS,EAAE;AAChB,WAAK,OAAO,EAAE;AAAA,IAChB;AAAA,EACF;AACF;AAKO,SAAS,iBAAiB,WAA+B;AAC9D,YAAU,KAAK,CAAC,GAAG,MAAM,EAAE,OAAO,EAAE,IAAI;AAC1C;"}
+{"version":3,"file":"centroid.js","names":[],"sources":["../../../../shared/src/centroid.ts"],"sourcesContent":["// Apache License 2.0\n// https://github.com/influxdata/tdigest\n\n// Centroid average position of all points in a shape\nexport class Centroid {\n  mean: number;\n  weight: number;\n\n  constructor(mean: number, weight: number) {\n    this.mean = mean;\n    this.weight = weight;\n  }\n\n  add(r: Centroid): void {\n    if (r.weight < 0) {\n      throw new Error('centroid weight cannot be less than zero');\n    }\n    if (this.weight !== 0) {\n      this.weight += r.weight;\n      this.mean += (r.weight * (r.mean - this.mean)) / this.weight;\n    } else {\n      this.weight = r.weight;\n      this.mean = r.mean;\n    }\n  }\n}\n\n/** CentroidList is sorted by the mean of the centroid, ascending. */\nexport type CentroidList = Centroid[];\n\nexport function sortCentroidList(centroids: CentroidList): void {\n  centroids.sort((a, b) => a.mean - b.mean);\n}\n"],"mappings":";AAIA,IAAa,WAAb,MAAsB;CACpB;CACA;CAEA,YAAY,MAAc,QAAgB;AACxC,OAAK,OAAO;AACZ,OAAK,SAAS;;CAGhB,IAAI,GAAmB;AACrB,MAAI,EAAE,SAAS,EACb,OAAM,IAAI,MAAM,2CAA2C;AAE7D,MAAI,KAAK,WAAW,GAAG;AACrB,QAAK,UAAU,EAAE;AACjB,QAAK,QAAS,EAAE,UAAU,EAAE,OAAO,KAAK,QAAS,KAAK;SACjD;AACL,QAAK,SAAS,EAAE;AAChB,QAAK,OAAO,EAAE;;;;AAQpB,SAAgB,iBAAiB,WAA+B;AAC9D,WAAU,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,KAAK"}

package/out/shared/src/config.js

@@ -1,6 +1,6 @@
-const isProd = process.env.NODE_ENV === "production";
-export {
-  isProd,
-  isProd as skipAssertJSONValue
-};
-//# sourceMappingURL=config.js.map
+//#region ../shared/src/config.ts
+var isProd = process.env.NODE_ENV === "production";
+//#endregion
+export { isProd };
+
+//# sourceMappingURL=config.js.map

package/out/shared/src/config.js.map

@@ -1 +1 @@
-{"version":3,"file":"config.js","sources":["../../../../shared/src/config.ts"],"sourcesContent":["declare const process: {\n  env: {\n    NODE_ENV?: string;\n  };\n};\n\nexport const isProd = process.env.NODE_ENV === 'production';\n\nexport {isProd as skipAssertJSONValue};\n"],"names":[],"mappings":"AAMO,MAAM,SAAS,QAAQ,IAAI,aAAa;"}
+{"version":3,"file":"config.js","names":[],"sources":["../../../../shared/src/config.ts"],"sourcesContent":["declare const process: {\n  env: {\n    NODE_ENV?: string;\n  };\n};\n\nexport const isProd = process.env.NODE_ENV === 'production';\n\nexport {isProd as skipAssertJSONValue};\n"],"mappings":";AAMA,IAAa,SAAA,QAAA,IAAA,aAAkC"}

package/out/shared/src/custom-key-map.js

@@ -1,59 +1,55 @@
-class CustomKeyMap {
-  [Symbol.toStringTag] = "CustomKeyMap";
-  #toKey;
-  #map = /* @__PURE__ */ new Map();
-  constructor(toKey, iterable) {
-    this.#toKey = toKey;
-    if (iterable) {
-      for (const [key, value] of iterable ?? []) {
-        this.#map.set(toKey(key), [key, value]);
-      }
-    }
-  }
-  clear() {
-    this.#map.clear();
-  }
-  delete(key) {
-    return this.#map.delete(this.#toKey(key));
-  }
-  forEach(callbackfn, thisArg) {
-    for (const [key, value] of this.#map.values()) {
-      callbackfn.call(thisArg, value, key, this);
-    }
-  }
-  get(key) {
-    return this.#map.get(this.#toKey(key))?.[1];
-  }
-  has(key) {
-    return this.#map.has(this.#toKey(key));
-  }
-  set(key, value) {
-    this.#map.set(this.#toKey(key), [key, value]);
-    return this;
-  }
-  get size() {
-    return this.#map.size;
-  }
-  *entries() {
-    for (const entry of this.#map.values()) {
-      yield entry.slice(0, 2);
-    }
-  }
-  *keys() {
-    for (const entry of this.#map.values()) {
-      yield entry[0];
-    }
-  }
-  *values() {
-    for (const entry of this.#map.values()) {
-      yield entry[1];
-    }
-  }
-  [Symbol.iterator]() {
-    return this.entries();
-  }
-}
-export {
-  CustomKeyMap
+//#region ../shared/src/custom-key-map.ts
+/**
+* A {@link Map} that uses a custom key transformation function to convert keys
+* to a primitive type that can be used as a {@link Map} key.
+*
+* This allows for using objects as keys in a {@link Map} without worrying about
+* reference equality.
+*/
+var CustomKeyMap = class {
+	[Symbol.toStringTag] = "CustomKeyMap";
+	#toKey;
+	#map = /* @__PURE__ */ new Map();
+	constructor(toKey, iterable) {
+		this.#toKey = toKey;
+		if (iterable) for (const [key, value] of iterable ?? []) this.#map.set(toKey(key), [key, value]);
+	}
+	clear() {
+		this.#map.clear();
+	}
+	delete(key) {
+		return this.#map.delete(this.#toKey(key));
+	}
+	forEach(callbackfn, thisArg) {
+		for (const [key, value] of this.#map.values()) callbackfn.call(thisArg, value, key, this);
+	}
+	get(key) {
+		return this.#map.get(this.#toKey(key))?.[1];
+	}
+	has(key) {
+		return this.#map.has(this.#toKey(key));
+	}
+	set(key, value) {
+		this.#map.set(this.#toKey(key), [key, value]);
+		return this;
+	}
+	get size() {
+		return this.#map.size;
+	}
+	*entries() {
+		for (const entry of this.#map.values()) yield entry.slice(0, 2);
+	}
+	*keys() {
+		for (const entry of this.#map.values()) yield entry[0];
+	}
+	*values() {
+		for (const entry of this.#map.values()) yield entry[1];
+	}
+	[Symbol.iterator]() {
+		return this.entries();
+	}
 };
-//# sourceMappingURL=custom-key-map.js.map
+//#endregion
+export { CustomKeyMap };
+
+//# sourceMappingURL=custom-key-map.js.map

package/out/shared/src/custom-key-map.js.map

@@ -1 +1 @@
-{"version":3,"file":"custom-key-map.js","sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n *\n * This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n */\nexport class CustomKeyMap<K, V> {\n  readonly [Symbol.toStringTag] = 'CustomKeyMap';\n  readonly #toKey: (key: K) => Primitive;\n  readonly #map = new Map<Primitive, readonly [K, V]>();\n\n  constructor(\n    toKey: (key: K) => Primitive,\n    iterable?: Iterable<readonly [K, V]> | null,\n  ) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const [key, value] of iterable ?? []) {\n        this.#map.set(toKey(key), [key, value]);\n      }\n    }\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(key: K): boolean {\n    return this.#map.delete(this.#toKey(key));\n  }\n\n  forEach(\n    callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    for (const [key, value] of this.#map.values()) {\n      callbackfn.call(thisArg, value, key, this);\n    }\n  }\n\n  get(key: K): V | undefined {\n    return this.#map.get(this.#toKey(key))?.[1];\n  }\n\n  has(key: K): boolean {\n    return this.#map.has(this.#toKey(key));\n  }\n\n  set(key: K, value: V): this {\n    this.#map.set(this.#toKey(key), [key, value]);\n    return this;\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): MapIterator<[K, V]> {\n    for (const entry of this.#map.values()) {\n      yield entry.slice(0, 2) as [K, V];\n    }\n  }\n\n  *keys(): MapIterator<K> {\n    for (const entry of this.#map.values()) {\n      yield entry[0];\n    }\n  }\n\n  *values(): MapIterator<V> {\n    for (const entry of this.#map.values()) {\n      yield entry[1];\n    }\n  }\n\n  [Symbol.iterator](): MapIterator<[K, V]> {\n    return this.entries();\n  }\n}\n"],"names":[],"mappings":"AASO,MAAM,aAAmB;AAAA,EAC9B,CAAU,OAAO,WAAW,IAAI;AAAA,EACvB;AAAA,EACA,2BAAW,IAAA;AAAA,EAEpB,YACE,OACA,UACA;AACA,SAAK,SAAS;AACd,QAAI,UAAU;AACZ,iBAAW,CAAC,KAAK,KAAK,KAAK,YAAY,CAAA,GAAI;AACzC,aAAK,KAAK,IAAI,MAAM,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;AAAA,MACxC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,QAAc;AACZ,SAAK,KAAK,MAAA;AAAA,EACZ;AAAA,EAEA,OAAO,KAAiB;AACtB,WAAO,KAAK,KAAK,OAAO,KAAK,OAAO,GAAG,CAAC;AAAA,EAC1C;AAAA,EAEA,QACE,YAEA,SACM;AACN,eAAW,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,UAAU;AAC7C,iBAAW,KAAK,SAAS,OAAO,KAAK,IAAI;AAAA,IAC3C;AAAA,EACF;AAAA,EAEA,IAAI,KAAuB;AACzB,WAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC,IAAI,CAAC;AAAA,EAC5C;AAAA,EAEA,IAAI,KAAiB;AACnB,WAAO,KAAK,KAAK,IAAI,KAAK,OAAO,GAAG,CAAC;AAAA,EACvC;AAAA,EAEA,IAAI,KAAQ,OAAgB;AAC1B,SAAK,KAAK,IAAI,KAAK,OAAO,GAAG,GAAG,CAAC,KAAK,KAAK,CAAC;AAC5C,WAAO;AAAA,EACT;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,CAAC,UAA+B;AAC9B,eAAW,SAAS,KAAK,KAAK,OAAA,GAAU;AACtC,YAAM,MAAM,MAAM,GAAG,CAAC;AAAA,IACxB;AAAA,EACF;AAAA,EAEA,CAAC,OAAuB;AACtB,eAAW,SAAS,KAAK,KAAK,OAAA,GAAU;AACtC,YAAM,MAAM,CAAC;AAAA,IACf;AAAA,EACF;AAAA,EAEA,CAAC,SAAyB;AACxB,eAAW,SAAS,KAAK,KAAK,OAAA,GAAU;AACtC,YAAM,MAAM,CAAC;AAAA,IACf;AAAA,EACF;AAAA,EAEA,CAAC,OAAO,QAAQ,IAAyB;AACvC,WAAO,KAAK,QAAA;AAAA,EACd;AACF;"}
+{"version":3,"file":"custom-key-map.js","names":["#toKey","#map"],"sources":["../../../../shared/src/custom-key-map.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Map} that uses a custom key transformation function to convert keys\n * to a primitive type that can be used as a {@link Map} key.\n *\n * This allows for using objects as keys in a {@link Map} without worrying about\n * reference equality.\n */\nexport class CustomKeyMap<K, V> {\n  readonly [Symbol.toStringTag] = 'CustomKeyMap';\n  readonly #toKey: (key: K) => Primitive;\n  readonly #map = new Map<Primitive, readonly [K, V]>();\n\n  constructor(\n    toKey: (key: K) => Primitive,\n    iterable?: Iterable<readonly [K, V]> | null,\n  ) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const [key, value] of iterable ?? []) {\n        this.#map.set(toKey(key), [key, value]);\n      }\n    }\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(key: K): boolean {\n    return this.#map.delete(this.#toKey(key));\n  }\n\n  forEach(\n    callbackfn: (value: V, key: K, map: CustomKeyMap<K, V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    for (const [key, value] of this.#map.values()) {\n      callbackfn.call(thisArg, value, key, this);\n    }\n  }\n\n  get(key: K): V | undefined {\n    return this.#map.get(this.#toKey(key))?.[1];\n  }\n\n  has(key: K): boolean {\n    return this.#map.has(this.#toKey(key));\n  }\n\n  set(key: K, value: V): this {\n    this.#map.set(this.#toKey(key), [key, value]);\n    return this;\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): MapIterator<[K, V]> {\n    for (const entry of this.#map.values()) {\n      yield entry.slice(0, 2) as [K, V];\n    }\n  }\n\n  *keys(): MapIterator<K> {\n    for (const entry of this.#map.values()) {\n      yield entry[0];\n    }\n  }\n\n  *values(): MapIterator<V> {\n    for (const entry of this.#map.values()) {\n      yield entry[1];\n    }\n  }\n\n  [Symbol.iterator](): MapIterator<[K, V]> {\n    return this.entries();\n  }\n}\n"],"mappings":";;;;;;;;AASA,IAAa,eAAb,MAAgC;CAC9B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,KAAiC;CAErD,YACE,OACA,UACA;AACA,QAAA,QAAc;AACd,MAAI,SACF,MAAK,MAAM,CAAC,KAAK,UAAU,YAAY,EAAE,CACvC,OAAA,IAAU,IAAI,MAAM,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;;CAK7C,QAAc;AACZ,QAAA,IAAU,OAAO;;CAGnB,OAAO,KAAiB;AACtB,SAAO,MAAA,IAAU,OAAO,MAAA,MAAY,IAAI,CAAC;;CAG3C,QACE,YAEA,SACM;AACN,OAAK,MAAM,CAAC,KAAK,UAAU,MAAA,IAAU,QAAQ,CAC3C,YAAW,KAAK,SAAS,OAAO,KAAK,KAAK;;CAI9C,IAAI,KAAuB;AACzB,SAAO,MAAA,IAAU,IAAI,MAAA,MAAY,IAAI,CAAC,GAAG;;CAG3C,IAAI,KAAiB;AACnB,SAAO,MAAA,IAAU,IAAI,MAAA,MAAY,IAAI,CAAC;;CAGxC,IAAI,KAAQ,OAAgB;AAC1B,QAAA,IAAU,IAAI,MAAA,MAAY,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;AAC7C,SAAO;;CAGT,IAAI,OAAe;AACjB,SAAO,MAAA,IAAU;;CAGnB,CAAC,UAA+B;AAC9B,OAAK,MAAM,SAAS,MAAA,IAAU,QAAQ,CACpC,OAAM,MAAM,MAAM,GAAG,EAAE;;CAI3B,CAAC,OAAuB;AACtB,OAAK,MAAM,SAAS,MAAA,IAAU,QAAQ,CACpC,OAAM,MAAM;;CAIhB,CAAC,SAAyB;AACxB,OAAK,MAAM,SAAS,MAAA,IAAU,QAAQ,CACpC,OAAM,MAAM;;CAIhB,CAAC,OAAO,YAAiC;AACvC,SAAO,KAAK,SAAS"}

package/out/shared/src/custom-key-set.js

@@ -1,52 +1,54 @@
-class CustomKeySet {
-  [Symbol.toStringTag] = "CustomKeySet";
-  #toKey;
-  #map = /* @__PURE__ */ new Map();
-  constructor(toKey, iterable) {
-    this.#toKey = toKey;
-    if (iterable) {
-      for (const value of iterable ?? []) {
-        this.#map.set(toKey(value), value);
-      }
-    }
-  }
-  add(value) {
-    this.#map.set(this.#toKey(value), value);
-    return this;
-  }
-  clear() {
-    this.#map.clear();
-  }
-  delete(value) {
-    return this.#map.delete(this.#toKey(value));
-  }
-  forEach(callbackfn, thisArg) {
-    this.#map.forEach((value) => {
-      callbackfn.call(thisArg, value, value, this);
-    });
-  }
-  has(value) {
-    return this.#map.has(this.#toKey(value));
-  }
-  get size() {
-    return this.#map.size;
-  }
-  *entries() {
-    for (const value of this.#map.values()) {
-      yield [value, value];
-    }
-  }
-  keys() {
-    return this.#map.values();
-  }
-  values() {
-    return this.#map.values();
-  }
-  [Symbol.iterator]() {
-    return this.#map.values();
-  }
-}
-export {
-  CustomKeySet
+//#region ../shared/src/custom-key-set.ts
+/**
+* A {@link Set} that uses a custom value transformation function to convert values
+* to a primitive type that can be used as a {@link Set} value.
+*
+* This allows for using objects as values in a {@link Set} without worrying about
+* reference equality.
+*/
+var CustomKeySet = class {
+	[Symbol.toStringTag] = "CustomKeySet";
+	#toKey;
+	#map = /* @__PURE__ */ new Map();
+	constructor(toKey, iterable) {
+		this.#toKey = toKey;
+		if (iterable) for (const value of iterable ?? []) this.#map.set(toKey(value), value);
+	}
+	add(value) {
+		this.#map.set(this.#toKey(value), value);
+		return this;
+	}
+	clear() {
+		this.#map.clear();
+	}
+	delete(value) {
+		return this.#map.delete(this.#toKey(value));
+	}
+	forEach(callbackfn, thisArg) {
+		this.#map.forEach((value) => {
+			callbackfn.call(thisArg, value, value, this);
+		});
+	}
+	has(value) {
+		return this.#map.has(this.#toKey(value));
+	}
+	get size() {
+		return this.#map.size;
+	}
+	*entries() {
+		for (const value of this.#map.values()) yield [value, value];
+	}
+	keys() {
+		return this.#map.values();
+	}
+	values() {
+		return this.#map.values();
+	}
+	[Symbol.iterator]() {
+		return this.#map.values();
+	}
 };
-//# sourceMappingURL=custom-key-set.js.map
+//#endregion
+export { CustomKeySet };
+
+//# sourceMappingURL=custom-key-set.js.map

package/out/shared/src/custom-key-set.js.map

@@ -1 +1 @@
-{"version":3,"file":"custom-key-set.js","sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n *\n * This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n */\n\nexport class CustomKeySet<V> {\n  readonly [Symbol.toStringTag] = 'CustomKeySet';\n  readonly #toKey: (value: V) => Primitive;\n  readonly #map = new Map<Primitive, V>();\n\n  constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> | null) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const value of iterable ?? []) {\n        this.#map.set(toKey(value), value);\n      }\n    }\n  }\n\n  add(value: V): this {\n    this.#map.set(this.#toKey(value), value);\n    return this;\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(value: V): boolean {\n    return this.#map.delete(this.#toKey(value));\n  }\n\n  forEach(\n    callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    this.#map.forEach(value => {\n      callbackfn.call(thisArg, value, value, this);\n    });\n  }\n\n  has(value: V): boolean {\n    return this.#map.has(this.#toKey(value));\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): IterableIterator<[V, V]> {\n    for (const value of this.#map.values()) {\n      yield [value, value];\n    }\n  }\n\n  keys(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  values(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  [Symbol.iterator](): IterableIterator<V> {\n    return this.#map.values();\n  }\n}\n"],"names":[],"mappings":"AAUO,MAAM,aAAgB;AAAA,EAC3B,CAAU,OAAO,WAAW,IAAI;AAAA,EACvB;AAAA,EACA,2BAAW,IAAA;AAAA,EAEpB,YAAY,OAAgC,UAA+B;AACzE,SAAK,SAAS;AACd,QAAI,UAAU;AACZ,iBAAW,SAAS,YAAY,IAAI;AAClC,aAAK,KAAK,IAAI,MAAM,KAAK,GAAG,KAAK;AAAA,MACnC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,IAAI,OAAgB;AAClB,SAAK,KAAK,IAAI,KAAK,OAAO,KAAK,GAAG,KAAK;AACvC,WAAO;AAAA,EACT;AAAA,EAEA,QAAc;AACZ,SAAK,KAAK,MAAA;AAAA,EACZ;AAAA,EAEA,OAAO,OAAmB;AACxB,WAAO,KAAK,KAAK,OAAO,KAAK,OAAO,KAAK,CAAC;AAAA,EAC5C;AAAA,EAEA,QACE,YAEA,SACM;AACN,SAAK,KAAK,QAAQ,CAAA,UAAS;AACzB,iBAAW,KAAK,SAAS,OAAO,OAAO,IAAI;AAAA,IAC7C,CAAC;AAAA,EACH;AAAA,EAEA,IAAI,OAAmB;AACrB,WAAO,KAAK,KAAK,IAAI,KAAK,OAAO,KAAK,CAAC;AAAA,EACzC;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK,KAAK;AAAA,EACnB;AAAA,EAEA,CAAC,UAAoC;AACnC,eAAW,SAAS,KAAK,KAAK,OAAA,GAAU;AACtC,YAAM,CAAC,OAAO,KAAK;AAAA,IACrB;AAAA,EACF;AAAA,EAEA,OAA4B;AAC1B,WAAO,KAAK,KAAK,OAAA;AAAA,EACnB;AAAA,EAEA,SAA8B;AAC5B,WAAO,KAAK,KAAK,OAAA;AAAA,EACnB;AAAA,EAEA,CAAC,OAAO,QAAQ,IAAyB;AACvC,WAAO,KAAK,KAAK,OAAA;AAAA,EACnB;AACF;"}
+{"version":3,"file":"custom-key-set.js","names":["#toKey","#map"],"sources":["../../../../shared/src/custom-key-set.ts"],"sourcesContent":["type Primitive = undefined | null | boolean | string | number | symbol | bigint;\n\n/**\n * A {@link Set} that uses a custom value transformation function to convert values\n * to a primitive type that can be used as a {@link Set} value.\n *\n * This allows for using objects as values in a {@link Set} without worrying about\n * reference equality.\n */\n\nexport class CustomKeySet<V> {\n  readonly [Symbol.toStringTag] = 'CustomKeySet';\n  readonly #toKey: (value: V) => Primitive;\n  readonly #map = new Map<Primitive, V>();\n\n  constructor(toKey: (value: V) => Primitive, iterable?: Iterable<V> | null) {\n    this.#toKey = toKey;\n    if (iterable) {\n      for (const value of iterable ?? []) {\n        this.#map.set(toKey(value), value);\n      }\n    }\n  }\n\n  add(value: V): this {\n    this.#map.set(this.#toKey(value), value);\n    return this;\n  }\n\n  clear(): void {\n    this.#map.clear();\n  }\n\n  delete(value: V): boolean {\n    return this.#map.delete(this.#toKey(value));\n  }\n\n  forEach(\n    callbackfn: (value: V, value2: V, set: CustomKeySet<V>) => void,\n    // oxlint-disable-next-line @typescript-eslint/no-explicit-any\n    thisArg?: any,\n  ): void {\n    this.#map.forEach(value => {\n      callbackfn.call(thisArg, value, value, this);\n    });\n  }\n\n  has(value: V): boolean {\n    return this.#map.has(this.#toKey(value));\n  }\n\n  get size(): number {\n    return this.#map.size;\n  }\n\n  *entries(): IterableIterator<[V, V]> {\n    for (const value of this.#map.values()) {\n      yield [value, value];\n    }\n  }\n\n  keys(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  values(): IterableIterator<V> {\n    return this.#map.values();\n  }\n\n  [Symbol.iterator](): IterableIterator<V> {\n    return this.#map.values();\n  }\n}\n"],"mappings":";;;;;;;;AAUA,IAAa,eAAb,MAA6B;CAC3B,CAAU,OAAO,eAAe;CAChC;CACA,uBAAgB,IAAI,KAAmB;CAEvC,YAAY,OAAgC,UAA+B;AACzE,QAAA,QAAc;AACd,MAAI,SACF,MAAK,MAAM,SAAS,YAAY,EAAE,CAChC,OAAA,IAAU,IAAI,MAAM,MAAM,EAAE,MAAM;;CAKxC,IAAI,OAAgB;AAClB,QAAA,IAAU,IAAI,MAAA,MAAY,MAAM,EAAE,MAAM;AACxC,SAAO;;CAGT,QAAc;AACZ,QAAA,IAAU,OAAO;;CAGnB,OAAO,OAAmB;AACxB,SAAO,MAAA,IAAU,OAAO,MAAA,MAAY,MAAM,CAAC;;CAG7C,QACE,YAEA,SACM;AACN,QAAA,IAAU,SAAQ,UAAS;AACzB,cAAW,KAAK,SAAS,OAAO,OAAO,KAAK;IAC5C;;CAGJ,IAAI,OAAmB;AACrB,SAAO,MAAA,IAAU,IAAI,MAAA,MAAY,MAAM,CAAC;;CAG1C,IAAI,OAAe;AACjB,SAAO,MAAA,IAAU;;CAGnB,CAAC,UAAoC;AACnC,OAAK,MAAM,SAAS,MAAA,IAAU,QAAQ,CACpC,OAAM,CAAC,OAAO,MAAM;;CAIxB,OAA4B;AAC1B,SAAO,MAAA,IAAU,QAAQ;;CAG3B,SAA8B;AAC5B,SAAO,MAAA,IAAU,QAAQ;;CAG3B,CAAC,OAAO,YAAiC;AACvC,SAAO,MAAA,IAAU,QAAQ"}