summaryrefslogtreecommitdiff
path: root/src/rax.c
diff options
context:
space:
mode:
authorantirez <antirez@gmail.com>2019-11-14 12:48:54 +0100
committerantirez <antirez@gmail.com>2019-11-14 12:48:54 +0100
commit8d50a8327e9f77f70ac7c11edd41a74a193ed830 (patch)
tree65c7e02b1be658506bce106613d572f530d9baff /src/rax.c
parent0f026af185e918a9773148f6ceaa1b084662be88 (diff)
downloadredis-8d50a8327e9f77f70ac7c11edd41a74a193ed830.tar.gz
Rax library updated.
Diffstat (limited to 'src/rax.c')
-rw-r--r--src/rax.c3
1 files changed, 2 insertions, 1 deletions
diff --git a/src/rax.c b/src/rax.c
index be474b058..29b74ae90 100644
--- a/src/rax.c
+++ b/src/rax.c
@@ -1673,6 +1673,7 @@ int raxSeek(raxIterator *it, const char *op, unsigned char *ele, size_t len) {
* node, but will be our match, representing the key "f".
*
* So in that case, we don't seek backward. */
+ it->data = raxGetData(it->node);
} else {
if (gt && !raxIteratorNextStep(it,0)) return 0;
if (lt && !raxIteratorPrevStep(it,0)) return 0;
@@ -1791,7 +1792,7 @@ int raxCompare(raxIterator *iter, const char *op, unsigned char *key, size_t key
if (eq && key_len == iter->key_len) return 1;
else if (lt) return iter->key_len < key_len;
else if (gt) return iter->key_len > key_len;
- return 0;
+ else return 0; /* Avoid warning, just 'eq' is handled before. */
} else if (cmp > 0) {
return gt ? 1 : 0;
} else /* (cmp < 0) */ {