@kamilmielnik/trie/build/lib/remove.js

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.remove = void 0;
/**
 * Removes given word from given {@link Node} if it exists.
 *
 * @param node - {@link Node} to remove word from.
 * @param word - Word to be removed.
 * @returns true if the word was removed, false otherwise.
 */
const remove = (node, word) => {
    if (word.length === 0) {
        if (node.wordEnd) {
            delete node.wordEnd;
            return true;
        }
        return false;
    }
    const letter = word[0];
    const nextNode = node[letter];
    if (!nextNode) {
        return false;
    }
    const removed = (0, exports.remove)(nextNode, word.substring(1));
    if (!removed) {
        return false;
    }
    if (Object.keys(nextNode).length === 0) {
        delete node[letter];
    }
    return true;
};
exports.remove = remove;