X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/8fb13ce816b85ac414921ecca420671bf74a3eea..779deb60f92ab2980c41f8cb408315fbac2fa54b:/doc/CommandReference.html diff --git a/doc/CommandReference.html b/doc/CommandReference.html index ec0376d4..647c1b0c 100644 --- a/doc/CommandReference.html +++ b/doc/CommandReference.html @@ -16,7 +16,7 @@
test if a key existsdelete a keyreturn the type of the value stored at keyreturn all the keys matching a given patternreturn a random key from the key spacerename the old key in the new one, destroing the newname key if it already existsrename the old key in the new one, if the newname key does not already existreturn the number of keys in the current dbset a time to live in seconds on a keyget the time to live in seconds of a keySelect the DB having the specified indexMove the key from the currently selected DB to the DB having as index dbindexRemove all the keys of the currently selected DBRemove all the keys from all the databasesset a key to a string valuereturn the string value of the keyset a key to a string returning the old value of the keymulti-get, return the strings values of the keysset a key to a string value if the key does not existset a multiple keys to multiple values in a single atomic operationset a multiple keys to multiple values in a single atomic operation if none of the keys already existincrement the integer value of key increment the integer value of key by integerdecrement the integer value of keydecrement the integer value of key by integerAppend an element to the tail of the List value at keyAppend an element to the head of the List value at keyReturn the length of the List value at keyReturn a range of elements from the List at keyTrim the list at key to the specified range of elementsReturn the element at index position from the List at keySet a new value as the element at index position of the List at keyRemove the first-N, last-N, or all the elements matching value from the List at keyReturn and remove (atomically) the first element of the List at keyReturn and remove (atomically) the last element of the List at keyReturn 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_set a key to a string valuereturn the string value of the keyset a key to a string returning the old value of the keymulti-get, return the strings values of the keysset a key to a string value if the key does not existSet+Expire combo commandset a multiple keys to multiple values in a single atomic operationset a multiple keys to multiple values in a single atomic operation if none of the keys already existincrement the integer value of key increment the integer value of key by integerdecrement the integer value of keydecrement the integer value of key by integerappend the specified string to the string stored at keyreturn a substring out of a larger stringAppend an element to the tail of the List value at keyAppend an element to the head of the List value at keyReturn the length of the List value at keyReturn a range of elements from the List at keyTrim the list at key to the specified range of elementsReturn the element at index position from the List at keySet a new value as the element at index position of the List at keyRemove the first-N, last-N, or all the elements matching value from the List at keyReturn and remove (atomically) the first element of the List at keyReturn and remove (atomically) the last element of the List at keyBlocking LPOPBlocking RPOPReturn 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 keyRemove the specified member from the Set value at keyRemove and return (pop) a random element from the Set value at keyMove the specified member from one Set to another atomicallyReturn the number of elements (the cardinality) of the Set at keyTest if the specified value is a member of the Set at keyReturn the intersection between the Sets stored at key1, key2, ..., keyNCompute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkeyReturn the union between the Sets stored at key1, key2, ..., keyNCompute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkeyReturn the difference between the Set stored at key1 and all the Sets key2, ..., keyNCompute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkeyReturn all the members of the Set value at keyReturn a random member of the Set value at keyAdd the specified member to the Sorted Set value at key or update the score if it already existRemove the specified member from the Sorted Set value at keyIf the member already exists increment its score by _increment_, otherwise add the member setting _increment_ as scoreReturn a range of elements from the sorted set at keyReturn 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 scoreReturn all the elements with score >= min and score <= max (a range query) from the sorted setReturn the cardinality (number of elements) of the sorted set at keyReturn the score associated with the specified element of the sorted set at keyRemove all the elements with score >= min and score <= max from the sorted setAdd the specified member to the Sorted Set value at key or update the score if it already existRemove the specified member from the Sorted Set value at keyIf the member already exists increment its score by _increment_, otherwise add the member setting _increment_ as scoreReturn the rank (or index) or _member_ in the sorted set at _key_, with scores being ordered from low to highReturn the rank (or index) or _member_ in the sorted set at _key_, with scores being ordered from high to lowReturn a range of elements from the sorted set at keyReturn 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 scoreReturn all the elements with score >= min and score <= max (a range query) from the sorted setReturn the cardinality (number of elements) of the sorted set at keyReturn the score associated with the specified element of the sorted set at keyRemove all the elements with rank >= min and rank <= max from the sorted setRemove all the elements with score >= min and score <= max from the sorted setPerform a union or intersection over a number of sorted sets with optional weight and aggregateSet 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 hashRemove the specified field from a hashReturn 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 parametersRedis atomic transactionsRedis Public/Subscribe messaging paradigm implementationSynchronously save the DB on diskAsynchronously save the DB on diskReturn the UNIX time stamp of the last successfully saving of the dataset on diskSynchronously save the DB on disk, then shutdown the serverRewrite the append only file in background when it gets too bigProvide information and statistics about the serverDump all the received requests in real timeChange the replication settings