PSETEX works exactly like {@link #setex(String, int, String)} with the sole difference that the expire time is specified in milliseconds instead of se

Slow path in case a line of bytes cannot be read in one #fill() operation. This is still faster than creating the StrinbBuilder, String, then encoding

Clear discovered nodes collections and gently release allocated resources

Atomically return and remove the first (LPOP) or last (RPOP) element of the list. For example if the list contains the elements "a","b","c" RPOP will

Add the string value to the head (LPUSH) or tail (RPUSH) of the list stored at key. If the key does not exist an empty list is created just before the

Add the specified member to the set value stored at key. If member is already a member of the set no operation is performed. If key does not exist a n

Return the set cardinality (number of elements). If the key does not exist 0 is returned, like for empty sets. @param key @return Integer reply, speci

The command is exactly equivalent to the following group of commands: {@link #set(String, String) SET} + {@link #expire(String, int) EXPIRE}. The oper

SETNX works exactly like {@link #set(String, String) SET} with the only difference that if the key already exists no operation is performed. SETNX act

Return 1 if member is a member of the set stored at key, otherwise 0 is returned. <p> Time complexity O(1) @param key @param member @return Integer re

Return all the members (elements) of the set value stored at key. This is just syntax glue for {@link #sinter(String...) SINTER}. <p> Time complexity

Remove the specified member from the set value stored at key. If member was not a member of the set no operation is performed. If key does not hold a

Return a subset of the string from offset start to offset end (both offsets are inclusive). Negative offsets can be used in order to provide an offset

This command swaps two Redis databases, so that immediately all the clients connected to a given database will see the data of the other database, and

Alters the last access time of a key(s). A key is ignored if it does not exist. Time complexity: O(N) where N is the number of keys that will be touch

The TTL command returns the remaining time to live in seconds of a key that has an {@link #expire(String, int) EXPIRE} set. This introspection capabil

Return the type of the value stored at key in form of a string. The type can be one of "none", "string", "list", "set". "none" is returned if the key

This command is very similar to DEL: it removes the specified keys. Just like DEL a key is ignored if it does not exist. However the command performs

Return the sorted set cardinality (number of elements). If the key does not exist 0 is returned, like for empty sorted sets. <p> Time complexity O(1)

Return the rank (or index) of member in the sorted set at key, with scores being ordered from low to high. <p> When the given member does not exist in

Remove the specified member from the sorted set value stored at key. If member was not a member of the set no operation is performed. If key does not

Remove all elements in the sorted set at key with rank between start and end. Start and end are 0-based with rank 0 being the element with the lowest

Return the rank (or index) of member in the sorted set at key, with scores being ordered from high to low. <p> When the given member does not exist in

Return the score of the specified element of the sorted set at key. If the specified element does not exist in the sorted set, or the key does not exi

Returns the new value of the cursor @return the new cursor value. {@link ScanParams#SCAN_POINTER_START} when a complete iteration has finished

Return the index of the current database @return the int of the index database.

A key tag is a special pattern inside a key that, if preset, is the only part of the key hashed in order to select the server for this key. @see <a hr

This method resolves the localhost in a 'lazy manner'. @return localhost