hasura/graphql-engine
1
0
Fork 0
mirror of https://github.com/hasura/graphql-engine.git synced 2024-12-16 09:51:59 +03:00
Code Issues Projects Releases Wiki Activity
3d25939f0c
graphql-engine/server/forks/hedis/codegen/commands.json
Puru Gupta 328b7b793f server: add support for redis clusters 
PR-URL: https://github.com/hasura/graphql-engine-mono/pull/8867
Co-authored-by: paritosh-08 <85472423+paritosh-08@users.noreply.github.com>
GitOrigin-RevId: 6ab173b02f6b8bf97ccbcdb00110fe147771c751
2023-06-05 12:11:59 +00:00

3249 lines
75 KiB
JSON
Raw Blame History

{
"APPEND": {
"summary": "Append a value to a key",
"complexity": "O(1). The amortized time complexity is O(1) assuming the appended value is small and the already present value is of any size, since the dynamic string library used by Redis will double the free space available on every reallocation.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.0.0",
"group": "string",
"returns": "integer"
},
"AUTH": {
"summary": "Authenticate to the server",
"arguments": [
{
"name": "password",
"type": "string"
}
],
"since": "1.0.0",
"group": "connection",
"returns": "status"
},
"BGREWRITEAOF": {
"summary": "Asynchronously rewrite the append-only file",
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"BGSAVE": {
"summary": "Asynchronously save the dataset to disk",
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"BITCOUNT": {
"summary": "Count set bits in a string",
"complexity": "O(N)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer",
"optional": true
},
{
"name": "end",
"type": "integer",
"optional": true
}
],
"since": "2.6.0",
"group": "string"
},
"BITOP": {
"summary": "Perform bitwise operations between strings",
"complexity": "O(N)",
"arguments": [
{
"name": "operation",
"type": "string"
},
{
"name": "destkey",
"type": "key"
},
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "2.6.0",
"group": "string"
},
"BITPOS": {
"summary": "Find first bit set or clear in a string",
"complexity": "O(N)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "bit",
"type": "integer"
},
{
"name": "start",
"type": "integer",
"optional": true
},
{
"name": "end",
"type": "integer",
"optional": true
}
],
"since": "2.8.7",
"group": "string",
"returns": "integer"
},
"BLPOP": {
"summary": "Remove and get the first element in a list, or block until one is available",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
},
{
"name": "timeout",
"type": "integer"
}
],
"since": "2.0.0",
"group": "list",
"returns": "maybe-pair"
},
"BRPOP": {
"summary": "Remove and get the last element in a list, or block until one is available",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
},
{
"name": "timeout",
"type": "integer"
}
],
"since": "2.0.0",
"group": "list",
"returns": "maybe-pair"
},
"BRPOPLPUSH": {
"summary": "Pop a value from a list, push it to another list and return it; or block until one is available",
"complexity": "O(1)",
"arguments": [
{
"name": "source",
"type": "key"
},
{
"name": "destination",
"type": "key"
},
{
"name": "timeout",
"type": "integer"
}
],
"since": "2.2.0",
"group": "list",
"returns": "maybe-string"
},
"CLIENT KILL": {
"summary": "Kill the connection of a client",
"complexity": "O(N) where N is the number of client connections",
"arguments": [
{
"name": "ip:port",
"type": "string",
"optional": true
},
{
"command": "ID",
"name": "client-id",
"type": "integer",
"optional": true
},
{
"command": "TYPE",
"type": "enum",
"enum": ["normal", "master", "slave", "pubsub"],
"optional": true
},
{
"command": "ADDR",
"name": "ip:port",
"type": "string",
"optional": true
},
{
"command": "SKIPME",
"name": "yes/no",
"type": "string",
"optional": true
}
],
"since": "2.4.0",
"group": "server",
"returns": "hash"
},
"CLIENT LIST": {
"summary": "Get the list of client connections",
"complexity": "O(N) where N is the number of client connections",
"since": "2.4.0",
"group": "server",
"returns": "list-string"
},
"CLIENT GETNAME": {
"summary": "Get the current connection name",
"complexity": "O(1)",
"since": "2.6.9",
"group": "server",
"returns": "status"
},
"CLIENT PAUSE": {
"summary": "Stop processing commands from clients for some time",
"complexity": "O(1)",
"arguments": [
{
"name": "timeout",
"type": "integer"
}
],
"since": "2.9.50",
"group": "server",
"returns": "status"
},
"CLIENT REPLY": {
"summary": "Instruct the server whether to reply to commands",
"complexity": "O(1)",
"arguments": [
{
"name": "reply-mode",
"type": "enum",
"enum": ["ON", "OFF", "SKIP"]
}
],
"since": "3.2",
"group": "server",
"returns": "integer"
},
"CLIENT SETNAME": {
"summary": "Set the current connection name",
"complexity": "O(1)",
"since": "2.6.9",
"arguments": [
{
"name": "connection-name",
"type": "string"
}
],
"group": "server",
"returns": "string"
},
"CLUSTER ADDSLOTS": {
"summary": "Assign new hash slots to receiving node",
"complexity": "O(N) where N is the total number of hash slot arguments",
"arguments": [
{
"name": "slot",
"type": "integer",
"multiple": true
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER COUNT-FAILURE-REPORTS": {
"summary": "Return the number of failure reports active for a given node",
"complexity": "O(N) where N is the number of failure reports",
"arguments": [
{
"name": "node-id",
"type": "string"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER COUNTKEYSINSLOT": {
"summary": "Return the number of local keys in the specified hash slot",
"complexity": "O(1)",
"arguments": [
{
"name": "slot",
"type": "integer"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER DELSLOTS": {
"summary": "Set hash slots as unbound in receiving node",
"complexity": "O(N) where N is the total number of hash slot arguments",
"arguments": [
{
"name": "slot",
"type": "integer",
"multiple": true
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER FAILOVER": {
"summary": "Forces a slave to perform a manual failover of its master.",
"complexity": "O(1)",
"arguments": [
{
"name": "options",
"type": "enum",
"enum": ["FORCE","TAKEOVER"],
"optional": true
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER FORGET": {
"summary": "Remove a node from the nodes table",
"complexity": "O(1)",
"arguments": [
{
"name": "node-id",
"type": "string"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER GETKEYSINSLOT": {
"summary": "Return local key names in the specified hash slot",
"complexity": "O(log(N)) where N is the number of requested keys",
"arguments": [
{
"name": "slot",
"type": "integer"
},
{
"name": "count",
"type": "integer"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER INFO": {
"summary": "Provides info about Redis Cluster node state",
"complexity": "O(1)",
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER KEYSLOT": {
"summary": "Returns the hash slot of the specified key",
"complexity": "O(N) where N is the number of bytes in the key",
"arguments": [
{
"name": "key",
"type": "string"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER MEET": {
"summary": "Force a node cluster to handshake with another node",
"complexity": "O(1)",
"arguments": [
{
"name": "ip",
"type": "string"
},
{
"name": "port",
"type": "integer"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER NODES": {
"summary": "Get Cluster config for the node",
"complexity": "O(N) where N is the total number of Cluster nodes",
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER REPLICATE": {
"summary": "Reconfigure a node as a slave of the specified master node",
"complexity": "O(1)",
"arguments": [
{
"name": "node-id",
"type": "string"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER RESET": {
"summary": "Reset a Redis Cluster node",
"complexity": "O(N) where N is the number of known nodes. The command may execute a FLUSHALL as a side effect.",
"arguments": [
{
"name": "reset-type",
"type": "enum",
"enum": ["HARD", "SOFT"],
"optional": true
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER SAVECONFIG": {
"summary": "Forces the node to save cluster state on disk",
"complexity": "O(1)",
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER SET-CONFIG-EPOCH": {
"summary": "Set the configuration epoch in a new node",
"complexity": "O(1)",
"arguments": [
{
"name": "config-epoch",
"type": "integer"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER SETSLOT": {
"summary": "Bind a hash slot to a specific node",
"complexity": "O(1)",
"arguments": [
{
"name": "slot",
"type": "integer"
},
{
"name": "subcommand",
"type": "enum",
"enum": ["IMPORTING", "MIGRATING", "STABLE", "NODE"]
},
{
"name": "node-id",
"type": "string",
"optional": true
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER SLAVES": {
"summary": "List slave nodes of the specified master node",
"complexity": "O(1)",
"arguments": [
{
"name": "node-id",
"type": "string"
}
],
"since": "3.0.0",
"group": "cluster"
},
"CLUSTER SLOTS": {
"summary": "Get array of Cluster slot to node mappings",
"complexity": "O(N) where N is the total number of Cluster nodes",
"since": "3.0.0",
"group": "cluster"
},
"COMMAND": {
"summary": "Get array of Redis command details",
"complexity": "O(N) where N is the total number of Redis commands",
"since": "2.8.13",
"group": "server",
"returns": "status"
},
"COMMAND COUNT": {
"summary": "Get total number of Redis commands",
"complexity": "O(1)",
"since": "2.8.13",
"group": "server",
"returns": "integer"
},
"COMMAND GETKEYS": {
"summary": "Extract keys given a full Redis command",
"complexity": "O(N) where N is the number of arguments to the command",
"since": "2.8.13",
"group": "server",
"returns": "list-string"
},
"COMMAND INFO": {
"summary": "Get array of specific Redis command details",
"complexity": "O(N) when N is number of commands to look up",
"since": "2.8.13",
"arguments": [
{
"name": "command-name",
"type": "string",
"multiple": true
}
],
"group": "server",
"returns": "list-string"
},
"CONFIG GET": {
"summary": "Get the value of a configuration parameter",
"arguments": [
{
"name": "parameter",
"type": "string"
}
],
"since": "2.0.0",
"group": "server",
"returns": "hash"
},
"CONFIG REWRITE": {
"summary": "Rewrite the configuration file with the in memory configuration",
"since": "2.8.0",
"group": "server",
"returns": "status"
},
"CONFIG SET": {
"summary": "Set a configuration parameter to the given value",
"arguments": [
{
"name": "parameter",
"type": "string"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.0.0",
"group": "server",
"returns": "status"
},
"CONFIG RESETSTAT": {
"summary": "Reset the stats returned by INFO",
"complexity": "O(1)",
"since": "2.0.0",
"group": "server",
"returns": "status"
},
"DBSIZE": {
"summary": "Return the number of keys in the selected database",
"since": "1.0.0",
"group": "server",
"returns": "integer"
},
"DEBUG OBJECT": {
"summary": "Get debugging information about a key",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "server",
"returns": "string"
},
"DEBUG SEGFAULT": {
"summary": "Make the server crash",
"since": "1.0.0",
"group": "server",
"returns": "string"
},
"DECR": {
"summary": "Decrement the integer value of a key by one",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "string",
"returns": "integer"
},
"DECRBY": {
"summary": "Decrement the integer value of a key by the given number",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "decrement",
"type": "integer"
}
],
"since": "1.0.0",
"group": "string",
"returns": "integer"
},
"DEL": {
"summary": "Delete a key",
"complexity": "O(N) where N is the number of keys that will be removed. When a key to remove holds a value other than a string, the individual complexity for this key is O(M) where M is the number of elements in the list, set, sorted set or hash. Removing a single key that holds a string value is O(1).",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "generic",
"returns": "integer"
},
"DISCARD": {
"summary": "Discard all commands issued after MULTI",
"since": "2.0.0",
"group": "transactions",
"returns": "status"
},
"DUMP": {
"summary": "Return a serialized version of the value stored at the specified key.",
"complexity": "O(1) to access the key and additional O(N*M) to serialized 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).",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.6.0",
"group": "generic",
"returns": "string"
},
"ECHO": {
"summary": "Echo the given string",
"arguments": [
{
"name": "message",
"type": "string"
}
],
"since": "1.0.0",
"group": "connection",
"returns": "string"
},
"EVAL": {
"summary": "Execute a Lua script server side",
"complexity": "Depends on the script that is executed.",
"arguments": [
{
"name": "script",
"type": "string"
},
{
"name": "numkeys",
"type": "integer"
},
{
"name": "key",
"type": "key",
"multiple": true
},
{
"name": "arg",
"type": "string",
"multiple": true
}
],
"since": "2.6.0",
"group": "scripting"
},
"EVALSHA": {
"summary": "Execute a Lua script server side",
"complexity": "Depends on the script that is executed.",
"arguments": [
{
"name": "sha1",
"type": "string"
},
{
"name": "numkeys",
"type": "integer"
},
{
"name": "key",
"type": "key",
"multiple": true
},
{
"name": "arg",
"type": "string",
"multiple": true
}
],
"since": "2.6.0",
"group": "scripting"
},
"EXEC": {
"summary": "Execute all commands issued after MULTI",
"since": "1.2.0",
"group": "transactions",
"returns": "reply"
},
"EXISTS": {
"summary": "Determine if a key exists",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "generic",
"returns": "bool"
},
"EXPIRE": {
"summary": "Set a key's time to live in seconds",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "seconds",
"type": "integer"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "bool"
},
"EXPIREAT": {
"summary": "Set the expiration for a key as a UNIX timestamp",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "timestamp",
"type": "posix time"
}
],
"since": "1.2.0",
"group": "generic",
"returns": "bool"
},
"FLUSHALL": {
"summary": "Remove all keys from all databases",
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"FLUSHDB": {
"summary": "Remove all keys from the current database",
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"GEOADD": {
"summary": "Add one or more geospatial items in the geospatial index represented using a sorted set",
"complexity": "O(log(N)) for each item added, where N is the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "longitude",
"type": "double"
},
{
"name": "latitude",
"type": "double"
},
{
"name": "member",
"type": "string"
}
],
"group": "geo"
},
"GEOHASH": {
"summary": "Returns members of a geospatial index as standard geohash strings",
"complexity": "O(log(N)) for each member requested, where N is the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string",
"multiple": true
}
],
"group": "geo"
},
"GEOPOS": {
"summary": "Returns longitude and latitude of members of a geospatial index",
"complexity": "O(log(N)) for each member requested, where N is the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string",
"multiple": true
}
],
"group": "geo"
},
"GEODIST": {
"summary": "Returns the distance between two members of a geospatial index",
"complexity": "O(log(N))",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member1",
"type": "string"
},
{
"name": "member2",
"type": "string"
},
{
"name": "unit",
"type": "string",
"optional": true
}
],
"group": "geo"
},
"GEORADIUS": {
"summary": "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point",
"complexity": "O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "longitude",
"type": "double"
},
{
"name": "latitude",
"type": "double"
},
{
"name": "radius",
"type": "double"
},
{
"name": "unit",
"type": "enum",
"enum": ["m", "km", "ft", "mi"]
},
{
"name": "withcoord",
"type": "enum",
"enum": ["WITHCOORD"],
"optional": true
},
{
"name": "withdist",
"type": "enum",
"enum": ["WITHDIST"],
"optional": true
},
{
"name": "withhash",
"type": "enum",
"enum": ["WITHHASH"],
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"group": "geo"
},
"GEORADIUSBYMEMBER": {
"summary": "Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member",
"complexity": "O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string"
},
{
"name": "radius",
"type": "double"
},
{
"name": "unit",
"type": "enum",
"enum": ["m", "km", "ft", "mi"]
},
{
"name": "withcoord",
"type": "enum",
"enum": ["WITHCOORD"],
"optional": true
},
{
"name": "withdist",
"type": "enum",
"enum": ["WITHDIST"],
"optional": true
},
{
"name": "withhash",
"type": "enum",
"enum": ["WITHHASH"],
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"group": "geo"
},
"GET": {
"summary": "Get the value of a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "string",
"returns": "maybe-string"
},
"GETBIT": {
"summary": "Returns the bit value at offset in the string value stored at key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "offset",
"type": "integer"
}
],
"since": "2.2.0",
"group": "string",
"returns": "integer"
},
"GETRANGE": {
"summary": "Get a substring of the string stored at a key",
"complexity": "O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "end",
"type": "integer"
}
],
"since": "2.4.0",
"group": "string",
"returns": "string"
},
"GETSET": {
"summary": "Set the string value of a key and return its old value",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
}
],
"since": "1.0.0",
"group": "string",
"returns": "maybe-string"
},
"HDEL": {
"summary": "Delete one or more hash fields",
"complexity": "O(N) where N is the number of fields to be removed.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string",
"multiple": true
}
],
"since": "2.0.0",
"group": "hash",
"returns": "integer"
},
"HEXISTS": {
"summary": "Determine if a hash field exists",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "bool"
},
"HGET": {
"summary": "Get the value of a hash field",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "maybe-string"
},
"HGETALL": {
"summary": "Get all the fields and values in a hash",
"complexity": "O(N) where N is the size of the hash.",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "hash"
},
"HINCRBY": {
"summary": "Increment the integer value of a hash field by the given number",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
},
{
"name": "increment",
"type": "integer"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "integer"
},
"HINCRBYFLOAT": {
"summary": "Increment the float value of a hash field by the given amount",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
},
{
"name": "increment",
"type": "double"
}
],
"since": "2.6.0",
"group": "hash",
"returns": "double"
},
"HKEYS": {
"summary": "Get all the fields in a hash",
"complexity": "O(N) where N is the size of the hash.",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "set"
},
"HLEN": {
"summary": "Get the number of fields in a hash",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "integer"
},
"HMGET": {
"summary": "Get the values of all the given hash fields",
"complexity": "O(N) where N is the number of fields being requested.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string",
"multiple": true
}
],
"since": "2.0.0",
"group": "hash",
"returns": "list-maybe"
},
"HMSET": {
"summary": "Set multiple hash fields to multiple values",
"complexity": "O(N) where N is the number of fields being set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": ["field", "value"],
"type": ["string", "string"],
"multiple": true
}
],
"since": "2.0.0",
"group": "hash",
"returns": "status"
},
"HSET": {
"summary": "Set the string value of a hash field",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "integer"
},
"HSETNX": {
"summary": "Set the value of a hash field, only if the field does not exist",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "bool"
},
"HSTRLEN": {
"summary": "Get the length of the value of a hash field",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "field",
"type": "string"
}
],
"since": "3.2.0",
"group": "hash",
"returns": "integer"
},
"HVALS": {
"summary": "Get all the values in a hash",
"complexity": "O(N) where N is the size of the hash.",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.0.0",
"group": "hash",
"returns": "set"
},
"INCR": {
"summary": "Increment the integer value of a key by one",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "string",
"returns": "integer"
},
"INCRBY": {
"summary": "Increment the integer value of a key by the given amount",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "increment",
"type": "integer"
}
],
"since": "1.0.0",
"group": "string",
"returns": "integer"
},
"INCRBYFLOAT": {
"summary": "Increment the float value of a key by the given amount",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "increment",
"type": "double"
}
],
"since": "2.6.0",
"group": "string",
"returns": "double"
},
"INFO": {
"summary": "Get information and statistics about the server",
"arguments": [
{
"name": "section",
"type": "string",
"optional": true
}
],
"since": "1.0.0",
"group": "server",
"returns": "string"
},
"KEYS": {
"summary": "Find all keys matching the given pattern",
"complexity": "O(N) with N being the number of keys in the database, under the assumption that the key names in the database and the given pattern have limited length.",
"arguments": [
{
"name": "pattern",
"type": "pattern"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "list-string"
},
"LASTSAVE": {
"summary": "Get the UNIX time stamp of the last successful save to disk",
"since": "1.0.0",
"group": "server",
"returns": "integer"
},
"LINDEX": {
"summary": "Get an element from a list by its index",
"complexity": "O(N) where N is the number of elements to traverse to get to the element at index. This makes asking for the first or the last element of the list O(1).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "index",
"type": "integer"
}
],
"since": "1.0.0",
"group": "list",
"returns": "maybe-string"
},
"LINSERT": {
"summary": "Insert an element before or after another element in a list",
"complexity": "O(N) where N is the number of elements to traverse before seeing the value pivot. This means that inserting somewhere on the left end on the list (head) can be considered O(1) and inserting somewhere on the right end (tail) is O(N).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "where",
"type": "enum",
"enum": ["BEFORE", "AFTER"]
},
{
"name": "pivot",
"type": "string"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.2.0",
"group": "list"
},
"LLEN": {
"summary": "Get the length of a list",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "list",
"returns": "integer"
},
"LPOP": {
"summary": "Remove and get the first element in a list",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "list",
"returns": "maybe-string"
},
"LPUSH": {
"summary": "Prepend one or multiple values to a list",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string",
"multiple": true
}
],
"since": "1.0.0",
"group": "list",
"returns": "integer"
},
"LPUSHX": {
"summary": "Prepend a value to a list, only if the list exists",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.2.0",
"group": "list",
"returns": "integer"
},
"LRANGE": {
"summary": "Get a range of elements from a list",
"complexity": "O(S+N) where S is the distance of start offset from HEAD for small lists, from nearest end (HEAD or TAIL) for large lists; and N is the number of elements in the specified range.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "stop",
"type": "integer"
}
],
"since": "1.0.0",
"group": "list",
"returns": "list-string"
},
"LREM": {
"summary": "Remove elements from a list",
"complexity": "O(N) where N is the length of the list.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "count",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "1.0.0",
"group": "list",
"returns": "integer"
},
"LSET": {
"summary": "Set the value of an element in a list by its index",
"complexity": "O(N) where N is the length of the list. Setting either the first or the last element of the list is O(1).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "index",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "1.0.0",
"group": "list",
"returns": "status"
},
"LTRIM": {
"summary": "Trim a list to the specified range",
"complexity": "O(N) where N is the number of elements to be removed by the operation.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "stop",
"type": "integer"
}
],
"since": "1.0.0",
"group": "list",
"returns": "status"
},
"MGET": {
"summary": "Get the values of all the given keys",
"complexity": "O(N) where N is the number of keys to retrieve.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "string",
"returns": "list-maybe"
},
"MIGRATE": {
"summary": "Atomically transfer a key from a Redis instance to another one.",
"complexity": "This command actually executes a DUMP+DEL in the source instance, and a RESTORE in the target instance. See the pages of these commands for time complexity. Also an O(N) data transfer between the two instances is performed.",
"arguments": [
{
"name": "host",
"type": "string"
},
{
"name": "port",
"type": "string"
},
{
"name": "key",
"type": "enum",
"enum": ["key", "\"\""]
},
{
"name": "destination-db",
"type": "integer"
},
{
"name": "timeout",
"type": "integer"
},
{
"name": "copy",
"type": "enum",
"enum": ["COPY"],
"optional": true
},
{
"name": "replace",
"type": "enum",
"enum": ["REPLACE"],
"optional": true
},
{
"name": "key",
"command": "KEYS",
"type": "key",
"variadic": true,
"optional": true
}
],
"since": "2.6.0",
"group": "generic",
"returns": "status"
},
"MONITOR": {
"summary": "Listen for all requests received by the server in real time",
"since": "1.0.0",
"group": "server"
},
"MOVE": {
"summary": "Move a key to another database",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "db",
"type": "integer"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "bool"
},
"MSET": {
"summary": "Set multiple keys to multiple values",
"complexity": "O(N) where N is the number of keys to set.",
"arguments": [
{
"name": ["key", "value"],
"type": ["key", "string"],
"multiple": true
}
],
"since": "1.0.1",
"group": "string",
"returns": "status"
},
"MSETNX": {
"summary": "Set multiple keys to multiple values, only if none of the keys exist",
"complexity": "O(N) where N is the number of keys to set.",
"arguments": [
{
"name": ["key", "value"],
"type": ["key", "string"],
"multiple": true
}
],
"since": "1.0.1",
"group": "string",
"returns": "bool"
},
"MULTI": {
"summary": "Mark the start of a transaction block",
"since": "1.2.0",
"group": "transactions",
"returns": "status"
},
"OBJECT": {
"summary": "Inspect the internals of Redis objects",
"complexity": "O(1) for all the currently implemented subcommands.",
"since": "2.2.3",
"group": "generic",
"arguments": [
{
"name": "subcommand",
"type": "string"
},
{
"name": "arguments",
"type": "string",
"optional": true,
"multiple": true
}
]
},
"PERSIST": {
"summary": "Remove the expiration from a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.2.0",
"group": "generic",
"returns": "bool"
},
"PEXPIRE": {
"summary": "Set a key's time to live in milliseconds",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "milliseconds",
"type": "integer"
}
],
"since": "2.6.0",
"group": "generic",
"returns": "bool"
},
"PEXPIREAT": {
"summary": "Set the expiration for a key as a UNIX timestamp specified in milliseconds",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "milliseconds-timestamp",
"type": "posix time"
}
],
"since": "2.6.0",
"group": "generic",
"returns": "bool"
},
"PFADD": {
"summary": "Adds all the elements arguments to the HyperLogLog data structure stored at the variable name specified as first argument.",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string",
"multiple": true
}
],
"since": "2.8.9",
"group": "hyperloglog",
"returns": "integer"
},
"PFCOUNT": {
"summary": "Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).",
"complexity": "O(1) with every small average constant times when called with a single key. O(N) with N being the number of keys, and much bigger constant times, when called with multiple keys.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "2.8.9",
"group": "hyperloglog",
"returns": "integer"
},
"PFMERGE": {
"summary": "Merge N different HyperLogLogs into a single one.",
"complexity": "O(N) to merge N HyperLogLogs, but with high constant times.",
"arguments": [
{
"name": "destkey",
"type": "key"
},
{
"name": "sourcekey",
"type": "key",
"multiple": true
}
],
"since": "2.8.9",
"group": "hyperloglog",
"returns": "string"
},
"PING": {
"summary": "Ping the server",
"since": "1.0.0",
"group": "connection",
"returns": "status"
},
"PSETEX": {
"summary": "Set the value and expiration in milliseconds of a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "milliseconds",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.6.0",
"group": "string",
"returns": "status"
},
"PSUBSCRIBE": {
"summary": "Listen for messages published to channels matching the given patterns",
"complexity": "O(N) where N is the number of patterns the client is already subscribed to.",
"arguments": [
{
"name": ["pattern"],
"type": ["pattern"],
"multiple": true
}
],
"since": "2.0.0",
"group": "pubsub"
},
"PUBSUB": {
"summary": "Inspect the state of the Pub/Sub subsystem",
"complexity": "O(N) for the CHANNELS subcommand, where N is the number of active channels, and assuming constant time pattern matching (relatively short channels and patterns). O(N) for the NUMSUB subcommand, where N is the number of requested channels. O(1) for the NUMPAT subcommand.",
"arguments": [
{
"name": "subcommand",
"type": "string"
},
{
"name": "argument",
"type": "string",
"optional": true,
"multiple": true
}
],
"since": "2.8.0",
"group": "pubsub"
},
"PTTL": {
"summary": "Get the time to live for a key in milliseconds",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.6.0",
"group": "generic",
"returns": "integer"
},
"PUBLISH": {
"summary": "Post a message to a channel",
"complexity": "O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).",
"arguments": [
{
"name": "channel",
"type": "string"
},
{
"name": "message",
"type": "string"
}
],
"since": "2.0.0",
"group": "pubsub"
},
"PUNSUBSCRIBE": {
"summary": "Stop listening for messages posted to channels matching the given patterns",
"complexity": "O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).",
"arguments": [
{
"name": "pattern",
"type": "pattern",
"optional": true,
"multiple": true
}
],
"since": "2.0.0",
"group": "pubsub"
},
"QUIT": {
"summary": "Close the connection",
"since": "1.0.0",
"group": "connection",
"returns": "status"
},
"RANDOMKEY": {
"summary": "Return a random key from the keyspace",
"complexity": "O(1)",
"since": "1.0.0",
"group": "generic",
"returns": "maybe-key"
},
"READONLY": {
"summary": "Enables read queries for a connection to a cluster slave node",
"complexity": "O(1)",
"since": "3.0.0",
"group": "cluster"
},
"READWRITE": {
"summary": "Disables read queries for a connection to a cluster slave node",
"complexity": "O(1)",
"since": "3.0.0",
"group": "cluster"
},
"RENAME": {
"summary": "Rename a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "newkey",
"type": "key"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "status"
},
"RENAMENX": {
"summary": "Rename a key, only if the new key does not exist",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "newkey",
"type": "key"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "bool"
},
"RESTORE": {
"summary": "Create a key using the provided serialized value, previously obtained using DUMP.",
"complexity": "O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, 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). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "time-to-live",
"type": "integer"
},
{
"name": "serialized-value",
"type": "string"
},
{
"name": "replace",
"type": "enum",
"enum": ["REPLACE"],
"optional": true
}
],
"since": "2.6.0",
"group": "generic",
"returns": "status"
},
"ROLE": {
"summary": "Return the role of the instance in the context of replication",
"since": "2.8.12",
"group": "server",
"returns": "list-string"
},
"RPOP": {
"summary": "Remove and get the last element in a list",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "list",
"returns": "maybe-string"
},
"RPOPLPUSH": {
"summary": "Remove the last element in a list, prepend it to another list and return it",
"complexity": "O(1)",
"arguments": [
{
"name": "source",
"type": "key"
},
{
"name": "destination",
"type": "key"
}
],
"since": "1.2.0",
"group": "list",
"returns": "maybe-string"
},
"RPUSH": {
"summary": "Append one or multiple values to a list",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string",
"multiple": true
}
],
"since": "1.0.0",
"group": "list",
"returns": "integer"
},
"RPUSHX": {
"summary": "Append a value to a list, only if the list exists",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.2.0",
"group": "list",
"returns": "integer"
},
"SADD": {
"summary": "Add one or more members to a set",
"complexity": "O(N) where N is the number of members to be added.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"SAVE": {
"summary": "Synchronously save the dataset to disk",
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"SCARD": {
"summary": "Get the number of members in a set",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"SCRIPT DEBUG": {
"summary": "Set the debug mode for executed scripts.",
"complexity": "O(1)",
"arguments": [
{
"name": "mode",
"type": "enum",
"enum": ["YES", "SYNC", "NO"]
}
],
"since": "3.2.0",
"group": "scripting",
"returns": "list-bool"
},
"SCRIPT EXISTS": {
"summary": "Check existence of scripts in the script cache.",
"complexity": "O(N) with N being the number of scripts to check (so checking a single script is an O(1) operation).",
"arguments": [
{
"name": "script",
"type": "string",
"multiple": true
}
],
"since": "2.6.0",
"group": "scripting",
"returns": "list-bool"
},
"SCRIPT FLUSH": {
"summary": "Remove all the scripts from the script cache.",
"complexity": "O(N) with N being the number of scripts in cache",
"since": "2.6.0",
"group": "scripting",
"returns": "status"
},
"SCRIPT KILL": {
"summary": "Kill the script currently in execution.",
"complexity": "O(1)",
"since": "2.6.0",
"group": "scripting",
"returns": "status"
},
"SCRIPT LOAD": {
"summary": "Load the specified Lua script into the script cache.",
"complexity": "O(N) with N being the length in bytes of the script body.",
"arguments": [
{
"name": "script",
"type": "string"
}
],
"since": "2.6.0",
"group": "scripting",
"returns": "string"
},
"SDIFF": {
"summary": "Subtract multiple sets",
"complexity": "O(N) where N is the total number of elements in all given sets.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "set"
},
"SDIFFSTORE": {
"summary": "Subtract multiple sets and store the resulting set in a key",
"complexity": "O(N) where N is the total number of elements in all given sets.",
"arguments": [
{
"name": "destination",
"type": "key"
},
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"SELECT": {
"summary": "Change the selected database for the current connection",
"arguments": [
{
"name": "index",
"type": "integer"
}
],
"since": "1.0.0",
"group": "connection",
"returns": "status"
},
"SET": {
"summary": "Set the string value of a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
},
{
"-command": "EX",
"name": "seconds",
"type": "integer",
"optional": true
},
{
"-command": "PX",
"name": "milliseconds",
"type": "integer",
"optional": true
},
{
"name": "condition",
"type": "enum",
"enum": ["NX", "XX"],
"optional": true
}
],
"since": "1.0.0",
"group": "string",
"returns": "status"
},
"SETBIT": {
"summary": "Sets or clears the bit at offset in the string value stored at key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "offset",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.2.0",
"group": "string",
"returns": "integer"
},
"SETEX": {
"summary": "Set the value and expiration of a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "seconds",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.0.0",
"group": "string",
"returns": "status"
},
"SETNX": {
"summary": "Set the value of a key, only if the key does not exist",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "value",
"type": "string"
}
],
"since": "1.0.0",
"group": "string",
"returns": "bool"
},
"SETRANGE": {
"summary": "Overwrite part of a string at key starting at the specified offset",
"complexity": "O(1), not counting the time taken to copy the new string in place. Usually, this string is very small so the amortized complexity is O(1). Otherwise, complexity is O(M) with M being the length of the value argument.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "offset",
"type": "integer"
},
{
"name": "value",
"type": "string"
}
],
"since": "2.2.0",
"group": "string",
"returns": "integer"
},
"SHUTDOWN": {
"summary": "Synchronously save the dataset to disk and then shut down the server",
"arguments": [
{
"name": "NOSAVE",
"type": "enum",
"enum": ["NOSAVE"],
"optional": true
},
{
"name": "SAVE",
"type": "enum",
"enum": ["SAVE"],
"optional": true
}
],
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"SINTER": {
"summary": "Intersect multiple sets",
"complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "set"
},
"SINTERSTORE": {
"summary": "Intersect multiple sets and store the resulting set in a key",
"complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.",
"arguments": [
{
"name": "destination",
"type": "key"
},
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"SISMEMBER": {
"summary": "Determine if a given value is a member of a set",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string"
}
],
"since": "1.0.0",
"group": "set",
"returns": "bool"
},
"SLAVEOF": {
"summary": "Make the server a slave of another instance, or promote it as master",
"arguments": [
{
"name": "host",
"type": "string"
},
{
"name": "port",
"type": "string"
}
],
"since": "1.0.0",
"group": "server",
"returns": "status"
},
"SLOWLOG": {
"summary": "Manages the Redis slow queries log",
"arguments": [
{
"name": "subcommand",
"type": "string"
},
{
"name": "argument",
"type": "string",
"optional": true
}
],
"since": "2.2.12",
"group": "server"
},
"SMEMBERS": {
"summary": "Get all the members in a set",
"complexity": "O(N) where N is the set cardinality.",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "set",
"returns": "set"
},
"SMOVE": {
"summary": "Move a member from one set to another",
"complexity": "O(1)",
"arguments": [
{
"name": "source",
"type": "key"
},
{
"name": "destination",
"type": "key"
},
{
"name": "member",
"type": "string"
}
],
"since": "1.0.0",
"group": "set",
"returns": "bool"
},
"SORT": {
"summary": "Sort the elements in a list, set or sorted set",
"complexity": "O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is currently O(N) as there is a copy step that will be avoided in next releases.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"command": "BY",
"name": "pattern",
"type": "pattern",
"optional": true
},
{
"command": "LIMIT",
"name": ["offset", "count"],
"type": ["integer", "integer"],
"optional": true
},
{
"command": "GET",
"name": "pattern",
"type": "string",
"optional": true,
"multiple": true
},
{
"name": "order",
"type": "enum",
"enum": ["ASC", "DESC"],
"optional": true
},
{
"name": "sorting",
"type": "enum",
"enum": ["ALPHA"],
"optional": true
},
{
"command": "STORE",
"name": "destination",
"type": "key",
"optional": true
}
],
"since": "1.0.0",
"group": "generic"
},
"SPOP": {
"summary": "Remove and return one or multiple random members from a set",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "maybe-string"
},
"SRANDMEMBER": {
"summary": "Get one or multiple random members from a set",
"complexity": "Without the count argument O(1), otherwise O(N) where N is the absolute value of the passed count.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "maybe-string"
},
"SREM": {
"summary": "Remove one or more members from a set",
"complexity": "O(N) where N is the number of members to be removed.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"STRLEN": {
"summary": "Get the length of the value stored in a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "2.2.0",
"group": "string",
"returns": "integer"
},
"SUBSCRIBE": {
"summary": "Listen for messages published to the given channels",
"complexity": "O(N) where N is the number of channels to subscribe to.",
"arguments": [
{
"name": ["channel"],
"type": ["string"],
"multiple": true
}
],
"since": "2.0.0",
"group": "pubsub"
},
"SUNION": {
"summary": "Add multiple sets",
"complexity": "O(N) where N is the total number of elements in all given sets.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "set"
},
"SUNIONSTORE": {
"summary": "Add multiple sets and store the resulting set in a key",
"complexity": "O(N) where N is the total number of elements in all given sets.",
"arguments": [
{
"name": "destination",
"type": "key"
},
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "1.0.0",
"group": "set",
"returns": "integer"
},
"SYNC": {
"summary": "Internal command used for replication",
"since": "1.0.0",
"group": "server"
},
"TIME": {
"summary": "Return the current server time",
"complexity": "O(1)",
"since": "2.6.0",
"group": "server",
"returns": "time"
},
"TTL": {
"summary": "Get the time to live for a key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "generic",
"returns": "integer"
},
"TYPE": {
"summary": "Determine the type stored at key",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.0.0",
"group": "generic"
},
"UNSUBSCRIBE": {
"summary": "Stop listening for messages posted to the given channels",
"complexity": "O(N) where N is the number of clients already subscribed to a channel.",
"arguments": [
{
"name": "channel",
"type": "string",
"optional": true,
"multiple": true
}
],
"since": "2.0.0",
"group": "pubsub"
},
"UNWATCH": {
"summary": "Forget about all watched keys",
"complexity": "O(1)",
"since": "2.2.0",
"group": "transactions",
"returns": "status"
},
"WAIT": {
"summary": "Wait for the synchronous replication of all the write commands sent in the context of the current connection",
"complexity": "O(1)",
"arguments": [
{
"name": "numslaves",
"type": "integer"
},
{
"name": "timeout",
"type": "integer"
}
],
"since": "3.0.0",
"group": "generic",
"returns": "integer"
},
"WATCH": {
"summary": "Watch the given keys to determine execution of the MULTI/EXEC block",
"complexity": "O(1) for every key.",
"arguments": [
{
"name": "key",
"type": "key",
"multiple": true
}
],
"since": "2.2.0",
"group": "transactions",
"returns": "status"
},
"ZADD": {
"summary": "Add one or more members to a sorted set, or update its score if it already exists",
"complexity": "O(log(N)) for each item added, where N is the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "condition",
"type": "enum",
"enum": ["NX","XX"],
"optional": true
},
{
"name": "change",
"type": "enum",
"enum": ["CH"],
"optional": true
},
{
"name": "increment",
"type": "enum",
"enum": ["INCR"],
"optional": true
},
{
"name": ["score", "member"],
"type": ["double", "string"],
"multiple": true
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "integer"
},
"ZCARD": {
"summary": "Get the number of members in a sorted set",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "integer"
},
"ZCOUNT": {
"summary": "Count the members in a sorted set with scores within the given values",
"complexity": "O(log(N)) with N being the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "double"
},
{
"name": "max",
"type": "double"
}
],
"since": "2.0.0",
"group": "sorted_set",
"returns": "integer"
},
"ZINCRBY": {
"summary": "Increment the score of a member in a sorted set",
"complexity": "O(log(N)) where N is the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "increment",
"type": "integer"
},
{
"name": "member",
"type": "string"
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "double"
},
"ZINTERSTORE": {
"summary": "Intersect multiple sorted sets and store the resulting sorted set in a new key",
"complexity": "O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.",
"arguments": [
{
"name": "destination",
"type": "key"
},
{
"name": "numkeys",
"type": "integer"
},
{
"name": "key",
"type": "key",
"multiple": true
},
{
"command": "WEIGHTS",
"name": "weight",
"type": "integer",
"variadic": true,
"optional": true
},
{
"command": "AGGREGATE",
"name": "aggregate",
"type": "enum",
"enum": ["SUM", "MIN", "MAX"],
"optional": true
}
],
"since": "2.0.0",
"group": "sorted_set"
},
"ZLEXCOUNT": {
"summary": "Count the number of members in a sorted set between a given lexicographical range",
"complexity": "O(log(N)) with N being the number of elements in the sorted set.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "string"
},
{
"name": "max",
"type": "string"
}
],
"since": "2.8.9",
"group": "sorted_set",
"returns": "integer"
},
"ZRANGE": {
"summary": "Return a range of members in a sorted set, by index",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "stop",
"type": "integer"
},
{
"name": "withscores",
"type": "enum",
"enum": ["WITHSCORES"],
"optional": true
}
],
"since": "1.2.0",
"group": "sorted_set"
},
"ZRANGEBYLEX": {
"summary": "Return a range of members in a sorted set, by lexicographical range",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "string"
},
{
"name": "max",
"type": "string"
},
{
"command": "LIMIT",
"name": ["offset", "count"],
"type": ["integer", "integer"],
"optional": true
}
],
"since": "2.8.9",
"group": "sorted_set",
"returns": "maybe-integer"
},
"ZREVRANGEBYLEX": {
"summary": "Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "max",
"type": "string"
},
{
"name": "min",
"type": "string"
},
{
"command": "LIMIT",
"name": ["offset", "count"],
"type": ["integer", "integer"],
"optional": true
}
],
"since": "2.8.9",
"group": "sorted_set",
"returns": "integer"
},
"ZRANGEBYSCORE": {
"summary": "Return a range of members in a sorted set, by score",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "double"
},
{
"name": "max",
"type": "double"
},
{
"name": "withscores",
"type": "enum",
"enum": ["WITHSCORES"],
"optional": true
},
{
"command": "LIMIT",
"name": ["offset", "count"],
"type": ["integer", "integer"],
"optional": true
}
],
"since": "1.0.5",
"group": "sorted_set",
"returns": "integer"
},
"ZRANK": {
"summary": "Determine the index of a member in a sorted set",
"complexity": "O(log(N))",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string"
}
],
"since": "2.0.0",
"group": "sorted_set",
"returns": "maybe-integer"
},
"ZREM": {
"summary": "Remove one or more members from a sorted set",
"complexity": "O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string",
"multiple": true
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "integer"
},
"ZREMRANGEBYLEX": {
"summary": "Remove all members in a sorted set between the given lexicographical range",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "string"
},
{
"name": "max",
"type": "string"
}
],
"since": "2.8.9",
"group": "sorted_set",
"returns": "integer"
},
"ZREMRANGEBYRANK": {
"summary": "Remove all members in a sorted set within the given indexes",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "stop",
"type": "integer"
}
],
"since": "2.0.0",
"group": "sorted_set",
"returns": "integer"
},
"ZREMRANGEBYSCORE": {
"summary": "Remove all members in a sorted set within the given scores",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "min",
"type": "double"
},
{
"name": "max",
"type": "double"
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "integer"
},
"ZREVRANGE": {
"summary": "Return a range of members in a sorted set, by index, with scores ordered from high to low",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "start",
"type": "integer"
},
{
"name": "stop",
"type": "integer"
},
{
"name": "withscores",
"type": "enum",
"enum": ["WITHSCORES"],
"optional": true
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "maybe-double"
},
"ZREVRANGEBYSCORE": {
"summary": "Return a range of members in a sorted set, by score, with scores ordered from high to low",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "max",
"type": "double"
},
{
"name": "min",
"type": "double"
},
{
"name": "withscores",
"type": "enum",
"enum": ["WITHSCORES"],
"optional": true
},
{
"command": "LIMIT",
"name": ["offset", "count"],
"type": ["integer", "integer"],
"optional": true
}
],
"since": "2.2.0",
"group": "sorted_set"
},
"ZREVRANK": {
"summary": "Determine the index of a member in a sorted set, with scores ordered from high to low",
"complexity": "O(log(N))",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string"
}
],
"since": "2.0.0",
"group": "sorted_set",
"returns": "maybe-integer"
},
"ZSCORE": {
"summary": "Get the score associated with the given member in a sorted set",
"complexity": "O(1)",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "member",
"type": "string"
}
],
"since": "1.2.0",
"group": "sorted_set",
"returns": "maybe-double"
},
"ZUNIONSTORE": {
"summary": "Add multiple sorted sets and store the resulting sorted set in a new key",
"complexity": "O(N)+O(M log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.",
"arguments": [
{
"name": "destination",
"type": "key"
},
{
"name": "numkeys",
"type": "integer"
},
{
"name": "key",
"type": "key",
"multiple": true
},
{
"command": "WEIGHTS",
"name": "weight",
"type": "integer",
"variadic": true,
"optional": true
},
{
"command": "AGGREGATE",
"name": "aggregate",
"type": "enum",
"enum": ["SUM", "MIN", "MAX"],
"optional": true
}
],
"since": "2.0.0",
"group": "sorted_set"
},
"SCAN": {
"summary": "Incrementally iterate the keys space",
"complexity": "O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection.",
"arguments": [
{
"name": "cursor",
"type": "integer"
},
{
"command": "MATCH",
"name": "pattern",
"type": "pattern",
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "2.8.0",
"group": "generic"
},
"SSCAN": {
"summary": "Incrementally iterate Set elements",
"complexity": "O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "cursor",
"type": "integer"
},
{
"command": "MATCH",
"name": "pattern",
"type": "pattern",
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "2.8.0",
"group": "set"
},
"HSCAN": {
"summary": "Incrementally iterate hash fields and associated values",
"complexity": "O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "cursor",
"type": "integer"
},
{
"command": "MATCH",
"name": "pattern",
"type": "pattern",
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "2.8.0",
"group": "hash"
},
"ZSCAN": {
"summary": "Incrementally iterate sorted sets elements and associated scores",
"complexity": "O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..",
"arguments": [
{
"name": "key",
"type": "key"
},
{
"name": "cursor",
"type": "integer"
},
{
"command": "MATCH",
"name": "pattern",
"type": "pattern",
"optional": true
},
{
"command": "COUNT",
"name": "count",
"type": "integer",
"optional": true
}
],
"since": "2.8.0",
"group": "sorted_set"
}
}
Reference in New Issue View Git Blame Copy Permalink