carmine.core — carmine 0.8.3-SNAPSHOT

Deliberately simple, high-performance Redis (2.0+) client for Clojure.

append clj

(append key value)

APPEND key value

Append a value to a key.

Available since: 2.0.0.

Time complexity: O(1). The amortized time complexity is O(1) assuming the appended value is small and the already present value is of any size, since the dynamic string library used by Redis will double the free space available on every reallocation.

atomically clj macro

(atomically watch-keys & body)

Executes all Redis commands in body as a single transaction and returns server response vector or the empty vector if transaction failed.

Body may contain a (discard) call to abort transaction.

auth clj

(auth password)

AUTH password

Authenticate to the server.

Available since: 1.0.0.

Time complexity:

bgrewriteaof clj

(bgrewriteaof)

BGREWRITEAOF

Asynchronously rewrite the append-only file.

Available since: 1.0.0.

Time complexity:

bgsave clj

(bgsave)

BGSAVE

Asynchronously save the dataset to disk.

Available since: 1.0.0.

Time complexity:

bitcount clj

(bitcount key & args)

BITCOUNT key [start] [end]

Count set bits in a string.

Available since: 2.6.0.

Time complexity: O(N)

bitop clj

(bitop operation destkey key & args)

BITOP operation destkey key [key ...]

Perform bitwise operations between strings.

Available since: 2.6.0.

Time complexity: O(N)

blpop clj

(blpop key & args)

BLPOP key [key ...] timeout

Remove and get the first element in a list, or block until one is available.

Available since: 2.0.0.

Time complexity: O(1)

brpop clj

(brpop key & args)

BRPOP key [key ...] timeout

Remove and get the last element in a list, or block until one is available.

Available since: 2.0.0.

Time complexity: O(1)

brpoplpush clj

(brpoplpush source destination timeout)

BRPOPLPUSH source destination timeout

Pop a value from a list, push it to another list and return it; or block until one is available.

Available since: 2.2.0.

Time complexity: O(1)

close-listener clj

(close-listener listener)

config-get clj

(config-get parameter)

CONFIG GET parameter

Get the value of a configuration parameter.

Available since: 2.0.0.

Time complexity:

config-resetstat clj

(config-resetstat)

CONFIG RESETSTAT

Reset the stats returned by INFO.

Available since: 2.0.0.

Time complexity: O(1)

config-set clj

(config-set parameter value)

CONFIG SET parameter value

Set a configuration parameter to the given value.

Available since: 2.0.0.

Time complexity:

dbsize clj

(dbsize)

DBSIZE

Return the number of keys in the selected database.

Available since: 1.0.0.

Time complexity:

debug-object clj

(debug-object key)

DEBUG OBJECT key

Get debugging information about a key.

Available since: 1.0.0.

Time complexity:

debug-segfault clj

(debug-segfault)

DEBUG SEGFAULT

Make the server crash.

Available since: 1.0.0.

Time complexity:

decr clj

(decr key)

DECR key

Decrement the integer value of a key by one.

Available since: 1.0.0.

Time complexity: O(1)

decrby clj

(decrby key decrement)

DECRBY key decrement

Decrement the integer value of a key by the given number.

Available since: 1.0.0.

Time complexity: O(1)

del clj

(del key & args)

DEL key [key ...]

Delete a key.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of keys that will be removed. When a key to remove holds a value other than a string, the individual complexity for this key is O(M) where M is the number of elements in the list, set, sorted set or hash. Removing a single key that holds a string value is O(1).

discard clj

(discard)

DISCARD

Discard all commands issued after MULTI.

Available since: 2.0.0.

Time complexity:

dump clj

(dump key)

DUMP key

Return a serialized version of the value stored at the specified key..

Available since: 2.6.0.

Time complexity: O(1) to access the key and additional O(NM) to serialized it, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1M) where M is small, so simply O(1).

echo clj

(echo message)

ECHO message

Echo the given string.

Available since: 1.0.0.

Time complexity:

eval clj

(eval script numkeys key & args)

EVAL script numkeys key [key ...] arg [arg ...]

Execute a Lua script server side.

Available since: 2.6.0.

