Struct redis_driver::Transaction
source · [−]pub struct Transaction { /* private fields */ }
Implementations
Trait Implementations
sourceimpl CommandSend for Transaction
impl CommandSend for Transaction
sourcefn send(
&self,
command: Command
) -> Pin<Box<dyn Future<Output = Result<Value>> + Send + '_>>
fn send(
&self,
command: Command
) -> Pin<Box<dyn Future<Output = Result<Value>> + Send + '_>>
Send an arbitrary command to the server. Read more
fn send_into<T: FromValue>(
&self,
command: Command
) -> Pin<Box<dyn Future<Output = Result<T>> + Send + '_>>
fn send_into_tuple_vec<T: FromValue, U: FromValue>(
&self,
command: Command
) -> Pin<Box<dyn Future<Output = Result<Vec<(T, U)>>> + Send + '_>>
sourceimpl GenericCommands for Transaction
impl GenericCommands for Transaction
sourcefn copy<S, D>(&self, source: S, destination: D) -> Copy<'_, Self>where
S: Into<BulkString>,
D: Into<BulkString>,
fn copy<S, D>(&self, source: S, destination: D) -> Copy<'_, Self>where
S: Into<BulkString>,
D: Into<BulkString>,
This command copies the value stored at the source key to the destination key. Read more
sourcefn del<K, C>(&self, keys: C) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn del<K, C>(&self, keys: C) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
Removes the specified keys. A key is ignored if it does not exist. Read more
sourcefn exists<K, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn exists<K, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
Returns if keys exist. Read more
sourcefn expire<K>(&self, key: K, seconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
fn expire<K>(&self, key: K, seconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
Set a timeout on key in seconds Read more
sourcefn expireat<K>(&self, key: K, unix_time_seconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
fn expireat<K>(&self, key: K, unix_time_seconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
EXPIREAT has the same effect and semantic as EXPIRE, but instead of specifying the number of seconds representing the TTL (time to live), it takes an absolute Unix timestamp (seconds since January 1, 1970) Read more
sourcefn expiretime<K>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn expiretime<K>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Returns the absolute Unix timestamp (since January 1, 1970) in seconds at which the given key will expire. Read more
sourcefn move_<K>(
&self,
key: K,
db: usize
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
fn move_<K>(
&self,
key: K,
db: usize
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
Move key from the currently selected database to the specified destination database. Read more
sourcefn persist<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
fn persist<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
Remove the existing timeout on key, turning the key from volatile (a key with an expire set) to persistent (a key that will never expire as no timeout is associated). Read more
sourcefn pexpire<K>(&self, key: K, milliseconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
fn pexpire<K>(&self, key: K, milliseconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
This command works exactly like EXPIRE but the time to live of the key is specified in milliseconds instead of seconds. Read more
sourcefn pexpireat<K>(&self, key: K, unix_time_milliseconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
fn pexpireat<K>(&self, key: K, unix_time_milliseconds: u64) -> Expire<'_, Self>where
K: Into<BulkString>,
PEXPIREAT has the same effect and semantic as EXPIREAT, but the Unix time at which the key will expire is specified in milliseconds instead of seconds. Read more
sourcefn pexpiretime<K>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn pexpiretime<K>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
PEXPIRETIME has the same semantic as EXPIRETIME, but returns the absolute Unix expiration timestamp in milliseconds instead of seconds. Read more
sourcefn pttl<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn pttl<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Returns the remaining time to live of a key that has a timeout. Read more
sourceimpl HashCommands for Transaction
impl HashCommands for Transaction
sourcefn hdel<K, F, C>(
&self,
key: K,
fields: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
C: SingleArgOrCollection<F>,
fn hdel<K, F, C>(
&self,
key: K,
fields: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
C: SingleArgOrCollection<F>,
Removes the specified fields from the hash stored at key. Read more
sourcefn hexists<K, F>(
&self,
key: K,
field: F
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
fn hexists<K, F>(
&self,
key: K,
field: F
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
Returns if field is an existing field in the hash stored at key. Read more
sourcefn hget<K, F, V>(
&self,
key: K,
field: F
) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: FromValue,
fn hget<K, F, V>(
&self,
key: K,
field: F
) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: FromValue,
Returns the value associated with field in the hash stored at key. Read more
sourcefn hgetall<'a, K, F, V>(
&'a self,
key: K
) -> Pin<Box<dyn Future<Output = Result<Vec<(F, V)>>> + 'a>>where
K: Into<BulkString>,
F: FromValue + 'a,
V: FromValue + 'a,
fn hgetall<'a, K, F, V>(
&'a self,
key: K
) -> Pin<Box<dyn Future<Output = Result<Vec<(F, V)>>> + 'a>>where
K: Into<BulkString>,
F: FromValue + 'a,
V: FromValue + 'a,
Returns all fields and values of the hash stored at key. Read more
sourcefn hincrby<K, F>(
&self,
key: K,
field: F,
increment: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
fn hincrby<K, F>(
&self,
key: K,
field: F,
increment: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
Increments the number stored at field in the hash stored at key by increment. Read more
sourcefn hincrbyfloat<K, F>(
&self,
key: K,
field: F,
increment: f64
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
fn hincrbyfloat<K, F>(
&self,
key: K,
field: F,
increment: f64
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
Increment the specified field of a hash stored at key, and representing a floating point number, by the specified increment. Read more
sourcefn hkeys<K, F>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<Vec<F>>> + '_>>where
K: Into<BulkString>,
F: FromValue,
fn hkeys<K, F>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<Vec<F>>> + '_>>where
K: Into<BulkString>,
F: FromValue,
Returns all field names in the hash stored at key. Read more
sourcefn hlen<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
fn hlen<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
Returns the number of fields contained in the hash stored at key. Read more
sourcefn hmget<K, F, V, C>(
&self,
key: K,
fields: C
) -> Pin<Box<dyn Future<Output = Result<Vec<V>>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
C: SingleArgOrCollection<F>,
V: FromValue,
fn hmget<K, F, V, C>(
&self,
key: K,
fields: C
) -> Pin<Box<dyn Future<Output = Result<Vec<V>>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
C: SingleArgOrCollection<F>,
V: FromValue,
Returns the values associated with the specified fields in the hash stored at key. Read more
sourcefn hrandfield<K>(&self, key: K) -> HRandField<'_, Self>where
K: Into<BulkString>,
fn hrandfield<K>(&self, key: K) -> HRandField<'_, Self>where
K: Into<BulkString>,
When called with just the key argument, return a random field from the hash value stored at key. Read more
sourcefn hscan<K>(&self, key: K, cursor: u64) -> HScan<'_, Self>where
K: Into<BulkString>,
fn hscan<K>(&self, key: K, cursor: u64) -> HScan<'_, Self>where
K: Into<BulkString>,
Iterates fields of Hash types and their associated values. Read more
sourcefn hset<K, F, V, I>(
&self,
key: K,
items: I
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: Into<BulkString>,
I: KeyValueArgOrCollection<F, V>,
fn hset<K, F, V, I>(
&self,
key: K,
items: I
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: Into<BulkString>,
I: KeyValueArgOrCollection<F, V>,
Sets field in the hash stored at key to value. Read more
sourcefn hsetnx<K, F, V>(
&self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: Into<BulkString>,
fn hsetnx<K, F, V>(
&self,
key: K,
field: F,
value: V
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
F: Into<BulkString>,
V: Into<BulkString>,
Sets field in the hash stored at key to value, only if field does not yet exist. Read more
sourceimpl ListCommands for Transaction
impl ListCommands for Transaction
sourcefn lindex<K, E>(
&self,
key: K,
index: isize
) -> Pin<Box<dyn Future<Output = Result<E>> + '_>>where
K: Into<BulkString>,
E: FromValue,
fn lindex<K, E>(
&self,
key: K,
index: isize
) -> Pin<Box<dyn Future<Output = Result<E>> + '_>>where
K: Into<BulkString>,
E: FromValue,
Returns the element at index index in the list stored at key. Read more
sourcefn linsert<K, E>(
&self,
key: K,
where_: LInsertWhere,
pivot: E,
element: E
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
fn linsert<K, E>(
&self,
key: K,
where_: LInsertWhere,
pivot: E,
element: E
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
Inserts element in the list stored at key either before or after the reference value pivot. Read more
sourcefn llen<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
fn llen<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
Inserts element in the list stored at key either before or after the reference value pivot. Read more
sourcefn lmove<S, D, E>(
&self,
source: S,
destination: D,
where_from: LMoveWhere,
where_to: LMoveWhere
) -> Pin<Box<dyn Future<Output = Result<E>> + '_>>where
S: Into<BulkString>,
D: Into<BulkString>,
E: FromValue,
fn lmove<S, D, E>(
&self,
source: S,
destination: D,
where_from: LMoveWhere,
where_to: LMoveWhere
) -> Pin<Box<dyn Future<Output = Result<E>> + '_>>where
S: Into<BulkString>,
D: Into<BulkString>,
E: FromValue,
Atomically returns and removes the first/last element (head/tail depending on the wherefrom argument) of the list stored at source, and pushes the element at the first/last element (head/tail depending on the whereto argument) of the list stored at destination. Read more
sourcefn lmpop<K, E, C>(
&self,
keys: C,
where_: LMoveWhere,
count: usize
) -> Pin<Box<dyn Future<Output = Result<(String, Vec<E>)>> + '_>>where
K: Into<BulkString>,
E: FromValue,
C: SingleArgOrCollection<K>,
fn lmpop<K, E, C>(
&self,
keys: C,
where_: LMoveWhere,
count: usize
) -> Pin<Box<dyn Future<Output = Result<(String, Vec<E>)>> + '_>>where
K: Into<BulkString>,
E: FromValue,
C: SingleArgOrCollection<K>,
Pops one or more elements from the first non-empty list key from the list of provided key names. Read more
sourcefn lpop<K, E>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
fn lpop<K, E>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
Removes and returns the first elements of the list stored at key. Read more
sourcefn lpos<K, E>(&self, key: K, element: E) -> LPos<'_, Self>where
K: Into<BulkString>,
E: Into<BulkString>,
fn lpos<K, E>(&self, key: K, element: E) -> LPos<'_, Self>where
K: Into<BulkString>,
E: Into<BulkString>,
Returns the index of matching elements inside a Redis list. Read more
sourcefn lpush<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
fn lpush<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
Insert all the specified values at the head of the list stored at key Read more
sourcefn lpushx<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
fn lpushx<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
Inserts specified values at the head of the list stored at key, only if key already exists and holds a list. Read more
sourcefn lrange<K, E>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
fn lrange<K, E>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
Returns the specified elements of the list stored at key. Read more
sourcefn lrem<K, E>(
&self,
key: K,
count: isize,
element: E
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
fn lrem<K, E>(
&self,
key: K,
count: isize,
element: E
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
Removes the first count occurrences of elements equal to element from the list stored at key. Read more
sourcefn lset<K, E>(
&self,
key: K,
index: isize,
element: E
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
fn lset<K, E>(
&self,
key: K,
index: isize,
element: E
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
Sets the list element at index to element. Read more
sourcefn ltrim<K>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
fn ltrim<K>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
Trim an existing list so that it will contain only the specified range of elements specified. Read more
sourcefn rpop<K, E>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
fn rpop<K, E>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<E>>> + '_>>where
K: Into<BulkString>,
E: FromValue,
Removes and returns the first elements of the list stored at key. Read more
sourcefn rpush<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
fn rpush<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
Insert all the specified values at the tail of the list stored at key Read more
sourcefn rpushx<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
fn rpushx<K, E, C>(
&self,
key: K,
elements: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
E: Into<BulkString>,
C: SingleArgOrCollection<E>,
Inserts specified values at the tail of the list stored at key, only if key already exists and holds a list. Read more
sourceimpl ServerCommands for Transaction
impl ServerCommands for Transaction
sourceimpl SetCommands for Transaction
impl SetCommands for Transaction
sourcefn sadd<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
fn sadd<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
Add the specified members to the set stored at key. Read more
sourcefn scard<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
fn scard<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
Returns the set cardinality (number of elements) of the set stored at key. Read more
sourcefn sdiff<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
fn sdiff<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
Returns the members of the set resulting from the difference between the first set and all the successive sets. Read more
sourcefn sdiffstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn sdiffstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
sourcefn sinter<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
fn sinter<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
Returns the members of the set resulting from the intersection of all the given sets. Read more
sourcefn sintercard<K, C>(
&self,
keys: C,
limit: usize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn sintercard<K, C>(
&self,
keys: C,
limit: usize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
sourcefn sinterstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn sinterstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
sourcefn sismember<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
fn sismember<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
Returns if member is a member of the set stored at key. Read more
sourcefn smembers<K, M>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
fn smembers<K, M>(
&self,
key: K
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
Returns all the members of the set value stored at key. Read more
sourcefn smismember<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<Vec<bool>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
fn smismember<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<Vec<bool>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
Returns whether each member is a member of the set stored at key. Read more
sourcefn smove<S, D, M>(
&self,
source: S,
destination: D,
member: M
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
S: Into<BulkString>,
D: Into<BulkString>,
M: Into<BulkString>,
fn smove<S, D, M>(
&self,
source: S,
destination: D,
member: M
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
S: Into<BulkString>,
D: Into<BulkString>,
M: Into<BulkString>,
Move member from the set at source to the set at destination. Read more
sourcefn spop<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
fn spop<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
Removes and returns one or more random members from the set value store at key. Read more
sourcefn srandmember<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
fn srandmember<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
Removes and returns one or more random members from the set value store at key. Read more
sourcefn srem<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
fn srem<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
Remove the specified members from the set stored at key. Read more
sourcefn sscan<K>(&self, key: K, cursor: u64) -> SScan<'_, Self>where
K: Into<BulkString>,
fn sscan<K>(&self, key: K, cursor: u64) -> SScan<'_, Self>where
K: Into<BulkString>,
Iterates elements of Sets types. Read more
sourcefn sunion<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
fn sunion<K, M, C>(
&self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<HashSet<M>>> + '_>>where
K: Into<BulkString>,
M: FromValue + Eq + Hash,
C: SingleArgOrCollection<K>,
Returns the members of the set resulting from the union of all the given sets. Read more
sourcefn sunionstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn sunionstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
sourceimpl SortedSetCommands for Transaction
impl SortedSetCommands for Transaction
sourcefn zadd<K>(&self, key: K) -> ZAdd<'_, Self>where
K: Into<BulkString>,
fn zadd<K>(&self, key: K) -> ZAdd<'_, Self>where
K: Into<BulkString>,
Adds all the specified members with the specified scores to the sorted set stored at key. Read more
sourcefn zcard<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
fn zcard<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
Returns the sorted set cardinality (number of elements) of the sorted set stored at key. Read more
sourcefn zcount<K, T, U>(
&self,
key: K,
min: T,
max: U
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
T: Into<BulkString>,
U: Into<BulkString>,
fn zcount<K, T, U>(
&self,
key: K,
min: T,
max: U
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
T: Into<BulkString>,
U: Into<BulkString>,
Returns the number of elements in the sorted set at key with a score between min and max. Read more
sourcefn zdiff<K, C>(&self, keys: C) -> ZDiff<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zdiff<K, C>(&self, keys: C) -> ZDiff<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
This command is similar to zdiffstore, but instead of storing the resulting sorted set, it is returned to the client. Read more
sourcefn zdiffstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zdiffstore<D, K, C>(
&self,
destination: D,
keys: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
Computes the difference between the first and all successive input sorted sets and stores the result in destination. Read more
sourcefn zincrby<K, M>(
&self,
key: K,
increment: f64,
member: M
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
fn zincrby<K, M>(
&self,
key: K,
increment: f64,
member: M
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
Increments the score of member in the sorted set stored at key by increment. Read more
sourcefn zinter<K, C>(&self, keys: C) -> ZInterUnion<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zinter<K, C>(&self, keys: C) -> ZInterUnion<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
This command is similar to zinterstore, but instead of storing the resulting sorted set, it is returned to the client. Read more
sourcefn zintercard<K, C>(
&self,
keys: C,
limit: usize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zintercard<K, C>(
&self,
keys: C,
limit: usize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
sourcefn zinterstore<D, K, C>(
&self,
destination: D,
keys: C
) -> ZInterUnionStore<'_, Self>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zinterstore<D, K, C>(
&self,
destination: D,
keys: C
) -> ZInterUnionStore<'_, Self>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
Computes the intersection of numkeys sorted sets given by the specified keys, and stores the result in destination. Read more
sourcefn zlexcount<K, M1, M2>(
&self,
key: K,
min: M1,
max: M2
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M1: Into<BulkString>,
M2: Into<BulkString>,
fn zlexcount<K, M1, M2>(
&self,
key: K,
min: M1,
max: M2
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M1: Into<BulkString>,
M2: Into<BulkString>,
When all the elements in a sorted set are inserted with the same score, in order to force lexicographical ordering, this command returns the number of elements in the sorted set at key with a value between min and max. Read more
sourcefn zmpop<K, C, E>(
&self,
keys: C,
where_: ZWhere,
count: usize
) -> Pin<Box<dyn Future<Output = Result<(String, Vec<(E, f64)>)>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
E: FromValue + Default,
fn zmpop<K, C, E>(
&self,
keys: C,
where_: ZWhere,
count: usize
) -> Pin<Box<dyn Future<Output = Result<(String, Vec<(E, f64)>)>> + '_>>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
E: FromValue + Default,
Pops one or more elements, that are member-score pairs, from the first non-empty sorted set in the provided list of key names. Read more
sourcefn zmscore<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<f64>>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
fn zmscore<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<f64>>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
Returns the scores associated with the specified members in the sorted set stored at key. Read more
sourcefn zpopmax<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<(M, f64)>>> + '_>>where
K: Into<BulkString>,
M: FromValue,
fn zpopmax<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<(M, f64)>>> + '_>>where
K: Into<BulkString>,
M: FromValue,
Removes and returns up to count members with the highest scores in the sorted set stored at key. Read more
sourcefn zpopmin<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<(M, f64)>>> + '_>>where
K: Into<BulkString>,
M: FromValue,
fn zpopmin<K, M>(
&self,
key: K,
count: usize
) -> Pin<Box<dyn Future<Output = Result<Vec<(M, f64)>>> + '_>>where
K: Into<BulkString>,
M: FromValue,
Removes and returns up to count members with the lowest scores in the sorted set stored at key. Read more
sourcefn zrandmember<K>(&self, key: K) -> ZRandMember<'_, Self>where
K: Into<BulkString>,
fn zrandmember<K>(&self, key: K) -> ZRandMember<'_, Self>where
K: Into<BulkString>,
Removes and returns up to count members with the lowest scores in the sorted set stored at key. Read more
sourcefn zrange<K, S>(&self, key: K, start: S, stop: S) -> ZRange<'_, Self>where
K: Into<BulkString>,
S: Into<BulkString>,
fn zrange<K, S>(&self, key: K, start: S, stop: S) -> ZRange<'_, Self>where
K: Into<BulkString>,
S: Into<BulkString>,
Returns the specified range of elements in the sorted set stored at key
. Read more
sourcefn zrangestore<D, S, T>(
&self,
dst: D,
src: S,
start: T,
stop: T
) -> ZRangeStore<'_, Self>where
D: Into<BulkString>,
S: Into<BulkString>,
T: Into<BulkString>,
fn zrangestore<D, S, T>(
&self,
dst: D,
src: S,
start: T,
stop: T
) -> ZRangeStore<'_, Self>where
D: Into<BulkString>,
S: Into<BulkString>,
T: Into<BulkString>,
sourcefn zrank<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<usize>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
fn zrank<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<usize>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
Returns the rank of member in the sorted set stored at key, with the scores ordered from low to high. Read more
sourcefn zrem<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
fn zrem<K, M, C>(
&self,
key: K,
members: C
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
C: SingleArgOrCollection<M>,
Removes the specified members from the sorted set stored at key. Read more
sourcefn zremrangebylex<K, S>(
&self,
key: K,
start: S,
stop: S
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
S: Into<BulkString>,
fn zremrangebylex<K, S>(
&self,
key: K,
start: S,
stop: S
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
S: Into<BulkString>,
When all the elements in a sorted set are inserted with the same score, in order to force lexicographical ordering, this command removes all elements in the sorted set stored at key between the lexicographical range specified by min and max. Read more
sourcefn zremrangebyrank<K>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
fn zremrangebyrank<K>(
&self,
key: K,
start: isize,
stop: isize
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
Removes all elements in the sorted set stored at key with rank between start and stop. Read more
sourcefn zremrangebyscore<K, S>(
&self,
key: K,
start: S,
stop: S
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
S: Into<BulkString>,
fn zremrangebyscore<K, S>(
&self,
key: K,
start: S,
stop: S
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
S: Into<BulkString>,
Removes all elements in the sorted set stored at key with a score between min and max (inclusive). Read more
sourcefn zrevrank<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<usize>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
fn zrevrank<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<usize>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
Returns the rank of member in the sorted set stored at key, with the scores ordered from high to low. Read more
sourcefn zscan<K>(&self, key: K, cursor: usize) -> ZScan<'_, Self>where
K: Into<BulkString>,
fn zscan<K>(&self, key: K, cursor: usize) -> ZScan<'_, Self>where
K: Into<BulkString>,
Iterates elements of Sorted Set types and their associated scores. Read more
sourcefn zscore<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<f64>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
fn zscore<K, M>(
&self,
key: K,
member: M
) -> Pin<Box<dyn Future<Output = Result<Option<f64>>> + '_>>where
K: Into<BulkString>,
M: Into<BulkString>,
Returns the score of member in the sorted set at key. Read more
sourcefn zunion<K, C>(&self, keys: C) -> ZInterUnion<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zunion<K, C>(&self, keys: C) -> ZInterUnion<'_, Self>where
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
This command is similar to zunionstore, but instead of storing the resulting sorted set, it is returned to the client. Read more
sourcefn zunionstore<D, K, C>(
&self,
destination: D,
keys: C
) -> ZInterUnionStore<'_, Self>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
fn zunionstore<D, K, C>(
&self,
destination: D,
keys: C
) -> ZInterUnionStore<'_, Self>where
D: Into<BulkString>,
K: Into<BulkString>,
C: SingleArgOrCollection<K>,
Computes the union of numkeys sorted sets given by the specified keys, and stores the result in destination. Read more
sourceimpl StringCommands for Transaction
impl StringCommands for Transaction
sourcefn append<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
fn append<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<usize>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
If key already exists and is a string, this command appends the value at the end of the string. If key does not exist it is created and set as an empty string, so APPEND will be similar to SET in this special case. Read more
sourcefn decr<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn decr<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Decrements the number stored at key by one. Read more
sourcefn decrby<K>(
&self,
key: K,
decrement: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn decrby<K>(
&self,
key: K,
decrement: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Decrements the number stored at key by one. Read more
sourcefn get<K, V>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
Self: Sized,
fn get<K, V>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
Self: Sized,
Get the value of key. Read more
sourcefn getdel<K, V>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
fn getdel<K, V>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
Get the value of key and delete the key. Read more
sourcefn getex<K>(&self, key: K) -> GetEx<'_, Self>where
K: Into<BulkString>,
fn getex<K>(&self, key: K) -> GetEx<'_, Self>where
K: Into<BulkString>,
Get the value of key and optionally set its expiration. GETEX is similar to GET, but is a write command with additional options. Read more
sourcefn getrange<K, V>(
&self,
key: K,
start: usize,
end: isize
) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
fn getrange<K, V>(
&self,
key: K,
start: usize,
end: isize
) -> Pin<Box<dyn Future<Output = Result<V>> + '_>>where
K: Into<BulkString>,
V: FromValue,
Returns the substring of the string value stored at key, determined by the offsets start and end (both are inclusive). Read more
sourcefn getset<K, V, R>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<R>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
R: FromValue,
fn getset<K, V, R>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<R>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
R: FromValue,
Atomically sets key to value and returns the old value stored at key. Returns an error when key exists but does not hold a string value. Any previous time to live associated with the key is discarded on successful SET operation. Read more
sourcefn incr<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn incr<K>(&self, key: K) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Increments the number stored at key by one. Read more
sourcefn incrby<K>(
&self,
key: K,
increment: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
fn incrby<K>(
&self,
key: K,
increment: i64
) -> Pin<Box<dyn Future<Output = Result<i64>> + '_>>where
K: Into<BulkString>,
Increments the number stored at key by increment. Read more
sourcefn incrbyfloat<K>(
&self,
key: K,
increment: f64
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
fn incrbyfloat<K>(
&self,
key: K,
increment: f64
) -> Pin<Box<dyn Future<Output = Result<f64>> + '_>>where
K: Into<BulkString>,
Increment the string representing a floating point number stored at key by the specified increment. By using a negative increment value, the result is that the value stored at the key is decremented (by the obvious properties of addition). If the key does not exist, it is set to 0 before performing the operation. An error is returned if one of the following conditions occur: Read more
sourcefn lcs<K>(&self, key1: K, key2: K) -> Lcs<'_, Self>where
K: Into<BulkString>,
fn lcs<K>(&self, key1: K, key2: K) -> Lcs<'_, Self>where
K: Into<BulkString>,
The LCS command implements the longest common subsequence algorithm Read more
sourcefn mget<'a, K, V, C>(
&'a self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<V>>>> + '_>>where
K: Into<BulkString>,
V: FromValue,
C: SingleArgOrCollection<K>,
fn mget<'a, K, V, C>(
&'a self,
keys: C
) -> Pin<Box<dyn Future<Output = Result<Vec<Option<V>>>> + '_>>where
K: Into<BulkString>,
V: FromValue,
C: SingleArgOrCollection<K>,
Returns the values of all specified keys. Read more
sourcefn mset<'a, K, V, C>(
&'a self,
items: C
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
C: KeyValueArgOrCollection<K, V>,
K: Into<BulkString>,
V: Into<BulkString>,
fn mset<'a, K, V, C>(
&'a self,
items: C
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
C: KeyValueArgOrCollection<K, V>,
K: Into<BulkString>,
V: Into<BulkString>,
Sets the given keys to their respective values. Read more
sourcefn msetnx<'a, K, V, C>(
&'a self,
items: C
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
C: KeyValueArgOrCollection<K, V>,
K: Into<BulkString>,
V: Into<BulkString>,
fn msetnx<'a, K, V, C>(
&'a self,
items: C
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
C: KeyValueArgOrCollection<K, V>,
K: Into<BulkString>,
V: Into<BulkString>,
Sets the given keys to their respective values. MSETNX will not perform any operation at all even if just a single key already exists. Read more
sourcefn psetex<K, V>(
&self,
key: K,
milliseconds: u64,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
fn psetex<K, V>(
&self,
key: K,
milliseconds: u64,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
sourcefn set<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
Self: Sized,
fn set<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
Self: Sized,
Set key to hold the string value. Read more
sourcefn set_with_options<K, V>(&self, key: K, value: V) -> SetWithOptions<'_, Self>where
K: Into<BulkString>,
V: Into<BulkString>,
fn set_with_options<K, V>(&self, key: K, value: V) -> SetWithOptions<'_, Self>where
K: Into<BulkString>,
V: Into<BulkString>,
Set key to hold the string value. Read more
sourcefn setex<K, V>(
&self,
key: K,
seconds: u64,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
fn setex<K, V>(
&self,
key: K,
seconds: u64,
value: V
) -> Pin<Box<dyn Future<Output = Result<()>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
Set key to hold the string value and set key to timeout after a given number of seconds. Read more
sourcefn setnx<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
fn setnx<K, V>(
&self,
key: K,
value: V
) -> Pin<Box<dyn Future<Output = Result<bool>> + '_>>where
K: Into<BulkString>,
V: Into<BulkString>,
Set key to hold string value if key does not exist. Read more
Auto Trait Implementations
impl !RefUnwindSafe for Transaction
impl Send for Transaction
impl Sync for Transaction
impl Unpin for Transaction
impl !UnwindSafe for Transaction
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> WithSubscriber for T
impl<T> WithSubscriber for T
sourcefn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where
S: Into<Dispatch>,
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
sourcefn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more