diff --git a/Changelog b/Changelog index 3a8c398e..08e26de8 100644 --- a/Changelog +++ b/Changelog @@ -1,3 +1,13 @@ +2009-05-20 Aman Gupta changes merged +2009-05-20 Merge git://github.com/tmm1/redis +2009-05-19 Allow timeout=0 config to disable client timeouts +2009-05-19 Partial qsort implemented in SORT command, only when both BY and LIMIT is used. minor fix for a warning compiling under Linux. +2009-05-19 psort.c/h added. This is a partial qsort implementation that Redis will use when SORT+LIMIT is requested +2009-05-17 Fix SINTER/UNIONSTORE to allow for &=/|= style operations (i.e. SINTERSTORE set1 set1 set2) +2009-05-17 Optimize SDIFF to return as soon as the result set is empty +2009-05-17 SDIFF/SDIFFSTORE implemnted unifying it with the implementation of SUNION/SUNIONSTORE +2009-05-11 timestamp in log lines +2009-05-11 Python client updated pushing from Ludo's repository 2009-05-11 disconnect when we cannot read from the socket 2009-05-11 benchmark utility now supports random keys 2009-05-10 minor doc changes diff --git a/doc/CommandReference.html b/doc/CommandReference.html index 724be24a..a83513c1 100644 --- a/doc/CommandReference.html +++ b/doc/CommandReference.html @@ -30,7 +30,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
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 all the members of the Set value at key
Add the specified member to the Set value at key
Remove the specified member 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
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
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
Return the members of a set resulting from the difference between the firstset provided and all the successive sets. Example:+
+key1 = x,a,b,c +key2 = c +key3 = a,d +SDIFF key1,key2,key3 => x,b +
Non existing keys are considered like empty sets.+
This commnad works exactly like SDIFF but instead of being returned the resulting set is sotred in dstkey.+