@kamilmielnik/trie
Version:
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
10 lines (9 loc) • 449 B
TypeScript
import type { Descendant, Node, TraverseOptions } from '../types';
/**
* Finds all {@link Descendant | descendants} of given {@link Node} and returns them as an array.
*
* @param node - {@link Node} to look for {@link Descendant | descendants} in.
* @param options - See {@link TraverseOptions}.
* @returns An array of {@link Descendant | descendants}.
*/
export declare const toArray: (node: Node, options?: TraverseOptions) => Descendant[];