pub struct CompactEdges {
pub node_to_idx: FxHashMap<FragmentId, u32>,
pub idx_to_node: Vec<FragmentId>,
pub edges: Vec<CompactEdge>,
}Expand description
Node-interned edge list: the memory-bounded intermediate between
edge collection and graph construction. idx_to_node is the sorted,
deduplicated fragment-id universe, so CSR node indexing built from it
is identical to the ordering Graph::freeze produces.
Fields§
§node_to_idx: FxHashMap<FragmentId, u32>§idx_to_node: Vec<FragmentId>§edges: Vec<CompactEdge>Auto Trait Implementations§
impl Freeze for CompactEdges
impl RefUnwindSafe for CompactEdges
impl Send for CompactEdges
impl Sync for CompactEdges
impl Unpin for CompactEdges
impl UnsafeUnpin for CompactEdges
impl UnwindSafe for CompactEdges
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more