File Explorer

1"use strict";2/*3 * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.4 * SPDX-License-Identifier: Apache-2.0.5 */6var __values = (this && this.__values) || function(o) {7    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;8    if (m) return m.call(o);9    if (o && typeof o.length === "number") return {10        next: function () {11            if (o && i >= o.length) o = void 0;12            return { value: o && o[i++], done: !o };13        }14    };15    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");16};17Object.defineProperty(exports, "__esModule", { value: true });18exports.Trie = exports.TrieOp = exports.Node = void 0;19/** @internal */20var Node = /** @class */ (function () {21    function Node(key, value, children) {22        if (children === void 0) { children = new Map(); }23        this.key = key;24        this.value = value;25        this.children = children;26    }27    return Node;28}());29exports.Node = Node;30/** @internal */31var TrieOp;32(function (TrieOp) {33    TrieOp[TrieOp["Insert"] = 0] = "Insert";34    TrieOp[TrieOp["Delete"] = 1] = "Delete";35    TrieOp[TrieOp["Find"] = 2] = "Find";36})(TrieOp = exports.TrieOp || (exports.TrieOp = {}));37;38/** @internal */39var Trie = /** @class */ (function () {40    function Trie(split) {41        this.root = new Node();42        if (typeof (split) === 'string') {43            var delimeter_1 = split;44            split = function (key) {45                return key.split(delimeter_1);46            };47        }48        this.split_key = split;49    }50    Trie.prototype.find_node = function (key, op) {51        var e_1, _a;52        var parts = this.split_key(key);53        var current = this.root;54        var parent = undefined;55        try {56            for (var parts_1 = __values(parts), parts_1_1 = parts_1.next(); !parts_1_1.done; parts_1_1 = parts_1.next()) {57                var part = parts_1_1.value;58                var child = current.children.get(part);59                if (!child) {60                    if (op == TrieOp.Insert) {61                        current.children.set(part, child = new Node(part));62                    }63                    else {64                        return undefined;65                    }66                }67                parent = current;68                current = child;69            }70        }71        catch (e_1_1) { e_1 = { error: e_1_1 }; }72        finally {73            try {74                if (parts_1_1 && !parts_1_1.done && (_a = parts_1.return)) _a.call(parts_1);75            }76            finally { if (e_1) throw e_1.error; }77        }78        if (parent && op == TrieOp.Delete) {79            parent.children.delete(current.key);80        }81        return current;82    };83    Trie.prototype.insert = function (key, value) {84        var node = this.find_node(key, TrieOp.Insert);85        node.value = value;86    };87    Trie.prototype.remove = function (key) {88        this.find_node(key, TrieOp.Delete);89    };90    Trie.prototype.find = function (key) {91        var node = this.find_node(key, TrieOp.Find);92        return node ? node.value : undefined;93    };94    return Trie;95}());96exports.Trie = Trie;97//# sourceMappingURL=trie.js.map