Commit ad94bc31 authored by Vitaly Arbuzov's avatar Vitaly Arbuzov
Browse files

Merge branch 'unstable' into dict-split-by-slot

parents a08686a5 e55568ed
{ {
"SENTINEL": { "SENTINEL": {
"summary": "A container for Sentinel commands", "summary": "A container for Redis Sentinel commands.",
"complexity": "Depends on subcommand.", "complexity": "Depends on subcommand.",
"group": "sentinel", "group": "sentinel",
"since": "2.8.4", "since": "2.8.4",
......
{ {
"SET": { "SET": {
"summary": "Set the string value of a key", "summary": "Sets the string value of a key, ignoring its type. The key is created if it doesn't exist.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SETBIT": { "SETBIT": {
"summary": "Sets or clears the bit at offset in the string value stored at key", "summary": "Sets or clears the bit at offset of the string value. Creates the key if it doesn't exist.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "bitmap", "group": "bitmap",
"since": "2.2.0", "since": "2.2.0",
......
{ {
"SETEX": { "SETEX": {
"summary": "Set the value and expiration of a key", "summary": "Sets the string value and expiration time of a key. Creates the key if it doesn't exist.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"SETNX": { "SETNX": {
"summary": "Set the value of a key, only if the key does not exist", "summary": "Set the string value of a key only when the key doesn't exist.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SETRANGE": { "SETRANGE": {
"summary": "Overwrite part of a string at key starting at the specified offset", "summary": "Overwrites a part of a string value with another by an offset. Creates the key if it doesn't exist.",
"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.", "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.",
"group": "string", "group": "string",
"since": "2.2.0", "since": "2.2.0",
......
{ {
"SHUTDOWN": { "SHUTDOWN": {
"summary": "Synchronously save the dataset to disk and then shut down the server", "summary": "Synchronously saves the database(s) to disk and shuts down the Redis server.",
"complexity": "O(N) when saving, where N is the total number of keys in all databases when saving data, otherwise O(1)", "complexity": "O(N) when saving, where N is the total number of keys in all databases when saving data, otherwise O(1)",
"group": "server", "group": "server",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SINTER": { "SINTER": {
"summary": "Intersect multiple sets", "summary": "Returns 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.", "complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.",
"group": "set", "group": "set",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SINTERCARD": { "SINTERCARD": {
"summary": "Intersect multiple sets and return the cardinality of the result", "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.", "complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.",
"group": "set", "group": "set",
"since": "7.0.0", "since": "7.0.0",
......
{ {
"SINTERSTORE": { "SINTERSTORE": {
"summary": "Intersect multiple sets and store the resulting set in a key", "summary": "Stores the intersect of multiple sets 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.", "complexity": "O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.",
"group": "set", "group": "set",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SISMEMBER": { "SISMEMBER": {
"summary": "Determine if a given value is a member of a set", "summary": "Determines whether a member belongs to a set.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "set", "group": "set",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SLAVEOF": { "SLAVEOF": {
"summary": "Make the server a replica of another instance, or promote it as master.", "summary": "Sets a Redis server as a replica of another, or promotes it to being a master.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "server", "group": "server",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"GET": { "GET": {
"summary": "Get the slow log's entries", "summary": "Returns the slow log's entries.",
"complexity": "O(N) where N is the number of entries returned", "complexity": "O(N) where N is the number of entries returned",
"group": "server", "group": "server",
"since": "2.2.12", "since": "2.2.12",
......
{ {
"LEN": { "LEN": {
"summary": "Get the slow log's length", "summary": "Returns the number of entries in the slow log.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "server", "group": "server",
"since": "2.2.12", "since": "2.2.12",
......
{ {
"RESET": { "RESET": {
"summary": "Clear all entries from the slow log", "summary": "Clears all entries from the slow log.",
"complexity": "O(N) where N is the number of entries in the slowlog", "complexity": "O(N) where N is the number of entries in the slowlog",
"group": "server", "group": "server",
"since": "2.2.12", "since": "2.2.12",
......
{ {
"SLOWLOG": { "SLOWLOG": {
"summary": "A container for slow log commands", "summary": "A container for slow log commands.",
"complexity": "Depends on subcommand.", "complexity": "Depends on subcommand.",
"group": "server", "group": "server",
"since": "2.2.12", "since": "2.2.12",
......
{ {
"SMEMBERS": { "SMEMBERS": {
"summary": "Get all the members in a set", "summary": "Returns all members of a set.",
"complexity": "O(N) where N is the set cardinality.", "complexity": "O(N) where N is the set cardinality.",
"group": "set", "group": "set",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SMISMEMBER": { "SMISMEMBER": {
"summary": "Returns the membership associated with the given elements for a set", "summary": "Determines whether multiple members belong to a set.",
"complexity": "O(N) where N is the number of elements being checked for membership", "complexity": "O(N) where N is the number of elements being checked for membership",
"group": "set", "group": "set",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"SMOVE": { "SMOVE": {
"summary": "Move a member from one set to another", "summary": "Moves a member from one set to another.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "set", "group": "set",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"SORT": { "SORT": {
"summary": "Sort the elements in a list, set or sorted set", "summary": "Sorts the elements in a list, a set, or a sorted set, optionally storing the result.",
"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 O(N).", "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 O(N).",
"group": "generic", "group": "generic",
"since": "1.0.0", "since": "1.0.0",
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment