|
Lists
We moved to Redis.io!Redis home moved to http://redis.io, please visit our new home. |
► Sign in to add a comment
|
|
|
|
|
Search
|
|
Lists
We moved to Redis.io!Redis home moved to http://redis.io, please visit our new home. |
Since you are already using skip lists in your implementation of sorted sets, I don't understand why you wouldn't use skip lists here instead of a normal linked list. As I understand it that would reduce the complexity of LRANGE and LINDEX to O(range_size + log N) and O(log N) respectively. Please enlighten me as to why I am wrong?