Time complexity: Depends on the script that is executed.

eval* clj

(eval* script numkeys key & args)

Optimistically tries to send 'evalsha' command for given script. In the event of a "NOSCRIPT" reply, reattempts with 'eval'. Returns the final command's reply.

evalsha clj

(evalsha sha1 numkeys key & args)

EVALSHA sha1 numkeys key [key ...] arg [arg ...]

Execute a Lua script server side.

Available since: 2.6.0.

Time complexity: Depends on the script that is executed.

evalsha* clj

(evalsha* script numkeys key & args)

Like 'evalsha' but automatically computes SHA1 hash for script.

exec clj

(exec)

EXEC

Execute all commands issued after MULTI.

Available since: 1.2.0.

Time complexity:

exists clj

(exists key)

EXISTS key

Determine if a key exists.

Available since: 1.0.0.

Time complexity: O(1)

expire clj

(expire key seconds)

EXPIRE key seconds

Set a key's time to live in seconds.

Available since: 1.0.0.

Time complexity: O(1)

expireat clj

(expireat key timestamp)

EXPIREAT key timestamp

Set the expiration for a key as a UNIX timestamp.

Available since: 1.2.0.

Time complexity: O(1)

flushall clj

(flushall)

FLUSHALL

Remove all keys from all databases.

Available since: 1.0.0.

Time complexity:

flushdb clj

(flushdb)

FLUSHDB

Remove all keys from the current database.

Available since: 1.0.0.

Time complexity:

get clj

(get key)

GET key

Get the value of a key.

Available since: 1.0.0.

Time complexity: O(1)

getbit clj

(getbit key offset)

GETBIT key offset

Returns the bit value at offset in the string value stored at key.

Available since: 2.2.0.

Time complexity: O(1)

getrange clj

(getrange key start end)

GETRANGE key start end

Get a substring of the string stored at a key.

Available since: 2.4.0.

Time complexity: O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.

getset clj

(getset key value)

GETSET key value

Set the string value of a key and return its old value.

Available since: 1.0.0.

Time complexity: O(1)

hash-script clj

hdel clj

(hdel key field & args)

HDEL key field [field ...]

Delete one or more hash fields.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of fields to be removed.

hexists clj

(hexists key field)

HEXISTS key field

Determine if a hash field exists.

Available since: 2.0.0.

Time complexity: O(1)

hget clj

(hget key field)

HGET key field

Get the value of a hash field.

Available since: 2.0.0.

Time complexity: O(1)

hgetall clj

(hgetall key)

HGETALL key

Get all the fields and values in a hash.

Available since: 2.0.0.

Time complexity: O(N) where N is the size of the hash.

hgetall* clj

(hgetall* key)

Like 'hgetall' but automatically coerces reply into a hash-map.

hincrby clj

(hincrby key field increment)

HINCRBY key field increment

Increment the integer value of a hash field by the given number.

Available since: 2.0.0.

Time complexity: O(1)

hincrbyfloat clj

(hincrbyfloat key field increment)

HINCRBYFLOAT key field increment

Increment the float value of a hash field by the given amount.

Available since: 2.6.0.

Time complexity: O(1)

hkeys clj

(hkeys key)

HKEYS key

Get all the fields in a hash.

Available since: 2.0.0.

Time complexity: O(N) where N is the size of the hash.

hlen clj

(hlen key)

HLEN key

Get the number of fields in a hash.

Available since: 2.0.0.

Time complexity: O(1)

hmget clj

(hmget key field & args)

HMGET key field [field ...]

Get the values of all the given hash fields.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of fields being requested.

hmset clj

(hmset key field value & args)

HMSET key ["field" "value"] [["field" "value"] ...]

Set multiple hash fields to multiple values.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of fields being set.

hset clj

(hset key field value)

HSET key field value

Set the string value of a hash field.

Available since: 2.0.0.

Time complexity: O(1)

hsetnx clj

(hsetnx key field value)

HSETNX key field value

Set the value of a hash field, only if the field does not exist.

Available since: 2.0.0.

Time complexity: O(1)

hvals clj

(hvals key)

HVALS key

Get all the values in a hash.

