pub struct IndexNode {
pub key: Vec<Vec<u8>>,
pub absent: bool,
pub references: Vec<Vec<Vec<Vec<u8>>>>,
pub value: Vec<u8>,
}Expand description
One node as it lives in GraphIndexBuilder._nodes.
Fields§
§key: Vec<Vec<u8>>The tuple key. Each element is a non-empty whitespace-free bytestring;
elements are joined by \x00 on disk.
absent: boolTrue when this key is known only as a reference target — it was added implicitly to satisfy a reference from a present node.
references: Vec<Vec<Vec<Vec<u8>>>>reference_lists lists of reference keys. Absent nodes always have
this empty.
value: Vec<u8>The value payload. Absent nodes always have this empty.
Trait Implementations§
impl Eq for IndexNode
impl StructuralPartialEq for IndexNode
Auto Trait Implementations§
impl Freeze for IndexNode
impl RefUnwindSafe for IndexNode
impl Send for IndexNode
impl Sync for IndexNode
impl Unpin for IndexNode
impl UnsafeUnpin for IndexNode
impl UnwindSafe for IndexNode
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.