Struct Form
pub struct Form<T>(pub T);Expand description
URL encoded payload extractor and responder.
Form has two uses: URL encoded responses, and extracting typed data from URL request payloads.
§Extractor
To extract typed data from a request body, the inner type T must implement the
DeserializeOwned trait.
Use FormConfig to configure extraction options.
§Examples
use actix_web::{post, web};
use serde::Deserialize;
#[derive(Deserialize)]
struct Info {
name: String,
}
// This handler is only called if:
// - request headers declare the content type as `application/x-www-form-urlencoded`
// - request payload deserializes into an `Info` struct from the URL encoded format
#[post("/")]
async fn index(web::Form(form): web::Form<Info>) -> String {
format!("Welcome {}!", form.name)
}§Responder
The Form type also allows you to create URL encoded responses by returning a value of type
Form<T> where T is the type to be URL encoded, as long as T implements Serialize.
§Examples
use actix_web::{get, web};
use serde::Serialize;
#[derive(Serialize)]
struct SomeForm {
name: String,
age: u8
}
// Response will have:
// - status: 200 OK
// - header: `Content-Type: application/x-www-form-urlencoded`
// - body: `name=actix&age=123`
#[get("/")]
async fn index() -> web::Form<SomeForm> {
web::Form(SomeForm {
name: "actix".to_owned(),
age: 123
})
}§Panics
URL encoded forms consist of unordered key=value pairs, therefore they cannot be decoded into
any type which depends upon data ordering (eg. tuples). Trying to do so will result in a panic.
Tuple Fields§
§0: TImplementations§
§impl<T> Form<T>
impl<T> Form<T>
pub fn into_inner(self) -> T
pub fn into_inner(self) -> T
Unwrap into inner T value.
Trait Implementations§
§impl<T> FromRequest for Form<T>where
T: DeserializeOwned + 'static,
See here for example of usage as an extractor.
impl<T> FromRequest for Form<T>where
T: DeserializeOwned + 'static,
See here for example of usage as an extractor.
§fn from_request(
req: &HttpRequest,
payload: &mut Payload,
) -> <Form<T> as FromRequest>::Future
fn from_request( req: &HttpRequest, payload: &mut Payload, ) -> <Form<T> as FromRequest>::Future
Self from request parts asynchronously.§fn extract(req: &HttpRequest) -> Self::Future
fn extract(req: &HttpRequest) -> Self::Future
Self from request head asynchronously. Read more§impl<T> Ord for Form<T>where
T: Ord,
impl<T> Ord for Form<T>where
T: Ord,
§impl<T> PartialOrd for Form<T>where
T: PartialOrd,
impl<T> PartialOrd for Form<T>where
T: PartialOrd,
§impl<T> Responder for Form<T>where
T: Serialize,
See here for example of usage as a handler return type.
impl<T> Responder for Form<T>where
T: Serialize,
See here for example of usage as a handler return type.
type Body = EitherBody<String>
§fn respond_to(
self,
_: &HttpRequest,
) -> HttpResponse<<Form<T> as Responder>::Body>
fn respond_to( self, _: &HttpRequest, ) -> HttpResponse<<Form<T> as Responder>::Body>
HttpResponse.§impl<T> Serialize for Form<T>where
T: Serialize,
impl<T> Serialize for Form<T>where
T: Serialize,
§fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
fn serialize<S>(
&self,
serializer: S,
) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
S: Serializer,
impl<T> Eq for Form<T>where
T: Eq,
impl<T> StructuralPartialEq for Form<T>
Auto Trait Implementations§
impl<T> Freeze for Form<T>where
T: Freeze,
impl<T> RefUnwindSafe for Form<T>where
T: RefUnwindSafe,
impl<T> Send for Form<T>where
T: Send,
impl<T> Sync for Form<T>where
T: Sync,
impl<T> Unpin for Form<T>where
T: Unpin,
impl<T> UnwindSafe for Form<T>where
T: UnwindSafe,
Blanket Implementations§
§impl<T, A, P> Access<T> for P
impl<T, A, P> Access<T> for P
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Chain<T> for T
impl<T> Chain<T> for T
§impl<T> Commands for Twhere
T: ConnectionLike,
impl<T> Commands for Twhere
T: ConnectionLike,
§fn get<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn get<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
MGET (if using TypedCommands, you should specifically use mget to get the correct return type.
Redis Docs§fn mget<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn mget<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn keys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn keys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn set<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn set<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn set_options<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: SetOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn set_options<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: SetOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn mset<'a, K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn mset<'a, K, V, RV>(&mut self, items: &'a [(K, V)]) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn set_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
seconds: u64,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn set_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
seconds: u64,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn pset_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
milliseconds: u64,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn pset_ex<'a, K, V, RV>(
&mut self,
key: K,
value: V,
milliseconds: u64,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn set_nx<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn set_nx<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn mset_nx<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn mset_nx<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn mset_ex<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)],
options: MSetOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn mset_ex<'a, K, V, RV>(
&mut self,
items: &'a [(K, V)],
options: MSetOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn getset<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn getset<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn getrange<'a, K, RV>(
&mut self,
key: K,
from: isize,
to: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn getrange<'a, K, RV>(
&mut self,
key: K,
from: isize,
to: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn setrange<'a, K, V, RV>(
&mut self,
key: K,
offset: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn setrange<'a, K, V, RV>(
&mut self,
key: K,
offset: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn del_ex<'a, K, RV>(
&mut self,
key: K,
value_comparison: ValueComparison,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn del_ex<'a, K, RV>(
&mut self,
key: K,
value_comparison: ValueComparison,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
match-value - Delete the key only if its value is equal to match-value
IFNE match-value - Delete the key only if its value is not equal to match-value
IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest
IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest
Redis Docs§fn digest<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn digest<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn exists<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn exists<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn key_type<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn key_type<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn expire<'a, K, RV>(&mut self, key: K, seconds: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn expire<'a, K, RV>(&mut self, key: K, seconds: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn expire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn expire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn pexpire<'a, K, RV>(&mut self, key: K, ms: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn pexpire<'a, K, RV>(&mut self, key: K, ms: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn pexpire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn pexpire_at<'a, K, RV>(&mut self, key: K, ts: i64) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn expire_time<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn expire_time<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pexpire_time<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn pexpire_time<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn persist<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn persist<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn ttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn ttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn pttl<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn get_ex<'a, K, RV>(
&mut self,
key: K,
expire_at: Expiry,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn get_ex<'a, K, RV>(
&mut self,
key: K,
expire_at: Expiry,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn get_del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn get_del<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn copy<'a, KSrc, KDst, Db, RV>(
&mut self,
source: KSrc,
destination: KDst,
options: CopyOptions<Db>,
) -> Result<RV, RedisError>where
KSrc: ToSingleRedisArg,
KDst: ToSingleRedisArg,
Db: ToString,
RV: FromRedisValue,
fn copy<'a, KSrc, KDst, Db, RV>(
&mut self,
source: KSrc,
destination: KDst,
options: CopyOptions<Db>,
) -> Result<RV, RedisError>where
KSrc: ToSingleRedisArg,
KDst: ToSingleRedisArg,
Db: ToString,
RV: FromRedisValue,
§fn rename<'a, K, N, RV>(&mut self, key: K, new_key: N) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
N: ToSingleRedisArg,
RV: FromRedisValue,
fn rename<'a, K, N, RV>(&mut self, key: K, new_key: N) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
N: ToSingleRedisArg,
RV: FromRedisValue,
§fn rename_nx<'a, K, N, RV>(
&mut self,
key: K,
new_key: N,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
N: ToSingleRedisArg,
RV: FromRedisValue,
fn rename_nx<'a, K, N, RV>(
&mut self,
key: K,
new_key: N,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
N: ToSingleRedisArg,
RV: FromRedisValue,
§fn unlink<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn unlink<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
DEL.
Returns number of keys unlinked.
Redis Docs§fn append<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn append<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn incr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn incr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
INCRBY or INCRBYFLOAT depending on the type.
If the key does not exist, it is set to 0 before performing the operation.§fn decr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn decr<'a, K, V, RV>(&mut self, key: K, delta: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn setbit<'a, K, RV>(
&mut self,
key: K,
offset: usize,
value: bool,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn setbit<'a, K, RV>(
&mut self,
key: K,
offset: usize,
value: bool,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn getbit<'a, K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn getbit<'a, K, RV>(&mut self, key: K, offset: usize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn bitcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn bitcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn bitcount_range<'a, K, RV>(
&mut self,
key: K,
start: usize,
end: usize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn bitcount_range<'a, K, RV>(
&mut self,
key: K,
start: usize,
end: usize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn bit_and<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_and<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
§fn bit_or<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_or<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
§fn bit_xor<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_xor<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
§fn bit_not<'a, D, S, RV>(
&mut self,
dstkey: D,
srckey: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToSingleRedisArg,
RV: FromRedisValue,
fn bit_not<'a, D, S, RV>(
&mut self,
dstkey: D,
srckey: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToSingleRedisArg,
RV: FromRedisValue,
§fn bit_diff<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_diff<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_diff1<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_diff1<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_and_or<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_and_or<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_one<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn bit_one<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§fn strlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn strlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn hget<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
RV: FromRedisValue,
fn hget<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
RV: FromRedisValue,
§fn hmget<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hmget<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hget_ex<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
expire_at: Expiry,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hget_ex<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
expire_at: Expiry,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hdel<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hdel<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hget_del<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hget_del<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hset<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn hset<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn hset_ex<'a, K, F, V, RV>(
&mut self,
key: K,
hash_field_expiration_options: &'a HashFieldExpirationOptions,
fields_values: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn hset_ex<'a, K, F, V, RV>(
&mut self,
key: K,
hash_field_expiration_options: &'a HashFieldExpirationOptions,
fields_values: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn hset_nx<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn hset_nx<'a, K, F, V, RV>(
&mut self,
key: K,
field: F,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn hset_multiple<'a, K, F, V, RV>(
&mut self,
key: K,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn hset_multiple<'a, K, F, V, RV>(
&mut self,
key: K,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn hincr<'a, K, F, D, RV>(
&mut self,
key: K,
field: F,
delta: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn hincr<'a, K, F, D, RV>(
&mut self,
key: K,
field: F,
delta: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn hexists<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
RV: FromRedisValue,
fn hexists<'a, K, F, RV>(&mut self, key: K, field: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToSingleRedisArg,
RV: FromRedisValue,
§fn httl<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn httl<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hpttl<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hpttl<'a, K, F, RV>(&mut self, key: K, fields: F) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hexpire<'a, K, F, RV>(
&mut self,
key: K,
seconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hexpire<'a, K, F, RV>(
&mut self,
key: K,
seconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hexpire_at<'a, K, F, RV>(
&mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hexpire_at<'a, K, F, RV>(
&mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hexpire_time<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hexpire_time<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hpersist<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hpersist<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hpexpire<'a, K, F, RV>(
&mut self,
key: K,
milliseconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hpexpire<'a, K, F, RV>(
&mut self,
key: K,
milliseconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hpexpire_at<'a, K, F, RV>(
&mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hpexpire_at<'a, K, F, RV>(
&mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hpexpire_time<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
fn hpexpire_time<'a, K, F, RV>(
&mut self,
key: K,
fields: F,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
F: ToRedisArgs,
RV: FromRedisValue,
§fn hkeys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hkeys<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn hvals<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hvals<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn hgetall<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hgetall<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn hlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn blmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn blmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn blmpop<'a, K, RV>(
&mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blmpop<'a, K, RV>(
&mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
count elements from the first non-empty list key from the list of
provided key names; or blocks until one is available.
Redis Docs§fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn blpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn brpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn brpop<'a, K, RV>(&mut self, key: K, timeout: f64) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn brpoplpush<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
timeout: f64,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn brpoplpush<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
timeout: f64,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn lindex<'a, K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn lindex<'a, K, RV>(&mut self, key: K, index: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn linsert_before<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn linsert_before<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn linsert_after<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn linsert_after<'a, K, P, V, RV>(
&mut self,
key: K,
pivot: P,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn llen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn llen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn lmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn lmove<'a, S, D, RV>(
&mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn lmpop<'a, K, RV>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn lmpop<'a, K, RV>(
&mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
count elements from the first non-empty list key from the list of
provided key names.
Redis Docs§fn lpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn lpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
count first elements of the list stored at key. Read more§fn lpos<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: LposOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn lpos<'a, K, V, RV>(
&mut self,
key: K,
value: V,
options: LposOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn lpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
§fn lpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
fn lpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
§fn lrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn lrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn lrem<'a, K, V, RV>(
&mut self,
key: K,
count: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn lrem<'a, K, V, RV>(
&mut self,
key: K,
count: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn ltrim<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn ltrim<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn lset<'a, K, V, RV>(
&mut self,
key: K,
index: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
fn lset<'a, K, V, RV>(
&mut self,
key: K,
index: isize,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToSingleRedisArg,
RV: FromRedisValue,
§fn ping<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn ping<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn ping_message<'a, K, RV>(&mut self, message: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn ping_message<'a, K, RV>(&mut self, message: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn rpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn rpop<'a, K, RV>(
&mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
count last elements of the list stored at key Read more§fn rpoplpush<'a, K, D, RV>(
&mut self,
key: K,
dstkey: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn rpoplpush<'a, K, D, RV>(
&mut self,
key: K,
dstkey: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn rpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush<'a, K, V, RV>(&mut self, key: K, value: V) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
§fn rpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
fn rpush_exists<'a, K, V, RV>(
&mut self,
key: K,
value: V,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
V: ToRedisArgs,
RV: FromRedisValue,
§fn sadd<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn sadd<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn scard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn scard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn sdiff<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiff<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn sdiffstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn sdiffstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn sinter<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sinter<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn sinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn sinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn sismember<'a, K, M, RV>(
&mut self,
key: K,
member: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn sismember<'a, K, M, RV>(
&mut self,
key: K,
member: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn smismember<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn smismember<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn smembers<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn smembers<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn smove<'a, S, D, M, RV>(
&mut self,
srckey: S,
dstkey: D,
member: M,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn smove<'a, S, D, M, RV>(
&mut self,
srckey: S,
dstkey: D,
member: M,
) -> Result<RV, RedisError>where
S: ToSingleRedisArg,
D: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn spop<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn spop<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn srandmember<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn srandmember<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn srandmember_multiple<'a, K, RV>(
&mut self,
key: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn srandmember_multiple<'a, K, RV>(
&mut self,
key: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn srem<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn srem<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn sunion<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn sunion<'a, K, RV>(&mut self, keys: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn sunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn sunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zadd<'a, K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zadd<'a, K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zadd_multiple<'a, K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zadd_multiple<'a, K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
§fn zadd_options<'a, K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S,
options: &'a SortedSetAddOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zadd_options<'a, K, S, M, RV>(
&mut self,
key: K,
member: M,
score: S,
options: &'a SortedSetAddOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zadd_multiple_options<'a, K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)],
options: &'a SortedSetAddOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
fn zadd_multiple_options<'a, K, S, M, RV>(
&mut self,
key: K,
items: &'a [(S, M)],
options: &'a SortedSetAddOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
S: ToRedisArgs,
M: ToRedisArgs,
RV: FromRedisValue,
§fn zcard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zcard<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zincr<'a, K, M, D, RV>(
&mut self,
key: K,
member: M,
delta: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
fn zincr<'a, K, M, D, RV>(
&mut self,
key: K,
member: M,
delta: D,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
D: ToSingleRedisArg,
RV: FromRedisValue,
§fn zinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zinterstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zinterstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zinterstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zinterstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zinterstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zinterstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zinterstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zlexcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zlexcount<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn bzpopmax<'a, K, RV>(
&mut self,
key: K,
timeout: f64,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzpopmax<'a, K, RV>(
&mut self,
key: K,
timeout: f64,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn zpopmax<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zpopmax<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn bzpopmin<'a, K, RV>(
&mut self,
key: K,
timeout: f64,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzpopmin<'a, K, RV>(
&mut self,
key: K,
timeout: f64,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn zpopmin<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zpopmin<'a, K, RV>(&mut self, key: K, count: isize) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn bzmpop_max<'a, K, RV>(
&mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzmpop_max<'a, K, RV>(
&mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn zmpop_max<'a, K, RV>(
&mut self,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_max<'a, K, RV>(
&mut self,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn bzmpop_min<'a, K, RV>(
&mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn bzmpop_min<'a, K, RV>(
&mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn zmpop_min<'a, K, RV>(
&mut self,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn zmpop_min<'a, K, RV>(
&mut self,
keys: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn zrandmember<'a, K, RV>(
&mut self,
key: K,
count: Option<isize>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrandmember<'a, K, RV>(
&mut self,
key: K,
count: Option<isize>,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
count == None)
Redis Docs§fn zrandmember_withscores<'a, K, RV>(
&mut self,
key: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrandmember_withscores<'a, K, RV>(
&mut self,
key: K,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebylex_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebylex_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebylex<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebylex<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebylex_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebyscore_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebyscore_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebyscore_limit<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrangebyscore_limit_withscores<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrank<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrank<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrem<'a, K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn zrem<'a, K, M, RV>(&mut self, key: K, members: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn zrembylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrembylex<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zremrangebyrank<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zremrangebyrank<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrembyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
fn zrembyscore<'a, K, M, MM, RV>(
&mut self,
key: K,
min: M,
max: MM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
MM: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrange<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrange_withscores<'a, K, RV>(
&mut self,
key: K,
start: isize,
stop: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebyscore<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebyscore<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebyscore_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebyscore_limit<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrangebyscore_limit_withscores<'a, K, MM, M, RV>(
&mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
MM: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zrevrank<'a, K, M, RV>(
&mut self,
key: K,
member: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zrevrank<'a, K, M, RV>(
&mut self,
key: K,
member: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zscore<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn zscore<'a, K, M, RV>(&mut self, key: K, member: M) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
§fn zscore_multiple<'a, K, M, RV>(
&mut self,
key: K,
members: &'a [M],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn zscore_multiple<'a, K, M, RV>(
&mut self,
key: K,
members: &'a [M],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn zunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zunionstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_min<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zunionstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_max<'a, D, K, RV>(
&mut self,
dstkey: D,
keys: K,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
RV: FromRedisValue,
§fn zunionstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zunionstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_min_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zunionstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
fn zunionstore_max_weights<'a, D, K, W, RV>(
&mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
K: ToRedisArgs,
W: ToRedisArgs,
RV: FromRedisValue,
Commands::zunionstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn pfadd<'a, K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToRedisArgs,
RV: FromRedisValue,
fn pfadd<'a, K, E, RV>(&mut self, key: K, element: E) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToRedisArgs,
RV: FromRedisValue,
§fn pfcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn pfcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn pfmerge<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
fn pfmerge<'a, D, S, RV>(
&mut self,
dstkey: D,
srckeys: S,
) -> Result<RV, RedisError>where
D: ToSingleRedisArg,
S: ToRedisArgs,
RV: FromRedisValue,
§fn publish<'a, K, E, RV>(
&mut self,
channel: K,
message: E,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToSingleRedisArg,
RV: FromRedisValue,
fn publish<'a, K, E, RV>(
&mut self,
channel: K,
message: E,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToSingleRedisArg,
RV: FromRedisValue,
§fn spublish<'a, K, E, RV>(
&mut self,
channel: K,
message: E,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToSingleRedisArg,
RV: FromRedisValue,
fn spublish<'a, K, E, RV>(
&mut self,
channel: K,
message: E,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
E: ToSingleRedisArg,
RV: FromRedisValue,
§fn object_encoding<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn object_encoding<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn object_idletime<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn object_idletime<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn object_freq<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn object_freq<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn object_refcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn object_refcount<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn client_getname<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn client_getname<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn client_id<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn client_id<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn client_setname<'a, K, RV>(
&mut self,
connection_name: K,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn client_setname<'a, K, RV>(
&mut self,
connection_name: K,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn acl_load<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_load<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_save<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_save<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_list<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_list<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_users<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_users<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_getuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn acl_getuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn acl_setuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn acl_setuser<'a, K, RV>(&mut self, username: K) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn acl_setuser_rules<'a, K, RV>(
&mut self,
username: K,
rules: &'a [Rule],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn acl_setuser_rules<'a, K, RV>(
&mut self,
username: K,
rules: &'a [Rule],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn acl_deluser<'a, K, RV>(
&mut self,
usernames: &'a [K],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn acl_deluser<'a, K, RV>(
&mut self,
usernames: &'a [K],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn acl_dryrun<'a, K, C, A, RV>(
&mut self,
username: K,
command: C,
args: A,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
C: ToSingleRedisArg,
A: ToRedisArgs,
RV: FromRedisValue,
fn acl_dryrun<'a, K, C, A, RV>(
&mut self,
username: K,
command: C,
args: A,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
C: ToSingleRedisArg,
A: ToRedisArgs,
RV: FromRedisValue,
§fn acl_cat<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_cat<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_cat_categoryname<'a, K, RV>(
&mut self,
categoryname: K,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn acl_cat_categoryname<'a, K, RV>(
&mut self,
categoryname: K,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn acl_genpass<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_genpass<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_genpass_bits<'a, RV>(&mut self, bits: isize) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_genpass_bits<'a, RV>(&mut self, bits: isize) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_whoami<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_whoami<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_log<'a, RV>(&mut self, count: isize) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_log<'a, RV>(&mut self, count: isize) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_log_reset<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_log_reset<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn acl_help<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn acl_help<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn geo_add<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn geo_add<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn geo_dist<'a, K, M1, M2, RV>(
&mut self,
key: K,
member1: M1,
member2: M2,
unit: Unit,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M1: ToSingleRedisArg,
M2: ToSingleRedisArg,
RV: FromRedisValue,
fn geo_dist<'a, K, M1, M2, RV>(
&mut self,
key: K,
member1: M1,
member2: M2,
unit: Unit,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M1: ToSingleRedisArg,
M2: ToSingleRedisArg,
RV: FromRedisValue,
§fn geo_hash<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn geo_hash<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn geo_pos<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
fn geo_pos<'a, K, M, RV>(
&mut self,
key: K,
members: M,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToRedisArgs,
RV: FromRedisValue,
§fn geo_radius<'a, K, RV>(
&mut self,
key: K,
longitude: f64,
latitude: f64,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn geo_radius<'a, K, RV>(
&mut self,
key: K,
longitude: f64,
latitude: f64,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn geo_radius_by_member<'a, K, M, RV>(
&mut self,
key: K,
member: M,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
fn geo_radius_by_member<'a, K, M, RV>(
&mut self,
key: K,
member: M,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
M: ToSingleRedisArg,
RV: FromRedisValue,
member. The
member itself is always contained in the results.
Redis Docs§fn xack<'a, K, G, I, RV>(
&mut self,
key: K,
group: G,
ids: &'a [I],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
I: ToRedisArgs,
RV: FromRedisValue,
fn xack<'a, K, G, I, RV>(
&mut self,
key: K,
group: G,
ids: &'a [I],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
I: ToRedisArgs,
RV: FromRedisValue,
§fn xadd<'a, K, ID, F, V, RV>(
&mut self,
key: K,
id: ID,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn xadd<'a, K, ID, F, V, RV>(
&mut self,
key: K,
id: ID,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn xadd_map<'a, K, ID, BTM, RV>(
&mut self,
key: K,
id: ID,
map: BTM,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
BTM: ToRedisArgs,
RV: FromRedisValue,
fn xadd_map<'a, K, ID, BTM, RV>(
&mut self,
key: K,
id: ID,
map: BTM,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
BTM: ToRedisArgs,
RV: FromRedisValue,
key.
Use * as the id for the current timestamp. Read more§fn xadd_options<'a, K, ID, I, RV>(
&mut self,
key: K,
id: ID,
items: I,
options: &'a StreamAddOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
I: ToRedisArgs,
RV: FromRedisValue,
fn xadd_options<'a, K, ID, I, RV>(
&mut self,
key: K,
id: ID,
items: I,
options: &'a StreamAddOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
I: ToRedisArgs,
RV: FromRedisValue,
§fn xadd_maxlen<'a, K, ID, F, V, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
fn xadd_maxlen<'a, K, ID, F, V, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
items: &'a [(F, V)],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
F: ToRedisArgs,
V: ToRedisArgs,
RV: FromRedisValue,
§fn xadd_maxlen_map<'a, K, ID, BTM, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
map: BTM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
BTM: ToRedisArgs,
RV: FromRedisValue,
fn xadd_maxlen_map<'a, K, ID, BTM, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
map: BTM,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
BTM: ToRedisArgs,
RV: FromRedisValue,
§fn xautoclaim_options<'a, K, G, C, MIT, S, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
start: S,
options: StreamAutoClaimOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
S: ToRedisArgs,
RV: FromRedisValue,
fn xautoclaim_options<'a, K, G, C, MIT, S, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
start: S,
options: StreamAutoClaimOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
S: ToRedisArgs,
RV: FromRedisValue,
§fn xclaim<'a, K, G, C, MIT, ID, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xclaim<'a, K, G, C, MIT, ID, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
§fn xclaim_options<'a, K, G, C, MIT, ID, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
options: StreamClaimOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xclaim_options<'a, K, G, C, MIT, ID, RV>(
&mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
options: StreamClaimOptions,
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
G: ToRedisArgs,
C: ToRedisArgs,
MIT: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
§fn xdel<'a, K, ID, RV>(
&mut self,
key: K,
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xdel<'a, K, ID, RV>(
&mut self,
key: K,
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToSingleRedisArg,
ID: ToRedisArgs,
RV: FromRedisValue,
§fn xdel_ex<'a, K, ID, RV>(
&mut self,
key: K,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xdel_ex<'a, K, ID, RV>(
&mut self,
key: K,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
XDEL command that provides finer control over how message entries are deleted with respect to consumer groups.§fn xack_del<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xack_del<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
XACK and XDEL that acknowledges and attempts to delete a list of ids for a given stream key and consumer group.§fn xgroup_create<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_create<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
group. It expects the stream key
to already exist. Otherwise, use xgroup_create_mkstream if it doesn’t.
The id is the starting message id all consumers should read from. Use $ If you want
all consumers to read from the last message added to stream. Read more§fn xgroup_createconsumer<'a, K, G, C, RV>(
&mut self,
key: K,
group: G,
consumer: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_createconsumer<'a, K, G, C, RV>(
&mut self,
key: K,
group: G,
consumer: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
consumer explicitly (vs implicit via XREADGROUP)
for given stream `key. Read more§fn xgroup_create_mkstream<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_create_mkstream<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
group
which makes the stream if it doesn’t exist. Read more§fn xgroup_setid<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_setid<'a, K, G, ID, RV>(
&mut self,
key: K,
group: G,
id: ID,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
§fn xgroup_destroy<'a, K, G, RV>(
&mut self,
key: K,
group: G,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_destroy<'a, K, G, RV>(
&mut self,
key: K,
group: G,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
§fn xgroup_delconsumer<'a, K, G, C, RV>(
&mut self,
key: K,
group: G,
consumer: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
fn xgroup_delconsumer<'a, K, G, C, RV>(
&mut self,
key: K,
group: G,
consumer: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
§fn xinfo_consumers<'a, K, G, RV>(
&mut self,
key: K,
group: G,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
fn xinfo_consumers<'a, K, G, RV>(
&mut self,
key: K,
group: G,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
group.
Take note of the StreamInfoConsumersReply return type. Read more§fn xinfo_groups<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xinfo_groups<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
groups created for a given stream key.
Take note of the StreamInfoGroupsReply return type. Read more§fn xinfo_stream<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xinfo_stream<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
id, length, number of groups, etc.)
Take note of the StreamInfoStreamReply return type. Read more§fn xlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xlen<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
key. Read more§fn xpending<'a, K, G, RV>(&mut self, key: K, group: G) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
fn xpending<'a, K, G, RV>(&mut self, key: K, group: G) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
RV: FromRedisValue,
key and consumer group and it
returns details about which consumers have pending messages
that haven’t been acked. Read more§fn xpending_count<'a, K, G, S, E, C, RV>(
&mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
fn xpending_count<'a, K, G, S, E, C, RV>(
&mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
§fn xpending_consumer_count<'a, K, G, S, E, C, CN, RV>(
&mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
consumer: CN,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
CN: ToRedisArgs,
RV: FromRedisValue,
fn xpending_consumer_count<'a, K, G, S, E, C, CN, RV>(
&mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
consumer: CN,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
G: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
CN: ToRedisArgs,
RV: FromRedisValue,
§fn xrange<'a, K, S, E, RV>(
&mut self,
key: K,
start: S,
end: E,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
fn xrange<'a, K, S, E, RV>(
&mut self,
key: K,
start: S,
end: E,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
RV: FromRedisValue,
key. Read more§fn xrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
key.
Use with caution! Read more§fn xrange_count<'a, K, S, E, C, RV>(
&mut self,
key: K,
start: S,
end: E,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
fn xrange_count<'a, K, S, E, C, RV>(
&mut self,
key: K,
start: S,
end: E,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
S: ToRedisArgs,
E: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
key. Read more§fn xread<'a, K, ID, RV>(
&mut self,
keys: &'a [K],
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xread<'a, K, ID, RV>(
&mut self,
keys: &'a [K],
ids: &'a [ID],
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
ids for each stream key.
This is the basic form of reading streams.
For more advanced control, like blocking, limiting, or reading by consumer group,
see xread_options. Read more§fn xread_options<'a, K, ID, RV>(
&mut self,
keys: &'a [K],
ids: &'a [ID],
options: &'a StreamReadOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
fn xread_options<'a, K, ID, RV>(
&mut self,
keys: &'a [K],
ids: &'a [ID],
options: &'a StreamReadOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
ID: ToRedisArgs,
RV: FromRedisValue,
§fn xrevrange<'a, K, E, S, RV>(
&mut self,
key: K,
end: E,
start: S,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
E: ToRedisArgs,
S: ToRedisArgs,
RV: FromRedisValue,
fn xrevrange<'a, K, E, S, RV>(
&mut self,
key: K,
end: E,
start: S,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
E: ToRedisArgs,
S: ToRedisArgs,
RV: FromRedisValue,
§fn xrevrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xrevrange_all<'a, K, RV>(&mut self, key: K) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
§fn xrevrange_count<'a, K, E, S, C, RV>(
&mut self,
key: K,
end: E,
start: S,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
E: ToRedisArgs,
S: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
fn xrevrange_count<'a, K, E, S, C, RV>(
&mut self,
key: K,
end: E,
start: S,
count: C,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
E: ToRedisArgs,
S: ToRedisArgs,
C: ToRedisArgs,
RV: FromRedisValue,
§fn xtrim<'a, K, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xtrim<'a, K, RV>(
&mut self,
key: K,
maxlen: StreamMaxlen,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
key to a MAXLEN count. Read more§fn xtrim_options<'a, K, RV>(
&mut self,
key: K,
options: &'a StreamTrimOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
fn xtrim_options<'a, K, RV>(
&mut self,
key: K,
options: &'a StreamTrimOptions,
) -> Result<RV, RedisError>where
K: ToRedisArgs,
RV: FromRedisValue,
key with full options Read more§fn load_script<'a, RV>(&mut self, script: &'a Script) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn load_script<'a, RV>(&mut self, script: &'a Script) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn invoke_script<'a, RV>(
&mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn invoke_script<'a, RV>(
&mut self,
invocation: &'a ScriptInvocation<'a>,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn flushall<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn flushall<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn flushall_options<'a, RV>(
&mut self,
options: &'a FlushAllOptions,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn flushall_options<'a, RV>(
&mut self,
options: &'a FlushAllOptions,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn flushdb<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn flushdb<'a, RV>(&mut self) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn flushdb_options<'a, RV>(
&mut self,
options: &'a FlushAllOptions,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
fn flushdb_options<'a, RV>(
&mut self,
options: &'a FlushAllOptions,
) -> Result<RV, RedisError>where
RV: FromRedisValue,
§fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError>where
RV: FromRedisValue,
fn scan<RV>(&mut self) -> Result<Iter<'_, RV>, RedisError>where
RV: FromRedisValue,
§fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Result<Iter<'_, RV>, RedisError>where
RV: FromRedisValue,
fn scan_options<RV>(
&mut self,
opts: ScanOptions,
) -> Result<Iter<'_, RV>, RedisError>where
RV: FromRedisValue,
§fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>where
P: ToSingleRedisArg,
RV: FromRedisValue,
fn scan_match<P, RV>(&mut self, pattern: P) -> Result<Iter<'_, RV>, RedisError>where
P: ToSingleRedisArg,
RV: FromRedisValue,
§fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn hscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
§fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn sscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
§fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
fn zscan<K, RV>(&mut self, key: K) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
RV: FromRedisValue,
§fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
fn zscan_match<K, P, RV>(
&mut self,
key: K,
pattern: P,
) -> Result<Iter<'_, RV>, RedisError>where
K: ToSingleRedisArg,
P: ToSingleRedisArg,
RV: FromRedisValue,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<C, T> ConnectionLike for Twhere
C: ConnectionLike,
T: DerefMut<Target = C>,
impl<C, T> ConnectionLike for Twhere
C: ConnectionLike,
T: DerefMut<Target = C>,
§fn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
fn req_packed_command(&mut self, cmd: &[u8]) -> Result<Value, RedisError>
fn req_packed_commands( &mut self, cmd: &[u8], offset: usize, count: usize, ) -> Result<Vec<Value>, RedisError>
§fn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
fn req_command(&mut self, cmd: &Cmd) -> Result<Value, RedisError>
§fn get_db(&self) -> i64
fn get_db(&self) -> i64
fn supports_pipelining(&self) -> bool
§fn check_connection(&mut self) -> bool
fn check_connection(&mut self) -> bool
PING internally).§impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
impl<T, A> DynAccess<T> for Awhere
A: Access<T>,
<A as Access<T>>::Guard: 'static,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
§impl<T, P> Resource for Twhere
T: DerefMut<Target = Path<P>>,
P: ResourcePath,
impl<T, P> Resource for Twhere
T: DerefMut<Target = Path<P>>,
P: ResourcePath,
§fn resource_path(&mut self) -> &mut Path<<T as Resource>::Path>
fn resource_path(&mut self) -> &mut Path<<T as Resource>::Path>
Source§impl<R> Rng for R
impl<R> Rng for R
Source§fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
StandardUniform distribution. Read moreSource§fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>
Source§fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
Source§fn random_bool(&mut self, p: f64) -> bool
fn random_bool(&mut self, p: f64) -> bool
p of being true. Read moreSource§fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
numerator/denominator of being
true. Read moreSource§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
Source§fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
Source§fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn gen<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
random to avoid conflict with the new gen keyword in Rust 2024.Rng::random.Source§fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn gen_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
random_rangeRng::random_range.§impl<R> Rng for Rwhere
R: TryRng<Error = Infallible> + ?Sized,
impl<R> Rng for Rwhere
R: TryRng<Error = Infallible> + ?Sized,
§impl<R> RngExt for R
impl<R> RngExt for R
§fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
fn random<T>(&mut self) -> Twhere
StandardUniform: Distribution<T>,
StandardUniform distribution. Read more§fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>where
Self: Sized,
StandardUniform: Distribution<T>,
fn random_iter<T>(self) -> Iter<StandardUniform, Self, T>where
Self: Sized,
StandardUniform: Distribution<T>,
§fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
fn random_range<T, R>(&mut self, range: R) -> Twhere
T: SampleUniform,
R: SampleRange<T>,
§fn random_bool(&mut self, p: f64) -> bool
fn random_bool(&mut self, p: f64) -> bool
p of being true. Read more§fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
fn random_ratio(&mut self, numerator: u32, denominator: u32) -> bool
numerator/denominator of being
true. Read more§fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
fn sample<T, D>(&mut self, distr: D) -> Twhere
D: Distribution<T>,
§fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
fn sample_iter<T, D>(self, distr: D) -> Iter<D, Self, T>where
D: Distribution<T>,
Self: Sized,
§impl<T> ServiceExt for T
impl<T> ServiceExt for T
§fn map_response_body<F>(self, f: F) -> MapResponseBody<Self, F>where
Self: Sized,
fn map_response_body<F>(self, f: F) -> MapResponseBody<Self, F>where
Self: Sized,
§fn decompression(self) -> Decompression<Self>where
Self: Sized,
fn decompression(self) -> Decompression<Self>where
Self: Sized,
§fn trace_for_http(self) -> Trace<Self, SharedClassifier<ServerErrorsAsFailures>>where
Self: Sized,
fn trace_for_http(self) -> Trace<Self, SharedClassifier<ServerErrorsAsFailures>>where
Self: Sized,
§fn trace_for_grpc(self) -> Trace<Self, SharedClassifier<GrpcErrorsAsFailures>>where
Self: Sized,
fn trace_for_grpc(self) -> Trace<Self, SharedClassifier<GrpcErrorsAsFailures>>where
Self: Sized,
§fn follow_redirects(self) -> FollowRedirect<Self>where
Self: Sized,
fn follow_redirects(self) -> FollowRedirect<Self>where
Self: Sized,
§impl<C> SignWithKey<String> for Cwhere
C: ToBase64,
impl<C> SignWithKey<String> for Cwhere
C: ToBase64,
fn sign_with_key(self, key: &impl SigningAlgorithm) -> Result<String, Error>
§impl<T> ToStringFallible for Twhere
T: Display,
impl<T> ToStringFallible for Twhere
T: Display,
§fn try_to_string(&self) -> Result<String, TryReserveError>
fn try_to_string(&self) -> Result<String, TryReserveError>
ToString::to_string, but without panic on OOM.
§impl<R> TryRng for R
impl<R> TryRng for R
§type Error = <<R as Deref>::Target as TryRng>::Error
type Error = <<R as Deref>::Target as TryRng>::Error
§fn try_next_u32(&mut self) -> Result<u32, <R as TryRng>::Error>
fn try_next_u32(&mut self) -> Result<u32, <R as TryRng>::Error>
u32.§fn try_next_u64(&mut self) -> Result<u64, <R as TryRng>::Error>
fn try_next_u64(&mut self) -> Result<u64, <R as TryRng>::Error>
u64.§fn try_fill_bytes(&mut self, dst: &mut [u8]) -> Result<(), <R as TryRng>::Error>
fn try_fill_bytes(&mut self, dst: &mut [u8]) -> Result<(), <R as TryRng>::Error>
dst entirely with random data.Source§impl<R> TryRngCore for R
impl<R> TryRngCore for R
Source§type Error = Infallible
type Error = Infallible
Source§fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
fn try_next_u32(&mut self) -> Result<u32, <R as TryRngCore>::Error>
u32.Source§fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
fn try_next_u64(&mut self) -> Result<u64, <R as TryRngCore>::Error>
u64.Source§fn try_fill_bytes(
&mut self,
dst: &mut [u8],
) -> Result<(), <R as TryRngCore>::Error>
fn try_fill_bytes( &mut self, dst: &mut [u8], ) -> Result<(), <R as TryRngCore>::Error>
dest entirely with random data.Source§fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
fn unwrap_mut(&mut self) -> UnwrapMut<'_, Self>
UnwrapMut wrapper.Source§fn read_adapter(&mut self) -> RngReadAdapter<'_, Self>where
Self: Sized,
fn read_adapter(&mut self) -> RngReadAdapter<'_, Self>where
Self: Sized,
RngCore to a RngReadAdapter.§impl<R> TryRngCore for Rwhere
R: TryRng,
impl<R> TryRngCore for Rwhere
R: TryRng,
§impl<T> TypedCommands for Twhere
T: ConnectionLike,
impl<T> TypedCommands for Twhere
T: ConnectionLike,
§fn get<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
fn get<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
MGET (if using TypedCommands, you should specifically use mget to get the correct return type.
Redis Docs§fn mget<'a, K>(&'a mut self, key: K) -> Result<Vec<Option<String>>, RedisError>
fn mget<'a, K>(&'a mut self, key: K) -> Result<Vec<Option<String>>, RedisError>
§fn keys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
fn keys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
§fn set<'a, K, V>(&'a mut self, key: K, value: V) -> Result<(), RedisError>
fn set<'a, K, V>(&'a mut self, key: K, value: V) -> Result<(), RedisError>
§fn set_options<'a, K, V>(
&'a mut self,
key: K,
value: V,
options: SetOptions,
) -> Result<Option<String>, RedisError>
fn set_options<'a, K, V>( &'a mut self, key: K, value: V, options: SetOptions, ) -> Result<Option<String>, RedisError>
§fn mset<'a, K, V>(&'a mut self, items: &'a [(K, V)]) -> Result<(), RedisError>
fn mset<'a, K, V>(&'a mut self, items: &'a [(K, V)]) -> Result<(), RedisError>
§fn set_ex<'a, K, V>(
&'a mut self,
key: K,
value: V,
seconds: u64,
) -> Result<(), RedisError>
fn set_ex<'a, K, V>( &'a mut self, key: K, value: V, seconds: u64, ) -> Result<(), RedisError>
§fn pset_ex<'a, K, V>(
&'a mut self,
key: K,
value: V,
milliseconds: u64,
) -> Result<(), RedisError>
fn pset_ex<'a, K, V>( &'a mut self, key: K, value: V, milliseconds: u64, ) -> Result<(), RedisError>
§fn set_nx<'a, K, V>(&'a mut self, key: K, value: V) -> Result<bool, RedisError>
fn set_nx<'a, K, V>(&'a mut self, key: K, value: V) -> Result<bool, RedisError>
§fn mset_nx<'a, K, V>(
&'a mut self,
items: &'a [(K, V)],
) -> Result<bool, RedisError>
fn mset_nx<'a, K, V>( &'a mut self, items: &'a [(K, V)], ) -> Result<bool, RedisError>
§fn mset_ex<'a, K, V>(
&'a mut self,
items: &'a [(K, V)],
options: MSetOptions,
) -> Result<bool, RedisError>
fn mset_ex<'a, K, V>( &'a mut self, items: &'a [(K, V)], options: MSetOptions, ) -> Result<bool, RedisError>
§fn getset<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Result<Option<String>, RedisError>
fn getset<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<Option<String>, RedisError>
§fn getrange<'a, K>(
&'a mut self,
key: K,
from: isize,
to: isize,
) -> Result<String, RedisError>
fn getrange<'a, K>( &'a mut self, key: K, from: isize, to: isize, ) -> Result<String, RedisError>
§fn setrange<'a, K, V>(
&'a mut self,
key: K,
offset: isize,
value: V,
) -> Result<usize, RedisError>
fn setrange<'a, K, V>( &'a mut self, key: K, offset: isize, value: V, ) -> Result<usize, RedisError>
§fn del<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn del<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn del_ex<'a, K>(
&'a mut self,
key: K,
value_comparison: ValueComparison,
) -> Result<usize, RedisError>
fn del_ex<'a, K>( &'a mut self, key: K, value_comparison: ValueComparison, ) -> Result<usize, RedisError>
match-value - Delete the key only if its value is equal to match-value
IFNE match-value - Delete the key only if its value is not equal to match-value
IFDEQ match-digest - Delete the key only if the digest of its value is equal to match-digest
IFDNE match-digest - Delete the key only if the digest of its value is not equal to match-digest
Redis Docs§fn digest<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
fn digest<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
§fn exists<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
fn exists<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
§fn key_type<'a, K>(&'a mut self, key: K) -> Result<ValueType, RedisError>
fn key_type<'a, K>(&'a mut self, key: K) -> Result<ValueType, RedisError>
§fn expire<'a, K>(&'a mut self, key: K, seconds: i64) -> Result<bool, RedisError>
fn expire<'a, K>(&'a mut self, key: K, seconds: i64) -> Result<bool, RedisError>
§fn expire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
fn expire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
§fn pexpire<'a, K>(&'a mut self, key: K, ms: i64) -> Result<bool, RedisError>
fn pexpire<'a, K>(&'a mut self, key: K, ms: i64) -> Result<bool, RedisError>
§fn pexpire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
fn pexpire_at<'a, K>(&'a mut self, key: K, ts: i64) -> Result<bool, RedisError>
§fn expire_time<'a, K>(
&'a mut self,
key: K,
) -> Result<IntegerReplyOrNoOp, RedisError>
fn expire_time<'a, K>( &'a mut self, key: K, ) -> Result<IntegerReplyOrNoOp, RedisError>
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pexpire_time<'a, K>(
&'a mut self,
key: K,
) -> Result<IntegerReplyOrNoOp, RedisError>
fn pexpire_time<'a, K>( &'a mut self, key: K, ) -> Result<IntegerReplyOrNoOp, RedisError>
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn persist<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
fn persist<'a, K>(&'a mut self, key: K) -> Result<bool, RedisError>
§fn ttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
fn ttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn pttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
fn pttl<'a, K>(&'a mut self, key: K) -> Result<IntegerReplyOrNoOp, RedisError>
ExistsButNotRelevant if key exists but has no expiration time.
Redis Docs§fn get_ex<'a, K>(
&'a mut self,
key: K,
expire_at: Expiry,
) -> Result<Option<String>, RedisError>
fn get_ex<'a, K>( &'a mut self, key: K, expire_at: Expiry, ) -> Result<Option<String>, RedisError>
§fn get_del<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
fn get_del<'a, K>(&'a mut self, key: K) -> Result<Option<String>, RedisError>
§fn copy<'a, KSrc, KDst, Db>(
&'a mut self,
source: KSrc,
destination: KDst,
options: CopyOptions<Db>,
) -> Result<bool, RedisError>
fn copy<'a, KSrc, KDst, Db>( &'a mut self, source: KSrc, destination: KDst, options: CopyOptions<Db>, ) -> Result<bool, RedisError>
§fn rename<'a, K, N>(&'a mut self, key: K, new_key: N) -> Result<(), RedisError>
fn rename<'a, K, N>(&'a mut self, key: K, new_key: N) -> Result<(), RedisError>
§fn rename_nx<'a, K, N>(
&'a mut self,
key: K,
new_key: N,
) -> Result<bool, RedisError>
fn rename_nx<'a, K, N>( &'a mut self, key: K, new_key: N, ) -> Result<bool, RedisError>
§fn unlink<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn unlink<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
DEL.
Returns number of keys unlinked.
Redis Docs§fn append<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
fn append<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
§fn incr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
fn incr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
INCRBY or INCRBYFLOAT depending on the type.
If the key does not exist, it is set to 0 before performing the operation.§fn decr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
fn decr<'a, K, V>(&'a mut self, key: K, delta: V) -> Result<isize, RedisError>
§fn setbit<'a, K>(
&'a mut self,
key: K,
offset: usize,
value: bool,
) -> Result<bool, RedisError>
fn setbit<'a, K>( &'a mut self, key: K, offset: usize, value: bool, ) -> Result<bool, RedisError>
§fn getbit<'a, K>(
&'a mut self,
key: K,
offset: usize,
) -> Result<bool, RedisError>
fn getbit<'a, K>( &'a mut self, key: K, offset: usize, ) -> Result<bool, RedisError>
§fn bitcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn bitcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn bitcount_range<'a, K>(
&'a mut self,
key: K,
start: usize,
end: usize,
) -> Result<usize, RedisError>
fn bitcount_range<'a, K>( &'a mut self, key: K, start: usize, end: usize, ) -> Result<usize, RedisError>
§fn bit_and<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_and<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
§fn bit_or<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
§fn bit_xor<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_xor<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
§fn bit_not<'a, D, S>(
&'a mut self,
dstkey: D,
srckey: S,
) -> Result<usize, RedisError>
fn bit_not<'a, D, S>( &'a mut self, dstkey: D, srckey: S, ) -> Result<usize, RedisError>
§fn bit_diff<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_diff<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
Perform a set difference to extract the members of X that are not members of any of Y1, Y2,….
Logical representation: X ∧ ¬(Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_diff1<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_diff1<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
Perform a relative complement set difference to extract the members of one or more of Y1, Y2,… that are not members of X.
Logical representation: ¬X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_and_or<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_and_or<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
Perform an “intersection of union(s)” operation to extract the members of X that are also members of one or more of Y1, Y2,….
Logical representation: X ∧ (Y1 ∨ Y2 ∨ …)
Redis Docs
§fn bit_one<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<usize, RedisError>
fn bit_one<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<usize, RedisError>
Perform an “exclusive membership” operation to extract the members of exactly one of X, Y1, Y2, ….
Logical representation: (X ∨ Y1 ∨ Y2 ∨ …) ∧ ¬((X ∧ Y1) ∨ (X ∧ Y2) ∨ (Y1 ∧ Y2) ∨ (Y1 ∧ Y3) ∨ …)
Redis Docs
§fn strlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn strlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn hget<'a, K, F>(
&'a mut self,
key: K,
field: F,
) -> Result<Option<String>, RedisError>
fn hget<'a, K, F>( &'a mut self, key: K, field: F, ) -> Result<Option<String>, RedisError>
§fn hmget<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<String>, RedisError>
fn hmget<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<String>, RedisError>
§fn hget_ex<'a, K, F>(
&'a mut self,
key: K,
fields: F,
expire_at: Expiry,
) -> Result<Vec<String>, RedisError>
fn hget_ex<'a, K, F>( &'a mut self, key: K, fields: F, expire_at: Expiry, ) -> Result<Vec<String>, RedisError>
§fn hdel<'a, K, F>(&'a mut self, key: K, field: F) -> Result<usize, RedisError>
fn hdel<'a, K, F>(&'a mut self, key: K, field: F) -> Result<usize, RedisError>
§fn hget_del<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<Option<String>>, RedisError>
fn hget_del<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<Option<String>>, RedisError>
§fn hset<'a, K, F, V>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Result<usize, RedisError>
fn hset<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Result<usize, RedisError>
§fn hset_ex<'a, K, F, V>(
&'a mut self,
key: K,
hash_field_expiration_options: &'a HashFieldExpirationOptions,
fields_values: &'a [(F, V)],
) -> Result<bool, RedisError>
fn hset_ex<'a, K, F, V>( &'a mut self, key: K, hash_field_expiration_options: &'a HashFieldExpirationOptions, fields_values: &'a [(F, V)], ) -> Result<bool, RedisError>
§fn hset_nx<'a, K, F, V>(
&'a mut self,
key: K,
field: F,
value: V,
) -> Result<bool, RedisError>
fn hset_nx<'a, K, F, V>( &'a mut self, key: K, field: F, value: V, ) -> Result<bool, RedisError>
§fn hset_multiple<'a, K, F, V>(
&'a mut self,
key: K,
items: &'a [(F, V)],
) -> Result<(), RedisError>
fn hset_multiple<'a, K, F, V>( &'a mut self, key: K, items: &'a [(F, V)], ) -> Result<(), RedisError>
§fn hincr<'a, K, F, D>(
&'a mut self,
key: K,
field: F,
delta: D,
) -> Result<f64, RedisError>
fn hincr<'a, K, F, D>( &'a mut self, key: K, field: F, delta: D, ) -> Result<f64, RedisError>
§fn hexists<'a, K, F>(&'a mut self, key: K, field: F) -> Result<bool, RedisError>
fn hexists<'a, K, F>(&'a mut self, key: K, field: F) -> Result<bool, RedisError>
§fn httl<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn httl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hpttl<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hpttl<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hexpire<'a, K, F>(
&'a mut self,
key: K,
seconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hexpire<'a, K, F>( &'a mut self, key: K, seconds: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hexpire_at<'a, K, F>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hexpire_time<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hpersist<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hpersist<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hpexpire<'a, K, F>(
&'a mut self,
key: K,
milliseconds: i64,
opt: ExpireOption,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hpexpire<'a, K, F>( &'a mut self, key: K, milliseconds: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hpexpire_at<'a, K, F>(
&'a mut self,
key: K,
ts: i64,
opt: ExpireOption,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hpexpire_at<'a, K, F>( &'a mut self, key: K, ts: i64, opt: ExpireOption, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hpexpire_time<'a, K, F>(
&'a mut self,
key: K,
fields: F,
) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
fn hpexpire_time<'a, K, F>( &'a mut self, key: K, fields: F, ) -> Result<Vec<IntegerReplyOrNoOp>, RedisError>
§fn hkeys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
fn hkeys<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
§fn hvals<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
fn hvals<'a, K>(&'a mut self, key: K) -> Result<Vec<String>, RedisError>
§fn hgetall<'a, K>(
&'a mut self,
key: K,
) -> Result<HashMap<String, String>, RedisError>
fn hgetall<'a, K>( &'a mut self, key: K, ) -> Result<HashMap<String, String>, RedisError>
§fn hlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn hlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn blmove<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
timeout: f64,
) -> Result<Option<String>, RedisError>
fn blmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, timeout: f64, ) -> Result<Option<String>, RedisError>
§fn blmpop<'a, K>(
&'a mut self,
timeout: f64,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<Option<[String; 2]>, RedisError>
fn blmpop<'a, K>( &'a mut self, timeout: f64, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<Option<[String; 2]>, RedisError>
count elements from the first non-empty list key from the list of
provided key names; or blocks until one is available.
Redis Docs§fn blpop<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Result<Option<[String; 2]>, RedisError>
fn blpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<[String; 2]>, RedisError>
§fn brpop<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Result<Option<[String; 2]>, RedisError>
fn brpop<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<[String; 2]>, RedisError>
§fn brpoplpush<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
timeout: f64,
) -> Result<Option<String>, RedisError>
fn brpoplpush<'a, S, D>( &'a mut self, srckey: S, dstkey: D, timeout: f64, ) -> Result<Option<String>, RedisError>
§fn lindex<'a, K>(
&'a mut self,
key: K,
index: isize,
) -> Result<Option<String>, RedisError>
fn lindex<'a, K>( &'a mut self, key: K, index: isize, ) -> Result<Option<String>, RedisError>
§fn linsert_before<'a, K, P, V>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Result<isize, RedisError>
fn linsert_before<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Result<isize, RedisError>
§fn linsert_after<'a, K, P, V>(
&'a mut self,
key: K,
pivot: P,
value: V,
) -> Result<isize, RedisError>
fn linsert_after<'a, K, P, V>( &'a mut self, key: K, pivot: P, value: V, ) -> Result<isize, RedisError>
§fn llen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn llen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn lmove<'a, S, D>(
&'a mut self,
srckey: S,
dstkey: D,
src_dir: Direction,
dst_dir: Direction,
) -> Result<String, RedisError>
fn lmove<'a, S, D>( &'a mut self, srckey: S, dstkey: D, src_dir: Direction, dst_dir: Direction, ) -> Result<String, RedisError>
§fn lmpop<'a, K>(
&'a mut self,
numkeys: usize,
key: K,
dir: Direction,
count: usize,
) -> Result<Option<(String, Vec<String>)>, RedisError>
fn lmpop<'a, K>( &'a mut self, numkeys: usize, key: K, dir: Direction, count: usize, ) -> Result<Option<(String, Vec<String>)>, RedisError>
count elements from the first non-empty list key from the list of
provided key names.
Redis Docs§fn lpop<'a, RV, K>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>
fn lpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Result<RV, RedisError>
count first elements of the list stored at key. Read more§fn lpos<'a, RV, K, V>(
&'a mut self,
key: K,
value: V,
options: LposOptions,
) -> Result<RV, RedisError>
fn lpos<'a, RV, K, V>( &'a mut self, key: K, value: V, options: LposOptions, ) -> Result<RV, RedisError>
§fn lpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
fn lpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
§fn lpush_exists<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Result<usize, RedisError>
fn lpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<usize, RedisError>
§fn lrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<Vec<String>, RedisError>
fn lrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
§fn lrem<'a, K, V>(
&'a mut self,
key: K,
count: isize,
value: V,
) -> Result<usize, RedisError>
fn lrem<'a, K, V>( &'a mut self, key: K, count: isize, value: V, ) -> Result<usize, RedisError>
§fn ltrim<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<(), RedisError>
fn ltrim<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<(), RedisError>
§fn lset<'a, K, V>(
&'a mut self,
key: K,
index: isize,
value: V,
) -> Result<(), RedisError>
fn lset<'a, K, V>( &'a mut self, key: K, index: isize, value: V, ) -> Result<(), RedisError>
§fn ping<'a>(&'a mut self) -> Result<String, RedisError>
fn ping<'a>(&'a mut self) -> Result<String, RedisError>
§fn ping_message<'a, K>(&'a mut self, message: K) -> Result<String, RedisError>
fn ping_message<'a, K>(&'a mut self, message: K) -> Result<String, RedisError>
§fn rpop<'a, RV, K>(
&'a mut self,
key: K,
count: Option<NonZero<usize>>,
) -> Result<RV, RedisError>
fn rpop<'a, RV, K>( &'a mut self, key: K, count: Option<NonZero<usize>>, ) -> Result<RV, RedisError>
count last elements of the list stored at key Read more§fn rpoplpush<'a, K, D>(
&'a mut self,
key: K,
dstkey: D,
) -> Result<Option<String>, RedisError>
fn rpoplpush<'a, K, D>( &'a mut self, key: K, dstkey: D, ) -> Result<Option<String>, RedisError>
§fn rpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
fn rpush<'a, K, V>(&'a mut self, key: K, value: V) -> Result<usize, RedisError>
§fn rpush_exists<'a, K, V>(
&'a mut self,
key: K,
value: V,
) -> Result<usize, RedisError>
fn rpush_exists<'a, K, V>( &'a mut self, key: K, value: V, ) -> Result<usize, RedisError>
§fn sadd<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
fn sadd<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
§fn scard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn scard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn sdiff<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
fn sdiff<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
§fn sdiffstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn sdiffstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn sinter<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
fn sinter<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
§fn sinterstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn sinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn sismember<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Result<bool, RedisError>
fn sismember<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<bool, RedisError>
§fn smismember<'a, K, M>(
&'a mut self,
key: K,
members: M,
) -> Result<Vec<bool>, RedisError>
fn smismember<'a, K, M>( &'a mut self, key: K, members: M, ) -> Result<Vec<bool>, RedisError>
§fn smembers<'a, K>(&'a mut self, key: K) -> Result<HashSet<String>, RedisError>
fn smembers<'a, K>(&'a mut self, key: K) -> Result<HashSet<String>, RedisError>
§fn smove<'a, S, D, M>(
&'a mut self,
srckey: S,
dstkey: D,
member: M,
) -> Result<bool, RedisError>
fn smove<'a, S, D, M>( &'a mut self, srckey: S, dstkey: D, member: M, ) -> Result<bool, RedisError>
§fn spop<'a, RV, K>(&'a mut self, key: K) -> Result<RV, RedisError>
fn spop<'a, RV, K>(&'a mut self, key: K) -> Result<RV, RedisError>
§fn srandmember<'a, K>(
&'a mut self,
key: K,
) -> Result<Option<String>, RedisError>
fn srandmember<'a, K>( &'a mut self, key: K, ) -> Result<Option<String>, RedisError>
§fn srandmember_multiple<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Result<Vec<String>, RedisError>
fn srandmember_multiple<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
§fn srem<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
fn srem<'a, K, M>(&'a mut self, key: K, member: M) -> Result<usize, RedisError>
§fn sunion<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
fn sunion<'a, K>(&'a mut self, keys: K) -> Result<HashSet<String>, RedisError>
§fn sunionstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn sunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zadd<'a, K, S, M>(
&'a mut self,
key: K,
member: M,
score: S,
) -> Result<usize, RedisError>
fn zadd<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, ) -> Result<usize, RedisError>
§fn zadd_multiple<'a, K, S, M>(
&'a mut self,
key: K,
items: &'a [(S, M)],
) -> Result<usize, RedisError>
fn zadd_multiple<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], ) -> Result<usize, RedisError>
§fn zadd_options<'a, K, S, M>(
&'a mut self,
key: K,
member: M,
score: S,
options: &'a SortedSetAddOptions,
) -> Result<usize, RedisError>
fn zadd_options<'a, K, S, M>( &'a mut self, key: K, member: M, score: S, options: &'a SortedSetAddOptions, ) -> Result<usize, RedisError>
§fn zadd_multiple_options<'a, K, S, M>(
&'a mut self,
key: K,
items: &'a [(S, M)],
options: &'a SortedSetAddOptions,
) -> Result<usize, RedisError>
fn zadd_multiple_options<'a, K, S, M>( &'a mut self, key: K, items: &'a [(S, M)], options: &'a SortedSetAddOptions, ) -> Result<usize, RedisError>
§fn zcard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn zcard<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn zcount<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<usize, RedisError>
fn zcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
§fn zincr<'a, K, M, D>(
&'a mut self,
key: K,
member: M,
delta: D,
) -> Result<f64, RedisError>
fn zincr<'a, K, M, D>( &'a mut self, key: K, member: M, delta: D, ) -> Result<f64, RedisError>
§fn zinterstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zinterstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zinterstore_min<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zinterstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zinterstore_max<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zinterstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zinterstore_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zinterstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zinterstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_min_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zinterstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zinterstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zinterstore_max_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zinterstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zinterstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zlexcount<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<usize, RedisError>
fn zlexcount<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
§fn bzpopmax<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Result<Option<(String, String, f64)>, RedisError>
fn bzpopmax<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<(String, String, f64)>, RedisError>
§fn zpopmax<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zpopmax<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
§fn bzpopmin<'a, K>(
&'a mut self,
key: K,
timeout: f64,
) -> Result<Option<(String, String, f64)>, RedisError>
fn bzpopmin<'a, K>( &'a mut self, key: K, timeout: f64, ) -> Result<Option<(String, String, f64)>, RedisError>
§fn zpopmin<'a, K>(
&'a mut self,
key: K,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zpopmin<'a, K>( &'a mut self, key: K, count: isize, ) -> Result<Vec<String>, RedisError>
§fn bzmpop_max<'a, K>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
fn bzmpop_max<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
§fn zmpop_max<'a, K>(
&'a mut self,
keys: K,
count: isize,
) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
fn zmpop_max<'a, K>( &'a mut self, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
§fn bzmpop_min<'a, K>(
&'a mut self,
timeout: f64,
keys: K,
count: isize,
) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
fn bzmpop_min<'a, K>( &'a mut self, timeout: f64, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
§fn zmpop_min<'a, K>(
&'a mut self,
keys: K,
count: isize,
) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
fn zmpop_min<'a, K>( &'a mut self, keys: K, count: isize, ) -> Result<Option<(String, Vec<(String, f64)>)>, RedisError>
§fn zrandmember<'a, RV, K>(
&'a mut self,
key: K,
count: Option<isize>,
) -> Result<RV, RedisError>
fn zrandmember<'a, RV, K>( &'a mut self, key: K, count: Option<isize>, ) -> Result<RV, RedisError>
count == None)
Redis Docs§fn zrandmember_withscores<'a, RV, K>(
&'a mut self,
key: K,
count: isize,
) -> Result<RV, RedisError>
fn zrandmember_withscores<'a, RV, K>( &'a mut self, key: K, count: isize, ) -> Result<RV, RedisError>
§fn zrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<Vec<String>, RedisError>
fn zrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
§fn zrange_withscores<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<Vec<(String, f64)>, RedisError>
fn zrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<(String, f64)>, RedisError>
§fn zrangebylex<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<Vec<String>, RedisError>
fn zrangebylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<String>, RedisError>
§fn zrangebylex_limit<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zrangebylex_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebylex<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Result<Vec<String>, RedisError>
fn zrevrangebylex<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebylex_limit<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zrevrangebylex_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
§fn zrangebyscore<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<Vec<String>, RedisError>
fn zrangebyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<String>, RedisError>
§fn zrangebyscore_withscores<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<Vec<(String, usize)>, RedisError>
fn zrangebyscore_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<Vec<(String, usize)>, RedisError>
§fn zrangebyscore_limit<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zrangebyscore_limit<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
§fn zrangebyscore_limit_withscores<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
offset: isize,
count: isize,
) -> Result<Vec<(String, usize)>, RedisError>
fn zrangebyscore_limit_withscores<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, offset: isize, count: isize, ) -> Result<Vec<(String, usize)>, RedisError>
§fn zrank<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Result<Option<usize>, RedisError>
fn zrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<usize>, RedisError>
§fn zrem<'a, K, M>(&'a mut self, key: K, members: M) -> Result<usize, RedisError>
fn zrem<'a, K, M>(&'a mut self, key: K, members: M) -> Result<usize, RedisError>
§fn zrembylex<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<usize, RedisError>
fn zrembylex<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
§fn zremrangebyrank<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<usize, RedisError>
fn zremrangebyrank<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<usize, RedisError>
§fn zrembyscore<'a, K, M, MM>(
&'a mut self,
key: K,
min: M,
max: MM,
) -> Result<usize, RedisError>
fn zrembyscore<'a, K, M, MM>( &'a mut self, key: K, min: M, max: MM, ) -> Result<usize, RedisError>
§fn zrevrange<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<Vec<String>, RedisError>
fn zrevrange<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
§fn zrevrange_withscores<'a, K>(
&'a mut self,
key: K,
start: isize,
stop: isize,
) -> Result<Vec<String>, RedisError>
fn zrevrange_withscores<'a, K>( &'a mut self, key: K, start: isize, stop: isize, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebyscore<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Result<Vec<String>, RedisError>
fn zrevrangebyscore<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebyscore_withscores<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
) -> Result<Vec<String>, RedisError>
fn zrevrangebyscore_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebyscore_limit<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zrevrangebyscore_limit<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
§fn zrevrangebyscore_limit_withscores<'a, K, MM, M>(
&'a mut self,
key: K,
max: MM,
min: M,
offset: isize,
count: isize,
) -> Result<Vec<String>, RedisError>
fn zrevrangebyscore_limit_withscores<'a, K, MM, M>( &'a mut self, key: K, max: MM, min: M, offset: isize, count: isize, ) -> Result<Vec<String>, RedisError>
§fn zrevrank<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Result<Option<usize>, RedisError>
fn zrevrank<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<usize>, RedisError>
§fn zscore<'a, K, M>(
&'a mut self,
key: K,
member: M,
) -> Result<Option<f64>, RedisError>
fn zscore<'a, K, M>( &'a mut self, key: K, member: M, ) -> Result<Option<f64>, RedisError>
§fn zscore_multiple<'a, K, M>(
&'a mut self,
key: K,
members: &'a [M],
) -> Result<Option<Vec<f64>>, RedisError>
fn zscore_multiple<'a, K, M>( &'a mut self, key: K, members: &'a [M], ) -> Result<Option<Vec<f64>>, RedisError>
§fn zunionstore<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zunionstore<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zunionstore_min<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zunionstore_min<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zunionstore_max<'a, D, K>(
&'a mut self,
dstkey: D,
keys: K,
) -> Result<usize, RedisError>
fn zunionstore_max<'a, D, K>( &'a mut self, dstkey: D, keys: K, ) -> Result<usize, RedisError>
§fn zunionstore_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zunionstore_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zunionstore], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_min_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zunionstore_min_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zunionstore_min], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn zunionstore_max_weights<'a, D, K, W>(
&'a mut self,
dstkey: D,
keys: &'a [(K, W)],
) -> Result<usize, RedisError>
fn zunionstore_max_weights<'a, D, K, W>( &'a mut self, dstkey: D, keys: &'a [(K, W)], ) -> Result<usize, RedisError>
Commands::zunionstore_max], but with the ability to specify a
multiplication factor for each sorted set by pairing one with each key
in a tuple.
Redis Docs§fn pfadd<'a, K, E>(&'a mut self, key: K, element: E) -> Result<bool, RedisError>
fn pfadd<'a, K, E>(&'a mut self, key: K, element: E) -> Result<bool, RedisError>
§fn pfcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn pfcount<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
§fn pfmerge<'a, D, S>(
&'a mut self,
dstkey: D,
srckeys: S,
) -> Result<(), RedisError>
fn pfmerge<'a, D, S>( &'a mut self, dstkey: D, srckeys: S, ) -> Result<(), RedisError>
§fn publish<'a, K, E>(
&'a mut self,
channel: K,
message: E,
) -> Result<usize, RedisError>
fn publish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Result<usize, RedisError>
§fn spublish<'a, K, E>(
&'a mut self,
channel: K,
message: E,
) -> Result<usize, RedisError>
fn spublish<'a, K, E>( &'a mut self, channel: K, message: E, ) -> Result<usize, RedisError>
§fn object_encoding<'a, K>(
&'a mut self,
key: K,
) -> Result<Option<String>, RedisError>
fn object_encoding<'a, K>( &'a mut self, key: K, ) -> Result<Option<String>, RedisError>
§fn object_idletime<'a, K>(
&'a mut self,
key: K,
) -> Result<Option<usize>, RedisError>
fn object_idletime<'a, K>( &'a mut self, key: K, ) -> Result<Option<usize>, RedisError>
§fn object_freq<'a, K>(&'a mut self, key: K) -> Result<Option<usize>, RedisError>
fn object_freq<'a, K>(&'a mut self, key: K) -> Result<Option<usize>, RedisError>
§fn object_refcount<'a, K>(
&'a mut self,
key: K,
) -> Result<Option<usize>, RedisError>
fn object_refcount<'a, K>( &'a mut self, key: K, ) -> Result<Option<usize>, RedisError>
§fn client_getname<'a>(&'a mut self) -> Result<Option<String>, RedisError>
fn client_getname<'a>(&'a mut self) -> Result<Option<String>, RedisError>
§fn client_id<'a>(&'a mut self) -> Result<isize, RedisError>
fn client_id<'a>(&'a mut self) -> Result<isize, RedisError>
§fn client_setname<'a, K>(
&'a mut self,
connection_name: K,
) -> Result<(), RedisError>
fn client_setname<'a, K>( &'a mut self, connection_name: K, ) -> Result<(), RedisError>
§fn acl_load<'a>(&'a mut self) -> Result<(), RedisError>
fn acl_load<'a>(&'a mut self) -> Result<(), RedisError>
§fn acl_save<'a>(&'a mut self) -> Result<(), RedisError>
fn acl_save<'a>(&'a mut self) -> Result<(), RedisError>
§fn acl_list<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
fn acl_list<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
§fn acl_users<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
fn acl_users<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
§fn acl_getuser<'a, K>(
&'a mut self,
username: K,
) -> Result<Option<AclInfo>, RedisError>
fn acl_getuser<'a, K>( &'a mut self, username: K, ) -> Result<Option<AclInfo>, RedisError>
§fn acl_setuser<'a, K>(&'a mut self, username: K) -> Result<(), RedisError>
fn acl_setuser<'a, K>(&'a mut self, username: K) -> Result<(), RedisError>
§fn acl_setuser_rules<'a, K>(
&'a mut self,
username: K,
rules: &'a [Rule],
) -> Result<(), RedisError>
fn acl_setuser_rules<'a, K>( &'a mut self, username: K, rules: &'a [Rule], ) -> Result<(), RedisError>
§fn acl_deluser<'a, K>(
&'a mut self,
usernames: &'a [K],
) -> Result<usize, RedisError>
fn acl_deluser<'a, K>( &'a mut self, usernames: &'a [K], ) -> Result<usize, RedisError>
§fn acl_dryrun<'a, K, C, A>(
&'a mut self,
username: K,
command: C,
args: A,
) -> Result<String, RedisError>
fn acl_dryrun<'a, K, C, A>( &'a mut self, username: K, command: C, args: A, ) -> Result<String, RedisError>
§fn acl_cat<'a>(&'a mut self) -> Result<HashSet<String>, RedisError>
fn acl_cat<'a>(&'a mut self) -> Result<HashSet<String>, RedisError>
§fn acl_cat_categoryname<'a, K>(
&'a mut self,
categoryname: K,
) -> Result<HashSet<String>, RedisError>
fn acl_cat_categoryname<'a, K>( &'a mut self, categoryname: K, ) -> Result<HashSet<String>, RedisError>
§fn acl_genpass<'a>(&'a mut self) -> Result<String, RedisError>
fn acl_genpass<'a>(&'a mut self) -> Result<String, RedisError>
§fn acl_genpass_bits<'a>(&'a mut self, bits: isize) -> Result<String, RedisError>
fn acl_genpass_bits<'a>(&'a mut self, bits: isize) -> Result<String, RedisError>
§fn acl_whoami<'a>(&'a mut self) -> Result<String, RedisError>
fn acl_whoami<'a>(&'a mut self) -> Result<String, RedisError>
§fn acl_log<'a>(&'a mut self, count: isize) -> Result<Vec<String>, RedisError>
fn acl_log<'a>(&'a mut self, count: isize) -> Result<Vec<String>, RedisError>
§fn acl_log_reset<'a>(&'a mut self) -> Result<(), RedisError>
fn acl_log_reset<'a>(&'a mut self) -> Result<(), RedisError>
§fn acl_help<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
fn acl_help<'a>(&'a mut self) -> Result<Vec<String>, RedisError>
§fn geo_add<'a, K, M>(
&'a mut self,
key: K,
members: M,
) -> Result<usize, RedisError>
fn geo_add<'a, K, M>( &'a mut self, key: K, members: M, ) -> Result<usize, RedisError>
§fn geo_dist<'a, K, M1, M2>(
&'a mut self,
key: K,
member1: M1,
member2: M2,
unit: Unit,
) -> Result<Option<f64>, RedisError>
fn geo_dist<'a, K, M1, M2>( &'a mut self, key: K, member1: M1, member2: M2, unit: Unit, ) -> Result<Option<f64>, RedisError>
§fn geo_pos<'a, K, M>(
&'a mut self,
key: K,
members: M,
) -> Result<Vec<Option<Coord<f64>>>, RedisError>
fn geo_pos<'a, K, M>( &'a mut self, key: K, members: M, ) -> Result<Vec<Option<Coord<f64>>>, RedisError>
§fn geo_radius<'a, K>(
&'a mut self,
key: K,
longitude: f64,
latitude: f64,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<Vec<RadiusSearchResult>, RedisError>
fn geo_radius<'a, K>( &'a mut self, key: K, longitude: f64, latitude: f64, radius: f64, unit: Unit, options: RadiusOptions, ) -> Result<Vec<RadiusSearchResult>, RedisError>
§fn geo_radius_by_member<'a, K, M>(
&'a mut self,
key: K,
member: M,
radius: f64,
unit: Unit,
options: RadiusOptions,
) -> Result<Vec<RadiusSearchResult>, RedisError>
fn geo_radius_by_member<'a, K, M>( &'a mut self, key: K, member: M, radius: f64, unit: Unit, options: RadiusOptions, ) -> Result<Vec<RadiusSearchResult>, RedisError>
member. The
member itself is always contained in the results.
Redis Docs§fn xack<'a, K, G, I>(
&'a mut self,
key: K,
group: G,
ids: &'a [I],
) -> Result<usize, RedisError>
fn xack<'a, K, G, I>( &'a mut self, key: K, group: G, ids: &'a [I], ) -> Result<usize, RedisError>
§fn xadd<'a, K, ID, F, V>(
&'a mut self,
key: K,
id: ID,
items: &'a [(F, V)],
) -> Result<Option<String>, RedisError>
fn xadd<'a, K, ID, F, V>( &'a mut self, key: K, id: ID, items: &'a [(F, V)], ) -> Result<Option<String>, RedisError>
§fn xadd_map<'a, K, ID, BTM>(
&'a mut self,
key: K,
id: ID,
map: BTM,
) -> Result<Option<String>, RedisError>
fn xadd_map<'a, K, ID, BTM>( &'a mut self, key: K, id: ID, map: BTM, ) -> Result<Option<String>, RedisError>
key.
Use * as the id for the current timestamp. Read more§fn xadd_options<'a, K, ID, I>(
&'a mut self,
key: K,
id: ID,
items: I,
options: &'a StreamAddOptions,
) -> Result<Option<String>, RedisError>
fn xadd_options<'a, K, ID, I>( &'a mut self, key: K, id: ID, items: I, options: &'a StreamAddOptions, ) -> Result<Option<String>, RedisError>
§fn xadd_maxlen<'a, K, ID, F, V>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
items: &'a [(F, V)],
) -> Result<Option<String>, RedisError>
fn xadd_maxlen<'a, K, ID, F, V>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, items: &'a [(F, V)], ) -> Result<Option<String>, RedisError>
§fn xadd_maxlen_map<'a, K, ID, BTM>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
id: ID,
map: BTM,
) -> Result<Option<String>, RedisError>
fn xadd_maxlen_map<'a, K, ID, BTM>( &'a mut self, key: K, maxlen: StreamMaxlen, id: ID, map: BTM, ) -> Result<Option<String>, RedisError>
§fn xautoclaim_options<'a, K, G, C, MIT, S>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
start: S,
options: StreamAutoClaimOptions,
) -> Result<StreamAutoClaimReply, RedisError>
fn xautoclaim_options<'a, K, G, C, MIT, S>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, start: S, options: StreamAutoClaimOptions, ) -> Result<StreamAutoClaimReply, RedisError>
§fn xclaim<'a, K, G, C, MIT, ID>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
) -> Result<StreamClaimReply, RedisError>
fn xclaim<'a, K, G, C, MIT, ID>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], ) -> Result<StreamClaimReply, RedisError>
§fn xclaim_options<'a, RV, K, G, C, MIT, ID>(
&'a mut self,
key: K,
group: G,
consumer: C,
min_idle_time: MIT,
ids: &'a [ID],
options: StreamClaimOptions,
) -> Result<RV, RedisError>
fn xclaim_options<'a, RV, K, G, C, MIT, ID>( &'a mut self, key: K, group: G, consumer: C, min_idle_time: MIT, ids: &'a [ID], options: StreamClaimOptions, ) -> Result<RV, RedisError>
§fn xdel_ex<'a, K, ID>(
&'a mut self,
key: K,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<Vec<XDelExStatusCode>, RedisError>
fn xdel_ex<'a, K, ID>( &'a mut self, key: K, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Result<Vec<XDelExStatusCode>, RedisError>
XDEL command that provides finer control over how message entries are deleted with respect to consumer groups.§fn xack_del<'a, K, G, ID>(
&'a mut self,
key: K,
group: G,
ids: &'a [ID],
options: StreamDeletionPolicy,
) -> Result<Vec<XAckDelStatusCode>, RedisError>
fn xack_del<'a, K, G, ID>( &'a mut self, key: K, group: G, ids: &'a [ID], options: StreamDeletionPolicy, ) -> Result<Vec<XAckDelStatusCode>, RedisError>
XACK and XDEL that acknowledges and attempts to delete a list of ids for a given stream key and consumer group.§fn xgroup_create<'a, K, G, ID>(
&'a mut self,
key: K,
group: G,
id: ID,
) -> Result<(), RedisError>
fn xgroup_create<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Result<(), RedisError>
group. It expects the stream key
to already exist. Otherwise, use xgroup_create_mkstream if it doesn’t.
The id is the starting message id all consumers should read from. Use $ If you want
all consumers to read from the last message added to stream. Read more§fn xgroup_createconsumer<'a, K, G, C>(
&'a mut self,
key: K,
group: G,
consumer: C,
) -> Result<bool, RedisError>
fn xgroup_createconsumer<'a, K, G, C>( &'a mut self, key: K, group: G, consumer: C, ) -> Result<bool, RedisError>
consumer explicitly (vs implicit via XREADGROUP)
for given stream `key. Read more§fn xgroup_create_mkstream<'a, K, G, ID>(
&'a mut self,
key: K,
group: G,
id: ID,
) -> Result<(), RedisError>
fn xgroup_create_mkstream<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Result<(), RedisError>
group
which makes the stream if it doesn’t exist. Read more§fn xgroup_setid<'a, K, G, ID>(
&'a mut self,
key: K,
group: G,
id: ID,
) -> Result<(), RedisError>
fn xgroup_setid<'a, K, G, ID>( &'a mut self, key: K, group: G, id: ID, ) -> Result<(), RedisError>
§fn xgroup_destroy<'a, K, G>(
&'a mut self,
key: K,
group: G,
) -> Result<bool, RedisError>
fn xgroup_destroy<'a, K, G>( &'a mut self, key: K, group: G, ) -> Result<bool, RedisError>
§fn xgroup_delconsumer<'a, K, G, C>(
&'a mut self,
key: K,
group: G,
consumer: C,
) -> Result<usize, RedisError>
fn xgroup_delconsumer<'a, K, G, C>( &'a mut self, key: K, group: G, consumer: C, ) -> Result<usize, RedisError>
§fn xinfo_consumers<'a, K, G>(
&'a mut self,
key: K,
group: G,
) -> Result<StreamInfoConsumersReply, RedisError>
fn xinfo_consumers<'a, K, G>( &'a mut self, key: K, group: G, ) -> Result<StreamInfoConsumersReply, RedisError>
group.
Take note of the StreamInfoConsumersReply return type. Read more§fn xinfo_groups<'a, K>(
&'a mut self,
key: K,
) -> Result<StreamInfoGroupsReply, RedisError>
fn xinfo_groups<'a, K>( &'a mut self, key: K, ) -> Result<StreamInfoGroupsReply, RedisError>
groups created for a given stream key.
Take note of the StreamInfoGroupsReply return type. Read more§fn xinfo_stream<'a, K>(
&'a mut self,
key: K,
) -> Result<StreamInfoStreamReply, RedisError>
fn xinfo_stream<'a, K>( &'a mut self, key: K, ) -> Result<StreamInfoStreamReply, RedisError>
id, length, number of groups, etc.)
Take note of the StreamInfoStreamReply return type. Read more§fn xlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
fn xlen<'a, K>(&'a mut self, key: K) -> Result<usize, RedisError>
key. Read more§fn xpending<'a, K, G>(
&'a mut self,
key: K,
group: G,
) -> Result<StreamPendingReply, RedisError>
fn xpending<'a, K, G>( &'a mut self, key: K, group: G, ) -> Result<StreamPendingReply, RedisError>
key and consumer group and it
returns details about which consumers have pending messages
that haven’t been acked. Read more§fn xpending_count<'a, K, G, S, E, C>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
) -> Result<StreamPendingCountReply, RedisError>
fn xpending_count<'a, K, G, S, E, C>( &'a mut self, key: K, group: G, start: S, end: E, count: C, ) -> Result<StreamPendingCountReply, RedisError>
§fn xpending_consumer_count<'a, K, G, S, E, C, CN>(
&'a mut self,
key: K,
group: G,
start: S,
end: E,
count: C,
consumer: CN,
) -> Result<StreamPendingCountReply, RedisError>
fn xpending_consumer_count<'a, K, G, S, E, C, CN>( &'a mut self, key: K, group: G, start: S, end: E, count: C, consumer: CN, ) -> Result<StreamPendingCountReply, RedisError>
§fn xrange<'a, K, S, E>(
&'a mut self,
key: K,
start: S,
end: E,
) -> Result<StreamRangeReply, RedisError>
fn xrange<'a, K, S, E>( &'a mut self, key: K, start: S, end: E, ) -> Result<StreamRangeReply, RedisError>
key. Read more§fn xrange_all<'a, K>(
&'a mut self,
key: K,
) -> Result<StreamRangeReply, RedisError>
fn xrange_all<'a, K>( &'a mut self, key: K, ) -> Result<StreamRangeReply, RedisError>
key.
Use with caution! Read more§fn xrange_count<'a, K, S, E, C>(
&'a mut self,
key: K,
start: S,
end: E,
count: C,
) -> Result<StreamRangeReply, RedisError>
fn xrange_count<'a, K, S, E, C>( &'a mut self, key: K, start: S, end: E, count: C, ) -> Result<StreamRangeReply, RedisError>
key. Read more§fn xread<'a, K, ID>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID],
) -> Result<Option<StreamReadReply>, RedisError>
fn xread<'a, K, ID>( &'a mut self, keys: &'a [K], ids: &'a [ID], ) -> Result<Option<StreamReadReply>, RedisError>
ids for each stream key.
This is the basic form of reading streams.
For more advanced control, like blocking, limiting, or reading by consumer group,
see xread_options. Read more§fn xread_options<'a, K, ID>(
&'a mut self,
keys: &'a [K],
ids: &'a [ID],
options: &'a StreamReadOptions,
) -> Result<Option<StreamReadReply>, RedisError>
fn xread_options<'a, K, ID>( &'a mut self, keys: &'a [K], ids: &'a [ID], options: &'a StreamReadOptions, ) -> Result<Option<StreamReadReply>, RedisError>
§fn xrevrange<'a, K, E, S>(
&'a mut self,
key: K,
end: E,
start: S,
) -> Result<StreamRangeReply, RedisError>
fn xrevrange<'a, K, E, S>( &'a mut self, key: K, end: E, start: S, ) -> Result<StreamRangeReply, RedisError>
§fn xrevrange_all<'a, K>(
&'a mut self,
key: K,
) -> Result<StreamRangeReply, RedisError>
fn xrevrange_all<'a, K>( &'a mut self, key: K, ) -> Result<StreamRangeReply, RedisError>
§fn xrevrange_count<'a, K, E, S, C>(
&'a mut self,
key: K,
end: E,
start: S,
count: C,
) -> Result<StreamRangeReply, RedisError>
fn xrevrange_count<'a, K, E, S, C>( &'a mut self, key: K, end: E, start: S, count: C, ) -> Result<StreamRangeReply, RedisError>
§fn xtrim<'a, K>(
&'a mut self,
key: K,
maxlen: StreamMaxlen,
) -> Result<usize, RedisError>
fn xtrim<'a, K>( &'a mut self, key: K, maxlen: StreamMaxlen, ) -> Result<usize, RedisError>
key to a MAXLEN count. Read more§fn xtrim_options<'a, K>(
&'a mut self,
key: K,
options: &'a StreamTrimOptions,
) -> Result<usize, RedisError>
fn xtrim_options<'a, K>( &'a mut self, key: K, options: &'a StreamTrimOptions, ) -> Result<usize, RedisError>
key with full options Read more