Search results
91 packages found
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
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
Performs fast search and replace on a text based on a set of rules.
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
A trie implementation that maps keys to objects for rapid retrieval by phrases. Most common use will be for typeahead searches.
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
- data
- structure
- structures
- data structure
- datastructure
- data-structure
- data structures
- datastructures
- data-structures
- in data structures
- in data structure
- binary
- depth
- breadth
- View more
This package can be used to implement a Search-As-You-Type funtionality and uses a Trie data structure
Efficient data structures for every day programming
- graph
- heap
- linked list
- max heap
- max stack
- min heap
- min stack
- quick stack
- priority queue
- queue
- stack
- trie
- binary-search
Tiny search module based on trie and aho-corasick using TypeScript
- typescript
- aho-corasick
- trie
- search
- searching
- match
- matching
- word match
- word matching
- text search
- text searching
- serialze
- serializing
- serialization
An implementation of the Aho-Corasick algorithm in TypeScript.
Trie-based map data structure with prefix search/query support
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
A trie search algorithm in Typscript.
usingbytes-dsa is comprehensive JavaScript library for common data structures and algorithms. This library is designed to be both educational and practical, providing implementations of fundamental data structures and algorithms that can be used in a vari
- data-structures
- algorithms
- javascript
- list
- tree
- SinglylinkedList
- DoublyLinkedList
- OrderedSinglyLinkedList
- OrderedDoublyLinkedList
- CircularSinglyLinkedList
- CircularDoublyLinkedList
- BinarySearchTree
- AVLTree
- RedBlackTree
- View more
The extremely fast compressed trie implementation.
production-ready data structures implementation in javascript & typescript.
- data structures typescript
- es6 data structures
- javascript data structures
- data structures
- data structures javascript
- data structures js
- stack
- es6 stack
- queue
- es6 queue
- priority queue
- priorityqueue
- set
- linked list
- View more
A simple class for ternary search trie in Node.js™.
A flexible implementation of a trie (prefix tree) to let you efficiently find partial and complete matches of stored values. A trie is a tree-like data structure, also referred to as a prefix tree, that enables optimized searching for specific keys from a
The TRIE data structure and search algorithm, on top of leveldb.
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more
A trie implementation for NodeJS