Search results
79 packages found
Rope-based persistent sequence type
A fully persistent balanced binary search tree
A comprehensive indexing solution built to cater to a wide variety of indexing requirements.
- database
- indexing
- search
- query
- key-value
- NoSQL
- storage
- OOP
- design patterns
- SOLID
- asynchronous
- fast-lookup
- big-data
- data-structure
- View more
Simple key-value storage directly on file system, maps each key to a separate file.
   or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
- flag
- move
- babel
- callbind
- Push
- defineProperty
- phone
- command
- stateless
- RegExp.prototype.flags
- typedarray
- String.prototype.trim
- call-bind
- negative
- View more
Like a stack, the queue is a linear data structure that stores items in either a First In First Out (FIFO) or Last In First Out (LIFO) manner. With FIFO, the least recently added item is removed first, while with LIFO, the most recently added item is remo
Rope-based persistent sequence type
JS implementation of persistent bit-partitioned vector trie a.k.a vector data structure in Clojure
A fully persistent balanced binary search tree. Typed version
A fully persistent balanced binary search tree
Fork of HAMT that adds transient mutation and support for custom key types
          ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/
- sort
- traverse
- inspect
- transpiler
- ECMAScript 2021
- Array.prototype.findLastIndex
- ie
- package manager
- queueMicrotask
- set
- concat
- electron
- logging
- private
- View more