pub fn precedes(&self, other: &IndexRoots) -> bool {
        if self.eavt_root >= other.eavt_root { return false }
        if self.aevt_root >= other.aevt_root { return false }
        if self.avet_root >= other.avet_root { return false }
        true
    }
/// Return whether all roots of `self` lie strictly before all roots of `other`.
///
/// Because page ids are allocated sequentially, roots A preceding roots B
/// implies that the elements reachable from A are a subset of the elements
/// reachable from B, under the assumption that B was obtained from A by
/// appending elements.
Return whether all roots of `self` lie strictly before all roots of `other`.
Because page ids are allocated sequentially, roots A preceding roots B
implies that the elements reachable from A are a subset of the elements
reachable from B, under the assumption that B was obtained from A by
appending elements.
Return whether all roots of ` self ` lie strictly before all roots of ` other ` . Because page ids are allocated sequentially roots A preceding roots B implies that the elements reachable from A are a subset of the elements reachable from B under the assumption that B was obtained from A by appending elements .
pub fn precedes(&self, other: &IndexRoots) -> bool {
        if self.eavt_root >= other.eavt_root { return false }
        if self.aevt_root >= other.aevt_root { return false }
        if self.avet_root >= other.avet_root { return false }
        true
    }
pub fn precedes ( & self , other : & IndexRoots ) -> bool { if self . eavt_root >= other . eavt_root { return false } if self . aevt_root >= other . aevt_root { return false } if self . avet_root >= other . avet_root { return false } true }
Return whether all roots of `self` lie strictly before all roots of `other`.
Return whether all roots of ` self ` lie strictly before all roots of ` other ` .
&self
other
&IndexRoots
&self
other
&IndexRoots