pub struct CellGraph {
pub grid: CellGrid,
pub offsets: Vec<u32>,
pub neighbor: Vec<u32>,
pub edge_weight: Vec<u64>,
}Expand description
Periodic cell adjacency with pair-count edge weights.
Each undirected pair is stored as two arcs of the same weight. A cut counts each undirected pair once.
Fields§
§grid: CellGridBin counts and point weights.
offsets: Vec<u32>CSR offsets, length ncell + 1.
neighbor: Vec<u32>Neighbour cell of each arc.
edge_weight: Vec<u64>Pair count of each arc.
Trait Implementations§
impl StructuralPartialEq for CellGraph
Auto Trait Implementations§
impl Freeze for CellGraph
impl RefUnwindSafe for CellGraph
impl Send for CellGraph
impl Sync for CellGraph
impl Unpin for CellGraph
impl UnsafeUnpin for CellGraph
impl UnwindSafe for CellGraph
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<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