You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository was archived by the owner on Dec 24, 2022. It is now read-only.
Just like NuGet version matchers, Redis uses `[` char to express inclusiveness and `(` char for exclusiveness.
36
+
Since the `IRedisClient` APIs defaults to inclusive searches, these two APIs are the same:
37
+
38
+
```csharp
39
+
Redis.SearchSortedSetCount("zset", "a", "c")
40
+
Redis.SearchSortedSetCount("zset", "[a", "[c")
41
+
```
42
+
43
+
Alternatively you can specify one or both bounds to be exclusive by using the `(` prefix, e.g:
44
+
45
+
```csharp
46
+
Redis.SearchSortedSetCount("zset", "a", "(c")
47
+
Redis.SearchSortedSetCount("zset", "(a", "(c")
48
+
```
49
+
50
+
More API examples are available in [LexTests.cs](https://github.com/ServiceStack/ServiceStack.Redis/blob/master/tests/ServiceStack.Redis.Tests/LexTests.cs).
51
+
6
52
### New HyperLog API
7
53
8
54
The development branch of Redis server (available when v3.0 is released) includes an ingenious algorithm to approximate the unique elements in a set with maximum space and time efficiency. For details about how it works see Redis's creator Salvatore's blog who [explains it in great detail](http://antirez.com/news/75). Essentially it lets you maintain an efficient way to count and merge unique elements in a set without having to store its elements.
0 commit comments