- 01 Sep, 2020 1 commit
-
-
Itamar Haber authored
Otherwise, it is treated as a single allocation and freed synchronously. The following logic is used for estimating the effort in constant-ish time complexity: 1. Check the number of nodes. 1. Add an allocation for each consumer group registered inside the stream. 1. Check the number of PELs in the first CG, and then add this count times the number of CGs. 1. Check the number of consumers in the first CG, and then add this count times the number of CGs. (cherry picked from commit 5b0a06af)
-
- 15 Apr, 2020 1 commit
-
-
antirez authored
Reloading of the RDB generated by DEBUG POPULATE 5000000 SAVE is now 25% faster. This commit also prepares the ability to have more flexibility when loading stuff from the RDB, since we no longer use dbAdd() but can control exactly how things are added in the database.
-
- 31 Jul, 2018 1 commit
-
-
zhaozhao.zz authored
-
- 03 Jul, 2018 1 commit
-
-
Jack Drogon authored
-
- 15 Jan, 2018 1 commit
-
-
antirez authored
-
- 14 Jan, 2018 1 commit
-
-
zhaozhao.zz authored
-
- 04 May, 2017 2 commits
- 27 Mar, 2017 1 commit
-
-
antirez authored
-
- 14 Sep, 2016 1 commit
-
-
antirez authored
Optimizations suggested and originally implemented by @oranagra. Re-applied by @antirez using the modified API.
-
- 13 Jan, 2016 1 commit
-
-
root authored
-
- 01 Oct, 2015 6 commits