diff --git a/TODO b/TODO index 4cfc6e4c3..74f133476 100644 --- a/TODO +++ b/TODO @@ -1,12 +1,5 @@ Redis TODO and Roadmap -VERSION 1.2 TODO (Zsets, Integer encoding, Append only journal) -=============================================================== - -Most of the features already implemented for this release. The following is a list of the missing things in order to release the first beta tar.gz: - -* Continue adding tests accordingly to gcov output. - VERSION 1.4 TODO (Hash type) ============================ diff --git a/doc/CommandReference.html b/doc/CommandReference.html index b2586d16a..ec0376d49 100644 --- a/doc/CommandReference.html +++ b/doc/CommandReference.html @@ -31,7 +31,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
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 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
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 Set value at key or update the score if it already exist
Remove the specified member from the Set value at key
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 score >= min and score <= max from the sorted set
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 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 score >= min and score <= max from the sorted set
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
Rewrite the append only file in background when it gets too big
Provide information and statistics about the server
Dump all the received requests in real time
Change the replication settings
Returns all the keys matching the glob-style pattern asspace separated strings. For example if you have in thedatabase the keys "foo" and "foobar" the command "KEYS foo*
"will return "foo foobar".
-Note that while the time complexity for this operation is O(n)the constant times are pretty low. For example Redis runningon an entry level laptop can scan a 1 million keys databasein 40 milliseconds. Still it's better to consider this one ofthe slow commands that may ruin the DB performance if not usedwith care.+
Note that while the time complexity for this operation is O(n)the constant times are pretty low. For example Redis runningon an entry level laptop can scan a 1 million keys databasein 40 milliseconds. Still it's better to consider this one of +the slow commands that may ruin the DB performance if not usedwith care*.+In other words this command is intended only for debugging and *special* operations like creating a script to change the DB schema. Don't use it in your normal code. Use Redis Sets in order to group together a subset of objects.Glob style patterns examples: -+
- h?llo will match hello hallo hhllo
- hllo will match hllo heeeello -
* haello will match hello and hallo, but not hilloUse \ to escape special chars if you want to match them verbatim.Return value
Bulk reply, specifically a string in the form of space separated list of keys. Note that most client libraries will return an Array of keys and not a single string with space separated keys (that is, split by " " is performed in the client library usually). -* h?llo will match hello hallo hhllo* h*llo will match hllo heeeello* hUse \ to escape special chars if you want to match them verbatim.[
ae]
llo will match hello and hallo, but not hilloReturn value
Bulk reply, specifically a string in the form of space separated list of keys. Note that most client libraries will return an Array of keys and not a single string with space separated keys (that is, split by " " is performed in the client library usually).
If member already exists in the sorted set adds the increment to its scoreand updates the position of the element in the sorted set accordingly.If member does not already exist in the sorted set it is added with_increment_ as score (that is, like if the previous score was virtually zero).If key does not exist a new sorted set with the specified_member_ as sole member is crated. If the key exists but does not hold asorted set value an error is returned.+
The score value can be the string representation of a double precision floatingpoint number. It's possible to provide a negative value to perform a decrement.+
For an introduction to sorted sets check the Introduction to Redis data types page.+
+The score of the member after the increment is performed. ++