Simple get command. Works on RedisBasic a b and RedisIntegral a b.

Construct a query to be used with mget. You may combine many of these together to create complex queries. Use mget to execute the query back in the Redis monad. Works on RedisBasic a b and RedisIntegral a b.

Reify a (⟿) query into the Redis monad via a single mget command.

Set a value for a given key. Works on RedisBasic a b and RedisIntegral a b.

Convenient alias for setting a value for an optional path

Construct a query to be used with mset. The MSET type is a Monoid, so you may combine many of these together before executing the batch with the mset command.

Execute a MSET query.

Set a value together with a given expiration timeout (in seconds).

Increment an Integer in Redis. Empty values are treated as 0.

Increment an Integer in Redis by a specific amount. Empty values are treated as 0.

Decrement an Integer in Redis. Empty values are treated as 0.

Decrement an Integer in Redis by a specific amount. Empty values are treated as 0.

Retrieve a range of elements. Endpoints are inclusive, just as with Haskell's [ 1 .. 5 ] notation.

Prepend items to the front of a list

Append items to the end of a list

Remove and return an item from the head of the list.

Remove an item from the list. You should ensure that any Eq instance in Haskell respects the induced equality by your encoding scheme, as Redis will use the latter.

Retrieve the length of a list.

Retrieve all elements of an HSet

Lookup via key and subkey

Lookup via key and subkeys, pairing each given subkey with the lookup result

Set via key and subkey

Set via key and subkeys

Delete via key and subkeys

Set a value only if it does not currently exist in the HSET

Use a cursor to iterate a collection

Retrieve the elements of a set from Redis

Test if an item is a member of a set

Add items to a set

Remove items from a set

Retrieve the cardinality of a set

Retrieve a random element from a set. The underlying Redis primitive uses a poor but efficient distribution, biased by the underlying hash bucket allocation.

Retrieve up to N unique random elements, limited by the cardinality of the set.

Use a cursor to iterate a collection

Add items and scores

Lookup an element's score

Read the scores from Redis, apply the given trasformation, and write the resulting data

Retrieve the given range of best-performing elements. Range is inclusive, just as with Haskell's [ 1 .. 5 ] notation, and it is 0-based, which means [ 0 .. 4 ] is what corresponds to the English phrase "Best 5."

Retrieve the given range of worst-performing elements. Range is inclusive, just as with Haskell's [ 1 .. 5 ] notation, and it is 0-based, which means [ 0 .. 4 ] is what corresponds to the English phrase "Worst 5."

Test if an object is a member of the set.

Calculate the rank of an item. The best item has rank 0.

Calculate the rank of an item starting from the end, e.g., the worst item has rank 0.

Remove items from a sorted set

Increment an item's score. If the item does not already exist, it is inserted with the given score.

The cardinality of a sorted set

Use a cursor to iterate a collection.

Retrieve items in a score range; final parameters are min, max, offset, and limit

Delete all data for the given keys in Redis

Discard any pending expirations of this key. Returns True if the key both exists and had a timeout which was removed by the command.

Expire after a given amount of time (in seconds). Returns True if the key existed and a timeout was set.

Expire at a given timestamp. Returns True if the key existed and a timeout was set.

Context for normal command execution, outside of transactions. Use runRedis to run actions of this type.

In this context, each result is wrapped in an Either to account for the possibility of Redis returning an Error reply.