- 30 May, 2013 1 commit
-
-
antirez authored
-
- 15 May, 2013 1 commit
-
-
antirez authored
Required because of recent changes in the way logfile is set to standard output.
-
- 09 May, 2013 1 commit
-
-
antirez authored
-
- 08 May, 2013 2 commits
- 23 Apr, 2013 1 commit
-
-
antirez authored
When the test is executed using the root account, setting the permission to 222 does not work as expected, as root can read files with 222 permission. Now we skip the test if root is detected. This fixes issue #1034 and the duplicated #1040 issue. Thanks to Jan-Erik Rediger (@badboy on Github) for finding a way to reproduce the issue.
-
- 22 Apr, 2013 1 commit
-
-
antirez authored
-
- 04 Apr, 2013 1 commit
-
-
antirez authored
-
- 28 Mar, 2013 3 commits
- 27 Mar, 2013 3 commits
- 25 Mar, 2013 1 commit
-
-
antirez authored
Fixes #621.
-
- 13 Mar, 2013 2 commits
- 12 Mar, 2013 1 commit
-
-
antirez authored
-
- 12 Feb, 2013 2 commits
- 05 Feb, 2013 1 commit
-
-
antirez authored
-
- 28 Jan, 2013 4 commits
-
-
antirez authored
-
antirez authored
-
antirez authored
When keyspace events are enabled, the overhead is not sever but noticeable, so this commit introduces the ability to select subclasses of events in order to avoid to generate events the user is not interested in. The events can be selected using redis.conf or CONFIG SET / GET.
-
antirez authored
-
- 23 Jan, 2013 2 commits
-
-
Johan Bergström authored
-
Johan Bergström authored
-
- 21 Jan, 2013 1 commit
-
-
antirez authored
UNSUBSCRIBE and PUNSUBSCRIBE commands are designed to mass-unsubscribe the client respectively all the channels and patters if called without arguments. However when these functions are called without arguments, but there are no channels or patters we are subscribed to, the old behavior was to don't reply at all. This behavior is broken, as every command should always reply. Also it is possible that we are no longer subscribed to a channels but we are subscribed to patters or the other way around, and the client should be notified with the correct number of subscriptions. Also it is not pretty that sometimes we did not receive a reply at all in a redis-cli session from these commands, blocking redis-cli trying to read the reply. This fixes issue #714.
-
- 19 Jan, 2013 2 commits
- 15 Jan, 2013 1 commit
-
-
antirez authored
-
- 10 Jan, 2013 1 commit
-
-
antirez authored
-
- 03 Dec, 2012 1 commit
-
-
antirez authored
Due to changes in recent releases of osx leaks utility, the osx leak detection no longer worked. Now it is fixed in a way that should be backward compatible.
-
- 02 Dec, 2012 1 commit
-
-
antirez authored
-
- 30 Nov, 2012 2 commits
-
-
antirez authored
SDIFF used an algorithm that was O(N) where N is the total number of elements of all the sets involved in the operation. The algorithm worked like that: ALGORITHM 1: 1) For the first set, add all the members to an auxiliary set. 2) For all the other sets, remove all the members of the set from the auxiliary set. So it is an O(N) algorithm where N is the total number of elements in all the sets involved in the diff operation. Cristobal Viedma suggested to modify the algorithm to the following: ALGORITHM 2: 1) Iterate all the elements of the first set. 2) For every element, check if the element also exists in all the other remaining sets. 3) Add the element to the auxiliary set only if it does not exist in any of the other sets. The complexity of this algorithm on the worst case is O(N*M) where N is the size of the first set and M the total number of sets involved in the operation. However when there are elements in common, with this algorithm we stop the computation for a given element as long as we find a duplicated element into another set. I (antirez) added an additional step to algorithm 2 to make it faster, that is to sort the set to subtract from the biggest to the smallest, so that it is more likely to find a duplicate in a larger sets that are checked before the smaller ones. WHAT IS BETTER? None of course, for instance if the first set is much larger than the other sets the second algorithm does a lot more work compared to the first algorithm. Similarly if the first set is much smaller than the other sets, the original algorithm will less work. So this commit makes Redis able to guess the number of operations required by each algorithm, and select the best at runtime according to the input received. However, since the second algorithm has better constant times and can do less work if there are duplicated elements, an advantage is given to the second algorithm.
-
antirez authored
-
- 29 Nov, 2012 1 commit
-
-
antirez authored
-
- 22 Nov, 2012 3 commits