Struct redis::Pipeline

pub struct Pipeline { /* fields omitted */ }

Represents a redis command pipeline.

Methods

impl Pipeline

A pipeline allows you to send multiple commands in one go to the redis server. API wise it's very similar to just using a command but it allows multiple commands to be chained and some features such as iteration are not available.

Basic example:

let ((k1, k2),) : ((i32, i32),) = redis::pipe()
    .cmd("SET").arg("key_1").arg(42).ignore()
    .cmd("SET").arg("key_2").arg(43).ignore()
    .cmd("MGET").arg(&["key_1", "key_2"]).query(&mut con).unwrap();

As you can see with cmd you can start a new command. By default each command produces a value but for some you can ignore them by calling ignore on the command. That way it will be skipped in the return value which is useful for SET commands and others, which do not have a useful return value.

pub fn new() -> Pipeline

Creates an empty pipeline. For consistency with the cmd api a pipe function is provided as alias.

pub fn with_capacity(capacity: usize) -> Pipeline

Creates an empty pipeline with pre-allocated capacity.

pub fn cmd(&mut self, name: &str) -> &mut Pipeline

Starts a new command. Functions such as arg then become available to add more arguments to that command.

pub fn add_command(&mut self, cmd: Cmd) -> &mut Pipeline

Adds a command to the pipeline.

pub fn arg<T: ToRedisArgs>(&mut self, arg: T) -> &mut Pipeline

Adds an argument to the last started command. This works similar to the arg method of the Cmd object.

Note that this function fails the task if executed on an empty pipeline.

pub fn ignore(&mut self) -> &mut Pipeline

Instructs the pipeline to ignore the return value of this command. It will still be ensured that it is not an error, but any successful result is just thrown away. This makes result processing through tuples much easier because you do not need to handle all the items you do not care about.

Note that this function fails the task if executed on an empty pipeline.

pub fn atomic(&mut self) -> &mut Pipeline

This enables atomic mode. In atomic mode the whole pipeline is enclosed in MULTI/EXEC. From the user's point of view nothing changes however. This is easier than using MULTI/EXEC yourself as the format does not change.

let (k1, k2) : (i32, i32) = redis::pipe()
    .atomic()
    .cmd("GET").arg("key_1")
    .cmd("GET").arg("key_2").query(&mut con).unwrap();

pub fn get_packed_pipeline(&self, atomic: bool) -> Vec<u8>

Returns the encoded pipeline commands.

pub fn query<T: FromRedisValue>(
    &self,
    con: &mut dyn ConnectionLike
) -> RedisResult<T>

Executes the pipeline and fetches the return values. Since most pipelines return different types it's recommended to use tuple matching to process the results:

let (k1, k2) : (i32, i32) = redis::pipe()
    .cmd("SET").arg("key_1").arg(42).ignore()
    .cmd("SET").arg("key_2").arg(43).ignore()
    .cmd("GET").arg("key_1")
    .cmd("GET").arg("key_2").query(&mut con).unwrap();

NOTE: A Pipeline object may be reused after query() with all the commands as were inserted to them. In order to clear a Pipeline object with minimal memory released/allocated, it is necessary to call the clear() before inserting new commands.

pub fn clear(&mut self)

Clear a Pipeline object internal data structure.

This allows reusing a Pipeline object as a clear object while performing a minimal amount of memory released/reallocated.

pub fn query_async<C, T: FromRedisValue>(self, con: C) -> RedisFuture<(C, T)> where
    C: ConnectionLike + Send + 'static,
    T: Send + 'static, 

Async version of query.

pub fn execute(&self, con: &mut dyn ConnectionLike)

This is a shortcut to query() that does not return a value and will fail the task if the query of the pipeline fails.

This is equivalent to a call of query like this:

let _ : () = redis::pipe().cmd("PING").query(&mut con).unwrap();

NOTE: A Pipeline object may be reused after query() with all the commands as were inserted to them. In order to clear a Pipeline object with minimal memory released/allocated, it is necessary to call the clear() before inserting new commands.

Trait Implementations

impl PipelineCommands for Pipeline

fn perform(&mut self, cmd: Cmd) -> &mut Pipeline

fn get<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

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

fn keys<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all keys matching pattern

fn set<K: ToRedisArgs, V: ToRedisArgs>(&mut self, key: K, value: V) -> &mut Self

Set the string value of a key.

fn set_multiple<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    items: &[(K, V)]
) -> &mut Self

Sets multiple keys to their values.

fn set_ex<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V,
    seconds: usize
) -> &mut Self

Set the value and expiration of a key.

fn set_nx<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn mset_nx<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    items: &[(K, V)]
) -> &mut Self

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

fn getset<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn getrange<K: ToRedisArgs>(
    &mut self,
    key: K,
    from: isize,
    to: isize
) -> &mut Self

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.

fn setrange<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    offset: isize,
    value: V
) -> &mut Self

