183 packages found
Immutable Data Collections
NoSQL Everywhere
kind of like lodash but works with Immutable
Tree data structure using Backbone Model and Collection
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
- bloom
- filter
- bloom filter
- probabilistic
- datastructure
- partitionned bloom filter
- scalable bloom filter
- counting bloom filter
- invertible bloom filter
- count min sketch
- cuckoo
- xor
- minhash
- top-k
This package can be used for creating a tree datastructure where a node can possess as many nodes as possible. This is a simple tree structure with only basics functions (getChilds/getParent).
Collection of data structures(LinkedList, DoubleLinkedList, Stack, Queue, Dictionary and etc...) for TypeScript.
Like Lego For Databases
Finger Tree data structure
Persistent AAtree datastructure
Immutable Data Collections
Immutable Data Collections
Immutable Data Collections
Immutable Data Collections
Sized balanced tree implementation in javascript
Immutable structurally typed data
Immutable Data Collections (v3.8.1)
Immutable Data Collections
Singly linked, doubly linked, and circular LinkedList
- adt
- abstract-data-type
- linkedlist
- linked-list
- list
- doubly-linked-list
- double-linked-list
- circular-linked-list
- circular-doubly-linked-list
- datastructure
- data-structure
HashMap that supports using one or more keys of any type.