org.frameworkset.nosql.redis

类 RedisHelper

java.lang.Object

org.frameworkset.nosql.redis.RedisHelper

public class RedisHelper
extends java.lang.Object

构造器概要

构造器

构造器和说明
RedisHelper(RedisDB db)

方法概要

方法

限定符和类型	方法和说明
java.lang.Long	append(java.lang.String key, java.lang.String value) If the key already exists and is a string, this command appends the provided value at the end of the string.
java.util.List<java.lang.String>	brpop(int timeout, java.lang.String... keys) BLPOP (and BRPOP) is a blocking list pop primitive.
java.util.List<java.lang.String>	configGet(java.lang.String pattern) Retrieve the configuration of a running Redis server.
java.lang.Long	decr(java.lang.String key) Decrement the number stored at key by one.
java.lang.Long	decrBy(java.lang.String key, long integer) IDECRBY work just like INCR but instead to decrement by 1 the decrement is integer.
java.lang.Long	del(java.lang.String... keys) Remove the specified keys.
java.lang.Long	del(java.lang.String key)
java.lang.String	echo(java.lang.String string)
java.lang.Object	eval(java.lang.String script, int keyCount, java.lang.String... params)
java.lang.Long	exists(java.lang.String... keys) Test if the specified key exists.
java.lang.Boolean	exists(java.lang.String key) Test if the specified key exists.
java.lang.Long	expire(java.lang.String key, int seconds) Set a timeout on the specified key.
java.lang.Long	expireAt(java.lang.String key, long unixTime) EXPIREAT works exctly like EXPIRE but instead to get the number of seconds representing the Time To Live of the key as a second argument (that is a relative way of specifing the TTL), it takes an absolute one in the form of a UNIX timestamp (Number of seconds elapsed since 1 Gen 1970).
java.lang.String	get(java.lang.String key) Get the value of the specified key.
java.lang.String	getSet(java.lang.String key, java.lang.String value) GETSET is an atomic set this value and return the old value command.
java.lang.Long	hdel(java.lang.String key, java.lang.String... fields) Remove the specified field from an hash stored at key.
java.lang.Boolean	hexists(java.lang.String key, java.lang.String field) Test for existence of a specified field in a hash.
java.lang.String	hget(java.lang.String key, java.lang.String field) If key holds a hash, retrieve the value associated to the specified field.
java.util.Map<java.lang.String,java.lang.String>	hgetAll(java.lang.String key) Return all the fields and associated values in a hash.
java.lang.Long	hincrBy(java.lang.String key, java.lang.String field, long value) Increment the number stored at field in the hash at key by value.
java.lang.Double	hincrByFloat(java.lang.String key, java.lang.String field, double value) Increment the number stored at field in the hash at key by a double precision floating point value.
java.util.Set<java.lang.String>	hkeys(java.lang.String key) Return all the fields in a hash.
java.lang.Long	hlen(java.lang.String key) Return the number of items in a hash.
java.util.List<java.lang.String>	hmget(java.lang.String key, java.lang.String... fields) Retrieve the values associated to the specified fields.
java.lang.String	hmset(java.lang.String key, java.util.Map<java.lang.String,java.lang.String> hash) Set the respective fields to the respective values.
java.lang.Long	hset(java.lang.String key, java.lang.String field, java.lang.String value) Set the specified hash field to the specified value.
java.lang.Long	hsetnx(java.lang.String key, java.lang.String field, java.lang.String value) Set the specified hash field to the specified value if the field not exists.
java.util.List<java.lang.String>	hvals(java.lang.String key) Return all the values in a hash.
java.lang.Long	incr(java.lang.String key) Increment the number stored at key by one.
java.lang.Long	incrBy(java.lang.String key, long integer) INCRBY work just like INCR but instead to increment by 1 the increment is integer.
java.lang.Double	incrByFloat(java.lang.String key, double value) INCRBYFLOAT INCRBYFLOAT commands are limited to double precision floating point values.
void	init()
java.util.Set<java.lang.String>	keys(java.lang.String pattern) Returns all the keys matching the glob-style pattern as space separated strings.
java.lang.String	lindex(java.lang.String key, long index) Return the specified element of the list stored at the specified key. 0 is the first element, 1 the second and so on.
java.lang.Long	linsert(java.lang.String key, redis.clients.jedis.BinaryClient.LIST_POSITION where, java.lang.String pivot, java.lang.String value)
java.lang.Long	llen(java.lang.String key) Return the length of the list stored at the specified key.
java.lang.String	lpop(java.lang.String key) Atomically return and remove the first (LPOP) or last (RPOP) element of the list.
java.lang.Long	lpush(java.lang.String key, java.lang.String... strings) Add the string value to the head (LPUSH) or tail (RPUSH) of the list stored at key.
java.lang.Long	lpushx(java.lang.String key, java.lang.String... string)
java.util.List<java.lang.String>	lrange(java.lang.String key, long start, long end) Return the specified elements of the list stored at the specified key.
java.lang.Long	lrem(java.lang.String key, long count, java.lang.String value) Remove the first count occurrences of the value element from the list.
java.lang.String	lset(java.lang.String key, long index, java.lang.String value) Set a new value as the element at index position of the List at key.
java.lang.String	ltrim(java.lang.String key, long start, long end) Trim an existing list so that it will contain only the specified range of elements specified.
java.util.List<java.lang.String>	mget(java.lang.String... keys) Get the values of all the specified keys.
java.lang.String	mset(java.lang.String... keysvalues) Set the the respective keys to the respective values.
java.lang.Long	msetnx(java.lang.String... keysvalues) Set the the respective keys to the respective values.
java.lang.Long	persist(java.lang.String key) Undo a expire at turning the expire key into a normal key.
java.lang.Long	pexpire(java.lang.String key, long milliseconds) redis 127.0.0.1:26381> sentinel masters 1) 1) "name" 2) "mymaster" 3) "ip" 4) "127.0.0.1" 5) "port" 6) "6379" 7) "runid" 8) "93d4d4e6e9c06d0eea36e27f31924ac26576081d" 9) "flags" 10) "master" 11) "pending-commands" 12) "0" 13) "last-ok-ping-reply" 14) "423" 15) "last-ping-reply" 16) "423" 17) "info-refresh" 18) "6107" 19) "num-slaves" 20) "1" 21) "num-other-sentinels" 22) "2" 23) "quorum" 24) "2"
java.lang.Long	pexpireAt(java.lang.String key, long millisecondsTimestamp)
redis.clients.jedis.Pipeline	pipelined()
java.lang.String	psetex(java.lang.String key, long milliseconds, java.lang.String value) PSETEX works exactly like setex(String, int, String) with the sole difference that the expire time is specified in milliseconds instead of seconds.
void	psubscribe(redis.clients.jedis.JedisPubSub jedisPubSub, java.lang.String... patterns)
java.lang.Long	pttl(java.lang.String key)
java.lang.Long	publish(java.lang.String channel, java.lang.String message)
java.lang.String	randomKey() Return a randomly selected key from the currently selected DB.
void	release()
java.lang.String	rpop(java.lang.String key) Atomically return and remove the first (LPOP) or last (RPOP) element of the list.
java.lang.String	rpoplpush(java.lang.String srckey, java.lang.String dstkey) Atomically return and remove the last (tail) element of the srckey list, and push the element as the first (head) element of the dstkey list.
java.lang.Long	rpush(java.lang.String key, java.lang.String... strings) Add the string value to the head (LPUSH) or tail (RPUSH) of the list stored at key.
java.lang.Long	rpushx(java.lang.String key, java.lang.String... string)
java.lang.Long	sadd(java.lang.String key, java.lang.String... members) Add the specified member to the set value stored at key.
java.lang.Long	scard(java.lang.String key) Return the set cardinality (number of elements).
java.util.Set<java.lang.String>	sdiff(java.lang.String... keys) Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN Example: key1 = [x, a, b, c] key2 = [c] key3 = [a, d] SDIFF key1,key2,key3 => [x, b] Non existing keys are considered like empty sets.
java.lang.Long	sdiffstore(java.lang.String dstkey, java.lang.String... keys) This command works exactly like {@link #sdiff(String...)
java.lang.String	set(java.lang.String key, java.lang.String value) Set the string value as value of the key.
java.lang.String	setex(java.lang.String key, int seconds, java.lang.String value) The command is exactly equivalent to the following group of commands: SET + EXPIRE.
java.lang.Long	setnx(java.lang.String key, java.lang.String value) SETNX works exactly like SET with the only difference that if the key already exists no operation is performed.
java.util.Set<java.lang.String>	sinter(java.lang.String... keys) Return the members of a set resulting from the intersection of all the sets hold at the specified keys.
java.lang.Long	sinterstore(java.lang.String dstkey, java.lang.String... keys) This commnad works exactly like {@link #sinter(String...)
java.lang.Boolean	sismember(java.lang.String key, java.lang.String member) Return 1 if member is a member of the set stored at key, otherwise 0 is returned.
java.util.Set<java.lang.String>	smembers(java.lang.String key) Return all the members (elements) of the set value stored at key.
java.lang.Long	smove(java.lang.String srckey, java.lang.String dstkey, java.lang.String member) Move the specifided member from the set at srckey to the set at dstkey.
java.util.List<java.lang.String>	sort(java.lang.String key) Sort a Set or a List.
java.util.List<java.lang.String>	sort(java.lang.String key, redis.clients.jedis.SortingParams sortingParameters) Sort a Set or a List accordingly to the specified parameters.
java.lang.Long	sort(java.lang.String key, redis.clients.jedis.SortingParams sortingParameters, java.lang.String dstkey) Sort a Set or a List accordingly to the specified parameters and store the result at dstkey.
java.lang.Long	sort(java.lang.String key, java.lang.String dstkey) Sort a Set or a List and Store the Result at dstkey.
java.lang.String	spop(java.lang.String key) Remove a random element from a Set returning it as return value.
java.util.Set<java.lang.String>	spop(java.lang.String key, long count)
java.lang.String	srandmember(java.lang.String key) Return a random element from a Set, without removing the element.
java.util.List<java.lang.String>	srandmember(java.lang.String key, int count)
java.lang.Long	srem(java.lang.String key, java.lang.String... members) Remove the specified member from the set value stored at key.
java.lang.Long	strlen(java.lang.String key)
void	subscribe(redis.clients.jedis.JedisPubSub jedisPubSub, java.lang.String... channels)
java.lang.String	substr(java.lang.String key, int start, int end) Return a subset of the string from offset start to offset end (both offsets are inclusive).
java.util.Set<java.lang.String>	sunion(java.lang.String... keys) Return the members of a set resulting from the union of all the sets hold at the specified keys.
java.lang.Long	sunionstore(java.lang.String dstkey, java.lang.String... keys) This command works exactly like {@link #sunion(String...)
java.lang.Long	ttl(java.lang.String key) The TTL command returns the remaining time to live in seconds of a key that has an EXPIRE set.
java.lang.String	type(java.lang.String key) Return the type of the value stored at key in form of a string.
java.lang.String	watch(java.lang.String... keys)
java.lang.Long	zadd(java.lang.String key, double score, java.lang.String member) Add the specified member having the specifeid score to the sorted set stored at key.
java.lang.Long	zadd(java.lang.String key, double score, java.lang.String member, redis.clients.jedis.params.sortedset.ZAddParams params)
java.lang.Long	zadd(java.lang.String key, java.util.Map<java.lang.String,java.lang.Double> scoreMembers)
java.lang.Long	zadd(java.lang.String key, java.util.Map<java.lang.String,java.lang.Double> scoreMembers, redis.clients.jedis.params.sortedset.ZAddParams params)
java.lang.Long	zcard(java.lang.String key) Return the sorted set cardinality (number of elements).
java.lang.Long	zcount(java.lang.String key, double min, double max)
java.lang.Long	zcount(java.lang.String key, java.lang.String min, java.lang.String max)
java.lang.Double	zincrby(java.lang.String key, double score, java.lang.String member) If member already exists in the sorted set adds the increment to its score and updates the position of the element in the sorted set accordingly.
java.lang.Double	zincrby(java.lang.String key, double score, java.lang.String member, redis.clients.jedis.params.sortedset.ZIncrByParams params)
java.util.Set<java.lang.String>	zrange(java.lang.String key, long start, long end)
java.lang.Long	zrank(java.lang.String key, java.lang.String member) Return the rank (or index) or member in the sorted set at key, with scores being ordered from low to high.
java.lang.Long	zrem(java.lang.String key, java.lang.String... members) Remove the specified member from the sorted set value stored at key.
java.lang.Double	zscore(java.lang.String key, java.lang.String member) Return the score of the specified element of the sorted set at key.

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

构造器详细资料

RedisHelper

public RedisHelper(RedisDB db)

方法详细资料

init

public void init()

release

public void release()

set

public java.lang.String set(java.lang.String key,
                   java.lang.String value)

Set the string value as value of the key. The string can't be longer than 1073741824 bytes (1 GB).

Time complexity: O(1)

参数:

key -

value -

返回:

Status code reply

get

public java.lang.String get(java.lang.String key)

Get the value of the specified key. If the key does not exist null is returned. If the value stored at key is not a string an error is returned because GET can only handle string values.

Time complexity: O(1)

参数:

key -

返回:

Bulk reply

exists

public java.lang.Long exists(java.lang.String... keys)

Test if the specified key exists. The command returns the number of keys existed Time complexity: O(N)

参数:

keys -

返回:

Integer reply, specifically: an integer greater than 0 if one or more keys were removed 0 if none of the specified key existed

exists

public java.lang.Boolean exists(java.lang.String key)

Test if the specified key exists. The command returns "1" if the key exists, otherwise "0" is returned. Note that even keys set with an empty string as value will return "1". Time complexity: O(1)

参数:

key -

返回:

Boolean reply, true if the key exists, otherwise false

del

public java.lang.Long del(java.lang.String... keys)

Remove the specified keys. If a given key does not exist no operation is performed for this key. The command returns the number of keys removed. Time complexity: O(1)

参数:

keys -

返回:

Integer reply, specifically: an integer greater than 0 if one or more keys were removed 0 if none of the specified key existed

del

public java.lang.Long del(java.lang.String key)

type

public java.lang.String type(java.lang.String key)

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 does not exist. Time complexity: O(1)

参数:

key -

返回:

Status code reply, specifically: "none" if the key does not exist "string" if the key contains a String value "list" if the key contains a List value "set" if the key contains a Set value "zset" if the key contains a Sorted Set value "hash" if the key contains a Hash value

keys

public java.util.Set<java.lang.String> keys(java.lang.String pattern)

Returns all the keys matching the glob-style pattern as space separated strings. For example if you have in the database the keys "foo" and "foobar" the command "KEYS foo*" will return "foo foobar".

Note that while the time complexity for this operation is O(n) the constant times are pretty low. For example Redis running on an entry level laptop can scan a 1 million keys database in 40 milliseconds. Still it's better to consider this one of the slow commands that may ruin the DB performance if not used with care.

In other words this command is intended only for debugging and special operations like creating a script to change the DB schema. Don't use it in your normal code. Use Redis Sets in order to group together a subset of objects.

Glob style patterns examples:

• h?llo will match hello hallo hhllo
• h*llo will match hllo heeeello
• h[ae]llo will match hello and hallo, but not hillo

Use \ to escape special chars if you want to match them verbatim.

Time complexity: O(n) (with n being the number of keys in the DB, and assuming keys and pattern of limited length)

参数:

pattern -

返回:

Multi bulk reply

randomKey

public java.lang.String randomKey()

Return a randomly selected key from the currently selected DB.

Time complexity: O(1)

返回:

Singe line reply, specifically the randomly selected key or an empty string is the database is empty

expire

public java.lang.Long expire(java.lang.String key,
                    int seconds)

Set a timeout on the specified key. After the timeout the key will be automatically deleted by the server. A key with an associated timeout is said to be volatile in Redis terminology.

Voltile keys are stored on disk like the other keys, the timeout is persistent too like all the other aspects of the dataset. Saving a dataset containing expires and stopping the server does not stop the flow of time as Redis stores on disk the time when the key will no longer be available as Unix time, and not the remaining seconds.

Since Redis 2.1.3 you can update the value of the timeout of a key already having an expire set. It is also possible to undo the expire at all turning the key into a normal key using the PERSIST command.

Time complexity: O(1)

参数:

key -

seconds -

返回:

Integer reply, specifically: 1: the timeout was set. 0: the timeout was not set since the key already has an associated timeout (this may happen only in Redis versions < 2.1.3, Redis >= 2.1.3 will happily update the timeout), or the key does not exist.

另请参阅:

Expire Command

expireAt

public java.lang.Long expireAt(java.lang.String key,
                      long unixTime)

EXPIREAT works exctly like EXPIRE but instead to get the number of seconds representing the Time To Live of the key as a second argument (that is a relative way of specifing the TTL), it takes an absolute one in the form of a UNIX timestamp (Number of seconds elapsed since 1 Gen 1970).

EXPIREAT was introduced in order to implement the Append Only File persistence mode so that EXPIRE commands are automatically translated into EXPIREAT commands for the append only file. Of course EXPIREAT can also used by programmers that need a way to simply specify that a given key should expire at a given time in the future.

Since Redis 2.1.3 you can update the value of the timeout of a key already having an expire set. It is also possible to undo the expire at all turning the key into a normal key using the PERSIST command.

Time complexity: O(1)

参数:

key -

unixTime -

返回:

Integer reply, specifically: 1: the timeout was set. 0: the timeout was not set since the key already has an associated timeout (this may happen only in Redis versions < 2.1.3, Redis >= 2.1.3 will happily update the timeout), or the key does not exist.

另请参阅:

Expire Command

ttl

public java.lang.Long ttl(java.lang.String key)

The TTL command returns the remaining time to live in seconds of a key that has an EXPIRE set. This introspection capability allows a Redis client to check how many seconds a given key will continue to be part of the dataset.

参数:

key -

返回:

Integer reply, returns the remaining time to live in seconds of a key that has an EXPIRE. In Redis 2.6 or older, if the Key does not exists or does not have an associated expire, -1 is returned. In Redis 2.8 or newer, if the Key does not have an associated expire, -1 is returned or if the Key does not exists, -2 is returned.

getSet

public java.lang.String getSet(java.lang.String key,
                      java.lang.String value)

GETSET is an atomic set this value and return the old value command. Set key to the string value and return the old value stored at key. The string can't be longer than 1073741824 bytes (1 GB).

Time complexity: O(1)

参数:

key -

value -

返回:

Bulk reply

mget

public java.util.List<java.lang.String> mget(java.lang.String... keys)

Get the values of all the specified keys. If one or more keys dont exist or is not of type String, a 'nil' value is returned instead of the value of the specified key, but the operation never fails.

Time complexity: O(1) for every key

参数:

keys -

返回:

Multi bulk reply

setnx

public java.lang.Long setnx(java.lang.String key,
                   java.lang.String value)

SETNX works exactly like SET with the only difference that if the key already exists no operation is performed. SETNX actually means "SET if Not eXists".

Time complexity: O(1)

参数:

key -

value -

返回:

Integer reply, specifically: 1 if the key was set 0 if the key was not set

setex

public java.lang.String setex(java.lang.String key,
                     int seconds,
                     java.lang.String value)

The command is exactly equivalent to the following group of commands: SET + EXPIRE. The operation is atomic.

Time complexity: O(1)

参数:

key -

seconds -

value -

返回:

Status code reply

mset

public java.lang.String mset(java.lang.String... keysvalues)

Set the the respective keys to the respective values. MSET will replace old values with new values, while MSETNX will not perform any operation at all even if just a single key already exists.

Because of this semantic MSETNX can be used in order to set different keys representing different fields of an unique logic object in a way that ensures that either all the fields or none at all are set.

Both MSET and MSETNX are atomic operations. This means that for instance if the keys A and B are modified, another client talking to Redis can either see the changes to both A and B at once, or no modification at all.

参数:

keysvalues -

返回:

Status code reply Basically +OK as MSET can't fail

另请参阅:

msetnx(String...)

msetnx

public java.lang.Long msetnx(java.lang.String... keysvalues)

Set the the respective keys to the respective values. MSET will replace old values with new values, while MSETNX will not perform any operation at all even if just a single key already exists.

Because of this semantic MSETNX can be used in order to set different keys representing different fields of an unique logic object in a way that ensures that either all the fields or none at all are set.

Both MSET and MSETNX are atomic operations. This means that for instance if the keys A and B are modified, another client talking to Redis can either see the changes to both A and B at once, or no modification at all.

参数:

keysvalues -

返回:

Integer reply, specifically: 1 if the all the keys were set 0 if no key was set (at least one key already existed)

另请参阅:

mset(String...)

decrBy

public java.lang.Long decrBy(java.lang.String key,
                    long integer)

IDECRBY work just like INCR but instead to decrement by 1 the decrement is integer.

INCR commands are limited to 64 bit signed integers.

Note: this is actually a string operation, that is, in Redis there are not "integer" types. Simply the string stored at the key is parsed as a base 10 64 bit signed integer, incremented, and then converted back as a string.

Time complexity: O(1)

参数:

key -

integer -

返回:

Integer reply, this commands will reply with the new value of key after the increment.

另请参阅:

incr(String), decr(String), incrBy(String, long)

decr

public java.lang.Long decr(java.lang.String key)

Decrement the number stored at key by one. If the key does not exist or contains a value of a wrong type, set the key to the value of "0" before to perform the decrement operation.

INCR commands are limited to 64 bit signed integers.

Note: this is actually a string operation, that is, in Redis there are not "integer" types. Simply the string stored at the key is parsed as a base 10 64 bit signed integer, incremented, and then converted back as a string.

Time complexity: O(1)

参数:

key -

返回:

Integer reply, this commands will reply with the new value of key after the increment.

另请参阅:

incr(String), incrBy(String, long), decrBy(String, long)

incrBy

public java.lang.Long incrBy(java.lang.String key,
                    long integer)

INCRBY work just like INCR but instead to increment by 1 the increment is integer.

INCR commands are limited to 64 bit signed integers.

Note: this is actually a string operation, that is, in Redis there are not "integer" types. Simply the string stored at the key is parsed as a base 10 64 bit signed integer, incremented, and then converted back as a string.

Time complexity: O(1)

参数:

key -

integer -

返回:

Integer reply, this commands will reply with the new value of key after the increment.

另请参阅:

incr(String), decr(String), decrBy(String, long)

incrByFloat

public java.lang.Double incrByFloat(java.lang.String key,
                           double value)

INCRBYFLOAT

INCRBYFLOAT commands are limited to double precision floating point values.

Note: this is actually a string operation, that is, in Redis there are not "double" types. Simply the string stored at the key is parsed as a base double precision floating point value, incremented, and then converted back as a string. There is no DECRYBYFLOAT but providing a negative value will work as expected.

Time complexity: O(1)

参数:

key -

value -

返回:

Double reply, this commands will reply with the new value of key after the increment.

incr

public java.lang.Long incr(java.lang.String key)

Increment the number stored at key by one. If the key does not exist or contains a value of a wrong type, set the key to the value of "0" before to perform the increment operation.

INCR commands are limited to 64 bit signed integers.

Note: this is actually a string operation, that is, in Redis there are not "integer" types. Simply the string stored at the key is parsed as a base 10 64 bit signed integer, incremented, and then converted back as a string.

Time complexity: O(1)

参数:

key -

返回:

Integer reply, this commands will reply with the new value of key after the increment.

另请参阅:

incrBy(String, long), decr(String), decrBy(String, long)

append

public java.lang.Long append(java.lang.String key,
                    java.lang.String value)

If the key already exists and is a string, this command appends the provided value at the end of the string. If the key does not exist it is created and set as an empty string, so APPEND will be very similar to SET in this special case.

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.

参数:

key -

value -

返回:

Integer reply, specifically the total length of the string after the append operation.

substr

public java.lang.String substr(java.lang.String key,
                      int start,
                      int end)

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 starting from the end of the string. So -1 means the last char, -2 the penultimate and so forth.

The function handles out of range requests without raising an error, but just limiting the resulting range to the actual length of the string.

Time complexity: O(start+n) (with start being the start index and n the total length of the requested range). Note that the lookup part of this command is O(1) so for small strings this is actually an O(1) command.

参数:

key -

start -

end -

返回:

Bulk reply

hset

public java.lang.Long hset(java.lang.String key,
                  java.lang.String field,
                  java.lang.String value)

Set the specified hash field to the specified value.

If key does not exist, a new key holding a hash is created.

Time complexity: O(1)

参数:

key -

field -

value -

返回:

If the field already exists, and the HSET just produced an update of the value, 0 is returned, otherwise if a new field is created 1 is returned.

hget

public java.lang.String hget(java.lang.String key,
                    java.lang.String field)

If key holds a hash, retrieve the value associated to the specified field.

If the field is not found or the key does not exist, a special 'nil' value is returned.

Time complexity: O(1)

参数:

key -

field -

返回:

Bulk reply

hsetnx

public java.lang.Long hsetnx(java.lang.String key,
                    java.lang.String field,
                    java.lang.String value)

Set the specified hash field to the specified value if the field not exists. Time complexity: O(1)

参数:

key -

field -

value -

返回:

If the field already exists, 0 is returned, otherwise if a new field is created 1 is returned.

hmset

public java.lang.String hmset(java.lang.String key,
                     java.util.Map<java.lang.String,java.lang.String> hash)

Set the respective fields to the respective values. HMSET replaces old values with new values.

If key does not exist, a new key holding a hash is created.

Time complexity: O(N) (with N being the number of fields)

参数:

key -

hash -

返回:

Return OK or Exception if hash is empty

hmget

public java.util.List<java.lang.String> hmget(java.lang.String key,
                                     java.lang.String... fields)

Retrieve the values associated to the specified fields.

If some of the specified fields do not exist, nil values are returned. Non existing keys are considered like empty hashes.

Time complexity: O(N) (with N being the number of fields)

参数:

key -

fields -

返回:

Multi Bulk Reply specifically a list of all the values associated with the specified fields, in the same order of the request.

hincrBy

public java.lang.Long hincrBy(java.lang.String key,
                     java.lang.String field,
                     long value)

Increment the number stored at field in the hash at key by value. If key does not exist, a new key holding a hash is created. If field does not exist or holds a string, the value is set to 0 before applying the operation. Since the value argument is signed you can use this command to perform both increments and decrements.

The range of values supported by HINCRBY is limited to 64 bit signed integers.

Time complexity: O(1)

参数:

key -

field -

value -

返回:

Integer reply The new value at field after the increment operation.

hincrByFloat

public java.lang.Double hincrByFloat(java.lang.String key,
                            java.lang.String field,
                            double value)

Increment the number stored at field in the hash at key by a double precision floating point value. If key does not exist, a new key holding a hash is created. If field does not exist or holds a string, the value is set to 0 before applying the operation. Since the value argument is signed you can use this command to perform both increments and decrements.

The range of values supported by HINCRBYFLOAT is limited to double precision floating point values.

Time complexity: O(1)

参数:

key -

field -

value -

返回:

Double precision floating point reply The new value at field after the increment operation.

hexists

public java.lang.Boolean hexists(java.lang.String key,
                        java.lang.String field)

Test for existence of a specified field in a hash. Time complexity: O(1)

参数:

key -

field -

返回:

Return 1 if the hash stored at key contains the specified field. Return 0 if the key is not found or the field is not present.

hdel

public java.lang.Long hdel(java.lang.String key,
                  java.lang.String... fields)

Remove the specified field from an hash stored at key.

Time complexity: O(1)

参数:

key -

fields -

返回:

If the field was present in the hash it is deleted and 1 is returned, otherwise 0 is returned and no operation is performed.

hlen

public java.lang.Long hlen(java.lang.String key)

Return the number of items in a hash.

Time complexity: O(1)

参数:

key -

返回:

The number of entries (fields) contained in the hash stored at key. If the specified key does not exist, 0 is returned assuming an empty hash.

hkeys

public java.util.Set<java.lang.String> hkeys(java.lang.String key)

Return all the fields in a hash.

Time complexity: O(N), where N is the total number of entries

参数:

key -

返回:

All the fields names contained into a hash.

hvals

public java.util.List<java.lang.String> hvals(java.lang.String key)

Return all the values in a hash.

Time complexity: O(N), where N is the total number of entries

参数:

key -

返回:

All the fields values contained into a hash.

hgetAll

public java.util.Map<java.lang.String,java.lang.String> hgetAll(java.lang.String key)

Return all the fields and associated values in a hash.

Time complexity: O(N), where N is the total number of entries

参数:

key -

返回:

All the fields and values contained into a hash.

rpush

public java.lang.Long rpush(java.lang.String key,
                   java.lang.String... strings)

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 append operation. If the key exists but is not a List an error is returned.

Time complexity: O(1)

参数:

key -

strings -

返回:

Integer reply, specifically, the number of elements inside the list after the push operation.

lpush

public java.lang.Long lpush(java.lang.String key,
                   java.lang.String... strings)

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 append operation. If the key exists but is not a List an error is returned.

Time complexity: O(1)

参数:

key -

strings -

返回:

Integer reply, specifically, the number of elements inside the list after the push operation.

llen

public java.lang.Long llen(java.lang.String key)

Return the length of the list stored at the specified key. If the key does not exist zero is returned (the same behaviour as for empty lists). If the value stored at key is not a list an error is returned.

Time complexity: O(1)

参数:

key -

返回:

The length of the list.

lrange

public java.util.List<java.lang.String> lrange(java.lang.String key,
                                      long start,
                                      long end)

Return the specified elements of the list stored at the specified key. Start and end are zero-based indexes. 0 is the first element of the list (the list head), 1 the next element and so on.

For example LRANGE foobar 0 2 will return the first three elements of the list.

start and end can also be negative numbers indicating offsets from the end of the list. For example -1 is the last element of the list, -2 the penultimate element and so on.

Consistency with range functions in various programming languages

Note that if you have a list of numbers from 0 to 100, LRANGE 0 10 will return 11 elements, that is, rightmost item is included. This may or may not be consistent with behavior of range-related functions in your programming language of choice (think Ruby's Range.new, Array#slice or Python's range() function).

LRANGE behavior is consistent with one of Tcl.

Out-of-range indexes

Indexes out of range will not produce an error: if start is over the end of the list, or start > end, an empty list is returned. If end is over the end of the list Redis will threat it just like the last element of the list.

Time complexity: O(start+n) (with n being the length of the range and start being the start offset)

参数:

key -

start -

end -

返回:

Multi bulk reply, specifically a list of elements in the specified range.

ltrim

public java.lang.String ltrim(java.lang.String key,
                     long start,
                     long end)

Trim an existing list so that it will contain only the specified range of elements specified. Start and end are zero-based indexes. 0 is the first element of the list (the list head), 1 the next element and so on.

For example LTRIM foobar 0 2 will modify the list stored at foobar key so that only the first three elements of the list will remain.

start and end can also be negative numbers indicating offsets from the end of the list. For example -1 is the last element of the list, -2 the penultimate element and so on.

Indexes out of range will not produce an error: if start is over the end of the list, or start > end, an empty list is left as value. If end over the end of the list Redis will threat it just like the last element of the list.

Hint: the obvious use of LTRIM is together with LPUSH/RPUSH. For example:

lpush("mylist", "someelement"); ltrim("mylist", 0, 99); *

The above two commands will push elements in the list taking care that the list will not grow without limits. This is very useful when using Redis to store logs for example. It is important to note that when used in this way LTRIM is an O(1) operation because in the average case just one element is removed from the tail of the list.

Time complexity: O(n) (with n being len of list - len of range)

参数:

key -

start -

end -

返回:

Status code reply

lindex

public java.lang.String lindex(java.lang.String key,
                      long index)

Return the specified element of the list stored at the specified key. 0 is the first element, 1 the second and so on. Negative indexes are supported, for example -1 is the last element, -2 the penultimate and so on.

If the value stored at key is not of list type an error is returned. If the index is out of range a 'nil' reply is returned.

Note that even if the average time complexity is O(n) asking for the first or the last element of the list is O(1).

Time complexity: O(n) (with n being the length of the list)

参数:

key -

index -

返回:

Bulk reply, specifically the requested element

lset

public java.lang.String lset(java.lang.String key,
                    long index,
                    java.lang.String value)

Set a new value as the element at index position of the List at key.

Out of range indexes will generate an error.

Similarly to other list commands accepting indexes, the index can be negative to access elements starting from the end of the list. So -1 is the last element, -2 is the penultimate, and so forth.

Time complexity:

O(N) (with N being the length of the list), setting the first or last elements of the list is O(1).

参数:

key -

index -

value -

返回:

Status code reply

另请参阅:

lindex(String, long)

lrem

public java.lang.Long lrem(java.lang.String key,
                  long count,
                  java.lang.String value)

Remove the first count occurrences of the value element from the list. If count is zero all the elements are removed. If count is negative elements are removed from tail to head, instead to go from head to tail that is the normal behaviour. So for example LREM with count -2 and hello as value to remove against the list (a,b,c,hello,x,hello,hello) will lave the list (a,b,c,hello,x). The number of removed elements is returned as an integer, see below for more information about the returned value. Note that non existing keys are considered like empty lists by LREM, so LREM against non existing keys will always return 0.

Time complexity: O(N) (with N being the length of the list)

参数:

key -

count -

value -

返回:

Integer Reply, specifically: The number of removed elements if the operation succeeded

lpop

public java.lang.String lpop(java.lang.String key)

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" LPOP will return "a" and the list will become "b","c".

If the key does not exist or the list is already empty the special value 'nil' is returned.

参数:

key -

返回:

Bulk reply

另请参阅:

rpop(String)

rpop

public java.lang.String rpop(java.lang.String key)

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 return "c" and the list will become "a","b".

If the key does not exist or the list is already empty the special value 'nil' is returned.

参数:

key -

返回:

Bulk reply

另请参阅:

lpop(String)

rpoplpush

public java.lang.String rpoplpush(java.lang.String srckey,
                         java.lang.String dstkey)

Atomically return and remove the last (tail) element of the srckey list, and push the element as the first (head) element of the dstkey list. For example if the source list contains the elements "a","b","c" and the destination list contains the elements "foo","bar" after an RPOPLPUSH command the content of the two lists will be "a","b" and "c","foo","bar".

If the key does not exist or the list is already empty the special value 'nil' is returned. If the srckey and dstkey are the same the operation is equivalent to removing the last element from the list and pusing it as first element of the list, so it's a "list rotation" command.

Time complexity: O(1)

参数:

srckey -

dstkey -

返回:

Bulk reply

sadd

public java.lang.Long sadd(java.lang.String key,
                  java.lang.String... members)

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 new set with the specified member as sole member is created. If the key exists but does not hold a set value an error is returned.

Time complexity O(1)

参数:

key -

members -

返回:

Integer reply, specifically: 1 if the new element was added 0 if the element was already a member of the set

smembers

public java.util.Set<java.lang.String> smembers(java.lang.String key)

Return all the members (elements) of the set value stored at key. This is just syntax glue for SINTER.

Time complexity O(N)

参数:

key -

返回:

Multi bulk reply

srem

public java.lang.Long srem(java.lang.String key,
                  java.lang.String... members)

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 set value an error is returned.

Time complexity O(1)

参数:

key -

members -

返回:

Integer reply, specifically: 1 if the new element was removed 0 if the new element was not a member of the set

spop

public java.lang.String spop(java.lang.String key)

Remove a random element from a Set returning it as return value. If the Set is empty or the key does not exist, a nil object is returned.

The srandmember(String) command does a similar work but the returned element is not removed from the Set.

Time complexity O(1)

参数:

key -

返回:

Bulk reply

spop

public java.util.Set<java.lang.String> spop(java.lang.String key,
                                   long count)

smove

public java.lang.Long smove(java.lang.String srckey,
                   java.lang.String dstkey,
                   java.lang.String member)

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 to be in the source or destination set for accessing clients.

If the source set does not exist or does not contain the specified element no operation is performed and zero is returned, otherwise the element is removed from the source set and added to the destination set. On success one is returned, even if the element was already present in the destination set.

An error is raised if the source or destination keys contain a non Set value.

Time complexity O(1)

参数:

srckey -

dstkey -

member -

返回:

Integer reply, specifically: 1 if the element was moved 0 if the element was not found on the first set and no operation was performed

scard

public java.lang.Long scard(java.lang.String key)

Return the set cardinality (number of elements). If the key does not exist 0 is returned, like for empty sets.

参数:

key -

返回:

Integer reply, specifically: the cardinality (number of elements) of the set as an integer.

sismember

public java.lang.Boolean sismember(java.lang.String key,
                          java.lang.String member)

Return 1 if member is a member of the set stored at key, otherwise 0 is returned.

Time complexity O(1)

参数:

key -

member -

返回:

Integer reply, specifically: 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

sinter

public java.util.Set<java.lang.String> sinter(java.lang.String... keys)

Return the members of a set resulting from the intersection of all the sets hold at the specified keys. Like in LRANGE the result is sent to the client as a multi-bulk reply (see the protocol specification for more information). If just a single key is specified, then this command produces the same result as SMEMBERS. Actually SMEMBERS is just syntax sugar for SINTER.

Non existing keys are considered like empty sets, so if one of the keys is missing an empty set is returned (since the intersection with an empty set always is an empty set).

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

参数:

keys -

返回:

Multi bulk reply, specifically the list of common elements.

sinterstore

public java.lang.Long sinterstore(java.lang.String dstkey,
                         java.lang.String... keys)

This commnad works exactly like SINTER but instead of being returned the resulting set is sotred as dstkey.

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

参数:

dstkey -

keys -

返回:

Status code reply

sunion

public java.util.Set<java.lang.String> sunion(java.lang.String... keys)

Return the members of a set resulting from the union of all the sets hold at the specified keys. Like in LRANGE the result is sent to the client as a multi-bulk reply (see the protocol specification for more information). If just a single key is specified, then this command produces the same result as SMEMBERS.

Non existing keys are considered like empty sets.

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

参数:

keys -

返回:

Multi bulk reply, specifically the list of common elements.

sunionstore

public java.lang.Long sunionstore(java.lang.String dstkey,
                         java.lang.String... keys)

This command works exactly like SUNION but instead of being returned the resulting set is stored as dstkey. Any existing value in dstkey will be over-written.

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

参数:

dstkey -

keys -

返回:

Status code reply

sdiff

public java.util.Set<java.lang.String> sdiff(java.lang.String... keys)

Return the difference between the Set stored at key1 and all the Sets key2, ..., keyN

Example:

 key1 = [x, a, b, c]
 key2 = [c]
 key3 = [a, d]
 SDIFF key1,key2,key3 => [x, b]
 

Non existing keys are considered like empty sets.

Time complexity:

O(N) with N being the total number of elements of all the sets

参数:

keys -

返回:

Return the members of a set resulting from the difference between the first set provided and all the successive sets.

sdiffstore

public java.lang.Long sdiffstore(java.lang.String dstkey,
                        java.lang.String... keys)

This command works exactly like SDIFF but instead of being returned the resulting set is stored in dstkey.

参数:

dstkey -

keys -

返回:

Status code reply

srandmember

public java.lang.String srandmember(java.lang.String key)

Return a random element from a Set, without removing the element. If the Set is empty or the key does not exist, a nil object is returned.

The SPOP command does a similar work but the returned element is popped (removed) from the Set.

Time complexity O(1)

参数:

key -

返回:

Bulk reply

srandmember

public java.util.List<java.lang.String> srandmember(java.lang.String key,
                                           int count)

zadd

public java.lang.Long zadd(java.lang.String key,
                  double score,
                  java.lang.String member)

Add the specified member having the specifeid score to the sorted set stored at key. If member is already a member of the sorted set the score is updated, and the element reinserted in the right position to ensure sorting. If key does not exist a new sorted set with the specified member as sole member is crated. If the key exists but does not hold a sorted set value an error is returned.

The score value can be the string representation of a double precision floating point number.

Time complexity O(log(N)) with N being the number of elements in the sorted set

参数:

key -

score -

member -

返回:

Integer reply, specifically: 1 if the new element was added 0 if the element was already a member of the sorted set and the score was updated

zadd

public java.lang.Long zadd(java.lang.String key,
                  double score,
                  java.lang.String member,
                  redis.clients.jedis.params.sortedset.ZAddParams params)

zadd

public java.lang.Long zadd(java.lang.String key,
                  java.util.Map<java.lang.String,java.lang.Double> scoreMembers)

zadd

public java.lang.Long zadd(java.lang.String key,
                  java.util.Map<java.lang.String,java.lang.Double> scoreMembers,
                  redis.clients.jedis.params.sortedset.ZAddParams params)

zrange

public java.util.Set<java.lang.String> zrange(java.lang.String key,
                                     long start,
                                     long end)

zrem

public java.lang.Long zrem(java.lang.String key,
                  java.lang.String... members)

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 not hold a set value an error is returned.

Time complexity O(log(N)) with N being the number of elements in the sorted set

参数:

key -

members -

返回:

Integer reply, specifically: 1 if the new element was removed 0 if the new element was not a member of the set

zincrby

public java.lang.Double zincrby(java.lang.String key,
                       double score,
                       java.lang.String member)

If member already exists in the sorted set adds the increment to its score and updates the position of the element in the sorted set accordingly. If member does not already exist in the sorted set it is added with increment as score (that is, like if the previous score was virtually zero). If key does not exist a new sorted set with the specified member as sole member is crated. If the key exists but does not hold a sorted set value an error is returned.

The score value can be the string representation of a double precision floating point number. It's possible to provide a negative value to perform a decrement.

For an introduction to sorted sets check the Introduction to Redis data types page.

Time complexity O(log(N)) with N being the number of elements in the sorted set

参数:

key -

score -

member -

返回:

The new score

zincrby

public java.lang.Double zincrby(java.lang.String key,
                       double score,
                       java.lang.String member,
                       redis.clients.jedis.params.sortedset.ZIncrByParams params)

zrank

public java.lang.Long zrank(java.lang.String key,
                   java.lang.String member)

Return the rank (or index) or member in the sorted set at key, with scores being ordered from low to high.

When the given member does not exist in the sorted set, the special value 'nil' is returned. The returned rank (or index) of the member is 0-based for both commands.

Time complexity:

O(log(N))

参数:

key -

member -

返回:

Integer reply or a nil bulk reply, specifically: the rank of the element as an integer reply if the element exists. A nil bulk reply if there is no such element.

另请参阅:

#zrevrank(String, String)

zcard

public java.lang.Long zcard(java.lang.String key)

Return the sorted set cardinality (number of elements). If the key does not exist 0 is returned, like for empty sorted sets.

Time complexity O(1)

参数:

key -

返回:

the cardinality (number of elements) of the set as an integer.

zscore

public java.lang.Double zscore(java.lang.String key,
                      java.lang.String member)

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 exist at all, a special 'nil' value is returned.

Time complexity: O(1)

参数:

key -

member -

返回:

the score

watch

public java.lang.String watch(java.lang.String... keys)

sort

public java.util.List<java.lang.String> sort(java.lang.String key)

Sort a Set or a List.

Sort the elements contained in the List, Set, or Sorted Set value at key. By default sorting is numeric with elements being compared as double precision floating point numbers. This is the simplest form of SORT.

参数:

key -

返回:

Assuming the Set/List at key contains a list of numbers, the return value will be the list of numbers ordered from the smallest to the biggest number.

另请参阅:

sort(String, String), sort(String, SortingParams), sort(String, SortingParams, String)

sort

public java.util.List<java.lang.String> sort(java.lang.String key,
                                    redis.clients.jedis.SortingParams sortingParameters)

Sort a Set or a List accordingly to the specified parameters.

examples:

Given are the following sets and key/values:

 x = [1, 2, 3]
 y = [a, b, c]
 
 k1 = z
 k2 = y
 k3 = x
 
 w1 = 9
 w2 = 8
 w3 = 7
 

Sort Order:

 sort(x) or sort(x, sp.asc())
 -> [1, 2, 3]
 
 sort(x, sp.desc())
 -> [3, 2, 1]
 
 sort(y)
 -> [c, a, b]
 
 sort(y, sp.alpha())
 -> [a, b, c]
 
 sort(y, sp.alpha().desc())
 -> [c, a, b]
 

Limit (e.g. for Pagination):

 sort(x, sp.limit(0, 2))
 -> [1, 2]
 
 sort(y, sp.alpha().desc().limit(1, 2))
 -> [b, a]
 

Sorting by external keys:

 sort(x, sb.by(w*))
 -> [3, 2, 1]
 
 sort(x, sb.by(w*).desc())
 -> [1, 2, 3]
 

Getting external keys:

 sort(x, sp.by(w*).get(k*))
 -> [x, y, z]
 
 sort(x, sp.by(w*).get(#).get(k*))
 -> [3, x, 2, y, 1, z]
 

参数:

key -

sortingParameters -

返回:

a list of sorted elements.

另请参阅:

sort(String), sort(String, SortingParams, String)

sort

public java.lang.Long sort(java.lang.String key,
                  redis.clients.jedis.SortingParams sortingParameters,
                  java.lang.String dstkey)

Sort a Set or a List accordingly to the specified parameters and store the result at dstkey.

参数:

key -

sortingParameters -

dstkey -

返回:

The number of elements of the list at dstkey.

另请参阅:

sort(String, SortingParams), sort(String), sort(String, String)

sort

public java.lang.Long sort(java.lang.String key,
                  java.lang.String dstkey)

Sort a Set or a List and Store the Result at dstkey.

Sort the elements contained in the List, Set, or Sorted Set value at key and store the result at dstkey. By default sorting is numeric with elements being compared as double precision floating point numbers. This is the simplest form of SORT.

参数:

key -

dstkey -

返回:

The number of elements of the list at dstkey.

另请参阅:

sort(String), sort(String, SortingParams), sort(String, SortingParams, String)

brpop

public java.util.List<java.lang.String> brpop(int timeout,
                                     java.lang.String... keys)

BLPOP (and BRPOP) is a blocking list pop primitive. You can see this commands as blocking versions of LPOP and RPOP able to block if the specified keys don't exist or contain empty lists.

The following is a description of the exact semantic. We describe BLPOP but the two commands are identical, the only difference is that BLPOP pops the element from the left (head) of the list, and BRPOP pops from the right (tail).

Non blocking behavior

When BLPOP is called, if at least one of the specified keys contain a non empty list, an element is popped from the head of the list and returned to the caller together with the name of the key (BLPOP returns a two elements array, the first element is the key, the second the popped value).

Keys are scanned from left to right, so for instance if you issue BLPOP list1 list2 list3 0 against a dataset where list1 does not exist but list2 and list3 contain non empty lists, BLPOP guarantees to return an element from the list stored at list2 (since it is the first non empty list starting from the left).

Blocking behavior

If none of the specified keys exist or contain non empty lists, BLPOP blocks until some other client performs a LPUSH or an RPUSH operation against one of the lists.

Once new data is present on one of the lists, the client finally returns with the name of the key unblocking it and the popped value.

When blocking, if a non-zero timeout is specified, the client will unblock returning a nil special value if the specified amount of seconds passed without a push operation against at least one of the specified keys.

The timeout argument is interpreted as an integer value. A timeout of zero means instead to block forever.

Multiple clients blocking for the same keys

Multiple clients can block for the same key. They are put into a queue, so the first to be served will be the one that started to wait earlier, in a first-blpopping first-served fashion.

blocking POP inside a MULTI/EXEC transaction

BLPOP and BRPOP can be used with pipelining (sending multiple commands and reading the replies in batch), but it does not make sense to use BLPOP or BRPOP inside a MULTI/EXEC block (a Redis transaction).

The behavior of BLPOP inside MULTI/EXEC when the list is empty is to return a multi-bulk nil reply, exactly what happens when the timeout is reached. If you like science fiction, think at it like if inside MULTI/EXEC the time will flow at infinite speed :)

Time complexity: O(1)

参数:

timeout -

keys -

返回:

BLPOP returns a two-elements array via a multi bulk reply in order to return both the unblocking key and the popped value.

When a non-zero timeout is specified, and the BLPOP operation timed out, the return value is a nil multi bulk reply. Most client values will return false or nil accordingly to the programming language used.

另请参阅:

#blpop(int, String...)

zcount

public java.lang.Long zcount(java.lang.String key,
                    double min,
                    double max)

zcount

public java.lang.Long zcount(java.lang.String key,
                    java.lang.String min,
                    java.lang.String max)

strlen

public java.lang.Long strlen(java.lang.String key)

lpushx

public java.lang.Long lpushx(java.lang.String key,
                    java.lang.String... string)

persist

public java.lang.Long persist(java.lang.String key)

Undo a expire at turning the expire key into a normal key.

Time complexity: O(1)

参数:

key -

返回:

Integer reply, specifically: 1: the key is now persist. 0: the key is not persist (only happens when key not set).

rpushx

public java.lang.Long rpushx(java.lang.String key,
                    java.lang.String... string)

echo

public java.lang.String echo(java.lang.String string)

linsert

public java.lang.Long linsert(java.lang.String key,
                     redis.clients.jedis.BinaryClient.LIST_POSITION where,
                     java.lang.String pivot,
                     java.lang.String value)

configGet

public java.util.List<java.lang.String> configGet(java.lang.String pattern)

Retrieve the configuration of a running Redis server. Not all the configuration parameters are supported.

CONFIG GET returns the current configuration parameters. This sub command only accepts a single argument, that is glob style pattern. All the configuration parameters matching this parameter are reported as a list of key-value pairs.

Example:

 $ redis-cli config get '*'
 1. "dbfilename"
 2. "dump.rdb"
 3. "requirepass"
 4. (nil)
 5. "masterauth"
 6. (nil)
 7. "maxmemory"
 8. "0\n"
 9. "appendfsync"
 10. "everysec"
 11. "save"
 12. "3600 1 300 100 60 10000"
 
 $ redis-cli config get 'm*'
 1. "masterauth"
 2. (nil)
 3. "maxmemory"
 4. "0\n"
 

参数:

pattern -

返回:

Bulk reply.

eval

public java.lang.Object eval(java.lang.String script,
                    int keyCount,
                    java.lang.String... params)

subscribe

public void subscribe(redis.clients.jedis.JedisPubSub jedisPubSub,
             java.lang.String... channels)

publish

public java.lang.Long publish(java.lang.String channel,
                     java.lang.String message)

psubscribe

public void psubscribe(redis.clients.jedis.JedisPubSub jedisPubSub,
              java.lang.String... patterns)

pexpire

public java.lang.Long pexpire(java.lang.String key,
                     long milliseconds)

 redis 127.0.0.1:26381> sentinel masters
 1)  1) "name"
     2) "mymaster"
     3) "ip"
     4) "127.0.0.1"
     5) "port"
     6) "6379"
     7) "runid"
     8) "93d4d4e6e9c06d0eea36e27f31924ac26576081d"
     9) "flags"
    10) "master"
    11) "pending-commands"
    12) "0"
    13) "last-ok-ping-reply"
    14) "423"
    15) "last-ping-reply"
    16) "423"
    17) "info-refresh"
    18) "6107"
    19) "num-slaves"
    20) "1"
    21) "num-other-sentinels"
    22) "2"
    23) "quorum"
    24) "2"
 
 

返回:

pexpireAt

public java.lang.Long pexpireAt(java.lang.String key,
                       long millisecondsTimestamp)

pttl

public java.lang.Long pttl(java.lang.String key)

psetex

public java.lang.String psetex(java.lang.String key,
                      long milliseconds,
                      java.lang.String value)

PSETEX works exactly like setex(String, int, String) with the sole difference that the expire time is specified in milliseconds instead of seconds. Time complexity: O(1)

参数:

key -

milliseconds -

value -

返回:

Status code reply

pipelined

public redis.clients.jedis.Pipeline pipelined()