1. 31 May, 2016 1 commit
  2. 18 May, 2016 1 commit
  3. 06 May, 2016 1 commit
  4. 05 May, 2016 2 commits
  5. 02 May, 2016 1 commit
    • antirez's avatar
      Cluster regression test for #3043. · 9c48f28e
      antirez authored
      The test works but is very slow so far, since it involves resharding
      1/5 of all the cluster slots from master 0 to the other 4 masters and
      back into the original master.
      9c48f28e
  6. 25 Apr, 2016 1 commit
  7. 18 Apr, 2016 1 commit
  8. 02 Mar, 2016 4 commits
  9. 18 Feb, 2016 1 commit
  10. 17 Feb, 2016 1 commit
    • antirez's avatar
      Cluster: resharding test provides more state when failing. · 15f37ebd
      antirez authored
      Now elements added to lists are incremental numbers in order to
      understand, when inconsistencies are found, what is the order in which
      the elements were added. Also the error now provides both the expected
      and found value.
      15f37ebd
  11. 02 Feb, 2016 1 commit
  12. 15 Jan, 2016 2 commits
  13. 08 Jan, 2016 1 commit
    • antirez's avatar
      Scripting: handle trailing comments. · f43c794b
      antirez authored
      This fix, provided by Paul Kulchenko (@pkulchenko), allows the Lua
      scripting engine to evaluate statements with a trailing comment like the
      following one:
      
          EVAL "print() --comment" 0
      
      Lua can't parse the above if the string does not end with a newline, so
      now a final newline is always added automatically. This does not change
      the SHA1 of scripts since the SHA1 is computed on the body we pass to
      EVAL, without the other code we add to register the function.
      
      Close #2951.
      f43c794b
  14. 02 Jan, 2016 1 commit
  15. 29 Dec, 2015 1 commit
  16. 18 Dec, 2015 1 commit
  17. 17 Dec, 2015 1 commit
    • antirez's avatar
      Cluster: resharding test now checks AOF consistency. · 9b4dd92c
      antirez authored
      It's a key invariant that when AOF is enabled, after the cluster
      reshards, a crash-recovery event causes all the keys to be still fine
      with the expected logical content. Now this is part of unit 04.
      9b4dd92c
  18. 11 Dec, 2015 2 commits
  19. 10 Dec, 2015 2 commits
    • antirez's avatar
      Cluster: more reliable migration tests. · 41db54a5
      antirez authored
      The old version was modeled with two failovers, however after the first
      it is possible that another slave will migrate to the new master, since
      for some time the new master is not backed by any slave. Probably there
      should be some pause after a failover, before the migration. Anyway the
      test is simpler in this way, and depends less on timing.
      41db54a5
    • antirez's avatar
      Cluster: more reliable replicas migration test. · b55affbc
      antirez authored
      b55affbc
  20. 28 Nov, 2015 1 commit
  21. 04 Nov, 2015 1 commit
  22. 03 Nov, 2015 1 commit
  23. 30 Oct, 2015 3 commits
  24. 15 Oct, 2015 1 commit
  25. 09 Oct, 2015 1 commit
  26. 07 Oct, 2015 1 commit
  27. 06 Oct, 2015 1 commit
  28. 01 Oct, 2015 2 commits
  29. 15 Sep, 2015 1 commit
    • antirez's avatar
      Test: fix false positive in HSTRLEN test. · 846da5b2
      antirez authored
      HINCRBY* tests later used the value "tmp" that was sometimes generated
      by the random key generation function. The result was ovewriting what
      Tcl expected to be inside Redis with another value, causing the next
      HSTRLEN test to fail.
      846da5b2
  30. 14 Sep, 2015 1 commit
    • antirez's avatar
      GEORADIUS: Don't report duplicates when radius is huge. · 3c23b5ff
      antirez authored
      Georadius works by computing the center + neighbors squares covering all
      the area of the specified position and radius. Then a distance filter is
      used to remove elements which are actually outside the range.
      
      When a huge radius is used, like 5000 km or more, adjacent neighbors may
      collide and be the same, leading to the reporting of the same element
      multiple times. This only happens in the edge case of huge radius but is
      not ideal.
      
      A robust but slow solution would involve qsorting the range to remove
      all the duplicates. However since the collisions are only in adjacent
      boxes, for the way they are ordered in the code, it is much faster to
      just check if the current box is the same as the previous one processed.
      
      This commit adds a regression test for the bug.
      
      Fixes #2767.
      3c23b5ff