diff options
| author | antirez <antirez@gmail.com> | 2018-06-15 13:14:57 +0200 |
|---|---|---|
| committer | antirez <antirez@gmail.com> | 2019-06-18 12:31:10 +0200 |
| commit | e9bb30fd859ed4e9e3e6434207dedbc251086858 (patch) | |
| tree | 0ac8972fefe6911dee8c7376e14c611fcc105e1c /src/sort.c | |
| parent | fd0ee469ab165d0e005e9fe1fca1c4f5c604cd56 (diff) | |
| download | redis-new-keyspace.tar.gz | |
Experimental: new keyspace and expire algorithm.new-keyspace
This is an alpha quality implementation of a new keyspace representation
and a new expire algorithm for Redis.
This work is described here:
https://gist.github.com/antirez/b2eb293819666ee104c7fcad71986eb7
Diffstat (limited to 'src/sort.c')
| -rw-r--r-- | src/sort.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/sort.c b/src/sort.c index db26da158..b54a40355 100644 --- a/src/sort.c +++ b/src/sort.c @@ -107,9 +107,9 @@ robj *lookupKeyByPattern(redisDb *db, robj *pattern, robj *subst, int writeflag) /* Lookup substituted key */ if (!writeflag) - o = lookupKeyRead(db,keyobj); + o = lookupKeyRead(db,keyobj,NULL); else - o = lookupKeyWrite(db,keyobj); + o = lookupKeyWrite(db,keyobj,NULL); if (o == NULL) goto noobj; if (fieldobj) { @@ -271,9 +271,9 @@ void sortCommand(client *c) { /* Lookup the key to sort. It must be of the right types */ if (storekey) - sortval = lookupKeyRead(c->db,c->argv[1]); + sortval = lookupKeyRead(c->db,c->argv[1],NULL); else - sortval = lookupKeyWrite(c->db,c->argv[1]); + sortval = lookupKeyWrite(c->db,c->argv[1],NULL); if (sortval && sortval->type != OBJ_SET && sortval->type != OBJ_LIST && sortval->type != OBJ_ZSET) |