@kamilmielnik/trie
Version:
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
10 lines (9 loc) • 328 B
TypeScript
import type { Node } from '../types';
/**
* Tells you whether given word is in the {@link Node}.
*
* @param node - {@link Node} to look for word in.
* @param word - Word to be found.
* @returns true if given word is in the {@link Node}, false otherwise.
*/
export declare const has: (node: Node, word: string) => boolean;