191 packages found
Immutable Data Collections
Immutable Data Collections
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
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
JS实现的数据结构与一些常用算法
Collection of data structures(LinkedList, DoubleLinkedList, Stack, Queue, Dictionary and etc...) for TypeScript.
kind of like lodash but works with Immutable
NoSQL Everywhere
A looped array that can return 'window':arr of defined size.
Tree data structure using Backbone Model and Collection
DataViewStructure is a class that helps fishing binary data structures out of a DataView
Immutable Data Collections
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).
Like Lego For Databases
Immutable structurally typed data
Finger Tree data structure
Immutable Data Collections
Immutable Data Collections
Immutable Data Collections
Immutable Data Collections