@wry/trie

What is @wry/trie?

The @wry/trie package is a library for creating and manipulating trie data structures in JavaScript. A trie, also known as a prefix tree, is a type of search tree that is used to store a dynamic set or associative array where the keys are usually strings. It is particularly useful for tasks like autocomplete, spell checking, and prefix matching.

What are @wry/trie's main functionalities?

Creating a Trie

This feature allows you to create a new Trie instance and insert strings into it. You can then find all strings that start with a given prefix.

{"import { Trie } from '@wry/trie';

const trie = new Trie();
trie.insert('hello');
trie.insert('world');
trie.insert('help');

console.log(trie.find('hel')); // ['hello', 'help']
console.log(trie.find('world')); // ['world']"}

Checking for Existence

This feature allows you to check if a particular string exists in the trie.

{"import { Trie } from '@wry/trie';

const trie = new Trie();
trie.insert('hello');
trie.insert('world');

console.log(trie.has('hello')); // true
console.log(trie.has('bye')); // false"}

Removing Entries

This feature allows you to remove entries from the trie.

{"import { Trie } from '@wry/trie';

const trie = new Trie();
trie.insert('hello');
trie.insert('world');
trie.remove('hello');

console.log(trie.has('hello')); // false
console.log(trie.has('world')); // true"}

Other packages similar to @wry/trie

trie-search

The trie-search package is another implementation of a trie data structure for JavaScript. It offers similar functionalities for adding and searching words in a trie. It also allows for customizing the key on which the trie is built and supports wildcard searches.

ternary-search-trie

This package implements a ternary search trie, which is a type of trie that can have better performance for certain datasets or use cases. It is similar to @wry/trie in that it is used for storing strings and performing prefix searches, but the underlying data structure and performance characteristics may differ.

README

@wry/trie

A trie data structure that holds object keys weakly, yet can also hold non-object keys, unlike WeakMap.