@blackglory/structures 0.11.6 → 0.11.8

package/README.md

@@ -265,6 +265,66 @@ class TrieMap<K extends Iterable<T>, V, T = unknown> {
 }
 ```
 
+Note that you might expect this data structure to be more space efficient than `BigMap`, but it doesn't.
+In V8, it can only store about 80% of data of `BigMap`.
+
+### StringTrieMap
+```ts
+class StringTrieMap<T> {
+  get [Symbol.toStringTag](): string
+
+  keys(): IterableIterator<string>
+  values(): IterableIterator<T>
+  entries(): IterableIterator<[key: string, value: T]>
+
+  set(key: string, value: T): this
+  has(key: string): boolean
+  get(key: string): T | undefined
+  delete(key: string): boolean
+}
+```
+
+Note that you might expect this data structure to be more space efficient than `BigMap`, but it doesn't.
+In V8, it can only store about 80% of data of `BigMap`.
+
+### RadixTree
+```ts
+class RadixTree<K extends Iterable<T>, V, T = unknown> {
+  get [Symbol.toStringTag](): string
+
+  entries(): IterableIterator<[key: T[], value: V]>
+  keys(): IterableIterator<T[]>
+  values(): IterableIterator<V>
+
+  set(key: K, value: V): this
+  has(key: K): boolean
+  get(key: K): V | undefined
+  delete(key: K): boolean
+}
+```
+
+Note that you might expect this data structure to be more space efficient than `BigMap`, but it doesn't.
+In V8, it can only store about 80% of data of `BigMap`.
+
+### StringRadixTree
+```ts
+class StringRadixTree<T> {
+  get [Symbol.toStringTag](): string
+
+  keys(): IterableIterator<string>
+  values(): IterableIterator<T>
+  entries(): IterableIterator<[key: string, value: T]>
+
+  set(key: string, value: T): this
+  has(key: string): boolean
+  get(key: string): T | undefined
+  delete(key: string): boolean
+}
+```
+
+Note that you might expect this data structure to be more space efficient than `BigMap`, but it doesn't.
+In V8, it can only store about 80% of data of `BigMap`.
+
 ### SparseSet
 ```ts
 class SparseSet implements Iterable<number> {
@@ -334,6 +394,7 @@ class DynamicTypedArray<T extends TypedArrayConstructor> {
   )
 
   set(index: number, value: number): void
+  setValues(index: number, values: TypedArrayOfConstructor<T>): void
   get(index: number): number | undefined
   push(...values: number[]): void
   pop(): number | undefined

package/lib/es2015/dynamic-typed-array.d.ts

@@ -15,6 +15,7 @@ export declare class DynamicTypedArray<T extends TypedArrayConstructor> {
     get length(): number;
     constructor(typedArrayConstructor: T, { capacity, growthFactor }?: IDynamicTypedArrayOptions);
     set(index: number, value: number): void;
+    setValues(index: number, values: TypedArrayOfConstructor<T>): void;
     get(index: number): number | undefined;
     push(...values: number[]): void;
     pop(): number | undefined;

package/lib/es2015/dynamic-typed-array.js

@@ -37,6 +37,16 @@ class DynamicTypedArray {
         }
         this.array[index] = value;
     }
+    setValues(index, values) {
+        if (index + values.length >= this.capacity) {
+            const newCapacity = computeNewCapacity(this.capacity, index + values.length, this.growthFactor);
+            this.resize(newCapacity);
+        }
+        if (index + values.length > this._length) {
+            this._length = index + values.length;
+        }
+        this.internalTypedArray.set(values, index);
+    }
     get(index) {
         return index < this._length
             ? this.array[index]

package/lib/es2015/dynamic-typed-array.js.map

@@ -1 +1 @@
-{"version":3,"file":"dynamic-typed-array.js","sourceRoot":"","sources":["../../src/dynamic-typed-array.ts"],"names":[],"mappings":";;;AACA,+CAA2C;AAQ3C,MAAa,iBAAiB;IAK5B,IAAI,kBAAkB;QACpB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,CAAA;IACrD,CAAC;IAKD,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1B,CAAC;IAKD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,YACU,qBAAwB,EAChC,EACE,QAAQ,GAAG,CAAC,EACZ,YAAY,GAAG,GAAG,KACW,EAAE;QAJzB,0BAAqB,GAArB,qBAAqB,CAAG;QA9B1B,YAAO,GAAW,CAAC,CAAA;QAoCzB,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,6BAA6B,CAAC,CAAA;QACjE,IAAA,eAAM,EAAC,QAAQ,IAAI,CAAC,EAAE,6CAA6C,CAAC,CAAA;QACpE,IAAA,eAAM,EAAC,YAAY,IAAI,CAAC,EAAE,kDAAkD,CAAC,CAAA;QAE7E,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAqB,CAAC,QAAQ,CAA+B,CAAA;QAC9E,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,KAAa;QAC9B,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC1B,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,KAAK,GAAG,CAAC,EACT,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;SACzB;QAED,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE;YACzB,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,CAAC,CAAA;SACzB;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;IAC3B,CAAC;IAED,GAAG,CAAC,KAAa;QACf,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO;YACtB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACnB,CAAC,CAAC,SAAS,CAAA;IAClB,CAAC;IAED,IAAI,CAAC,GAAG,MAAgB;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAA;QAC9C,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,SAAS,EACT,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;SACzB;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAA;SACnC;IACH,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,OAAO,EAAE,CAAA;YAEd,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YAExB,OAAO,KAAK,CAAA;SACb;aAAM;YACL,OAAO,SAAS,CAAA;SACjB;IACH,CAAC;IAED,IAAI,CAAC,OAA0C;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;IACvB,CAAC;IAEO,MAAM,CAAC,WAAmB;QAChC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,EAAE;YACrC,OAAM;SACP;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,EAAE;YAC1C,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAA;YAC5D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACxB,IAAI,CAAC,KAAK,GAAG,QAAsC,CAAA;SACpD;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,EAAE;YAC1C,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAA;YAE5D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,GAAG;gBAC9B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;aAC5B;YACD,IAAI,CAAC,KAAK,GAAG,QAAsC,CAAA;SACpD;IACH,CAAC;CACF;AA9HD,8CA8HC;AAED,SAAgB,kBAAkB,CAChC,WAAmB,EACnB,YAAoB,EACpB,YAAoB;IAEpB,IAAI,YAAY,KAAK,CAAC,EAAE;QACtB,OAAO,YAAY,CAAA;KACpB;SAAM;QACL,IAAI,WAAW,KAAK,YAAY,EAAE;YAChC,OAAO,YAAY,CAAA;SACpB;aAAM,IAAI,WAAW,GAAG,YAAY,EAAE;YAErC,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;YAC1C,OAAO,WAAW,GAAG,YAAY,EAAE;gBACjC,WAAW,IAAI,YAAY,CAAA;aAC5B;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;SAC/B;aAAM;YAKL,IAAI,YAAY,KAAK,CAAC,EAAE;gBACtB,OAAO,CAAC,CAAA;aACT;iBAAM;gBACL,IAAI,WAAW,GAAG,WAAW,CAAA;gBAC7B,OAAO,IAAI,EAAE;oBACX,MAAM,IAAI,GAAG,WAAW,GAAG,YAAY,CAAA;oBACvC,IAAI,IAAI,GAAG,YAAY,EAAE;wBACvB,MAAK;qBACN;yBAAM;wBACL,WAAW,GAAG,IAAI,CAAA;qBACnB;iBACF;gBACD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;aAC/B;SACF;KACF;AACH,CAAC;AAtCD,gDAsCC"}
+{"version":3,"file":"dynamic-typed-array.js","sourceRoot":"","sources":["../../src/dynamic-typed-array.ts"],"names":[],"mappings":";;;AACA,+CAA2C;AAQ3C,MAAa,iBAAiB;IAK5B,IAAI,kBAAkB;QACpB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,iBAAiB;QACnB,OAAO,IAAI,CAAC,qBAAqB,CAAC,iBAAiB,CAAA;IACrD,CAAC;IAKD,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1B,CAAC;IAKD,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,YACU,qBAAwB,EAChC,EACE,QAAQ,GAAG,CAAC,EACZ,YAAY,GAAG,GAAG,KACW,EAAE;QAJzB,0BAAqB,GAArB,qBAAqB,CAAG;QA9B1B,YAAO,GAAW,CAAC,CAAA;QAoCzB,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,6BAA6B,CAAC,CAAA;QACjE,IAAA,eAAM,EAAC,QAAQ,IAAI,CAAC,EAAE,6CAA6C,CAAC,CAAA;QACpE,IAAA,eAAM,EAAC,YAAY,IAAI,CAAC,EAAE,kDAAkD,CAAC,CAAA;QAE7E,IAAI,CAAC,KAAK,GAAG,IAAI,qBAAqB,CAAC,QAAQ,CAA+B,CAAA;QAC9E,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,KAAa;QAC9B,IAAI,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC1B,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,KAAK,GAAG,CAAC,EACT,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;SACzB;QAED,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE;YACzB,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,CAAC,CAAA;SACzB;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;IAC3B,CAAC;IAED,SAAS,CAAC,KAAa,EAAE,MAAkC;QACzD,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC1C,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,KAAK,GAAG,MAAM,CAAC,MAAM,EACrB,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;SACzB;QAED,IAAI,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,EAAE;YACxC,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,CAAA;SACrC;QAED,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IAC5C,CAAC;IAED,GAAG,CAAC,KAAa;QACf,OAAO,KAAK,GAAG,IAAI,CAAC,OAAO;YACtB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;YACnB,CAAC,CAAC,SAAS,CAAA;IAClB,CAAC;IAED,IAAI,CAAC,GAAG,MAAgB;QACtB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAA;QAC9C,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC7B,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,SAAS,EACT,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;SACzB;QAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAA;SACnC;IACH,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAA;YAC1C,IAAI,CAAC,OAAO,EAAE,CAAA;YAEd,MAAM,WAAW,GAAG,kBAAkB,CACpC,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,YAAY,CAClB,CAAA;YACD,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,CAAA;YAExB,OAAO,KAAK,CAAA;SACb;aAAM;YACL,OAAO,SAAS,CAAA;SACjB;IACH,CAAC;IAED,IAAI,CAAC,OAA0C;QAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACxB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;IACvB,CAAC;IAEO,MAAM,CAAC,WAAmB;QAChC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,EAAE;YACrC,OAAM;SACP;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,EAAE;YAC1C,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAA;YAC5D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YACxB,IAAI,CAAC,KAAK,GAAG,QAAsC,CAAA;SACpD;aAAM,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,WAAW,EAAE;YAC1C,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAA;YAE5D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,GAAG;gBAC9B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;aAC5B;YACD,IAAI,CAAC,KAAK,GAAG,QAAsC,CAAA;SACpD;IACH,CAAC;CACF;AA/ID,8CA+IC;AAED,SAAgB,kBAAkB,CAChC,WAAmB,EACnB,YAAoB,EACpB,YAAoB;IAEpB,IAAI,YAAY,KAAK,CAAC,EAAE;QACtB,OAAO,YAAY,CAAA;KACpB;SAAM;QACL,IAAI,WAAW,KAAK,YAAY,EAAE;YAChC,OAAO,YAAY,CAAA;SACpB;aAAM,IAAI,WAAW,GAAG,YAAY,EAAE;YAErC,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;YAC1C,OAAO,WAAW,GAAG,YAAY,EAAE;gBACjC,WAAW,IAAI,YAAY,CAAA;aAC5B;YACD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;SAC/B;aAAM;YAKL,IAAI,YAAY,KAAK,CAAC,EAAE;gBACtB,OAAO,CAAC,CAAA;aACT;iBAAM;gBACL,IAAI,WAAW,GAAG,WAAW,CAAA;gBAC7B,OAAO,IAAI,EAAE;oBACX,MAAM,IAAI,GAAG,WAAW,GAAG,YAAY,CAAA;oBACvC,IAAI,IAAI,GAAG,YAAY,EAAE;wBACvB,MAAK;qBACN;yBAAM;wBACL,WAAW,GAAG,IAAI,CAAA;qBACnB;iBACF;gBACD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAA;aAC/B;SACF;KACF;AACH,CAAC;AAtCD,gDAsCC"}

package/lib/es2015/index.d.ts

@@ -11,6 +11,9 @@ export * from './lru-map';
 export * from './expirable-map';
 export * from './tlru-map';
 export * from './trie-map';
+export * from './string-trie-map';
+export { RadixTree } from './radix-tree';
+export { StringRadixTree } from './string-radix-tree';
 export * from './sparse-set';
 export * from './sparse-map';
 export * from './typed-sparse-map';

package/lib/es2015/index.js

@@ -14,7 +14,7 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.DynamicTypedArray = void 0;
+exports.DynamicTypedArray = exports.StringRadixTree = exports.RadixTree = void 0;
 __exportStar(require("./box"), exports);
 __exportStar(require("./cons"), exports);
 __exportStar(require("./array"), exports);
@@ -28,6 +28,11 @@ __exportStar(require("./lru-map"), exports);
 __exportStar(require("./expirable-map"), exports);
 __exportStar(require("./tlru-map"), exports);
 __exportStar(require("./trie-map"), exports);
+__exportStar(require("./string-trie-map"), exports);
+var radix_tree_1 = require("./radix-tree");
+Object.defineProperty(exports, "RadixTree", { enumerable: true, get: function () { return radix_tree_1.RadixTree; } });
+var string_radix_tree_1 = require("./string-radix-tree");
+Object.defineProperty(exports, "StringRadixTree", { enumerable: true, get: function () { return string_radix_tree_1.StringRadixTree; } });
 __exportStar(require("./sparse-set"), exports);
 __exportStar(require("./sparse-map"), exports);
 __exportStar(require("./typed-sparse-map"), exports);

package/lib/es2015/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,0CAAuB;AACvB,4CAAyB;AACzB,4CAAyB;AACzB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B;AAC5B,4CAAyB;AACzB,kDAA+B"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,0CAAuB;AACvB,4CAAyB;AACzB,4CAAyB;AACzB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,oDAAiC;AACjC,2CAAwC;AAA/B,uGAAA,SAAS,OAAA;AAClB,yDAAqD;AAA5C,oHAAA,eAAe,OAAA;AACxB,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B;AAC5B,4CAAyB;AACzB,kDAA+B"}

package/lib/es2015/radix-tree.d.ts

@@ -0,0 +1,17 @@
+export declare class RadixTree<K extends Iterable<T>, V, T = unknown> {
+    private root;
+    get [Symbol.toStringTag](): string;
+    entries(): IterableIterator<[key: T[], value: V]>;
+    keys(): IterableIterator<T[]>;
+    values(): IterableIterator<V>;
+    set(key: K, value: V): this;
+    has(key: K): boolean;
+    get(key: K): V | undefined;
+    delete(key: K): boolean;
+}
+export declare function matchPrefix<T>(prefixes: Iterable<T[]>, path: T[]): T[] | undefined;
+export declare function findCommonPrefix<T>(prefixes: Iterable<T[]>, path: T[]): {
+    prefix: T[];
+    commonPartLength: number;
+} | undefined;
+export declare function getCommonPrefix<T>(paths: T[][]): T[];

package/lib/es2015/radix-tree.js

@@ -0,0 +1,221 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCommonPrefix = exports.findCommonPrefix = exports.matchPrefix = exports.RadixTree = void 0;
+const iterable_operator_1 = require("iterable-operator");
+const extra_utils_1 = require("extra-utils");
+class TreeNode {
+    constructor(value) {
+        this.value = value;
+        this.children = new Map();
+    }
+}
+class RadixTree {
+    constructor() {
+        this.root = new TreeNode();
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    entries() {
+        return dfs(this.root, []);
+        function* dfs(node, path) {
+            for (const [prefix, childNode] of node.children) {
+                const newPath = [...path, ...prefix];
+                if ((0, extra_utils_1.isntUndefined)(childNode.value)) {
+                    yield [newPath, childNode.value];
+                }
+                yield* dfs(childNode, newPath);
+            }
+        }
+    }
+    keys() {
+        return (0, iterable_operator_1.map)(this.entries(), ([key]) => key);
+    }
+    values() {
+        return (0, iterable_operator_1.map)(this.entries(), ([, value]) => value);
+    }
+    set(key, value) {
+        set((0, iterable_operator_1.toArray)(key), value, this.root);
+        return this;
+        function set(key, value, node) {
+            const commonPrefix = findCommonPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(commonPrefix)) {
+                const { prefix, commonPartLength } = commonPrefix;
+                if (prefix.length === commonPartLength) {
+                    const prefixNode = node.children.get(prefix);
+                    if (key.length === prefix.length) {
+                        prefixNode.value = value;
+                    }
+                    else {
+                        const newKey = key.slice(prefix.length);
+                        set(newKey, value, prefixNode);
+                    }
+                }
+                else {
+                    const oldPrefixNode = node.children.get(prefix);
+                    const commonPrefix = prefix.slice(0, commonPartLength);
+                    const newPrefixNode = new TreeNode();
+                    node.children.set(commonPrefix, newPrefixNode);
+                    newPrefixNode.children.set(prefix.slice(commonPartLength), oldPrefixNode);
+                    newPrefixNode.children.set(key.slice(commonPartLength), new TreeNode(value));
+                    node.children.delete(prefix);
+                }
+            }
+            else {
+                node.children.set(key, new TreeNode(value));
+            }
+        }
+    }
+    has(key) {
+        return has((0, iterable_operator_1.toArray)(key), this.root);
+        function has(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                const restKey = key.slice(matchedPrefix.length);
+                if (restKey.length === 0) {
+                    return true;
+                }
+                else {
+                    return has(restKey, node.children.get(matchedPrefix));
+                }
+            }
+            else {
+                return false;
+            }
+        }
+    }
+    get(key) {
+        return get((0, iterable_operator_1.toArray)(key), this.root);
+        function get(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                const restKey = key.slice(matchedPrefix.length);
+                const nextNode = node.children.get(matchedPrefix);
+                if (restKey.length === 0) {
+                    return nextNode.value;
+                }
+                else {
+                    return get(restKey, nextNode);
+                }
+            }
+            else {
+                return undefined;
+            }
+        }
+    }
+    delete(key) {
+        return _delete((0, iterable_operator_1.toArray)(key), this.root);
+        function _delete(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                if (key.length === matchedPrefix.length) {
+                    const targetNode = node.children.get(matchedPrefix);
+                    if (targetNode.children.size === 0) {
+                        node.children.delete(matchedPrefix);
+                    }
+                    else {
+                        delete node.value;
+                        if (targetNode.children.size === 1) {
+                            const [key, value] = (0, iterable_operator_1.first)(targetNode.children.entries());
+                            node.children.set([...matchedPrefix, ...key], value);
+                            node.children.delete(matchedPrefix);
+                        }
+                    }
+                    return true;
+                }
+                else {
+                    const nextNode = node.children.get(matchedPrefix);
+                    const nextKey = key.slice(matchedPrefix.length);
+                    const deleted = _delete(nextKey, nextNode);
+                    if (deleted) {
+                        if (!('value' in nextNode)) {
+                            switch (nextNode.children.size) {
+                                case 0: {
+                                    node.children.delete(matchedPrefix);
+                                    break;
+                                }
+                                case 1: {
+                                    const [key, value] = (0, iterable_operator_1.first)(nextNode.children.entries());
+                                    node.children.set([...matchedPrefix, ...key], value);
+                                    node.children.delete(matchedPrefix);
+                                    break;
+                                }
+                                default: {
+                                    const entries = (0, iterable_operator_1.toArray)(nextNode.children.entries());
+                                    const keys = entries.map(([key]) => key);
+                                    const commonPrefix = getCommonPrefix(keys);
+                                    if (commonPrefix) {
+                                        const newPrefix = [...matchedPrefix, ...commonPrefix];
+                                        const childNode = new TreeNode();
+                                        for (const [key, value] of entries) {
+                                            childNode.children.set(key.slice(commonPrefix.length), value);
+                                        }
+                                        node.children.set(newPrefix, childNode);
+                                        node.children.delete(matchedPrefix);
+                                    }
+                                }
+                            }
+                        }
+                        return true;
+                    }
+                    else {
+                        return false;
+                    }
+                }
+            }
+            else {
+                return false;
+            }
+        }
+    }
+}
+exports.RadixTree = RadixTree;
+function matchPrefix(prefixes, path) {
+    return (0, iterable_operator_1.find)(prefixes, prefix => path[0] === prefix[0]);
+}
+exports.matchPrefix = matchPrefix;
+function findCommonPrefix(prefixes, path) {
+    for (const prefix of prefixes) {
+        let commonPartLength = 0;
+        for (let i = 0; i < prefix.length; i++) {
+            if (path[i] === prefix[i]) {
+                commonPartLength++;
+            }
+            else {
+                if (commonPartLength > 0) {
+                    return { prefix, commonPartLength };
+                }
+            }
+        }
+        if (commonPartLength > 0) {
+            return { prefix, commonPartLength };
+        }
+    }
+}
+exports.findCommonPrefix = findCommonPrefix;
+function getCommonPrefix(paths) {
+    if (paths.length > 0) {
+        const commonPrefix = [];
+        loop: for (let elementIndex = 0, firstPathLength = paths[0].length; elementIndex < firstPathLength; elementIndex++) {
+            const element = paths[0][elementIndex];
+            for (let pathIndex = 1; pathIndex < paths.length; pathIndex++) {
+                const path = paths[pathIndex];
+                if (elementIndex < path.length) {
+                    if (path[elementIndex] !== element) {
+                        break loop;
+                    }
+                }
+                else {
+                    break loop;
+                }
+            }
+            commonPrefix.push(element);
+        }
+        return commonPrefix;
+    }
+    else {
+        return [];
+    }
+}
+exports.getCommonPrefix = getCommonPrefix;
+//# sourceMappingURL=radix-tree.js.map