Overwrite the part of the value stored in key at the specified offset.

fn del<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Delete one or more keys.

fn exists<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Determine if a key exists.

fn expire<K: ToRedisArgs>(&mut self, key: K, seconds: usize) -> &mut Self

Set a key's time to live in seconds.

fn expire_at<K: ToRedisArgs>(&mut self, key: K, ts: usize) -> &mut Self

Set the expiration for a key as a UNIX timestamp.

fn pexpire<K: ToRedisArgs>(&mut self, key: K, ms: usize) -> &mut Self

Set a key's time to live in milliseconds.

fn pexpire_at<K: ToRedisArgs>(&mut self, key: K, ts: usize) -> &mut Self

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

fn persist<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Remove the expiration from a key.

fn ttl<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Check the expiration time of a key.

fn rename<K: ToRedisArgs>(&mut self, key: K, new_key: K) -> &mut Self

Rename a key.

fn rename_nx<K: ToRedisArgs>(&mut self, key: K, new_key: K) -> &mut Self

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

fn append<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

Append a value to a key.

fn incr<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    delta: V
) -> &mut Self

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

fn setbit<K: ToRedisArgs>(
    &mut self,
    key: K,
    offset: usize,
    value: bool
) -> &mut Self

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

fn getbit<K: ToRedisArgs>(&mut self, key: K, offset: usize) -> &mut Self

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

fn bitcount<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Count set bits in a string.

fn bitcount_range<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: usize,
    end: usize
) -> &mut Self

Count set bits in a string in a range.

fn bit_and<K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self

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

fn bit_or<K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self

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

fn bit_xor<K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self

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

fn bit_not<K: ToRedisArgs>(&mut self, dstkey: K, srckey: K) -> &mut Self

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

fn strlen<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the length of the value stored in a key.

fn hget<K: ToRedisArgs, F: ToRedisArgs>(
    &mut self,
    key: K,
    field: F
) -> &mut Self

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

fn hdel<K: ToRedisArgs, F: ToRedisArgs>(
    &mut self,
    key: K,
    field: F
) -> &mut Self

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

fn hset<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    field: F,
    value: V
) -> &mut Self

Sets a single field in a hash.

fn hset_nx<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    field: F,
    value: V
) -> &mut Self

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

fn hset_multiple<K: ToRedisArgs, F: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    items: &[(F, V)]
) -> &mut Self

Sets a multiple fields in a hash.

fn hincr<K: ToRedisArgs, F: ToRedisArgs, D: ToRedisArgs>(
    &mut self,
    key: K,
    field: F,
    delta: D
) -> &mut Self

Increments a value.

fn hexists<K: ToRedisArgs, F: ToRedisArgs>(
    &mut self,
    key: K,
    field: F
) -> &mut Self

Checks if a field in a hash exists.

fn hkeys<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the keys in a hash.

fn hvals<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the values in a hash.

fn hgetall<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets all the fields and values in a hash.

fn hlen<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Gets the length of a hash.

fn blpop<K: ToRedisArgs>(&mut self, key: K, timeout: usize) -> &mut Self

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

fn brpop<K: ToRedisArgs>(&mut self, key: K, timeout: usize) -> &mut Self

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

fn brpoplpush<K: ToRedisArgs>(
    &mut self,
    srckey: K,
    dstkey: K,
    timeout: usize
) -> &mut Self

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

fn lindex<K: ToRedisArgs>(&mut self, key: K, index: isize) -> &mut Self

Get an element from a list by its index.

fn linsert_before<K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    pivot: P,
    value: V
) -> &mut Self

Insert an element before another element in a list.

fn linsert_after<K: ToRedisArgs, P: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    pivot: P,
    value: V
) -> &mut Self

Insert an element after another element in a list.

fn llen<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Returns the length of the list stored at key.

fn lpop<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

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

fn lpush<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn lpush_exists<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn lrange<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

Returns the specified elements of the list stored at key.

fn lrem<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    count: isize,
    value: V
) -> &mut Self

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

fn ltrim<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn lset<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    index: isize,
    value: V
) -> &mut Self

Sets the list element at index to value

fn rpop<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

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

fn rpoplpush<K: ToRedisArgs>(&mut self, key: K, dstkey: K) -> &mut Self

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

fn rpush<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn rpush_exists<K: ToRedisArgs, V: ToRedisArgs>(
    &mut self,
    key: K,
    value: V
) -> &mut Self

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

fn sadd<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

Add one or more members to a set.

fn scard<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the number of members in a set.

fn sdiff<K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Subtract multiple sets.

fn sdiffstore<K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self

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

fn sinter<K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Intersect multiple sets.

fn sinterstore<K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self

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

fn sismember<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

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

fn smembers<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get all the members in a set.

fn smove<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    srckey: K,
    dstkey: K,
    member: M
) -> &mut Self

Move a member from one set to another.

fn spop<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Remove and return a random member from a set.

