Trait r2d2_redis_cluster::Commands

pub trait Commands: ConnectionLike {
    pub fn get<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn keys<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn set<K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn set_multiple<K, V, RV>(
        &mut self, 
        items: &[(K, V)]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn set_ex<K, V, RV>(
        &mut self, 
        key: K, 
        value: V, 
        seconds: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn set_nx<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn mset_nx<K, V, RV>(
        &mut self, 
        items: &[(K, V)]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn getset<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn del<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn exists<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn expire<K, RV>(
        &mut self, 
        key: K, 
        seconds: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn expire_at<K, RV>(
        &mut self, 
        key: K, 
        ts: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn pexpire<K, RV>(
        &mut self, 
        key: K, 
        ms: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn pexpire_at<K, RV>(
        &mut self, 
        key: K, 
        ts: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn persist<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn ttl<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rename<K, RV>(
        &mut self, 
        key: K, 
        new_key: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rename_nx<K, RV>(
        &mut self, 
        key: K, 
        new_key: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn append<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn incr<K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn setbit<K, RV>(
        &mut self, 
        key: K, 
        offset: usize, 
        value: bool
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn getbit<K, RV>(
        &mut self, 
        key: K, 
        offset: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bitcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bitcount_range<K, RV>(
        &mut self, 
        key: K, 
        start: usize, 
        end: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bit_and<K, RV>(
        &mut self, 
        dstkey: K, 
        srckeys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bit_or<K, RV>(
        &mut self, 
        dstkey: K, 
        srckeys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bit_xor<K, RV>(
        &mut self, 
        dstkey: K, 
        srckeys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn bit_not<K, RV>(
        &mut self, 
        dstkey: K, 
        srckey: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn strlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hget<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hdel<K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hset<K, F, V, RV>(
        &mut self, 
        key: K, 
        field: F, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hset_nx<K, F, V, RV>(
        &mut self, 
        key: K, 
        field: F, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hset_multiple<K, F, V, RV>(
        &mut self, 
        key: K, 
        items: &[(F, V)]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hincr<K, F, D, RV>(
        &mut self, 
        key: K, 
        field: F, 
        delta: D
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        F: ToRedisArgs,
        D: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hexists<K, F, RV>(
        &mut self, 
        key: K, 
        field: F
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        F: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hkeys<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hvals<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hgetall<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hlen<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn blpop<K, RV>(
        &mut self, 
        key: K, 
        timeout: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn brpop<K, RV>(
        &mut self, 
        key: K, 
        timeout: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn brpoplpush<K, RV>(
        &mut self, 
        srckey: K, 
        dstkey: K, 
        timeout: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lindex<K, RV>(
        &mut self, 
        key: K, 
        index: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn linsert_before<K, P, V, RV>(
        &mut self, 
        key: K, 
        pivot: P, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn linsert_after<K, P, V, RV>(
        &mut self, 
        key: K, 
        pivot: P, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn llen<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lpop<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lpush<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lpush_exists<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lrange<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lrem<K, V, RV>(
        &mut self, 
        key: K, 
        count: isize, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn ltrim<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn lset<K, V, RV>(
        &mut self, 
        key: K, 
        index: isize, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rpop<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rpoplpush<K, RV>(
        &mut self, 
        key: K, 
        dstkey: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rpush<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn rpush_exists<K, V, RV>(
        &mut self, 
        key: K, 
        value: V
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        V: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sadd<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn scard<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sdiff<K, RV>(&mut self, keys: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sdiffstore<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sinter<K, RV>(&mut self, keys: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sdinterstore<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sismember<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn smembers<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn smove<K, M, RV>(
        &mut self, 
        srckey: K, 
        dstkey: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn spop<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn srandmember<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn srandmember_multiple<K, RV>(
        &mut self, 
        key: K, 
        count: usize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn srem<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sunion<K, RV>(&mut self, keys: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sunionstore<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zadd<K, S, M, RV>(
        &mut self, 
        key: K, 
        member: M, 
        score: S
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        S: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zadd_multiple<K, S, M, RV>(
        &mut self, 
        key: K, 
        items: &[(S, M)]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        S: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zcard<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zcount<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zincr<K, M, D, RV>(
        &mut self, 
        key: K, 
        member: M, 
        delta: D
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        D: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zinterstore<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zinterstore_min<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zinterstore_max<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zlexcount<K, L, RV>(
        &mut self, 
        key: K, 
        min: L, 
        max: L
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        L: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrange<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrange_withscores<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrangebylex<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrangebylex_limit<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrangebylex<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrangebylex_limit<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrangebyscore<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrangebyscore_withscores<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrangebyscore_limit<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrangebyscore_limit_withscores<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrank<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrem<K, M, RV>(
        &mut self, 
        key: K, 
        members: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrembylex<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrembyrank<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrembyscore<K, M, MM, RV>(
        &mut self, 
        key: K, 
        min: M, 
        max: MM
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrange<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrevrange_withscores<K, RV>(
        &mut self, 
        key: K, 
        start: isize, 
        stop: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zrevrangebyscore<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrangebyscore_withscores<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrangebyscore_limit<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrangebyscore_limit_withscores<K, MM, M, RV>(
        &mut self, 
        key: K, 
        max: MM, 
        min: M, 
        offset: isize, 
        count: isize
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
        MM: ToRedisArgs,
    { ... }
    pub fn zrevrank<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zscore<K, M, RV>(
        &mut self, 
        key: K, 
        member: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zunionstore<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zunionstore_min<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zunionstore_max<K, RV>(
        &mut self, 
        dstkey: K, 
        keys: &[K]
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn pfadd<K, E, RV>(
        &mut self, 
        key: K, 
        element: E
    ) -> Result<RV, RedisError>
    where
        E: ToRedisArgs,
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn pfcount<K, RV>(&mut self, key: K) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn pfmerge<K, RV>(
        &mut self, 
        dstkey: K, 
        srckeys: K
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn publish<K, E, RV>(
        &mut self, 
        channel: K, 
        message: E
    ) -> Result<RV, RedisError>
    where
        E: ToRedisArgs,
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn geo_add<K, M, RV>(
        &mut self, 
        key: K, 
        members: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn geo_dist<K, M1, M2, RV>(
        &mut self, 
        key: K, 
        member1: M1, 
        member2: M2, 
        unit: Unit
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
        M1: ToRedisArgs,
        M2: ToRedisArgs,
    { ... }
    pub fn geo_hash<K, M, RV>(
        &mut self, 
        key: K, 
        members: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn geo_pos<K, M, RV>(
        &mut self, 
        key: K, 
        members: M
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn geo_radius<K, RV>(
        &mut self, 
        key: K, 
        longitude: f64, 
        latitude: f64, 
        radius: f64, 
        unit: Unit, 
        options: RadiusOptions
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn geo_radius_by_member<K, M, RV>(
        &mut self, 
        key: K, 
        member: M, 
        radius: f64, 
        unit: Unit, 
        options: RadiusOptions
    ) -> Result<RV, RedisError>
    where
        K: ToRedisArgs,
        M: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError>
    where
        RV: FromRedisValue,
    { ... }
    pub fn scan_match<P, RV>(
        &mut self, 
        pattern: P
    ) -> Result<Iter<'_, RV>, RedisError>
    where
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn hscan_match<K, P, RV>(
        &mut self, 
        key: K, 
        pattern: P
    ) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn sscan_match<K, P, RV>(
        &mut self, 
        key: K, 
        pattern: P
    ) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
    pub fn zscan_match<K, P, RV>(
        &mut self, 
        key: K, 
        pattern: P
    ) -> Result<Iter<'_, RV>, RedisError>
    where
        K: ToRedisArgs,
        P: ToRedisArgs,
        RV: FromRedisValue,
    { ... }
}

Implements common redis commands for connection like objects. This allows you to send commands straight to a connection or client. It is also implemented for redis results of clients which makes for very convenient access in some basic cases.

This allows you to use nicer syntax for some common operations. For instance this code:

let client = redis::Client::open("redis://127.0.0.1/")?;
let mut con = client.get_connection()?;
redis::cmd("SET").arg("my_key").arg(42).execute(&mut con);
assert_eq!(redis::cmd("GET").arg("my_key").query(&mut con), Ok(42));

Will become this:

use redis::Commands;
let client = redis::Client::open("redis://127.0.0.1/")?;
let mut con = client.get_connection()?;
assert_eq!(con.get("my_key"), Ok(42));

Provided methods

pub fn get<K, RV>(&mut 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.

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

Gets all keys matching pattern

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

Set the string value of a key.

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

Sets multiple keys to their values.

pub fn set_ex<K, V, RV>(
    &mut 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.

pub fn set_nx<K, V, RV>(&mut 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

pub fn mset_nx<K, V, RV>(&mut 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.

pub fn getset<K, V, RV>(&mut 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.

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

Delete one or more keys.

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

Determine if a key exists.

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

Set a key's time to live in seconds.

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

Set the expiration for a key as a UNIX timestamp.

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

Set a key's time to live in milliseconds.

pub fn pexpire_at<K, RV>(&mut 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.

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

Remove the expiration from a key.

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

Check the expiration time of a key.

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

Rename a key.

pub fn rename_nx<K, RV>(&mut 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.

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

Append a value to a key.

pub fn incr<K, V, RV>(&mut 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.

pub fn setbit<K, RV>(
    &mut 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.

pub fn getbit<K, RV>(&mut 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.

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

Count set bits in a string.

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

Count set bits in a string in a range.

pub fn bit_and<K, RV>(
    &mut 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.

pub fn bit_or<K, RV>(&mut 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.

pub fn bit_xor<K, RV>(
    &mut 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.

pub fn bit_not<K, RV>(&mut 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.

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

Get the length of the value stored in a key.

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

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

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

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

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

Sets a single field in a hash.

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

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

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

Sets a multiple fields in a hash.

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

Increments a value.

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

Checks if a field in a hash exists.

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

Gets all the keys in a hash.

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

Gets all the values in a hash.

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

Gets all the fields and values in a hash.

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

Gets the length of a hash.

pub fn blpop<K, RV>(&mut 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.

pub fn brpop<K, RV>(&mut 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.

pub fn brpoplpush<K, RV>(
    &mut 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.

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

Get an element from a list by its index.

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

Insert an element before another element in a list.

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

Insert an element after another element in a list.

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

Returns the length of the list stored at key.

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

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

pub fn lpush<K, V, RV>(&mut 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.

pub fn lpush_exists<K, V, RV>(
    &mut 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.

pub fn lrange<K, RV>(
    &mut 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.

pub fn lrem<K, V, RV>(
    &mut 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.

pub fn ltrim<K, RV>(
    &mut 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.

pub fn lset<K, V, RV>(
    &mut self,
    key: K,
    index: isize,
    value: V
) -> Result<RV, RedisError> where
    K: ToRedisArgs,
    V: ToRedisArgs,
    RV: FromRedisValue, 

Sets the list element at index to value

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

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

pub fn rpoplpush<K, RV>(&mut 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.

pub fn rpush<K, V, RV>(&mut 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.

pub fn rpush_exists<K, V, RV>(
    &mut 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.

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

Add one or more members to a set.

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

Get the number of members in a set.

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

Subtract multiple sets.

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

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

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

Intersect multiple sets.

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

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

pub fn sismember<K, M, RV>(
    &mut 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.

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

Get all the members in a set.

pub fn smove<K, M, RV>(
    &mut 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.

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

Remove and return a random member from a set.

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

Get one random member from a set.

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

Get multiple random members from a set.

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

Remove one or more members from a set.

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

Add multiple sets.

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

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

pub fn zadd<K, S, M, RV>(
    &mut 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.

pub fn zadd_multiple<K, S, M, RV>(
    &mut 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.

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

Get the number of members in a sorted set.

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

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

pub fn zincr<K, M, D, RV>(
    &mut 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.

pub fn zinterstore<K, RV>(
    &mut 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.

pub fn zinterstore_min<K, RV>(
    &mut 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.

pub fn zinterstore_max<K, RV>(
    &mut 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.

pub fn zlexcount<K, L, RV>(
    &mut 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.

pub fn zrange<K, RV>(
    &mut 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

pub fn zrange_withscores<K, RV>(
    &mut 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pub fn zrank<K, M, RV>(&mut 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.

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

Remove one or more members from a sorted set.

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

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

pub fn zrembyrank<K, RV>(
    &mut 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.

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

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

pub fn zrevrange<K, RV>(
    &mut 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.

pub fn zrevrange_withscores<K, RV>(
    &mut 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.

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

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

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

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

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

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

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

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

pub fn zrevrank<K, M, RV>(
    &mut 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.

pub fn zscore<K, M, RV>(&mut 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.

pub fn zunionstore<K, RV>(
    &mut 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.

pub fn zunionstore_min<K, RV>(
    &mut 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.

pub fn zunionstore_max<K, RV>(
    &mut 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.

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

Adds the specified elements to the specified HyperLogLog.

pub fn pfcount<K, RV>(&mut 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).

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

Merge N different HyperLogLogs into a single one.

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

Posts a message to the given channel.

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

Adds the specified geospatial items to the specified key.

Every member has to be written as a tuple of (longitude, latitude, member_name). It can be a single tuple, or a vector of tuples.

longitude, latitude can be set using redis::geo::Coord.

Returns the number of elements added to the sorted set, not including elements already existing for which the score was updated.

Example

use redis::{Commands, Connection, RedisResult};
use redis::geo::Coord;

fn add_point(con: &mut Connection) -> RedisResult<isize> {
    con.geo_add("my_gis", (Coord::lon_lat(13.361389, 38.115556), "Palermo"))
}

fn add_point_with_tuples(con: &mut Connection) -> RedisResult<isize> {
    con.geo_add("my_gis", ("13.361389", "38.115556", "Palermo"))
}

fn add_many_points(con: &mut Connection) -> RedisResult<isize> {
    con.geo_add("my_gis", &[
        ("13.361389", "38.115556", "Palermo"),
        ("15.087269", "37.502669", "Catania")
    ])
}

pub fn geo_dist<K, M1, M2, RV>(
    &mut self,
    key: K,
    member1: M1,
    member2: M2,
    unit: Unit
) -> Result<RV, RedisError> where
    K: ToRedisArgs,
    RV: FromRedisValue,
    M1: ToRedisArgs,
    M2: ToRedisArgs, 

Return the distance between two members in the geospatial index represented by the sorted set.

If one or both the members are missing, the command returns NULL, so it may be convenient to parse its response as either Option<f64> or Option<String>.

Example

use redis::{Commands, RedisResult};
use redis::geo::Unit;

fn get_dists(con: &mut redis::Connection) {
    let x: RedisResult<f64> = con.geo_dist(
        "my_gis",
        "Palermo",
        "Catania",
        Unit::Kilometers
    );
    // x is Ok(166.2742)

    let x: RedisResult<Option<f64>> = con.geo_dist(
        "my_gis",
        "Palermo",
        "Atlantis",
        Unit::Meters
    );
    // x is Ok(None)
}

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

Return valid Geohash strings representing the position of one or more members of the geospatial index represented by the sorted set at key.

Example

use redis::{Commands, RedisResult};

fn get_hash(con: &mut redis::Connection) {
    let x: RedisResult<Vec<String>> = con.geo_hash("my_gis", "Palermo");
    // x is vec!["sqc8b49rny0"]

    let x: RedisResult<Vec<String>> = con.geo_hash("my_gis", &["Palermo", "Catania"]);
    // x is vec!["sqc8b49rny0", "sqdtr74hyu0"]
}

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

Return the positions of all the specified members of the geospatial index represented by the sorted set at key.

Every position is a pair of (longitude, latitude). redis::geo::Coord can be used to convert these value in a struct.

Example

use redis::{Commands, RedisResult};
use redis::geo::Coord;

fn get_position(con: &mut redis::Connection) {
    let x: RedisResult<Vec<Vec<f64>>> = con.geo_pos("my_gis", &["Palermo", "Catania"]);
    // x is [ [ 13.361389, 38.115556 ], [ 15.087269, 37.502669 ] ];

    let x: Vec<Coord<f64>> = con.geo_pos("my_gis", "Palermo").unwrap();
    // x[0].longitude is 13.361389
    // x[0].latitude is 38.115556
}

pub fn geo_radius<K, RV>(
    &mut self,
    key: K,
    longitude: f64,
    latitude: f64,
    radius: f64,
    unit: Unit,
    options: RadiusOptions
) -> Result<RV, RedisError> where
    K: ToRedisArgs,
    RV: FromRedisValue, 

Return the members of a sorted set populated with geospatial information using geo_add, which are within the borders of the area specified with the center location and the maximum distance from the center (the radius).

Every item in the result can be read with redis::geo::RadiusSearchResult, which support the multiple formats returned by GEORADIUS.

use redis::{Commands, RedisResult};
use redis::geo::{RadiusOptions, RadiusSearchResult, RadiusOrder, Unit};

fn radius(con: &mut redis::Connection) -> Vec<RadiusSearchResult> {
    let opts = RadiusOptions::default().with_dist().order(RadiusOrder::Asc);
    con.geo_radius("my_gis", 15.90, 37.21, 51.39, Unit::Kilometers, opts).unwrap()
}

pub fn geo_radius_by_member<K, M, RV>(
    &mut self,
    key: K,
    member: M,
    radius: f64,
    unit: Unit,
    options: RadiusOptions
) -> Result<RV, RedisError> where
    K: ToRedisArgs,
    M: ToRedisArgs,
    RV: FromRedisValue, 

Retrieve members selected by distance with the center of member. The member itself is always contained in the results.

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

Incrementally iterate the keys space.

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

Incrementally iterate the keys space for keys matching a pattern.

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

Incrementally iterate hash fields and associated values.

pub fn hscan_match<K, P, RV>(
    &mut 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.

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

Incrementally iterate set elements.

pub fn sscan_match<K, P, RV>(
    &mut 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.

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

Incrementally iterate sorted set elements.

pub fn zscan_match<K, P, RV>(
    &mut 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.

Loading content...

Implementors

impl<T> Commands for T where
    T: ConnectionLike, 

Loading content...