Results for trie-substring-search

Fast and tiny fuzzy-search utility

Minimalistic trie implementation for prefix searches

Unicode Trie data structure for fast character metadata lookup, ported from ICU

A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.

https://en.wikipedia.org/wiki/Trie

Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams

Trie Data Structure to support cspell.

Count the longest repeating streak of a substring

A simple trie structure to perform prefix search on texts in O(n) time, where n - number of characters in searched word. > Trie is a basic Tree structure, also known as [prefix tree](https://en.wikipedia.org/wiki/Trie) Super simple, Super fast, super comp

Curated collection of data structures for the JavaScript/TypeScript.

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

Crazy fast http radix based router

A memoization algorithm in which each function argument represents a new key, creating a trie of caches as defined by the array in your first argument.

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

JavaScript implementation of Double-Array trie

Implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper.

Strongly typed trie data structure for path and URL-like strings.

Trie and radix tree implementation tailored towards exact matches.

Trim a consecutively repeated substring: foo--bar---baz → foo-bar-baz

A fast, accurate and multilingual fuzzy search library.

Unicode-aware substring

Count how often a character (or substring) is used in a string

A tiny, efficient fuzzy matcher that doesn't suck

Radix trie module.