diff --git a/Changelog b/Changelog
index b89a1989..0ce9bb4b 100644
--- a/Changelog
+++ b/Changelog
@@ -1,3 +1,12 @@
+2009-06-14 Clojure library thanks to Ragnar Dahlén
+2009-06-10 It is now possible to specify - as config file name to read it from stdin
+2009-06-10 sync with jodosha redis-rb
+2009-06-10 Redis-rb sync
+2009-06-10 max inline request raised again to 1024*1024*256 bytes
+2009-06-10 max bytes in an inline command raised to 1024*1024 bytes, in order to allow for very large MGETs and still protect from client crashes
+2009-06-08 SPOP implemented. Hash table resizing for Sets and Expires too. Changed the resize policy to play better with RANDOMKEY and SPOP.
+2009-06-07 some minor changes to the backtrace code
+2009-06-07 enable backtrace capabilities only for Linux and MacOSX
2009-06-07 Dump a backtrace on sigsegv/sigbus, original coded thanks to Diego Rosario Brogna, modified in order to work on different OSes and to enhance reliability
2009-06-06 Merge git://github.com/dierbro/redis
2009-06-06 add more output
diff --git a/doc/CommandReference.html b/doc/CommandReference.html
index aa1f0e9f..d44fb1e1 100644
--- a/doc/CommandReference.html
+++ b/doc/CommandReference.html
@@ -30,7 +30,7 @@
SET key value set a key to a string value GET key return the string value of the key GETSET key value set a key to a string returning the old value of the key MGET key1 key2 ... keyN multi-get, return the strings values of the keys SETNX key value set a key to a string value if the key does not exist INCR key increment the integer value of key INCRBY key integer increment the integer value of key by integer DECR key decrement the integer value of key DECRBY key integer decrement the integer value of key by integer EXISTS key test if a key exists DEL key delete a key TYPE key return the type of the value stored at key KEYS pattern return all the keys matching a given pattern RANDOMKEY return a random key from the key space RENAME oldname newname rename the old key in the new one, destroing the newname key if it already exists RENAMENX oldname newname rename the old key in the new one, if the newname key does not already exist DBSIZE return the number of keys in the current db EXPIRE set a time to live in seconds on a key TTL get the time to live in seconds of a key RPUSH key value Append an element to the tail of the List value at key LPUSH key value Append an element to the head of the List value at key LLEN key Return the length of the List value at key LRANGE key start end Return a range of elements from the List at key LTRIM key start end Trim the list at key to the specified range of elements LINDEX key index Return the element at index position from the List at key LSET key index value Set a new value as the element at index position of the List at key LREM key count value Remove the first-N, last-N, or all the elements matching value from the List at key LPOP key Return and remove (atomically) the first element of the List at key RPOP key Return and remove (atomically) the last element of the List at key SADD key member Add the specified member to the Set value at key SREM key member Remove the specified member from the Set value at key SMOVE srckey dstkey member Move the specified member from one Set to another atomically SCARD key Return the number of elements (the cardinality) of the Set at key SISMEMBER key member Test if the specified value is a member of the Set at key SINTER key1 key2 ... keyN Return the intersection between the Sets stored at key1, key2, ..., keyN SINTERSTORE dstkey key1 key2 ... keyN Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey SUNION key1 key2 ... keyN Return the union between the Sets stored at key1, key2, ..., keyN SUNIONSTORE dstkey key1 key2 ... keyN Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey SDIFF key1 key2 ... keyN Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN SDIFFSTORE dstkey key1 key2 ... keyN Compute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkey SMEMBERS key Return all the members of the Set value at key SADD key member Add the specified member to the Set value at key SREM key member Remove the specified member from the Set value at key SPOP key Remove and return (pop) a random element from the Set value at key SMOVE srckey dstkey member Move the specified member from one Set to another atomically SCARD key Return the number of elements (the cardinality) of the Set at key SISMEMBER key member Test if the specified value is a member of the Set at key SINTER key1 key2 ... keyN Return the intersection between the Sets stored at key1, key2, ..., keyN SINTERSTORE dstkey key1 key2 ... keyN Compute the intersection between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey SUNION key1 key2 ... keyN Return the union between the Sets stored at key1, key2, ..., keyN SUNIONSTORE dstkey key1 key2 ... keyN Compute the union between the Sets stored at key1, key2, ..., keyN, and store the resulting Set at dstkey SDIFF key1 key2 ... keyN Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN SDIFFSTORE dstkey key1 key2 ... keyN Compute the difference between the Set key1 and all the Sets key2, ..., keyN, and store the resulting Set at dstkey SMEMBERS key Return all the members of the Set value at key SELECT index Select the DB having the specified index MOVE key dbindex Move the key from the currently selected DB to the DB having as index dbindex FLUSHDB Remove all the keys of the currently selected DB FLUSHALL Remove all the keys from all the databases SORT key BY pattern LIMIT start end GET pattern ASC|DESC ALPHA Sort a Set or a List accordingly to the specified parameters SAVE Synchronously save the DB on disk BGSAVE Asynchronously save the DB on disk LASTSAVE Return the UNIX time stamp of the last successfully saving of the dataset on disk SHUTDOWN Synchronously save the DB on disk, then shutdown the server
+
+
+
+
+
+
+
SpopCommand
+
+
+
+
+
+
+
+
Time complexity O(1) Pop a random element from a Set, and return it to the caller. If the key does not exist or if the key contains an empty Set a special 'nil' value is returned.
+
bulk reply
+
+
+
+
+
+
+