emilbayes / sodium-uuid
Generate v4 UUIDs using libsodium's RNG
☆11Updated 4 years ago
Alternatives and similar repositories for sodium-uuid:
Users that are interested in sodium-uuid are comparing it to the libraries listed below
- Generate a diff friendly string that is bounded by a configurable scroll box☆18Updated 7 years ago
- Run ps with all active lil-pids services☆9Updated 8 years ago
- Create a levelDB instance on your local machine☆12Updated 8 years ago
- Test harness for Javascript libsodium implementations☆8Updated last year
- read and write to a file in a cache-friendly way by using aligned blocks☆8Updated 4 years ago
- A random-access instance that wraps another instance that is created async☆6Updated 8 years ago
- Low level bit encoder for buffers☆16Updated 8 years ago
- Stream all of npm metadata into hypercore☆19Updated 8 years ago
- ☆6Updated 7 years ago
- make choo's events non-blocking ... ...☆13Updated 8 years ago
- Tests for pull streams☆9Updated 8 years ago
- A Dat Storage Provider for Google Drive☆9Updated 7 years ago
- ☆7Updated 8 years ago
- Compress an HTTP response if the client has headers that allow it☆11Updated 7 years ago
- ☆10Updated 4 years ago
- Stream a github event feed into a hypercore☆17Updated 8 years ago
- Efficient keypath subspaces with bytewise tuples☆14Updated 7 years ago
- unique client ids using monotonic incremental numbers with no upper bound.☆8Updated 8 years ago
- Transform native bindings to be relative to their file☆12Updated 8 years ago
- Live & persistent stats module for hyperdrive.☆12Updated 8 years ago
- Easily spin up a dht-rpc bootstrap node from the command line.☆7Updated 6 years ago
- A pullstream "webdriver" for interacting with changes to the dom.☆8Updated 8 years ago
- An alternative name for HyperDB☆14Updated 7 years ago
- Experimental quick-n-dirty file sharing tool on top of dat☆13Updated 8 years ago
- A pure js implementation of Rabin fingerprinting (aka. content defind chunking)☆13Updated 8 years ago
- Expand diffs that GitHub mistakenly hides☆4Updated 7 years ago
- Given two sorted arrays, a and b, efficiently return an array of indexes of b's elements in a.☆8Updated 7 years ago
- Simple levelup hooks implemented using instance method override of arbitrary levelups.☆16Updated 4 years ago
- An in memory sorted set that uses binary search on numeric indexes to find values next to each other☆19Updated 8 years ago
- oi oi oi☆7Updated 8 years ago