package/lib/es2015/radix-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"radix-tree.js","sourceRoot":"","sources":["../../src/radix-tree.ts"],"names":[],"mappings":";;;AAAA,yDAA6D;AAC7D,6CAA2C;AAE3C,MAAM,QAAQ;IAGZ,YAAmB,KAAS;QAAT,UAAK,GAAL,KAAK,CAAI;QAF5B,aAAQ,GAAG,IAAI,GAAG,EAAuB,CAAA;IAEV,CAAC;CACjC;AAED,MAAa,SAAS;IAAtB;QACU,SAAI,GAAG,IAAI,QAAQ,EAAQ,CAAA;IAyLrC,CAAC;IAvLC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,OAAO;QACL,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAEzB,QAAQ,CAAC,CAAC,GAAG,CACX,IAAoB,EACpB,IAAS;YAET,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC/C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC,CAAA;gBACpC,IAAI,IAAA,2BAAa,EAAC,SAAS,CAAC,KAAK,CAAC,EAAE;oBAClC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;iBACjC;gBAED,KAAK,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;aAC/B;QACH,CAAC;IACH,CAAC;IAED,IAAI;QACF,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;IAC5C,CAAC;IAED,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QACnC,OAAO,IAAI,CAAA;QAEX,SAAS,GAAG,CAAC,GAAQ,EAAE,KAAQ,EAAE,IAAoB;YACnD,MAAM,YAAY,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAChE,IAAI,IAAA,2BAAa,EAAC,YAAY,CAAC,EAAE;gBAC/B,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,GAAG,YAAY,CAAA;gBACjD,IAAI,MAAM,CAAC,MAAM,KAAK,gBAAgB,EAAE;oBAEtC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;oBAE7C,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE;wBAEhC,UAAU,CAAC,KAAK,GAAG,KAAK,CAAA;qBACzB;yBAAM;wBAEL,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;wBACvC,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAA;qBAC/B;iBACF;qBAAM;oBAGL,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;oBAChD,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAA;oBACtD,MAAM,aAAa,GAAG,IAAI,QAAQ,EAAQ,CAAA;oBAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,aAAa,CAAC,CAAA;oBAC9C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,aAAa,CAAC,CAAA;oBACzE,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,IAAI,QAAQ,CAAO,KAAK,CAAC,CAAC,CAAA;oBAClF,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;iBAC7B;aACF;iBAAM;gBACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;aAC5C;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnC,SAAS,GAAG,CAAC,GAAQ,EAAE,IAAoB;YACzC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;gBAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;oBACxB,OAAO,IAAI,CAAA;iBACZ;qBAAM;oBACL,OAAO,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC,CAAA;iBACvD;aACF;iBAAM;gBACL,OAAO,KAAK,CAAA;aACb;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnC,SAAS,GAAG,CAAC,GAAQ,EAAE,IAAoB;YACzC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;gBAClD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;oBACxB,OAAO,QAAQ,CAAC,KAAK,CAAA;iBACtB;qBAAM;oBACL,OAAO,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;iBAC9B;aACF;iBAAM;gBACL,OAAO,SAAS,CAAA;aACjB;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,OAAO,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEvC,SAAS,OAAO,CAAC,GAAQ,EAAE,IAAoB;YAC7C,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,IAAI,GAAG,CAAC,MAAM,KAAK,aAAa,CAAC,MAAM,EAAE;oBAEvC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;oBACpD,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;wBAGlC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;qBACpC;yBAAM;wBAEL,OAAO,IAAI,CAAC,KAAK,CAAA;wBACjB,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;4BAGlC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAA,yBAAK,EAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAE,CAAA;4BAC1D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;4BACpD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;yBACpC;qBACF;oBACD,OAAO,IAAI,CAAA;iBACZ;qBAAM;oBAEL,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;oBAClD,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;oBAC/C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;oBAC1C,IAAI,OAAO,EAAE;wBAEX,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC,EAAE;4BAE1B,QAAQ,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE;gCAC9B,KAAK,CAAC,CAAC,CAAC;oCAEN,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;oCACnC,MAAK;iCACN;gCACD,KAAK,CAAC,CAAC,CAAC;oCAIN,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAA,yBAAK,EAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAE,CAAA;oCACxD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;oCACpD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;oCACnC,MAAK;iCACN;gCACD,OAAO,CAAC,CAAC;oCAIP,MAAM,OAAO,GAAG,IAAA,2BAAO,EAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAA;oCACpD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;oCACxC,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,CAAA;oCAC1C,IAAI,YAAY,EAAE;wCAChB,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,YAAY,CAAC,CAAA;wCACrD,MAAM,SAAS,GAAG,IAAI,QAAQ,EAAQ,CAAA;wCACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE;4CAClC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAA;yCAC9D;wCACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;wCACvC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;qCACpC;iCACF;6BACF;yBACF;wBACD,OAAO,IAAI,CAAA;qBACZ;yBAAM;wBAEL,OAAO,KAAK,CAAA;qBACb;iBACF;aACF;iBAAM;gBACL,OAAO,KAAK,CAAA;aACb;QACH,CAAC;IACH,CAAC;CACF;AA1LD,8BA0LC;AAOD,SAAgB,WAAW,CAAI,QAAuB,EAAE,IAAS;IAC/D,OAAO,IAAA,wBAAI,EAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AACxD,CAAC;AAFD,kCAEC;AAOD,SAAgB,gBAAgB,CAAI,QAAuB,EAAE,IAAS;IAIpE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;QAC7B,IAAI,gBAAgB,GAAG,CAAC,CAAA;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE;gBACzB,gBAAgB,EAAE,CAAA;aACnB;iBAAM;gBACL,IAAI,gBAAgB,GAAG,CAAC,EAAE;oBACxB,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAA;iBACpC;aACF;SACF;QACD,IAAI,gBAAgB,GAAG,CAAC,EAAE;YACxB,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAA;SACpC;KACF;AACH,CAAC;AAnBD,4CAmBC;AAMD,SAAgB,eAAe,CAAI,KAAY;IAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QACpB,MAAM,YAAY,GAAQ,EAAE,CAAA;QAE5B,IAAI,EAAE,KACJ,IAAI,YAAY,GAAG,CAAC,EAAE,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EACvD,YAAY,GAAG,eAAe,EAC9B,YAAY,EAAE,EACd;YACA,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;YACtC,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE;gBAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAA;gBAC7B,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE;oBAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,OAAO,EAAE;wBAClC,MAAM,IAAI,CAAA;qBACX;iBACF;qBAAM;oBACL,MAAM,IAAI,CAAA;iBACX;aACF;YACD,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SAC3B;QAED,OAAO,YAAY,CAAA;KACpB;SAAM;QACL,OAAO,EAAE,CAAA;KACV;AACH,CAAC;AA3BD,0CA2BC"}

