Struct LockLazyQuery 

pub struct LockLazyQuery<'a, T: 'static, L, I>
where
    L: LockValue<T> + 'a,
    I: Iterator<Item = &'a L>,
{ /* private fields */ }

Lazy query for locked data with early termination.

Implementations

impl<'a, T: 'static, L, I> LockLazyQuery<'a, T, L, I>

where L: LockValue<T> + 'a, I: Iterator<Item = &'a L> + 'a,

pub fn new(iter: I) -> Self

Create a new lazy query from an iterator of locks.

pub fn where_<F, P>( self, path: KeyPaths<T, F>, predicate: P, ) -> LockLazyQuery<'a, T, L, impl Iterator<Item = &'a L> + 'a>

where F: 'static, P: Fn(&F) -> bool + 'a,

Filter using a key-path predicate (lazy).

pub fn select_lazy<F>( self, path: KeyPaths<T, F>, ) -> impl Iterator<Item = F> + 'a

where F: Clone + 'static,

Map to a field value (lazy).

pub fn take_lazy(self, n: usize) -> impl Iterator<Item = T> + 'a

where T: Clone,

Take first N items (lazy).

pub fn skip_lazy( self, n: usize, ) -> LockLazyQuery<'a, T, L, impl Iterator<Item = &'a L> + 'a>

Skip first N items (lazy).

pub fn count(self) -> usize

Count matching items (terminal).

pub fn first(self) -> Option<T>

where T: Clone,

Get first matching item (terminal).

pub fn any(self) -> bool

Check if any items match (terminal).

pub fn collect(self) -> Vec<T>

where T: Clone,

Collect into Vec (terminal).