libring v1.0.2 HashRing
This module defines an API for creating/manipulating a hash ring. The internal datastructure for the hash ring is actually a gb_tree, which provides fast lookups for a given key on the ring.
- The ring is a continuum of 2^32 “points”, or integer values
- Nodes are sharded into 128 points, and distributed across the ring
- Each shard owns the keyspace below it
- Keys are hashed and assigned a point on the ring, the node for a given ring is determined by finding the next highest point on the ring for a shard, the node that shard belongs to is then the node which owns that key.
- If a key’s hash does not have any shards above it, it belongs to the first shard, this mechanism is what creates the ring-like topology.
- When nodes are added/removed from the ring, only a small subset of keys must be reassigned
Summary
Functions
Adds a node to the hash ring, with an optional weight provided which determines the number of virtual nodes (shards) that will be assigned to it on the ring
Adds a list of nodes to the hash ring. The list can contain just the node key, or a tuple of the node key and it’s desired weight
Determines which node owns the given key. This function assumes that the ring has been populated with at least one node
Creates a new hash ring structure, with no nodes added yet
Creates a new hash ring structure, seeded with the given node, with an optional weight provided which determines the number of virtual nodes (shards) that will be assigned to it on the ring
Removes a node from the hash ring
Types
t :: %HashRing{nodes: [term], ring: :gb_trees.tree}
Functions
Specs
add_node(HashRing.t, term, pos_integer) :: HashRing.t
Adds a node to the hash ring, with an optional weight provided which determines the number of virtual nodes (shards) that will be assigned to it on the ring.
The default weight for a node is 128
Examples
iex> ring = HashRing.new()
...> ring = HashRing.add_node(ring, "a")
...> %HashRing{nodes: ["b", "a"]} = ring = HashRing.add_node(ring, "b", 64)
...> HashRing.key_to_node(ring, :foo)
"b"
Specs
add_nodes(HashRing.t, [term | {term, pos_integer}]) :: HashRing.t
Adds a list of nodes to the hash ring. The list can contain just the node key, or a tuple of the node key and it’s desired weight.
See also the documentation for add_node/3
.
Examples
iex> ring = HashRing.new()
...> ring = HashRing.add_nodes(ring, ["a", {"b", 64}])
...> %HashRing{nodes: ["b", "a"]} = ring
...> HashRing.key_to_node(ring, :foo)
"b"
Specs
key_to_node(HashRing.t, term) ::
node |
{:error, {:invalid_ring, :no_nodes}}
Determines which node owns the given key. This function assumes that the ring has been populated with at least one node.
Examples
iex> ring = HashRing.new("a")
...> HashRing.key_to_node(ring, :foo)
"a"
iex> ring = HashRing.new()
...> HashRing.key_to_node(ring, :foo)
{:error, {:invalid_ring, :no_nodes}}
Specs
new :: HashRing.t
Creates a new hash ring structure, with no nodes added yet
Examples
iex> ring = HashRing.new()
...> %HashRing{nodes: ["a"]} = ring = HashRing.add_node(ring, "a")
...> HashRing.key_to_node(ring, {:complex, "key"})
"a"
Specs
new(node, pos_integer) :: HashRing.t
Creates a new hash ring structure, seeded with the given node, with an optional weight provided which determines the number of virtual nodes (shards) that will be assigned to it on the ring.
The default weight for a node is 128
Examples
iex> ring = HashRing.new("a")
...> %HashRing{nodes: ["a"]} = ring
...> HashRing.key_to_node(ring, :foo)
"a"
iex> ring = HashRing.new("a", 200)
...> %HashRing{nodes: ["a"]} = ring
...> HashRing.key_to_node(ring, :foo)
"a"
Specs
remove_node(HashRing.t, node) :: HashRing.t
Removes a node from the hash ring.
Examples
iex> ring = HashRing.new()
...> %HashRing{nodes: ["a"]} = ring = HashRing.add_node(ring, "a")
...> %HashRing{nodes: []} = ring = HashRing.remove_node(ring, "a")
...> HashRing.key_to_node(ring, :foo)
{:error, {:invalid_ring, :no_nodes}}