package/lib/es2015/string-radix-tree.d.ts

@@ -0,0 +1,17 @@
+export declare class StringRadixTree<T> {
+    private root;
+    get [Symbol.toStringTag](): string;
+    entries(): IterableIterator<[key: string, value: T]>;
+    keys(): IterableIterator<string>;
+    values(): IterableIterator<T>;
+    set(key: string, value: T): this;
+    has(key: string): boolean;
+    get(key: string): T | undefined;
+    delete(key: string): boolean;
+}
+export declare function matchPrefix(prefixes: Iterable<string>, path: string): string | undefined;
+export declare function findCommonPrefix(prefixes: Iterable<string>, path: string): {
+    prefix: string;
+    commonPartLength: number;
+} | undefined;
+export declare function getCommonPrefix(paths: string[]): string;

package/lib/es2015/string-radix-tree.js

@@ -0,0 +1,221 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getCommonPrefix = exports.findCommonPrefix = exports.matchPrefix = exports.StringRadixTree = void 0;
+const iterable_operator_1 = require("iterable-operator");
+const extra_utils_1 = require("extra-utils");
+class TreeNode {
+    constructor(value) {
+        this.value = value;
+        this.children = new Map();
+    }
+}
+class StringRadixTree {
+    constructor() {
+        this.root = new TreeNode();
+    }
+    get [Symbol.toStringTag]() {
+        return this.constructor.name;
+    }
+    entries() {
+        return dfs(this.root, '');
+        function* dfs(node, path) {
+            for (const [prefix, childNode] of node.children) {
+                const newPath = path + prefix;
+                if ((0, extra_utils_1.isntUndefined)(childNode.value)) {
+                    yield [newPath, childNode.value];
+                }
+                yield* dfs(childNode, newPath);
+            }
+        }
+    }
+    keys() {
+        return (0, iterable_operator_1.map)(this.entries(), ([key]) => key);
+    }
+    values() {
+        return (0, iterable_operator_1.map)(this.entries(), ([, value]) => value);
+    }
+    set(key, value) {
+        set(key, value, this.root);
+        return this;
+        function set(key, value, node) {
+            const commonPrefix = findCommonPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(commonPrefix)) {
+                const { prefix, commonPartLength } = commonPrefix;
+                if (prefix.length === commonPartLength) {
+                    const prefixNode = node.children.get(prefix);
+                    if (key.length === prefix.length) {
+                        prefixNode.value = value;
+                    }
+                    else {
+                        const newKey = key.slice(prefix.length);
+                        set(newKey, value, prefixNode);
+                    }
+                }
+                else {
+                    const oldPrefixNode = node.children.get(prefix);
+                    const commonPrefix = prefix.slice(0, commonPartLength);
+                    const newPrefixNode = new TreeNode();
+                    node.children.set(commonPrefix, newPrefixNode);
+                    newPrefixNode.children.set(prefix.slice(commonPartLength), oldPrefixNode);
+                    newPrefixNode.children.set(key.slice(commonPartLength), new TreeNode(value));
+                    node.children.delete(prefix);
+                }
+            }
+            else {
+                node.children.set(key, new TreeNode(value));
+            }
+        }
+    }
+    has(key) {
+        return has(key, this.root);
+        function has(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                const restKey = key.slice(matchedPrefix.length);
+                if (restKey.length === 0) {
+                    return true;
+                }
+                else {
+                    return has(restKey, node.children.get(matchedPrefix));
+                }
+            }
+            else {
+                return false;
+            }
+        }
+    }
+    get(key) {
+        return get(key, this.root);
+        function get(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                const restKey = key.slice(matchedPrefix.length);
+                const nextNode = node.children.get(matchedPrefix);
+                if (restKey.length === 0) {
+                    return nextNode.value;
+                }
+                else {
+                    return get(restKey, nextNode);
+                }
+            }
+            else {
+                return undefined;
+            }
+        }
+    }
+    delete(key) {
+        return _delete(key, this.root);
+        function _delete(key, node) {
+            const matchedPrefix = matchPrefix(node.children.keys(), key);
+            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
+                if (key.length === matchedPrefix.length) {
+                    const targetNode = node.children.get(matchedPrefix);
+                    if (targetNode.children.size === 0) {
+                        node.children.delete(matchedPrefix);
+                    }
+                    else {
+                        delete node.value;
+                        if (targetNode.children.size === 1) {
+                            const [key, value] = (0, iterable_operator_1.first)(targetNode.children.entries());
+                            node.children.set(matchedPrefix + key, value);
+                            node.children.delete(matchedPrefix);
+                        }
+                    }
+                    return true;
+                }
+                else {
+                    const nextNode = node.children.get(matchedPrefix);
+                    const nextKey = key.slice(matchedPrefix.length);
+                    const deleted = _delete(nextKey, nextNode);
+                    if (deleted) {
+                        if (!('value' in nextNode)) {
+                            switch (nextNode.children.size) {
+                                case 0: {
+                                    node.children.delete(matchedPrefix);
+                                    break;
+                                }
+                                case 1: {
+                                    const [key, value] = (0, iterable_operator_1.first)(nextNode.children.entries());
+                                    node.children.set(matchedPrefix + key, value);
+                                    node.children.delete(matchedPrefix);
+                                    break;
+                                }
+                                default: {
+                                    const entries = (0, iterable_operator_1.toArray)(nextNode.children.entries());
+                                    const keys = entries.map(([key]) => key);
+                                    const commonPrefix = getCommonPrefix(keys);
+                                    if (commonPrefix) {
+                                        const newPrefix = matchedPrefix + commonPrefix;
+                                        const childNode = new TreeNode();
+                                        for (const [key, value] of entries) {
+                                            childNode.children.set(key.slice(commonPrefix.length), value);
+                                        }
+                                        node.children.set(newPrefix, childNode);
+                                        node.children.delete(matchedPrefix);
+                                    }
+                                }
+                            }
+                        }
+                        return true;
+                    }
+                    else {
+                        return false;
+                    }
+                }
+            }
+            else {
+                return false;
+            }
+        }
+    }
+}
+exports.StringRadixTree = StringRadixTree;
+function matchPrefix(prefixes, path) {
+    return (0, iterable_operator_1.find)(prefixes, prefix => path.startsWith(prefix));
+}
+exports.matchPrefix = matchPrefix;
+function findCommonPrefix(prefixes, path) {
+    for (const prefix of prefixes) {
+        let commonPartLength = 0;
+        for (let i = 0; i < prefix.length; i++) {
+            if (path[i] === prefix[i]) {
+                commonPartLength++;
+            }
+            else {
+                if (commonPartLength > 0) {
+                    return { prefix, commonPartLength };
+                }
+            }
+        }
+        if (commonPartLength > 0) {
+            return { prefix, commonPartLength };
+        }
+    }
+}
+exports.findCommonPrefix = findCommonPrefix;
+function getCommonPrefix(paths) {
+    if (paths.length > 0) {
+        const commonPrefix = [];
+        loop: for (let charIndex = 0, firstPathLength = paths[0].length; charIndex < firstPathLength; charIndex++) {
+            const char = paths[0][charIndex];
+            for (let pathIndex = 1; pathIndex < paths.length; pathIndex++) {
+                const path = paths[pathIndex];
+                if (charIndex < path.length) {
+                    if (path[charIndex] !== char) {
+                        break loop;
+                    }
+                }
+                else {
+                    break loop;
+                }
+            }
+            commonPrefix.push(char);
+        }
+        return commonPrefix.join('');
+    }
+    else {
+        return '';
+    }
+}
+exports.getCommonPrefix = getCommonPrefix;
+//# sourceMappingURL=string-radix-tree.js.map