watson / hash-index
A hashing function which returns integers with a possible max value
☆29Updated 9 years ago
Alternatives and similar repositories for hash-index:
Users that are interested in hash-index are comparing it to the libraries listed below
- Simple one-way stream multiplexer with very few features☆25Updated 8 years ago
- Interpret a number as base 8☆19Updated 9 years ago
- Git repository object walker☆7Updated 8 years ago
- Make sure the last sync call to an async function is executed after all previous ones have finished☆31Updated 9 years ago
- Borough☆9Updated 8 years ago
- Output binary buffers as a nice shortened hex string☆27Updated 5 years ago
- Iterate through the values of a stream☆27Updated 6 years ago
- Distributed map and filter☆33Updated 8 years ago
- Stream all of npm metadata into hypercore☆19Updated 8 years ago
- Linear asynchronous stateful indexing of a hypercore feed☆24Updated 7 years ago
- Elect a leader using unix sockets, for node☆20Updated 6 years ago
- Pass in a string, get a buffer back. Pass in a buffer, get the same buffer back.☆26Updated 7 years ago
- Parse a tabular input stream☆18Updated 9 years ago
- On-disk variable sized chunk store☆22Updated 9 years ago
- ☆10Updated 8 years ago
- Get the union of two sorted streams☆28Updated 2 years ago
- Easily convert Little/Big endian typed arrays to the host endianess☆15Updated 6 years ago
- Readable stream that reads from a file descriptor. Supports tailing and retries.☆16Updated 7 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
- Uniformly pick a random value from a stream☆14Updated 10 years ago
- npm registry on dat☆40Updated 7 years ago
- Back to the basics, Hickey-inspired, generic text parser☆21Updated 8 years ago
- Get started using the github in no time! Instantiates github module by using ghauth.☆14Updated 10 years ago
- Read a multipart stream over HTTP☆13Updated 7 years ago
- recursive file and folder copy using in memory tar streams☆16Updated 9 years ago
- Content addressable graph where every node has at most a single link to another node☆20Updated 9 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
- Read a file and re-read it when it changes☆17Updated 8 years ago
- Superseded by abstract-level. Error types for levelup.☆13Updated 4 months ago
- Run ps with all active lil-pids services☆9Updated 8 years ago