summaryrefslogtreecommitdiff
path: root/examples/redis-unstable/src/commands/dump.json
diff options
context:
space:
mode:
authorMitja Felicijan <mitja.felicijan@gmail.com>2026-01-21 22:40:55 +0100
committerMitja Felicijan <mitja.felicijan@gmail.com>2026-01-21 22:40:55 +0100
commit5d8dfe892a2ea89f706ee140c3bdcfd89fe03fda (patch)
tree1acdfa5220cd13b7be43a2a01368e80d306473ca /examples/redis-unstable/src/commands/dump.json
parentc7ab12bba64d9c20ccd79b132dac475f7bc3923e (diff)
downloadcrep-5d8dfe892a2ea89f706ee140c3bdcfd89fe03fda.tar.gz
Add Redis source code for testing
Diffstat (limited to 'examples/redis-unstable/src/commands/dump.json')
-rw-r--r--examples/redis-unstable/src/commands/dump.json58
1 files changed, 58 insertions, 0 deletions
diff --git a/examples/redis-unstable/src/commands/dump.json b/examples/redis-unstable/src/commands/dump.json
new file mode 100644
index 0000000..9e772ed
--- /dev/null
+++ b/examples/redis-unstable/src/commands/dump.json
@@ -0,0 +1,58 @@
+{
+ "DUMP": {
+ "summary": "Returns a serialized representation of the value stored at a key.",
+ "complexity": "O(1) to access the key and additional O(N*M) to serialize it, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1).",
+ "group": "generic",
+ "since": "2.6.0",
+ "arity": 2,
+ "function": "dumpCommand",
+ "command_flags": [
+ "READONLY"
+ ],
+ "acl_categories": [
+ "KEYSPACE"
+ ],
+ "command_tips": [
+ "NONDETERMINISTIC_OUTPUT"
+ ],
+ "key_specs": [
+ {
+ "flags": [
+ "RO",
+ "ACCESS"
+ ],
+ "begin_search": {
+ "index": {
+ "pos": 1
+ }
+ },
+ "find_keys": {
+ "range": {
+ "lastkey": 0,
+ "step": 1,
+ "limit": 0
+ }
+ }
+ }
+ ],
+ "reply_schema": {
+ "oneOf": [
+ {
+ "description": "The serialized value.",
+ "type": "string"
+ },
+ {
+ "description": "Key does not exist.",
+ "type": "null"
+ }
+ ]
+ },
+ "arguments": [
+ {
+ "name": "key",
+ "type": "key",
+ "key_spec_index": 0
+ }
+ ]
+ }
+}