pub struct Query<'a> {
pub by: By<'a>,
pub rev: bool,
pub offset: usize,
pub count: Option<usize>,
}Expand description
A run of members, however it was asked for.
min and max are always the low end and the high end of the range itself,
whichever order the command wrote them in. REV reverses the walk, it does
not reverse the range, which is why ZRANGEBYSCORE k 1 5 and
ZREVRANGEBYSCORE k 5 1 cover the same members.
Fields§
§by: By<'a>What the range is measured in.
rev: boolWalk from the high end down. REV, and the ZREV spellings.
offset: usizeHow many to skip once the range is found. LIMIT’s first number.
count: Option<usize>How many to take, or all of them. LIMIT’s second number, where Redis’s
negative count means all.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<'a> Freeze for Query<'a>
impl<'a> RefUnwindSafe for Query<'a>
impl<'a> Send for Query<'a>
impl<'a> Sync for Query<'a>
impl<'a> Unpin for Query<'a>
impl<'a> UnsafeUnpin for Query<'a>
impl<'a> UnwindSafe for Query<'a>
Blanket Implementations§
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
Mutably borrows from an owned value. Read more