- 09 May, 2016 1 commit
-
-
oranagra authored
-
- 18 Apr, 2016 1 commit
-
-
Damian Janowski authored
-
- 15 Apr, 2016 2 commits
- 14 Apr, 2016 2 commits
- 18 Feb, 2016 1 commit
-
-
antirez authored
Related to issue #3019.
-
- 01 Oct, 2015 1 commit
-
-
antirez authored
-
- 27 Jul, 2015 1 commit
-
-
antirez authored
-
- 26 Jul, 2015 5 commits
- 03 Jul, 2015 1 commit
-
-
antirez authored
-
- 22 Jun, 2015 2 commits
-
-
antirez authored
Now used both in geo.c and t_zset to provide ZSCORE.
-
Matt Stancliff authored
Current todo: - replace functions in zset.{c,h} with a new unified Redis zset access API. Once we get the zset interface fixed, we can squash relevant commits in this branch and have one nice commit to merge into unstable. This commit adds: - Geo commands - Tests; runnable with: ./runtest --single unit/geo - Geo helpers in deps/geohash-int/ - src/geo.{c,h} and src/geojson.{c,h} implementing geo commands - Updated build configurations to get everything working - TEMPORARY: src/zset.{c,h} implementing zset score and zset range reading without writing to client output buffers. - Modified linkage of one t_zset.c function for use in zset.c Conflicts: src/Makefile src/redis.c
-
- 02 Jun, 2015 1 commit
-
-
linfangrong authored
-
- 29 May, 2015 3 commits
-
-
antirez authored
From Twitter: "@antirez that’s an awfully-named command :( http://en.wikipedia.org/wiki/Retching"
-
antirez authored
Normally ZADD only returns the number of elements added to a sorted set, using the RETCH option it returns the sum of elements added or for which the score was updated.
-
antirez authored
-
- 28 May, 2015 1 commit
-
-
antirez authored
-
- 23 Dec, 2014 1 commit
-
-
Matt Stancliff authored
-
- 07 Aug, 2014 1 commit
-
-
Wei Jin authored
Fixes #1741
-
- 22 Jul, 2014 2 commits
-
-
antirez authored
-
antirez authored
The user @kjmph provided excellent ideas to improve speed of ZUNIONSTORE (in certain cases by many order of magnitude), together with an implementation of the ideas. While the ideas were sounding, the implementation could be improved both in terms of speed and clearness, so that's my attempt at reimplementing the speedup proposed, trying to improve by directly using just a dictionary with an embedded score inside, and reusing the single-pass aggregate + order-later approach. Note that you can't apply this commit without applying the previous commit in this branch that adds a double in the dictEntry value union. Issue #1786.
-
- 26 Jun, 2014 1 commit
-
-
antirez authored
-
- 31 May, 2014 1 commit
-
-
zionwu authored
-
- 18 Apr, 2014 1 commit
-
-
antirez authored
-
- 17 Apr, 2014 3 commits
- 16 Apr, 2014 2 commits
- 05 Apr, 2014 1 commit
-
-
antirez authored
-
- 05 Dec, 2013 1 commit
-
-
antirez authored
-
- 05 Nov, 2013 1 commit
-
-
antirez authored
The previous implementation of SCAN parsed the cursor in the generic function implementing SCAN, SSCAN, HSCAN and ZSCAN. The actual higher-level command implementation only checked for empty keys and return ASAP in that case. The result was that inverting the arguments of, for instance, SSCAN for example and write: SSCAN 0 key Instead of SSCAN key 0 Resulted into no error, since 0 is a non-existing key name very likely. Just the iterator returned no elements at all. In order to fix this issue the code was refactored to extract the function to parse the cursor and return the error. Every higher level command implementation now parses the cursor and later checks if the key exist or not.
-
- 28 Oct, 2013 2 commits
- 19 Aug, 2013 1 commit
-
-
antirez authored
Related to issue #1240.
-