Trie

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

FormData.entries ponyfill

Logformatter for logentries

Customizable trie data structure built in JavaScript.

Generate regular expressions that match a set of strings

Countries, states/regions, cities.

The easiest way to get up and running in your app using trieve search.

SAML 2.0 node helpers

Externalizes references to Object.entries

`Object.values(obj)` -> `Object.keys(obj).map(key => obj[key])`

Minimalistic trie implementation for autosuggest and autocomplete components.

Family for all Identity Verification related APIs

The extremely fast compressed trie implementation.

A simple NPM package to get capitals, currency, native language, famous_for etc. of all the countries in the world

TypeScript definitions for trie-prefix-tree

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

Trie Data Structure reader for cspell

compressed-trie data-structure

Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max

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

A compact trie for mapping keys to values

TypeScript definitions for autosuggest-trie

HTTP router for Node.js based on a prefix tree

Implementation of verkle trees as used in Ethereum.

Lightweight Path Trie for TypeScript and JavaScript

Observable Path Trie Store

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

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

Fast prefix operations for strings of digits

A JavaScript port of Data.Trie

get trie position list { position: keyword[] }

An efficient immutable ordered sequence of elements akin to a Vector

A router for Node.js based on a prefix tree

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

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

production-ready data structures implementation in javascript & typescript.

Binary Merkle Tree operations on data

A library for quick insert and retrieval of JavaScript objects, keyed by prefix strings.

TypeScript library providing a trie (prefix tree) datastructure.

Minimal trie datastructure representation

JS Trie / DAWG classes

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

The trie from node-autocompleter in a form that can be used in browser

Customizable trie data structure built in JavaScript.

Trie-routing for Koa

A trie implementation for NodeJS