fn srandmember<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get one random member from a set.

fn srandmember_multiple<K: ToRedisArgs>(
    &mut self,
    key: K,
    count: usize
) -> &mut Self

Get multiple random members from a set.

fn srem<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

Remove one or more members from a set.

fn sunion<K: ToRedisArgs>(&mut self, keys: K) -> &mut Self

Add multiple sets.

fn sunionstore<K: ToRedisArgs>(&mut self, dstkey: K, keys: K) -> &mut Self

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

fn zadd<K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M,
    score: S
) -> &mut Self

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

fn zadd_multiple<K: ToRedisArgs, S: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    items: &[(S, M)]
) -> &mut Self

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

fn zcard<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

Get the number of members in a sorted set.

fn zcount<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zincr<K: ToRedisArgs, M: ToRedisArgs, D: ToRedisArgs>(
    &mut self,
    key: K,
    member: M,
    delta: D
) -> &mut Self

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: ToRedisArgs>(&mut self, dstkey: K, keys: &[K]) -> &mut Self

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

fn zinterstore_min<K: ToRedisArgs>(
    &mut self,
    dstkey: K,
    keys: &[K]
) -> &mut Self

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

fn zinterstore_max<K: ToRedisArgs>(
    &mut self,
    dstkey: K,
    keys: &[K]
) -> &mut Self

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

fn zlexcount<K: ToRedisArgs, L: ToRedisArgs>(
    &mut self,
    key: K,
    min: L,
    max: L
) -> &mut Self

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

fn zrange<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn zrange_withscores<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn zrangebylex<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zrangebylex_limit<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrevrangebylex<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M
) -> &mut Self

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

fn zrevrangebylex_limit<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrangebyscore<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zrangebyscore_withscores<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zrangebyscore_limit<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrangebyscore_limit_withscores<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrank<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

Determine the index of a member in a sorted set.

fn zrem<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    members: M
) -> &mut Self

Remove one or more members from a sorted set.

fn zrembylex<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zrembyrank<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn zrembyscore<K: ToRedisArgs, M: ToRedisArgs, MM: ToRedisArgs>(
    &mut self,
    key: K,
    min: M,
    max: MM
) -> &mut Self

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

fn zrevrange<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn zrevrange_withscores<K: ToRedisArgs>(
    &mut self,
    key: K,
    start: isize,
    stop: isize
) -> &mut Self

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

fn zrevrangebyscore<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M
) -> &mut Self

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

fn zrevrangebyscore_withscores<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M
) -> &mut Self

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

fn zrevrangebyscore_limit<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrevrangebyscore_limit_withscores<K: ToRedisArgs, MM: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    max: MM,
    min: M,
    offset: isize,
    count: isize
) -> &mut Self

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

fn zrevrank<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

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

fn zscore<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M
) -> &mut Self

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

fn zunionstore<K: ToRedisArgs>(&mut self, dstkey: K, keys: &[K]) -> &mut Self

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

fn zunionstore_min<K: ToRedisArgs>(
    &mut self,
    dstkey: K,
    keys: &[K]
) -> &mut Self

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

fn zunionstore_max<K: ToRedisArgs>(
    &mut self,
    dstkey: K,
    keys: &[K]
) -> &mut Self

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

fn pfadd<K: ToRedisArgs, E: ToRedisArgs>(
    &mut self,
    key: K,
    element: E
) -> &mut Self

Adds the specified elements to the specified HyperLogLog.

fn pfcount<K: ToRedisArgs>(&mut self, key: K) -> &mut Self

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

fn pfmerge<K: ToRedisArgs>(&mut self, dstkey: K, srckeys: K) -> &mut Self

Merge N different HyperLogLogs into a single one.

fn publish<K: ToRedisArgs, E: ToRedisArgs>(
    &mut self,
    channel: K,
    message: E
) -> &mut Self

Posts a message to the given channel.

fn geo_add<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    members: M
) -> &mut Self

Adds the specified geospatial items to the specified key.

fn geo_dist<K: ToRedisArgs, M1: ToRedisArgs, M2: ToRedisArgs>(
    &mut self,
    key: K,
    member1: M1,
    member2: M2,
    unit: Unit
) -> &mut Self

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

fn geo_hash<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    members: M
) -> &mut Self

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

fn geo_pos<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    members: M
) -> &mut Self

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

fn geo_radius<K: ToRedisArgs>(
    &mut self,
    key: K,
    longitude: f64,
    latitude: f64,
    radius: f64,
    unit: Unit,
    options: RadiusOptions
) -> &mut Self

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

fn geo_radius_by_member<K: ToRedisArgs, M: ToRedisArgs>(
    &mut self,
    key: K,
    member: M,
    radius: f64,
    unit: Unit,
    options: RadiusOptions
) -> &mut Self

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

impl Clone for Pipeline

fn clone(&self) -> Pipeline

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for Pipeline

fn default() -> Pipeline

Returns the "default value" for a type.