redis_cluster

Struct Cluster

Source 
pub struct Cluster { /* private fields */ }

Implementations§

Source§

impl Cluster

Source

pub fn new(startup_nodes: Vec<&str>) -> Cluster

Examples found in repository?
examples/basic.rs (line 10)
7fn main() {
8    let startup_nodes =
9        vec!["redis://127.0.0.1:7000", "redis://127.0.0.1:7001", "redis://127.0.0.1:7002"];
10    let mut clus = Cluster::new(startup_nodes);
11    let mut cmd = ClusterCmd::new();
12    cmd.arg("SET").arg("foo").arg("bar");
13    let _: () = clus.send_command(&cmd).unwrap();
14
15    let mut cmd = ClusterCmd::new();
16    cmd.arg("GET").arg("foo");
17    let res: String = clus.send_command(&cmd).unwrap();
18    println!("{:?}", res);
19    assert_eq!(res, "bar");
20
21    let _: () = clus.set("hey", "there").unwrap();
22    let res: String = clus.get("hey").unwrap();
23    println!("{:?}", res);
24    assert_eq!(res, "there");
25}
Source

pub fn send_command<T: FromRedisValue>( &mut self, cmd: &ClusterCmd, ) -> RedisResult<T>

Examples found in repository?
examples/basic.rs (line 13)
7fn main() {
8    let startup_nodes =
9        vec!["redis://127.0.0.1:7000", "redis://127.0.0.1:7001", "redis://127.0.0.1:7002"];
10    let mut clus = Cluster::new(startup_nodes);
11    let mut cmd = ClusterCmd::new();
12    cmd.arg("SET").arg("foo").arg("bar");
13    let _: () = clus.send_command(&cmd).unwrap();
14
15    let mut cmd = ClusterCmd::new();
16    cmd.arg("GET").arg("foo");
17    let res: String = clus.send_command(&cmd).unwrap();
18    println!("{:?}", res);
19    assert_eq!(res, "bar");
20
21    let _: () = clus.set("hey", "there").unwrap();
22    let res: String = clus.get("hey").unwrap();
23    println!("{:?}", res);
24    assert_eq!(res, "there");
25}

Trait Implementations§

Source§

impl Clone for Cluster

Source§

fn clone(&self) -> Cluster

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Commands for Cluster

Source§

fn get<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get the value of a key. If key is a vec this becomes an MGET.
Source§

fn keys<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Gets all keys matching pattern
Source§

fn set<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the string value of a key.
Source§

fn set_multiple<K, V, RV>(&self, items: &[(K, V)]) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets multiple keys to their values.
Source§

