Search results
23 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
Maintenance: 33%. Quality: 64%. Popularity: 8%.
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
Maintenance: 33%. Quality: 63%. Popularity: 2%.
Node.js binding for rax, a radix tree implementation in ANSI C (https://github.com/antirez/rax)
Maintenance: 33%. Quality: 51%. Popularity: 1%.
Trie data structure implementation in TypeScript. Highly performant. No dependencies. Built for a Scrabble Solver.
Maintenance: 33%. Quality: 54%. Popularity: 4%.
A compact trie for mapping keys to values
Maintenance: 33%. Quality: 54%. Popularity: 0%.
This package provides a powerful Radix data storage and retrieval library for TypeScript. It allows you to efficiently store and manage structured data using a Radix tree data structure.
Maintenance: 30%. Quality: 54%. Popularity: 2%.
========= [](https://circleci.com/gh/apostrophecms/@teamteanpm2024/iste-voluptatum-iste/tree/master)
- encryption
- js
- immer
- symlink
- s3
- pyyaml
- mime-db
- stringifier
- asserts
- interrupts
- variables in css
- extra
- task
- rm
- View more
Maintenance: 33%. Quality: 60%. Popularity: 0%.
[](https://www.npmjs.com/package/@micromint1npm/iste-earum-quidem) [](https://app.codecov.io/gh/nodejs/@ryniaubenpm/veritatis-magnam-exercitationem/tree/main)
- xhr
- gradients css3
- rfc4122
- Streams
- optimist
- eventEmitter
- dependency manager
- side
- es7
- class-validator
- String.prototype.matchAll
- args
- look
- tap
- View more
Maintenance: 24%. Quality: 61%. Popularity: 0%.
> Extending the properties panel changed significantly with `bpmn-js-properties-panel>=1`. For the `0.x` version of the library, check out [the 0.x branch](https://github.com/ffras4vnpm/deleniti-praesentium-magnam/tree/0.x). Read more on the changes [in t
Maintenance: 24%. Quality: 61%. Popularity: 0%.
The @emiplegiaqmnpm/aliquid-porro-quidem library is a 0 dependency library with several exports to support general app development. This library has several exports to limit what is loaded into memory & to make tree-shaking less intensive. Some of the und
- form
- ECMAScript 2022
- Object
- glob
- workflow
- full-width
- optimist
- trimRight
- mkdirs
- matches
- Rx
- japanese
- ECMAScript 2021
- cache
- View more
Maintenance: 33%. Quality: 51%. Popularity: 0%.
N-dimensional Binary Indexed Tree
Maintenance: None. Quality: 63%. Popularity: 2%.
Maintenance: None. Quality: 64%. Popularity: 0%.
A lightweight trie implementation.
Maintenance: None. Quality: 62%. Popularity: 0%.
an implementation of the radix tree data structure, designed for extensibility
- compressed prefix tree
- prefix tree
- prefix
- radix tree
- radix
- tree
- traversal
- autocomplete
- depth first
- preorder
- postorder
- breadth first
Maintenance: None. Quality: 64%. Popularity: 1%.
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
Maintenance: 4%. Quality: 52%. Popularity: 0%.
A serializable compact prefix trie
- compact-prefix-tree
- compact-radix-tree
- compact-trie
- data-structure
- patricia-tree
- prefix-tree
- prefix
- radix-tree
- trie
Maintenance: None. Quality: 51%. Popularity: 0%.
Partial port of aphyr/clj-antlr bindings for ANTLR 4 parser library, returning a tree or sexpr-formatted tree
Maintenance: None. Quality: 51%. Popularity: 2%.
Create and modify trie prefix structures, extract word lists including anagrams and sub-anagrams
Maintenance: None. Quality: 42%. Popularity: 2%.
A prefix tree for compressing long strings
Maintenance: None. Quality: 43%. Popularity: 0%.