Skip to content

redis modules docs sync #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
github-actions wants to merge 3 commits into
base: main
Choose a base branch
from
Open

redis modules docs sync #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0a45ab3
Update data/commands_redisbloom.json for release v2.8.20
redisdocsapp[bot] May 25, 2026
217f72c
Update data/commands_redistimeseries.json for release v1.12.14
redisdocsapp[bot] May 25, 2026
8db1104
Update data/commands_redisearch.json for release v2.10.30
redisdocsapp[bot] May 25, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
20 changes: 10 additions & 10 deletions data/commands_redisbloom.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -623,7 +623,7 @@
"group": "cms"
},
"TOPK.RESERVE": {
"summary": "Initializes a Top-K sketch with specified parameters",
"summary": "Initializes a TopK with specified parameters",
"complexity": "O(1)",
"arguments": [
{
Expand Down Expand Up @@ -658,7 +658,7 @@
"group": "topk"
},
"TOPK.ADD": {
"summary": "Adds an item to a Top-k sketch. Multiple items can be added at the same time.",
"summary": "Increases the count of one or more items by increment",
"complexity": "O(n * k) where n is the number of items and k is the depth",
"arguments": [
{
Expand Down Expand Up @@ -737,8 +737,8 @@
"group": "topk"
},
"TOPK.LIST": {
"summary": "Return the full list of items in Top-K sketch.",
"complexity": "O(k*log(k)) where k is the value of top-k",
"summary": "Return full list of items in Top K list",
"complexity": "O(k) where k is the value of top-k",
"arguments": [
{
"name": "key",
Expand Down Expand Up @@ -798,7 +798,7 @@
},
"TDIGEST.ADD": {
"summary": "Adds one or more observations to a t-digest sketch",
"complexity": "O(N), where N is the number of samples to add",
"complexity": "O(N) , where N is the number of samples to add",
"arguments": [
{
"name": "key",
Expand Down Expand Up @@ -889,7 +889,7 @@
},
"TDIGEST.QUANTILE": {
"summary": "Returns, for each input fraction, an estimation of the value (floating point) that is smaller than the given fraction of observations",
"complexity": "O(N) where N is the number of quantiles specified.",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
Expand Down Expand Up @@ -943,7 +943,7 @@
},
"TDIGEST.RANK": {
"summary": "Returns, for each input value (floating-point), the estimated rank of the value (the number of observations in the sketch that are smaller than the value + half the number of observations that are equal to the value)",
"complexity": "O(N) where N is the number of values specified.",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
Expand All @@ -960,7 +960,7 @@
},
"TDIGEST.REVRANK": {
"summary": "Returns, for each input value (floating-point), the estimated reverse rank of the value (the number of observations in the sketch that are larger than the value + half the number of observations that are equal to the value)",
"complexity": "O(N) where N is the number of values specified.",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
Expand All @@ -977,7 +977,7 @@
},
"TDIGEST.BYRANK": {
"summary": "Returns, for each input rank, an estimation of the value (floating-point) with that rank",
"complexity": "O(N) where N is the number of ranks specified",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
Expand All @@ -994,7 +994,7 @@
},
"TDIGEST.BYREVRANK": {
"summary": "Returns, for each input reverse rank, an estimation of the value (floating-point) with that reverse rank",
"complexity": "O(N) where N is the number of reverse ranks specified.",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
Expand Down
Loading