Available since: 2.0.0.

Time complexity: O(N) where N is the size of the hash.

incr clj

(incr key)

INCR key

Increment the integer value of a key by one.

Available since: 1.0.0.

Time complexity: O(1)

incrby clj

(incrby key increment)

INCRBY key increment

Increment the integer value of a key by the given amount.

Available since: 1.0.0.

Time complexity: O(1)

incrbyfloat clj

(incrbyfloat key increment)

INCRBYFLOAT key increment

Increment the float value of a key by the given amount.

Available since: 2.6.0.

Time complexity: O(1)

info clj

(info)

INFO

Get information and statistics about the server.

Available since: 1.0.0.

Time complexity:

info* clj

(info*)

Like 'info' but automatically coerces reply into a hash-map.

keys clj

(keys pattern)

KEYS pattern

Find all keys matching the given pattern.

Available since: 1.0.0.

Time complexity: O(N) with N being the number of keys in the database, under the assumption that the key names in the database and the given pattern have limited length.

lastsave clj

(lastsave)

LASTSAVE

Get the UNIX time stamp of the last successful save to disk.

Available since: 1.0.0.

Time complexity:

lindex clj

(lindex key index)

LINDEX key index

Get an element from a list by its index.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of elements to traverse to get to the element at index. This makes asking for the first or the last element of the list O(1).

linsert clj

(linsert key where pivot value)

LINSERT key BEFORE|AFTER pivot value

Insert an element before or after another element in a list.

Available since: 2.2.0.

Time complexity: O(N) where N is the number of elements to traverse before seeing the value pivot. This means that inserting somewhere on the left end on the list (head) can be considered O(1) and inserting somewhere on the right end (tail) is O(N).

llen clj

(llen key)

LLEN key

Get the length of a list.

Available since: 1.0.0.

Time complexity: O(1)

lpop clj

(lpop key)

LPOP key

Remove and get the first element in a list.

Available since: 1.0.0.

Time complexity: O(1)

lpush clj

(lpush key value & args)

LPUSH key value [value ...]

Prepend one or multiple values to a list.

Available since: 1.0.0.

Time complexity: O(1)

lpushx clj

(lpushx key value)

LPUSHX key value

Prepend a value to a list, only if the list exists.

Available since: 2.2.0.

Time complexity: O(1)

lrange clj

(lrange key start stop)

LRANGE key start stop

Get a range of elements from a list.

Available since: 1.0.0.

Time complexity: O(S+N) where S is the start offset and N is the number of elements in the specified range.

lrem clj

(lrem key count value)

LREM key count value

Remove elements from a list.

Available since: 1.0.0.

Time complexity: O(N) where N is the length of the list.

lset clj

(lset key index value)

LSET key index value

Set the value of an element in a list by its index.

Available since: 1.0.0.

Time complexity: O(N) where N is the length of the list. Setting either the first or the last element of the list is O(1).

ltrim clj

(ltrim key start stop)

LTRIM key start stop

Trim a list to the specified range.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of elements to be removed by the operation.

make-conn-pool clj

(make-conn-pool & options)

For option documentation see http://commons.apache.org/pool/apidocs/org/apache/commons/pool/impl/GenericKeyedObjectPool.html

make-conn-spec clj

(make-conn-spec &
                {:keys [host port password timeout db]
                 :or {host "127.0.0.1" port 6379 password nil timeout 0 db 0}})

mget clj

(mget key & args)

MGET key [key ...]

Get the values of all the given keys.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of keys to retrieve.

migrate clj

(migrate host port key destination-db timeout)

MIGRATE host port key destination-db timeout

Atomically transfer a key from a Redis instance to another one..

Available since: 2.6.0.

Time complexity: This command actually executes a DUMP+DEL in the source instance, and a RESTORE in the target instance. See the pages of these commands for time complexity. Also an O(N) data transfer between the two instances is performed.

monitor clj

(monitor)

MONITOR

Listen for all requests received by the server in real time.

Available since: 1.0.0.

Time complexity:

move clj

(move key db)

MOVE key db

Move a key to another database.

Available since: 1.0.0.

