diff --git a/Changelog b/Changelog index bdd99731..ee11a10a 100644 --- a/Changelog +++ b/Changelog @@ -1,3 +1,5 @@ +2009-04-28 less CPU usage in command parsing, case insensitive config directives +2009-04-28 GETSET command doc added 2009-04-28 GETSET tests 2009-04-28 GETSET implemented 2009-04-27 ability to specify a different file name for the DB diff --git a/TODO b/TODO index bb162494..e236352c 100644 --- a/TODO +++ b/TODO @@ -1,5 +1,6 @@ BEFORE REDIS 1.0.0-rc1 +- SMOVE _key1_ _key2_ _ele_. Pop an element form _key1_ and push (SADD or LPUSH) it nto _key2_. - What happens if the saving child gets killed instead to end normally? Handle this. - Make sinterstore / unionstore / sdiffstore returning the cardinality of the resulting set. - Remove max number of args limit diff --git a/doc/CommandReference.html b/doc/CommandReference.html index 5ade73b9..724be24a 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
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 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
the cardinality (number of elements) of the set as an integer.
Return the members of a set resulting from the intersection of all thesets hold at the specified keys. Like in LRANGE the result is sent tothe client as a multi-bulk reply (see the protocol specification formore information). If just a single key is specified, then this commandproduces the same result as SELEMENTS. Actually SELEMENTS is just syntaxsugar for SINTERSECT.
Non existing keys are considered like empty sets, so if one of the keys ismissing an empty set is returned (since the intersection with an emptyset always is an empty set).
* SREM* SISMEMBER* SCARD* SMEMBERS* SINTERSTORE* SUNION* SUNIONSTORE+
* SADD* SREM* SISMEMBER* SCARD* SMEMBERS* SINTERSTORE* SUNION* SUNIONSTORE* SMOVEdiff --git a/doc/SinterstoreCommand.html b/doc/SinterstoreCommand.html index 02757ccf..798e7519 100644 --- a/doc/SinterstoreCommand.html +++ b/doc/SinterstoreCommand.html @@ -29,7 +29,7 @@
This commnad works exactly like SINTER but instead of being returned the resulting set is sotred as _dstkey_.
* SREM* SISMEMBER* SCARD* SMEMBERS* SINTER* SINTERSTORE+
* SADD* SREM* SISMEMBER* SCARD* SMEMBERS* SINTER* SINTERSTORE* SMOVEdiff --git a/doc/SismemberCommand.html b/doc/SismemberCommand.html index 0b321637..fb900c47 100644 --- a/doc/SismemberCommand.html +++ b/doc/SismemberCommand.html @@ -32,7 +32,7 @@ 1 if the element is a member of the set 0 if the element is not a member of the set OR if the key does not exist
Return all the members (elements) of the set value stored at key. Thisis just syntax glue for SINTERSECT.
Move the specifided member from the set at srckey to the set at dstkey.This operation is atomic, in every given moment the element will appear tobe in the source or destination set for accessing clients.+
If the source set does not exist or does not contain the specified elementno operation is performed and zero is returned, otherwise the element isremoved from the source set and added to the destination set. On successone is returned, even if the element was already present in the destionationset.+
An error is raised if the source or destination keys contain a non Set value.+
+1 if the element was moved +0 if the element was not found on the first set and no operation was performed +
Note that GET can be used multiple times in order to get more keys forevery element of the original List or Set sorted.
Return the members of a set resulting from the union of all thesets hold at the specified keys. Like in LRANGE the result is sent tothe client as a multi-bulk reply (see the protocol specification formore information). If just a single key is specified, then this commandproduces the same result as SELEMENTS.
Non existing keys are considered like empty sets.
This commnad works exactly like SUNION but instead of being returned the resulting set is sotred as dstkey.