160 lines
3.6 KiB
Java
160 lines
3.6 KiB
Java
package redis.clients.jedis;
|
|
|
|
import java.util.Collection;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
import java.util.Set;
|
|
|
|
import redis.clients.jedis.BinaryClient.LIST_POSITION;
|
|
|
|
/**
|
|
* Common interface for sharded and non-sharded BinaryJedis
|
|
*/
|
|
public interface BinaryJedisCommands {
|
|
String set(byte[] key, byte[] value);
|
|
|
|
byte[] get(byte[] key);
|
|
|
|
Integer exists(byte[] key);
|
|
|
|
String type(byte[] key);
|
|
|
|
Integer expire(byte[] key, int seconds);
|
|
|
|
Integer expireAt(byte[] key, long unixTime);
|
|
|
|
Integer ttl(byte[] key);
|
|
|
|
byte[] getSet(byte[] key, byte[] value);
|
|
|
|
Integer setnx(byte[] key, byte[] value);
|
|
|
|
String setex(byte[] key, int seconds, byte[] value);
|
|
|
|
Integer decrBy(byte[] key, int integer);
|
|
|
|
Integer decr(byte[] key);
|
|
|
|
Integer incrBy(byte[] key, int integer);
|
|
|
|
Integer incr(byte[] key);
|
|
|
|
Integer append(byte[] key, byte[] value);
|
|
|
|
byte[] substr(byte[] key, int start, int end);
|
|
|
|
Integer hset(byte[] key, byte[] field, byte[] value);
|
|
|
|
byte[] hget(byte[] key, byte[] field);
|
|
|
|
Integer hsetnx(byte[] key, byte[] field, byte[] value);
|
|
|
|
String hmset(byte[] key, Map<byte[], byte[]> hash);
|
|
|
|
List<byte[]> hmget(byte[] key, byte[]... fields);
|
|
|
|
Integer hincrBy(byte[] key, byte[] field, int value);
|
|
|
|
Integer hexists(byte[] key, byte[] field);
|
|
|
|
Integer hdel(byte[] key, byte[] field);
|
|
|
|
Integer hlen(byte[] key);
|
|
|
|
Set<byte[]> hkeys(byte[] key);
|
|
|
|
Collection<byte[]> hvals(byte[] key);
|
|
|
|
Map<byte[], byte[]> hgetAll(byte[] key);
|
|
|
|
Integer rpush(byte[] key, byte[] string);
|
|
|
|
Integer lpush(byte[] key, byte[] string);
|
|
|
|
Integer llen(byte[] key);
|
|
|
|
List<byte[]> lrange(byte[] key, int start, int end);
|
|
|
|
String ltrim(byte[] key, int start, int end);
|
|
|
|
byte[] lindex(byte[] key, int index);
|
|
|
|
String lset(byte[] key, int index, byte[] value);
|
|
|
|
Integer lrem(byte[] key, int count, byte[] value);
|
|
|
|
byte[] lpop(byte[] key);
|
|
|
|
byte[] rpop(byte[] key);
|
|
|
|
Integer sadd(byte[] key, byte[] member);
|
|
|
|
Set<byte[]> smembers(byte[] key);
|
|
|
|
Integer srem(byte[] key, byte[] member);
|
|
|
|
byte[] spop(byte[] key);
|
|
|
|
Integer scard(byte[] key);
|
|
|
|
Integer sismember(byte[] key, byte[] member);
|
|
|
|
byte[] srandmember(byte[] key);
|
|
|
|
Integer zadd(byte[] key, double score, byte[] member);
|
|
|
|
Set<byte[]> zrange(byte[] key, int start, int end);
|
|
|
|
Integer zrem(byte[] key, byte[] member);
|
|
|
|
Double zincrby(byte[] key, double score, byte[] member);
|
|
|
|
Integer zrank(byte[] key, byte[] member);
|
|
|
|
Integer zrevrank(byte[] key, byte[] member);
|
|
|
|
Set<byte[]> zrevrange(byte[] key, int start, int end);
|
|
|
|
Set<Tuple> zrangeWithScores(byte[] key, int start, int end);
|
|
|
|
Set<Tuple> zrevrangeWithScores(byte[] key, int start, int end);
|
|
|
|
Integer zcard(byte[] key);
|
|
|
|
Double zscore(byte[] key, byte[] member);
|
|
|
|
List<byte[]> sort(byte[] key);
|
|
|
|
List<byte[]> sort(byte[] key, SortingParams sortingParameters);
|
|
|
|
Integer zcount(byte[] key, double min, double max);
|
|
|
|
Set<byte[]> zrangeByScore(byte[] key, double min, double max);
|
|
|
|
Set<byte[]> zrangeByScore(
|
|
byte[] key,
|
|
double min,
|
|
double max,
|
|
int offset,
|
|
int count);
|
|
|
|
Set<Tuple> zrangeByScoreWithScores(byte[] key, double min, double max);
|
|
|
|
Set<Tuple> zrangeByScoreWithScores(
|
|
byte[] key,
|
|
double min,
|
|
double max,
|
|
int offset,
|
|
int count);
|
|
|
|
Integer zremrangeByRank(byte[] key, int start, int end);
|
|
|
|
Integer zremrangeByScore(byte[] key, double start, double end);
|
|
|
|
Integer linsert(
|
|
byte[] key,
|
|
LIST_POSITION where,
|
|
byte[] pivot,
|
|
byte[] value);
|
|
}
|