Skip to content

Commit 6d540d2

Browse files
authored
DEV: replace hackers with racers on sorted sets page (#749)
1 parent f7597ab commit 6d540d2

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

content/develop/data-types/sorted-sets.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ As you can see [`ZADD`]({{< relref "/commands/zadd" >}}) is similar to [`SADD`](
5757
[`ZADD`]({{< relref "/commands/zadd" >}}) is also variadic, so you are free to specify multiple score-value
5858
pairs, even if this is not used in the example above.
5959

60-
With sorted sets it is trivial to return a list of hackers sorted by their
60+
With sorted sets it is trivial to return a list of racers sorted by their
6161
birth year because actually *they are already sorted*.
6262

6363
Implementation note: Sorted sets are implemented via a
@@ -163,7 +163,7 @@ Redis instance will reply with the same output).
163163
The main commands to operate with lexicographical ranges are [`ZRANGEBYLEX`]({{< relref "/commands/zrangebylex" >}}),
164164
[`ZREVRANGEBYLEX`]({{< relref "/commands/zrevrangebylex" >}}), [`ZREMRANGEBYLEX`]({{< relref "/commands/zremrangebylex" >}}) and [`ZLEXCOUNT`]({{< relref "/commands/zlexcount" >}}).
165165

166-
For example, let's add again our list of famous hackers, but this time
166+
For example, let's add again our list of famous racers, but this time
167167
using a score of zero for all the elements. We'll see that because of the sorted sets ordering rules, they are already sorted lexicographically. Using [`ZRANGEBYLEX`]({{< relref "/commands/zrangebylex" >}}) we can ask for lexicographical ranges:
168168

169169
{{< clients-example ss_tutorial zadd_lex >}}

0 commit comments

Comments
 (0)