X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/02fdd5ab4c8691156c150bc3948cbebbe8b208ad..49128f0b9da725de992e427fa341a837bcc2991b:/doc/CommandReference.html?ds=inline diff --git a/doc/CommandReference.html b/doc/CommandReference.html index 5ade73b9..647c1b0c 100644 --- a/doc/CommandReference.html +++ b/doc/CommandReference.html @@ -16,7 +16,7 @@
set a key to a string value
return the string value of the key
set a key to a string returning the old value of the key
multi-get, return the strings values of the keys
set a key to a string value if the key does not exist
increment the integer value of key
increment the integer value of key by integer
decrement the integer value of key
decrement the integer value of key by integer
test if a key exists
delete a key
return the type of the value stored at key
return all the keys matching a given pattern
return a random key from the key space
rename the old key in the new one, destroing the newname key if it already exists
rename the old key in the new one, if the newname key does not already exist
return the number of keys in the current db
set a time to live in seconds on a key
Append an element to the tail of the List value at key
Append an element to the head of the List value at key
Return the length of the List value at key
Return a range of elements from the List at key
Trim the list at key to the specified range of elements
Return the element at index position from the List at key
Set a new value as the element at index position of the List at key
Remove the first-N, last-N, or all the elements matching value from the List at key
Return and remove (atomically) the first element of the List at key
Return and remove (atomically) the last element of the List at key
Add the specified member to the Set value at key
Remove the specified member from the Set value at key
Return the number of elements (the cardinality) of the Set at key
Test if the specified value is a member of the Set at key
Return the intersection between the Sets stored at key1, key2, ..., keyN
Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey
Return the union between the Sets stored at key1, key2, ..., keyN
Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey
Return all the members of the Set value at key
Select the DB having the specified index
Move the key from the currently selected DB to the DB having as index dbindex
Remove all the keys of the currently selected DB
Remove all the keys from all the databases
test if a key exists
delete a key
return the type of the value stored at key
return all the keys matching a given pattern
return a random key from the key space
rename the old key in the new one, destroing the newname key if it already exists
rename the old key in the new one, if the newname key does not already exist
return the number of keys in the current db
set a time to live in seconds on a key
get the time to live in seconds of a key
Select the DB having the specified index
Move the key from the currently selected DB to the DB having as index dbindex
Remove all the keys of the currently selected DB
Remove all the keys from all the databases
set a key to a string value
return the string value of the key
set a key to a string returning the old value of the key
multi-get, return the strings values of the keys
set a key to a string value if the key does not exist
Set+Expire combo command
set a multiple keys to multiple values in a single atomic operation
set a multiple keys to multiple values in a single atomic operation if none of the keys already exist
increment the integer value of key
increment the integer value of key by integer
decrement the integer value of key
decrement the integer value of key by integer
append the specified string to the string stored at key
return a substring out of a larger string
Append an element to the tail of the List value at key
Append an element to the head of the List value at key
Return the length of the List value at key
Return a range of elements from the List at key
Trim the list at key to the specified range of elements
Return the element at index position from the List at key
Set a new value as the element at index position of the List at key
Remove the first-N, last-N, or all the elements matching value from the List at key
Return and remove (atomically) the first element of the List at key
Return and remove (atomically) the last element of the List at key
Blocking LPOP
Blocking RPOP
Return and remove (atomically) the last element of the source List stored at _srckey_ and push the same element to the destination List stored at _dstkey_
Add the specified member to the Set value at key
Remove the specified member from the Set value at key
Remove and return (pop) a random element from the Set value at key
Move the specified member from one Set to another atomically
Return the number of elements (the cardinality) of the Set at key
Test if the specified value is a member of the Set at key
Return the intersection between the Sets stored at key1, key2, ..., keyN
Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey
Return the union between the Sets stored at key1, key2, ..., keyN
Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey
Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN
Compute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkey
Return all the members of the Set value at key
Return a random member of the Set value at key
Add the specified member to the Sorted Set value at key or update the score if it already exist
Remove the specified member from the Sorted Set value at key
If the member already exists increment its score by _increment_, otherwise add the member setting _increment_ as score
Return the rank (or index) or _member_ in the sorted set at _key_, with scores being ordered from low to high
Return the rank (or index) or _member_ in the sorted set at _key_, with scores being ordered from high to low
Return a range of elements from the sorted set at key
Return a range of elements from the sorted set at key, exactly like ZRANGE, but the sorted set is ordered in traversed in reverse order, from the greatest to the smallest score
Return all the elements with score >= min and score <= max (a range query) from the sorted set
Return the cardinality (number of elements) of the sorted set at key
Return the score associated with the specified element of the sorted set at key
Remove all the elements with rank >= min and rank <= max from the sorted set
Remove all the elements with score >= min and score <= max from the sorted set
Perform a union or intersection over a number of sorted sets with optional weight and aggregate
Set the hash field to the specified value. Creates the hash if needed.
Retrieve the value of the specified hash field.
Set the hash fields to their respective values.
Increment the integer value of the hash at _key_ on _field_ with _integer_.
Test for existence of a specified field in a hash
Remove the specified field from a hash
Return the number of items in a hash.
Return all the fields in a hash.
Return all the values in a hash.
Return all the fields and associated values in a hash.
Sort a Set or a List accordingly to the specified parameters
Synchronously save the DB on disk
Asynchronously save the DB on disk
Return the UNIX time stamp of the last successfully saving of the dataset on disk
Synchronously save the DB on disk, then shutdown the server
Provide information and statistics about the server
Dump all the received requests in real time
Redis atomic transactions
Redis Public/Subscribe messaging paradigm implementation
Synchronously save the DB on disk
Asynchronously save the DB on disk
Return the UNIX time stamp of the last successfully saving of the dataset on disk
Synchronously save the DB on disk, then shutdown the server
Rewrite the append only file in background when it gets too big