fn set_ex<K, V, RV>( &self, key: K, value: V, seconds: usize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Set the value and expiration of a key.
Source§

fn set_nx<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

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

fn mset_nx<K, V, RV>(&self, items: &[(K, V)]) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets multiple keys to their values failing if at least one already exists.
Source§

fn getset<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

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

fn del<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Delete one or more keys.
Source§

fn exists<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Determine if a key exists.
Source§

fn expire<K, RV>(&self, key: K, seconds: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Set a key’s time to live in seconds.
Source§

fn expire_at<K, RV>(&self, key: K, ts: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Set the expiration for a key as a UNIX timestamp.
Source§

fn pexpire<K, RV>(&self, key: K, ms: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Set a key’s time to live in milliseconds.
Source§

fn pexpire_at<K, RV>(&self, key: K, ts: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn persist<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Remove the expiration from a key.
Source§

fn rename<K, RV>(&self, key: K, new_key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Rename a key.
Source§

fn rename_nx<K, RV>(&self, key: K, new_key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn append<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Append a value to a key.
Source§

fn incr<K, V, RV>(&self, key: K, delta: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type.
Source§

fn setbit<K, RV>( &self, key: K, offset: usize, value: bool, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn getbit<K, RV>(&self, key: K, offset: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn bitcount<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Count set bits in a string.
Source§

fn bitcount_range<K, RV>( &self, key: K, start: usize, end: usize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Count set bits in a string in a range.
Source§

fn bit_and<K, RV>(&self, dstkey: K, srckeys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key.
Source§

fn bit_or<K, RV>(&self, dstkey: K, srckeys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key.
Source§

fn bit_xor<K, RV>(&self, dstkey: K, srckeys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key.
Source§

fn bit_not<K, RV>(&self, dstkey: K, srckey: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key.
Source§

fn strlen<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get the length of the value stored in a key.
Source§

fn hget<K, F, RV>(&self, key: K, field: F) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Gets a single (or multiple) fields from a hash.
Source§

fn hdel<K, F, RV>(&self, key: K, field: F) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Deletes a single (or multiple) fields from a hash.
Source§

fn hset<K, F, V, RV>( &self, key: K, field: F, value: V, ) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets a single field in a hash.
Source§

fn hset_nx<K, F, V, RV>( &self, key: K, field: F, value: V, ) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets a single field in a hash if it does not exist.
Source§

fn hset_multiple<K, F, V, RV>( &self, key: K, items: &[(F, V)], ) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Sets a multiple fields in a hash.
Source§

fn hincr<K, F, D, RV>( &self, key: K, field: F, delta: D, ) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue,

Increments a value.
Source§

fn hexists<K, F, RV>(&self, key: K, field: F) -> Result<RV, RedisError>
where K: ToRedisArgs, F: ToRedisArgs, RV: FromRedisValue,

Checks if a field in a hash exists.
Source§

fn hkeys<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Gets all the keys in a hash.
Source§

fn hvals<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Gets all the values in a hash.
Source§

fn hgetall<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Gets all the fields and values in a hash.
Source§

fn hlen<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Gets the length of a hash.
Source§

fn blpop<K, RV>(&self, key: K, timeout: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn brpop<K, RV>(&self, key: K, timeout: usize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn brpoplpush<K, RV>( &self, srckey: K, dstkey: K, timeout: usize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn lindex<K, RV>(&self, key: K, index: isize) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get an element from a list by its index.
Source§

fn linsert_before<K, P, V, RV>( &self, key: K, pivot: P, value: V, ) -> Result<RV, RedisError>
where K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert an element before another element in a list.
Source§

fn linsert_after<K, P, V, RV>( &self, key: K, pivot: P, value: V, ) -> Result<RV, RedisError>
where K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert an element after another element in a list.
Source§

fn llen<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Returns the length of the list stored at key.
Source§

fn lpop<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Removes and returns the first element of the list stored at key.
Source§

fn lpush<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert all the specified values at the head of the list stored at key.
Source§

fn lpush_exists<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Inserts a value at the head of the list stored at key, only if key already exists and holds a list.
Source§

fn lrange<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Returns the specified elements of the list stored at key.
Source§

fn lrem<K, V, RV>( &self, key: K, count: isize, value: V, ) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Removes the first count occurrences of elements equal to value from the list stored at key.
Source§

fn ltrim<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Trim an existing list so that it will contain only the specified range of elements specified.
Source§

fn rpop<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Removes and returns the last element of the list stored at key.
Source§

fn rpoplpush<K, RV>(&self, key: K, dstkey: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Pop a value from a list, push it to another list and return it.
Source§

fn rpush<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Insert all the specified values at the tail of the list stored at key.
Source§

fn rpush_exists<K, V, RV>(&self, key: K, value: V) -> Result<RV, RedisError>
where K: ToRedisArgs, V: ToRedisArgs, RV: FromRedisValue,

Inserts value at the tail of the list stored at key, only if key already exists and holds a list.
Source§

fn sadd<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Add one or more members to a set.
Source§

fn scard<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get the number of members in a set.
Source§

fn sdiff<K, RV>(&self, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Subtract multiple sets.
Source§

fn sdiffstore<K, RV>(&self, dstkey: K, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn sinter<K, RV>(&self, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sets.
Source§

fn sdinterstore<K, RV>(&self, dstkey: K, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn sismember<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

fn smembers<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get all the members in a set.
Source§

fn smove<K, M, RV>( &self, srckey: K, dstkey: K, member: M, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Move a member from one set to another.
Source§

fn spop<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Remove and return a random member from a set.
Source§

fn srandmember<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get one random member from a set.
Source§

fn srandmember_multiple<K, RV>( &self, key: K, count: usize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get multiple random members from a set.
Source§

fn srem<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Remove one or more members from a set.
Source§

fn sunion<K, RV>(&self, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Add multiple sets.
Source§

fn sunionstore<K, RV>(&self, dstkey: K, keys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn zadd<K, S, M, RV>( &self, key: K, member: M, score: S, ) -> Result<RV, RedisError>
where K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Add one member to a sorted set, or update its score if it already exists.
Source§

fn zadd_multiple<K, S, M, RV>( &self, key: K, items: &[(S, M)], ) -> Result<RV, RedisError>
where K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Add multiple members to a sorted set, or update its score if it already exists.
Source§

fn zcard<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Get the number of members in a sorted set.
Source§

fn zcount<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

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

fn zincr<K, M, D, RV>( &self, key: K, member: M, delta: D, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs, RV: FromRedisValue,

Increments the member in a sorted set at key by delta. If the member does not exist, it is added with delta as its score.
Source§

fn zinterstore<K, RV>(&self, dstkey: K, keys: &[K]) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.
Source§

fn zinterstore_min<K, RV>( &self, dstkey: K, keys: &[K], ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.
Source§

fn zinterstore_max<K, RV>( &self, dstkey: K, keys: &[K], ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.
Source§

fn zlexcount<K, L, RV>(&self, key: K, min: L, max: L) -> Result<RV, RedisError>
where K: ToRedisArgs, L: ToRedisArgs, RV: FromRedisValue,

Count the number of members in a sorted set between a given lexicographical range.
Source§

fn zrange<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by index
Source§

fn zrange_withscores<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by index with scores.
Source§

fn zrangebylex<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range.
Source§

fn zrangebylex_limit<K, M, MM, RV>( &self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Source§

fn zrevrangebylex<K, MM, M, RV>( &self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range.
Source§

fn zrevrangebylex_limit<K, MM, M, RV>( &self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by lexicographical range with offset and limit.
Source§

fn zrangebyscore<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

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

fn zrangebyscore_withscores<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with scores.
Source§

fn zrangebyscore_limit<K, M, MM, RV>( &self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit.
Source§

fn zrangebyscore_limit_withscores<K, M, MM, RV>( &self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit with scores.
Source§

fn zrank<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Determine the index of a member in a sorted set.
Source§

fn zrem<K, M, RV>(&self, key: K, members: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Remove one or more members from a sorted set.
Source§

fn zrembylex<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

Remove all members in a sorted set between the given lexicographical range.
Source§

fn zrembyrank<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn zrembyscore<K, M, MM, RV>( &self, key: K, min: M, max: MM, ) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs, RV: FromRedisValue,

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

fn zrevrange<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn zrevrange_withscores<K, RV>( &self, key: K, start: isize, stop: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

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

fn zrevrangebyscore<K, MM, M, RV>( &self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

fn zrevrangebyscore_withscores<K, MM, M, RV>( &self, key: K, max: MM, min: M, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with scores.
Source§

fn zrevrangebyscore_limit<K, MM, M, RV>( &self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit.
Source§

fn zrevrangebyscore_limit_withscores<K, MM, M, RV>( &self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<RV, RedisError>
where K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

Return a range of members in a sorted set, by score with limit with scores.
Source§

fn zrevrank<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

fn zscore<K, M, RV>(&self, key: K, member: M) -> Result<RV, RedisError>
where K: ToRedisArgs, M: ToRedisArgs, RV: FromRedisValue,

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

fn zunionstore<K, RV>(&self, dstkey: K, keys: &[K]) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function.
Source§

fn zunionstore_min<K, RV>( &self, dstkey: K, keys: &[K], ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function.
Source§

fn zunionstore_max<K, RV>( &self, dstkey: K, keys: &[K], ) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function.
Source§

fn pfadd<K, E, RV>(&self, key: K, element: E) -> Result<RV, RedisError>
where K: ToRedisArgs, E: ToRedisArgs, RV: FromRedisValue,

Adds the specified elements to the specified HyperLogLog.
Source§

fn pfcount<K, RV>(&self, key: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s).
Source§

fn pfmerge<K, RV>(&self, dstkey: K, srckeys: K) -> Result<RV, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Merge N different HyperLogLogs into a single one.
Source§

fn publish<K, E, RV>(&self, channel: K, message: E) -> Result<RV, RedisError>
where K: ToRedisArgs, E: ToRedisArgs, RV: FromRedisValue,

Posts a message to the given channel.
Source§

fn scan<RV>(&self) -> Result<Iter<'_, RV>, RedisError>
where RV: FromRedisValue,

Incrementally iterate the keys space.
Source§

fn scan_match<P, RV>(&self, pattern: P) -> Result<Iter<'_, RV>, RedisError>
where P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate the keys space for keys matching a pattern.
Source§

fn hscan<K, RV>(&self, key: K) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate hash fields and associated values.
Source§

fn hscan_match<K, P, RV>( &self, key: K, pattern: P, ) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate hash fields and associated values for field names matching a pattern.
Source§

fn sscan<K, RV>(&self, key: K) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements.
Source§

fn sscan_match<K, P, RV>( &self, key: K, pattern: P, ) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate set elements for elements matching a pattern.
Source§

fn zscan<K, RV>(&self, key: K) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate sorted set elements.
Source§

fn zscan_match<K, P, RV>( &self, key: K, pattern: P, ) -> Result<Iter<'_, RV>, RedisError>
where K: ToRedisArgs, P: ToRedisArgs, RV: FromRedisValue,

Incrementally iterate sorted set elements for elements matching a pattern.
Source§

impl ConnectionLike for Cluster

Source§

fn req_packed_command(&self, cmd: &[u8]) -> RedisResult<Value>

Sends an already encoded (packed) command into the TCP socket and reads the single response from it.
Source§

fn req_packed_commands( &self, cmd: &[u8], offset: usize, count: usize, ) -> RedisResult<Vec<Value>>

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining.
Source§

fn get_db(&self) -> i64

Returns the database this connection is bound to. Note that this information might be unreliable because it’s initially cached and also might be incorrect if the connection like object is not actually connected.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.