Time complexity: O(1)

mset clj

(mset key value & args)

MSET ["key" "value"] [["key" "value"] ...]

Set multiple keys to multiple values.

Available since: 1.0.1.

Time complexity: O(N) where N is the number of keys to set.

msetnx clj

(msetnx key value & args)

MSETNX ["key" "value"] [["key" "value"] ...]

Set multiple keys to multiple values, only if none of the keys exist.

Available since: 1.0.1.

Time complexity: O(N) where N is the number of keys to set.

multi clj

(multi)

MULTI

Mark the start of a transaction block.

Available since: 1.2.0.

Time complexity:

object clj

(object subcommand & args)

OBJECT subcommand [arguments [arguments ...]]

Inspect the internals of Redis objects.

Available since: 2.2.3.

Time complexity: O(1) for all the currently implemented subcommands.

persist clj

(persist key)

PERSIST key

Remove the expiration from a key.

Available since: 2.2.0.

Time complexity: O(1)

pexpire clj

(pexpire key milliseconds)

PEXPIRE key milliseconds

Set a key's time to live in milliseconds.

Available since: 2.6.0.

Time complexity: O(1)

pexpireat clj

(pexpireat key milliseconds-timestamp)

PEXPIREAT key milliseconds-timestamp

Set the expiration for a key as a UNIX timestamp specified in milliseconds.

Available since: 2.6.0.

Time complexity: O(1)

ping clj

(ping)

PING

Ping the server.

Available since: 1.0.0.

Time complexity:

psetex clj

(psetex key milliseconds value)

PSETEX key milliseconds value

Set the value and expiration in milliseconds of a key.

Available since: 2.6.0.

Time complexity: O(1)

psubscribe clj

(psubscribe pattern & args)

PSUBSCRIBE pattern [pattern ...]

Listen for messages published to channels matching the given patterns.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of patterns the client is already subscribed to.

pttl clj

(pttl key)

PTTL key

Get the time to live for a key in milliseconds.

Available since: 2.6.0.

Time complexity: O(1)

publish clj

(publish channel message)

PUBLISH channel message

Post a message to a channel.

Available since: 2.0.0.

Time complexity: O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).

punsubscribe clj

(punsubscribe & args)

PUNSUBSCRIBE [pattern [pattern ...]]

Stop listening for messages posted to channels matching the given patterns.

Available since: 2.0.0.

Time complexity: O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).

quit clj

(quit)

QUIT

Close the connection.

Available since: 1.0.0.

Time complexity:

randomkey clj

(randomkey)

RANDOMKEY

Return a random key from the keyspace.

Available since: 1.0.0.

Time complexity: O(1)

remember clj

(remember value)

Special command that takes any value and returns it unchanged as part of an enclosing 'with-conn' pipeline response.

rename clj

(rename key newkey)

RENAME key newkey

Rename a key.

Available since: 1.0.0.

Time complexity: O(1)

renamenx clj

(renamenx key newkey)

RENAMENX key newkey

Rename a key, only if the new key does not exist.

Available since: 1.0.0.

Time complexity: O(1)

restore clj

(restore key ttl serialized-value)

RESTORE key ttl serialized-value

Create a key using the provided serialized value, previously obtained using DUMP..

Available since: 2.6.0.

Time complexity: O(1) to create the new key and additional O(NM) to recostruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1M) where M is small, so simply O(1). However for sorted set values the complexity is O(NMlog(N)) because inserting values into sorted sets is O(log(N)).

rpop clj

(rpop key)

RPOP key

Remove and get the last element in a list.

Available since: 1.0.0.

Time complexity: O(1)

rpoplpush clj

(rpoplpush source destination)

RPOPLPUSH source destination

Remove the last element in a list, append it to another list and return it.

Available since: 1.2.0.

Time complexity: O(1)

rpush clj

(rpush key value & args)

RPUSH key value [value ...]

Append one or multiple values to a list.

Available since: 1.0.0.

Time complexity: O(1)

rpushx clj

(rpushx key value)

RPUSHX key value

Append a value to a list, only if the list exists.

Available since: 2.2.0.

Time complexity: O(1)

sadd clj

