Trait redis_cluster_rs::Commands

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

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.

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

Gets all keys matching pattern

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

Set the string value of a key.

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

Sets multiple keys to their values.

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

Set the value and expiration of a key.

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

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

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

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

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

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

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

Delete one or more keys.

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

Determine if a key exists.

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.

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.

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.

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.

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

Remove the expiration from a key.

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

Check the expiration time of a key.

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

Rename a key.

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.

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

Append a value to a key.

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

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

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.

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.

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

Count set bits in a string.

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.

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.

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.

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.

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.

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.

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

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

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

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

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

Sets a single field in a hash.

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

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

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

Sets a multiple fields in a hash.

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

Increments a value.

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

Checks if a field in a hash exists.

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

Gets all the keys in a hash.

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

Gets all the values in a hash.

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.

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

Gets the length of a hash.

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.

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.

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.

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.

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

Insert an element before another element in a list.

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

Insert an element after another element in a list.

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.

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.

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

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

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

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

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.

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

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

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.

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

Sets the list element at index to value

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.

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.

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

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

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

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

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.

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

Get the number of members in a set.

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

Subtract multiple sets.

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.

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

Intersect multiple sets.

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.

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.

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

Get all the members in a set.

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.

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.

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

Get one random member from a set.

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.

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.

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

Add multiple sets.

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.

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

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

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

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

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.

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

fn zincr<K, M, D, RV>(
    &mut self,
    key: K,
    member: M,
    delta: D
) -> Result<RV, RedisError> where
    D: ToRedisArgs,
    K: ToRedisArgs,
    M: 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.

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.

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.

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.

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.

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

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.

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

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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

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

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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

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

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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.

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.

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

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.

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

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.

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.

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

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

fn zrevrangebyscore_withscores<K, MM, M, RV>(
    &mut self,
    key: K,
    max: MM,
    min: M
) -> 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.

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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,
    MM: ToRedisArgs,
    RV: FromRedisValue, 

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

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.

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.

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.

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.

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.

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.

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).

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.

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.

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")
    ])
}

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

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)
}

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"]
}

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
}

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()
}

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.

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

Incrementally iterate the keys space.

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.

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

Incrementally iterate hash fields and associated values.

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.

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

Incrementally iterate set elements.

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.

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

Incrementally iterate sorted set elements.

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...