Trie

Customizable countries dropdown with flags, dial code, language and currency details developed in Angular.

Standard data structure

Seamlessly and efficiently use @popeindustries/lit-html-server rendered HTML to hydrate lit-html templates in the browser

An elegant TypeScript module to fetch information about countries from a comprehensive JSON data file.

FormData.entries ponyfill

Enable hydration of lit-element elements rendered on the server with @popeindustries/lit-html-server

A type-safe implementation of Object.entries

Convex component for retrying idempotent actions.

Seamlessly render lit templates and elements on the server and in the browser

Next.js redis cache handler

Packages all countries for front end developers

A custom implementation of ethereumjs trie

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

Create a regular expression from trie like object

Generate regular expressions that match a set of strings

The extremely fast compressed trie implementation.

Trie Data Structure reader for cspell

A compact trie for mapping keys to values

Customizable trie data structure built in JavaScript.

compressed-trie data-structure

A fast weighted autocompleter

TypeScript definitions for trie-prefix-tree

Runtime code for unicode-trie files.

Builder code for unicode tries

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

Fast prefix operations for strings of digits

Fast Trie for React Native

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

production-ready data structures implementation in javascript & typescript.

Composable trie based router

Trie generator.

Implementation of verkle trees as used in Ethereum.

Implementation of binary trees as used in Ethereum.

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

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

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

Trie-routing for Koa

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

An efficient immutable ordered sequence of elements akin to a Vector

A TypeScript library offering efficient standard (prefix) and compressed (radix) tries for optimized string storage and operations, featuring trie-map variants for key-value storage.

A Trie-based router

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

Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.

A JavaScript implementation of a Trie

Minimal trie datastructure representation

Customizable trie data structure built in JavaScript.

get trie position list { position: keyword[] }

A trie implementation for NodeJS

Trie-based ES6 Map clone: keys=iterables, values=anything