(sadd key member & args)

SADD key member [member ...]

Add one or more members to a set.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of members to be added.

save clj

(save)

SAVE

Synchronously save the dataset to disk.

Available since: 1.0.0.

Time complexity:

scard clj

(scard key)

SCARD key

Get the number of members in a set.

Available since: 1.0.0.

Time complexity: O(1)

script-exists clj

(script-exists script & args)

SCRIPT EXISTS script [script ...]

Check existence of scripts in the script cache..

Available since: 2.6.0.

Time complexity: O(N) with N being the number of scripts to check (so checking a single script is an O(1) operation).

script-flush clj

(script-flush)

SCRIPT FLUSH

Remove all the scripts from the script cache..

Available since: 2.6.0.

Time complexity: O(N) with N being the number of scripts in cache

script-kill clj

(script-kill)

SCRIPT KILL

Kill the script currently in execution..

Available since: 2.6.0.

Time complexity: O(1)

script-load clj

(script-load script)

SCRIPT LOAD script

Load the specified Lua script into the script cache..

Available since: 2.6.0.

Time complexity: O(N) with N being the length in bytes of the script body.

sdiff clj

(sdiff key & args)

SDIFF key [key ...]

Subtract multiple sets.

Available since: 1.0.0.

Time complexity: O(N) where N is the total number of elements in all given sets.

sdiffstore clj

(sdiffstore destination key & args)

SDIFFSTORE destination key [key ...]

Subtract multiple sets and store the resulting set in a key.

Available since: 1.0.0.

Time complexity: O(N) where N is the total number of elements in all given sets.

select clj

(select index)

SELECT index

Change the selected database for the current connection.

Available since: 1.0.0.

Time complexity:

set clj

(set key value)

SET key value

Set the string value of a key.

Available since: 1.0.0.

Time complexity: O(1)

setbit clj

(setbit key offset value)

SETBIT key offset value

Sets or clears the bit at offset in the string value stored at key.

Available since: 2.2.0.

Time complexity: O(1)

setex clj

(setex key seconds value)

SETEX key seconds value

Set the value and expiration of a key.

Available since: 2.0.0.

Time complexity: O(1)

setnx clj

(setnx key value)

SETNX key value

Set the value of a key, only if the key does not exist.

Available since: 1.0.0.

Time complexity: O(1)

setrange clj

(setrange key offset value)

SETRANGE key offset value

Overwrite part of a string at key starting at the specified offset.

Available since: 2.2.0.

Time complexity: O(1), not counting the time taken to copy the new string in place. Usually, this string is very small so the amortized complexity is O(1). Otherwise, complexity is O(M) with M being the length of the value argument.

shutdown clj

(shutdown & args)

SHUTDOWN [NOSAVE] [SAVE]

Synchronously save the dataset to disk and then shut down the server.

Available since: 1.0.0.

Time complexity:

sinter clj

(sinter key & args)

SINTER key [key ...]

Intersect multiple sets.

Available since: 1.0.0.

Time complexity: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.

sinterstore clj

(sinterstore destination key & args)

SINTERSTORE destination key [key ...]

Intersect multiple sets and store the resulting set in a key.

Available since: 1.0.0.

Time complexity: O(N*M) worst case where N is the cardinality of the smallest set and M is the number of sets.

sismember clj

(sismember key member)

SISMEMBER key member

Determine if a given value is a member of a set.

Available since: 1.0.0.

Time complexity: O(1)

skip-replies clj macro

(skip-replies & body)

slaveof clj

(slaveof host port)

SLAVEOF host port

Make the server a slave of another instance, or promote it as master.

Available since: 1.0.0.

Time complexity:

slowlog clj

(slowlog subcommand & args)

SLOWLOG subcommand [argument]

Manages the Redis slow queries log.

Available since: 2.2.12.

Time complexity:

smembers clj

(smembers key)

SMEMBERS key

Get all the members in a set.

Available since: 1.0.0.

Time complexity: O(N) where N is the set cardinality.

smove clj

(smove source destination member)

SMOVE source destination member

Move a member from one set to another.

Available since: 1.0.0.

Time complexity: O(1)

