Trie

APIs for EPCNext project

The api is responsible for upserting Loyalty Process Rules

Family for all Identity Verification related APIs

Holistic patient score related set of APIs

Sustainability Reference Data

This has files related to Public Sector APIs

Wire adapter for actionable list connect APIs

APIs for Tearsheets feature in FSC

i18n for ISO 3166-1 country codes

Minimalistic trie implementation for autosuggest and autocomplete components.

TypeScript definitions for autosuggest-trie

Generate regular expressions that match a set of strings

Create a regular expression from trie like object

The extremely fast compressed trie implementation.

A minimal and powerful trie based url path router for Node.js.

An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module

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

Implementation of verkle trees as used in Ethereum.

Customizable trie data structure built in JavaScript.

TypeScript definitions for trie-prefix-tree

A compact trie for mapping keys to values

Standard data structure

Trie Data Structure reader for cspell

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

compressed-trie data-structure

A node module with a simple trie data structure, support for insert and search functions

Trie generator.

A custom implementation of ethereumjs trie

Runtime code for unicode-trie files.

Fast prefix operations for strings of digits

Trie-based map data structure with prefix search/query support

Fast Trie for React Native

A fast weighted autocompleter

This is an implementation of the modified merkle patricia tree as specified in Ethereum's yellow paper, adapted for Polkadot

production-ready data structures implementation in javascript & typescript.

John Resig's trie implementation, prettified and packaged for npm

Customizable trie data structure built in JavaScript.

Create a regular expression to match any of the phrases added to the trie (inspired by Dan Kogai's Regexp::Trie Perl module.)

Composable trie based router

An efficient immutable ordered sequence of elements akin to a Vector

Performs fast search and replace on a text based on a set of rules.

ES Map/Set-compatible implementations with customizable equality semantics & supporting operations

A fast weighted auto-completion trie.

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

Implementation of verkle trees as used in Ethereum.

Implementation of binary trees as used in Ethereum.

Generates trie roots from key-value pairs

get trie position list { position: keyword[] }

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

A JavaScript port of Data.Trie