Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a Distributed Hash Table (DHT) part of the BitTorrent protocol, as specified by BEP 5: http://www.bittorrent.org/beps/bep_0005.html
Package dht implements a Distributed Hash Table (DHT) part of the BitTorrent protocol, as specified by BEP 5: http://www.bittorrent.org/beps/bep_0005.html BitTorrent uses a "distributed hash table" (DHT) for storing peer contact information for "trackerless" torrents.
Package dht implements a distributed hash table that satisfies the ipfs routing interface. This DHT is modeled after kademlia with S/Kademlia modifications.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package core implements a custom, mmap-backed open-addressing hash table tuned for fixed-size keys/values, read-heavy workloads, and real-time updates at a scale larger than RAM.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package wormhole implements a concurrent, ordered in-memory map with ordered generic keys and arbitrary values, using the Wormhole paper's hash-indexed prefix trie, linked leaves, stable record slots with tag-bucket chains, lazy leaf sorting, and versioned two-table metadata updates.
Package cuckoo implements d-ary bucketized cuckoo hashing with stash (bucketized cuckoo hashing is also known as splash tables).
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package bitcask implements Bitcask, a log-structured hash table for fast key/value storage.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package auth is browser sign-in for a service with no user table: OIDC (authorization code with PKCE, state and nonce in transient cookies, an optional required group), an HMAC-signed session cookie that carries the identity itself, and a password check for deployments without an identity provider (a fixed account or a bcrypt hash).
Package password is the password sign-in method: argon2id hashes in its own auth_password table, sign-up, sign-in with any sign-in identifier, forgotten-password reset through whatever recovery channel the user has, and change.
Package gorge holds the sources that decide a binary card table's bytes, so that a binary knows which tables match it without a source tree: a pinned tool, a gate's base tree and a deployed server all outlive their checkout, and walking up to hash dirac/kgen at run time would load whatever the cwd happens to be in.
Package dendrite implements a distributed hash table (DHT) based on Chord Protocol.
Package mph implements a minimal perfect hash table over strings.
Package kad implements a Kademlia Distributed Hash Table for node discovery.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package redimo implements Redis data structures on top of a single Amazon DynamoDB table, exposing Strings, Hashes, Lists, Sets and Sorted Sets through a Client whose method names mirror the corresponding Redis commands (GET/SET, HGET/HSET, LPUSH/RPOP, SADD/SREM, ZADD/ZRANGE, and so on).
Package redimo implements Redis data structures on top of a single Amazon DynamoDB table, exposing Strings, Hashes, Lists, Sets and Sorted Sets through a Client whose method names mirror the corresponding Redis commands (GET/SET, HGET/HSET, LPUSH/RPOP, SADD/SREM, ZADD/ZRANGE, and so on).
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package hashing provides utilities for and an implementation of a hash table which is more performant than the default go map implementation by leveraging xxh3 and some custom hash functions.
Package dht implements a Distributed Hash Table (DHT) part of the BitTorrent protocol, as specified by BEP 5: http://www.bittorrent.org/beps/bep_0005.html
Package hashset implements a set backed by a hash table.
Package hashmap provides a hash table implementation with case-insensitive string hashing, matching Chromium's WTF HashMap behavior.
Package cuckoo provides a hash table that uses cuckoo hashing to achieve a worst-case O(1) lookup time.
Package maphash provides hash functions on byte sequences and comparable values. These hash functions are intended to be used to implement hash tables or other data structures that need to map arbitrary strings or byte sequences to a uniform distribution on unsigned 64-bit integers. Each different instance of a hash table or data structure should use its own Seed. The hash functions are not cryptographically secure. (See crypto/sha256 and crypto/sha512 for cryptographic use.)
Package dht implements a Distributed Hash Table (DHT) part of the BitTorrent protocol, as specified by BEP 5: http://www.bittorrent.org/beps/bep_0005.html
Package mph implements a minimal perfect hash table over strings.
Package mph implements a minimal perfect hash table over strings.
Package dht implements a distributed hash table that satisfies the ipfs routing interface. This DHT is modeled after kademlia with S/Kademlia modifications.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.
Package dht implements a distributed hash table that satisfies the ipfs routing interface.