sort clj

(sort key & args)

SORT key [BY pattern] [LIMIT offset count] [GET pattern [GET pattern ...]] [ASC|DESC] [ALPHA] [STORE destination]

Sort the elements in a list, set or sorted set.

Available since: 1.0.0.

Time complexity: O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is currently O(N) as there is a copy step that will be avoided in next releases.

sort* clj

(sort* key & sort-args)

Like 'sort' but supports idiomatic Clojure arguments: :by pattern, :limit offset count, :get pattern, :mget patterns, :store destination, :alpha, :asc, :desc.

spop clj

(spop key)

SPOP key

Remove and return a random member from a set.

Available since: 1.0.0.

Time complexity: O(1)

srandmember clj

(srandmember key)

SRANDMEMBER key

Get a random member from a set.

Available since: 1.0.0.

Time complexity: O(1)

srem clj

(srem key member & args)

SREM key member [member ...]

Remove one or more members from a set.

Available since: 1.0.0.

Time complexity: O(N) where N is the number of members to be removed.

strlen clj

(strlen key)

STRLEN key

Get the length of the value stored in a key.

Available since: 2.2.0.

Time complexity: O(1)

subscribe clj

(subscribe channel & args)

SUBSCRIBE channel [channel ...]

Listen for messages published to the given channels.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of channels to subscribe to.

sunion clj

(sunion key & args)

SUNION key [key ...]

Add multiple sets.

Available since: 1.0.0.

Time complexity: O(N) where N is the total number of elements in all given sets.

sunionstore clj

(sunionstore destination key & args)

SUNIONSTORE destination key [key ...]

Add multiple sets and store the resulting set in a key.

Available since: 1.0.0.

Time complexity: O(N) where N is the total number of elements in all given sets.

sync clj

(sync)

SYNC

Internal command used for replication.

Available since: 1.0.0.

Time complexity:

time clj

(time)

TIME

Return the current server time.

Available since: 2.6.0.

Time complexity:

ttl clj

(ttl key)

TTL key

Get the time to live for a key.

Available since: 1.0.0.

Time complexity: O(1)

type clj

(type key)

TYPE key

Determine the type stored at key.

Available since: 1.0.0.

Time complexity: O(1)

unsubscribe clj

(unsubscribe & args)

UNSUBSCRIBE [channel [channel ...]]

Stop listening for messages posted to the given channels.

Available since: 2.0.0.

Time complexity: O(N) where N is the number of clients already subscribed to a channel.

unwatch clj

(unwatch)

UNWATCH

Forget about all watched keys.

Available since: 2.2.0.

Time complexity: O(1)

watch clj

(watch key & args)

WATCH key [key ...]

Watch the given keys to determine execution of the MULTI/EXEC block.

Available since: 2.2.0.

Time complexity: O(1) for every key.

with-conn clj macro

(with-conn connection-pool connection-spec & body)

Evaluates body in the context of a thread-bound pooled connection to a Redis server. Sends Redis commands to server as pipeline and returns the server's response. Releases connection back to pool when done.

Use 'make-conn-pool' and 'make-conn-spec' to generate the required arguments.

with-new-listener clj macro

(with-new-listener connection-spec handler initial-state & body)

Creates a persistent connection to Redis server and a thread to listen for server messages on that connection.

Incoming messages will be dispatched (along with current listener state) to binary handler function.

Evaluates body within the context of the connection and returns a general-purpose Listener containing:

1. The underlying persistent connection to facilitate 'close-listener' and
   'with-open-listener'.
2. An atom containing the function given to handle incoming server
   messages.
3. An atom containing any other optional listener state.

Useful for pub/sub, monitoring, etc.

with-new-pubsub-listener clj macro

(with-new-pubsub-listener connection-spec
                          message-handlers
                          &
                          subscription-commands)

A wrapper for 'with-new-listener'. Creates a persistent connection to Redis server and a thread to listen for published messages from channels that we'll subscribe to using 'p/subscribe' commands in body.

While listening, incoming messages will be dispatched by source (channel or pattern) to the given message-handler functions:

 {"channel1" (fn [message] (prn "Channel match: " message))
  "user*"    (fn [message] (prn "Pattern match: " message))}

