mafintosh / sparse-bitfield
Bitfield that allocates a series of small buffers to support sparse bits without allocating a massive buffer
☆26Updated 3 years ago
Alternatives and similar repositories for sparse-bitfield
Users that are interested in sparse-bitfield are comparing it to the libraries listed below
Sorting:
- On-disk variable sized chunk store☆22Updated 9 years ago
- Model a tree structure on top off an append-only log.☆53Updated 6 years ago
- Low level bit encoder for buffers☆16Updated 8 years ago
- Calculate the xor distance between two buffers as a new buffer and compare computed distances with eachother☆38Updated 4 years ago
- A pure js implementation of Rabin fingerprinting (aka. content defind chunking)☆13Updated 8 years ago
- Distributed reduce on top of hypercore☆17Updated 8 years ago
- Join the p2p swarm for a given hyperdrive archive.☆25Updated 8 years ago
- Test and report p2p connectivity on the current network☆30Updated 3 years ago
- Generate v4 UUIDs using libsodium's RNG☆11Updated 4 years ago
- ☆7Updated 8 years ago
- An abstract-random-access backend that writes to fixed size page files instead of a single file. Useful for sparse data.☆20Updated 8 years ago
- Binary serialization of arbitrarily complex structures that sort element-wise☆8Updated 7 years ago
- Base class for random access stores☆30Updated 7 years ago
- Elect a leader using unix sockets, for node☆20Updated 6 years ago
- Small program that lists all the changes in a dat [ DEPRECATED - More info on active projects and modules at https://dat-ecosystem.org/ ]…☆22Updated 3 years ago
- Live & persistent stats module for hyperdrive.☆12Updated 8 years ago
- Command line tool to serve hyperdrives over http☆19Updated 8 years ago
- Distributed map and filter☆33Updated 8 years ago
- hyperfused client for node☆21Updated 9 years ago
- Tests for pull streams☆9Updated 8 years ago
- Resolve a dependency graph for buffer creation☆15Updated 7 years ago
- A couple of functions that make it easy to maintain an unordered set as an array in an efficient way☆22Updated 6 years ago
- A simple batching function that allows you to atomically batch a series of operations.☆33Updated 7 years ago
- A run-length-encoder that compresses bitfields.☆15Updated 6 years ago
- Borough☆9Updated 8 years ago
- Content addressable graph where every node has at most a single link to another node☆20Updated 9 years ago
- Data structure that maps entries to numeric ids☆14Updated 9 years ago
- Vanity ed25519 public keys, through Huffman Codes☆12Updated 8 years ago
- Clone a website and share with dat (currently outdated).☆12Updated 8 years ago
- Superseded by abstract-level. Error types for levelup.☆13Updated 4 months ago