diff options
| author | Mitja Felicijan <mitja.felicijan@gmail.com> | 2026-01-21 22:52:54 +0100 |
|---|---|---|
| committer | Mitja Felicijan <mitja.felicijan@gmail.com> | 2026-01-21 22:52:54 +0100 |
| commit | dcacc00e3750300617ba6e16eb346713f91a783a (patch) | |
| tree | 38e2d4fb5ed9d119711d4295c6eda4b014af73fd /examples/redis-unstable/src/commands/sintercard.json | |
| parent | 58dac10aeb8f5a041c46bddbeaf4c7966a99b998 (diff) | |
| download | crep-dcacc00e3750300617ba6e16eb346713f91a783a.tar.gz | |
Remove testing data
Diffstat (limited to 'examples/redis-unstable/src/commands/sintercard.json')
| -rw-r--r-- | examples/redis-unstable/src/commands/sintercard.json | 60 |
1 files changed, 0 insertions, 60 deletions
diff --git a/examples/redis-unstable/src/commands/sintercard.json b/examples/redis-unstable/src/commands/sintercard.json deleted file mode 100644 index 9a79183..0000000 --- a/examples/redis-unstable/src/commands/sintercard.json +++ /dev/null @@ -1,60 +0,0 @@ -{ - "SINTERCARD": { - "summary": "Returns the number of members of the intersect of multiple sets.", - "complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.", - "group": "set", - "since": "7.0.0", - "arity": -3, - "function": "sinterCardCommand", - "get_keys_function": "sintercardGetKeys", - "command_flags": [ - "READONLY" - ], - "acl_categories": [ - "SET" - ], - "key_specs": [ - { - "flags": [ - "RO", - "ACCESS" - ], - "begin_search": { - "index": { - "pos": 1 - } - }, - "find_keys": { - "keynum": { - "keynumidx": 0, - "firstkey": 1, - "step": 1 - } - } - } - ], - "reply_schema": { - "description": "Number of the elements in the resulting intersection.", - "type": "integer", - "minimum": 0 - }, - "arguments": [ - { - "name": "numkeys", - "type": "integer" - }, - { - "name": "key", - "type": "key", - "key_spec_index": 0, - "multiple": true - }, - { - "token": "LIMIT", - "name": "limit", - "type": "integer", - "optional": true - } - ] - } -} |