SUBSCRIBE message: ["message" channel payload] PSUBSCRIBE message: ["pmessage" pattern matching-channel payload]

Returns the Listener to allow manual closing and adjustments to message-handlers.

with-open-listener clj macro

(with-open-listener listener & body)

Evaluates body within the context of given listener's preexisting persistent connection.

with-parser clj macro

(with-parser parser-fn & body)

Wraps body so that replies to any wrapped Redis commands will be parsed with (parser-fn reply).

zadd clj

(zadd key score member & args)

ZADD key score member [score] [member]

Add one or more members to a sorted set, or update its score if it already exists.

Available since: 1.2.0.

Time complexity: O(log(N)) where N is the number of elements in the sorted set.

zcard clj

(zcard key)

ZCARD key

Get the number of members in a sorted set.

Available since: 1.2.0.

Time complexity: O(1)

zcount clj

(zcount key min max)

ZCOUNT key min max

Count the members in a sorted set with scores within the given values.

Available since: 2.0.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M being the number of elements between min and max.

zincrby clj

(zincrby key increment member)

ZINCRBY key increment member

Increment the score of a member in a sorted set.

Available since: 1.2.0.

Time complexity: O(log(N)) where N is the number of elements in the sorted set.

zinterstore clj

(zinterstore destination numkeys key & args)

ZINTERSTORE destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]

Intersect multiple sorted sets and store the resulting sorted set in a new key.

Available since: 2.0.0.

Time complexity: O(NK)+O(Mlog(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.

zinterstore* clj

(zinterstore* dest-key source-keys & options)

Like 'zinterstore' but automatically counts keys.

zrange clj

(zrange key start stop & args)

ZRANGE key start stop [WITHSCORES]

Return a range of members in a sorted set, by index.

Available since: 1.2.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.

zrangebyscore clj

(zrangebyscore key min max & args)

ZRANGEBYSCORE key min max [WITHSCORES] [LIMIT offset count]

Return a range of members in a sorted set, by score.

Available since: 1.0.5.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).

zrank clj

(zrank key member)

ZRANK key member

Determine the index of a member in a sorted set.

Available since: 2.0.0.

Time complexity: O(log(N))

zrem clj

(zrem key member & args)

ZREM key member [member ...]

Remove one or more members from a sorted set.

Available since: 1.2.0.

Time complexity: O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.

zremrangebyrank clj

(zremrangebyrank key start stop)

ZREMRANGEBYRANK key start stop

Remove all members in a sorted set within the given indexes.

Available since: 2.0.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.

zremrangebyscore clj

(zremrangebyscore key min max)

ZREMRANGEBYSCORE key min max

Remove all members in a sorted set within the given scores.

Available since: 1.2.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.

zrevrange clj

(zrevrange key start stop & args)

ZREVRANGE key start stop [WITHSCORES]

Return a range of members in a sorted set, by index, with scores ordered from high to low.

Available since: 1.2.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.

zrevrangebyscore clj

(zrevrangebyscore key max min & args)

ZREVRANGEBYSCORE key max min [WITHSCORES] [LIMIT offset count]

Return a range of members in a sorted set, by score, with scores ordered from high to low.

Available since: 2.2.0.

Time complexity: O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).

zrevrank clj

(zrevrank key member)

ZREVRANK key member

Determine the index of a member in a sorted set, with scores ordered from high to low.

Available since: 2.0.0.

Time complexity: O(log(N))

zscore clj

(zscore key member)

ZSCORE key member

Get the score associated with the given member in a sorted set.

Available since: 1.2.0.

Time complexity: O(1)

zunionstore clj

(zunionstore destination numkeys key & args)

ZUNIONSTORE destination numkeys key [key ...] [WEIGHTS weight] [AGGREGATE SUM|MIN|MAX]

Add multiple sorted sets and store the resulting sorted set in a new key.

Available since: 2.0.0.

Time complexity: O(N)+O(M log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.

zunionstore* clj

(zunionstore* dest-key source-keys & options)

Like 'zunionstore' but automatically counts keys.