@kamilmielnik/trie
Version:
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
10 lines (9 loc) • 379 B
TypeScript
import type { Node } from '../types';
/**
* Finds {@link Node} representing given prefix in given {@link Node}.
*
* @param node - {@link Node} to look for prefix in.
* @param prefix - Prefix to be found.
* @returns {@link Node} representing a given prefix, undefined if there is no such node.
*/
export declare const find: (node: Node, prefix: string) => Node | undefined;