Skip to content

Commit 0bf0f69

Browse files
authored
DEV: fix typo on cluster spec page (#1079)
1 parent 663bada commit 0bf0f69

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

content/operate/oss_and_stack/reference/cluster-spec.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -198,7 +198,7 @@ Then instead of hashing the key, only what is between the first occurrence of `{
198198
Examples:
199199

200200
* The two keys `{user1000}.following` and `{user1000}.followers` will hash to the same hash slot since only the substring `user1000` will be hashed in order to compute the hash slot.
201-
* For the key `foo{}{bar}` the whole key will be hashed as usually since the first occurrence of `{` is followed by `}` on the right without characters in the middle.
201+
* For the key `foo{}{bar}` the whole key will be hashed as usual since the first occurrence of `{` is followed by `}` on the right without characters in the middle.
202202
* For the key `foo{{bar}}zap` the substring `{bar` will be hashed, because it is the substring between the first occurrence of `{` and the first occurrence of `}` on its right.
203203
* For the key `foo{bar}{zap}` the substring `bar` will be hashed, since the algorithm stops at the first valid or invalid (without bytes inside) match of `{` and `}`.
204204
* What follows from the algorithm is that if the key starts with `{}`, it is guaranteed to be hashed as a whole. This is useful when using binary data as key names.

0 commit comments

Comments
 (0)