- 11 Feb, 2015 17 commits
-
-
antirez authored
The old version of SPOP with "count" argument used an API call of dict.c which was actually designed for a different goal, and was not capable of good distribution. We follow a different three-cases approach optimized for different ratiion between sets and requested number of elements. The implementation is simpler and allowed the removal of a large amount of code.
-
antirez authored
-
antirez authored
Now the API automatically creates its argv copy and increment ref count of passed objects.
-
antirez authored
Severan problems are addressed but still a few missing. Since replication of this command was more complex than others since it needs to replicate multiple SREM commands, an old API able to do this was reused (it was taken inside the implementation since it was pretty obvious soon or later that would be useful). The API was improved a bit so that now a command may opt-out for the standard command replication when the server.dirty counter is incremented, in order to "manually" replicate what it wants.
-
antirez authored
-
antirez authored
Fixed by @oranagra, thank you.
-
antirez authored
-
antirez authored
-
antirez authored
-
antirez authored
Avoid code repetition introduced with PR #2367, also fixes the return value to always return 0 if there is nothing more to rehash.
-
Sun He authored
-
antirez authored
This is very similar to the optimization applied to dictGetRandomKeys, but applied to the single key variant. Related to issue #2306.
-
antirez authored
Related to issue #2306.
-
antirez authored
We use the invariant that the original table ht[0] is never populated up to the index before the current rehashing index. Related to issue #2306.
-
antirez authored
Related to issue #2306.
-
antirez authored
Related to issue #2306.
-
antirez authored
Related to issue #2306.
-
- 10 Feb, 2015 1 commit
-
-
antirez authored
Related to issue #2372.
-
- 09 Feb, 2015 1 commit
-
-
antirez authored
-
- 08 Feb, 2015 2 commits
-
-
antirez authored
--stat mode already used to reconnect automatically if the server is no longer available. This is useful since this is an interactive mode used for debugging, however the same applies to --latency and --latency-dist modes, so now both use the reconnecting command execution as well. The reconnection code was modified to use basic VT100 escape sequences in order to play better with different kinds of output on the screen when the reconnection happens, and to hide the reconnection attempt output when finally the reconnection happens.
-
antirez authored
So far not able to find a color palette within the 256 colors which is not confusing. However I believe it is a possible task, so will try better later.
-
- 07 Feb, 2015 5 commits
-
-
antirez authored
Still not happy with the result but low grays are hard to see in certain monitors with a non perfect gamma.
-
antirez authored
-
Mariano Pérez Rodríguez authored
Fixing #2371 as per @mattsta's suggestion
-
antirez authored
-
antirez authored
-
- 04 Feb, 2015 1 commit
-
-
antirez authored
-
- 03 Feb, 2015 6 commits
-
-
antirez authored
Related to #2346.
-
antirez authored
Related to #2346.
-
antirez authored
-
antirez authored
-
antirez authored
This also makes it backward compatible in the usage, but for the command name. However the old command name was less obvious so it is worth to break it probably. With the new setup the program main can perform argument parsing and everything else useful for an RDB check regardless of the Redis server itself.
-
antirez authored
Backtrace is a glibc extension, while setproctitle() implementation depends on the memory layout and is partially libc dependent.
-
- 02 Feb, 2015 1 commit
-
-
Sun He authored
also fix the situation "dontsort DESC" of a list
-
- 30 Jan, 2015 3 commits
-
-
antirez authored
-
antirez authored
This improves PFAIL -> FAIL switch. Too late at this point in the RC releases to add proper PFAIL/FAIL separate dictionary to do this in a less randomized way. Tested in practice with experiments that this helps. PFAIL -> FAIL average with 20 nodes and node-timeout set to 5 seconds takes 2.5 seconds without this commit, 1 second with this commit.
-
antirez authored
-
- 29 Jan, 2015 3 commits
-
-
antirez authored
-
antirez authored
-
antirez authored
Otherwise it is impossible to receive the majority of failure reports in the node_timeout*2 window in larger clusters. Still with a 200 nodes cluster, 20 gossip sections are a very reasonable amount of bytes to send. A side effect of this change is also fater cluster nodes joins for large clusters, because the cluster layout makes less time to propagate.
-