pub struct GraphSelectionKey { /* private fields */ }Expand description
A conjunction over graph identities, including empty results and the requested page suffix. Hashing the selector bounds retained key storage independently of label/name length; ordered entity IDs retain their range semantics.
Implementations§
Source§impl GraphSelectionKey
impl GraphSelectionKey
pub fn new( namespace: GraphIdentifierNamespace, filter: GraphEntityFilter<'_>, after: Option<u64>, ) -> StorageBackendResult<Self>
pub fn predicate(&self) -> SerializablePredicate<'_>
Auto Trait Implementations§
impl Freeze for GraphSelectionKey
impl RefUnwindSafe for GraphSelectionKey
impl Send for GraphSelectionKey
impl Sync for GraphSelectionKey
impl Unpin for GraphSelectionKey
impl UnsafeUnpin for GraphSelectionKey
impl UnwindSafe for GraphSelectionKey
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