From 55e41d6d5647e2048a8c9a5151bb940a661b35e6 Mon Sep 17 00:00:00 2001 From: Katsunori Kanda Date: Mon, 15 Dec 2014 01:37:57 +0900 Subject: [PATCH] =doc fix typo --- akka-contrib/docs/cluster-sharding.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/akka-contrib/docs/cluster-sharding.rst b/akka-contrib/docs/cluster-sharding.rst index 5e405c662c..8e5302b732 100644 --- a/akka-contrib/docs/cluster-sharding.rst +++ b/akka-contrib/docs/cluster-sharding.rst @@ -68,7 +68,7 @@ overhead, and increased latency because the corrdinator is involved in the routi shard. The sharding algorithm must be the same on all nodes in a running cluster. It can be changed after stopping all nodes in the cluster. -A simple sharding algorithm that works fine in most cases is to take the ``hashCode`` of the the entry identifier modulo +A simple sharding algorithm that works fine in most cases is to take the ``hashCode`` of the entry identifier modulo number of shards. Messages to the entries are always sent via the local ``ShardRegion``. The ``ShardRegion`` actor reference for a @@ -125,7 +125,7 @@ overhead, and increased latency because the corrdinator is involved in the routi shard. The sharding algorithm must be the same on all nodes in a running cluster. It can be changed after stopping all nodes in the cluster. -A simple sharding algorithm that works fine in most cases is to take the ``hashCode`` of the the entry identifier modulo +A simple sharding algorithm that works fine in most cases is to take the ``hashCode`` of the entry identifier modulo number of shards. Messages to the entries are always sent via the local ``ShardRegion``. The ``ShardRegion`` actor reference for a