pub struct PartitionMatch<T> {
pub whole: T,
pub parts: Vec<T>,
pub covered: usize,
}Expand description
A clean, complete, disjoint, unambiguous partition: whole’s token multiset
is exactly the disjoint union of parts, each a strict subset.
Fields§
§whole: T§parts: Vec<T>§covered: usizeNumber of atoms (tokens) the partition covers — whole’s total.
Auto Trait Implementations§
impl<T> Freeze for PartitionMatch<T>where
T: Freeze,
impl<T> RefUnwindSafe for PartitionMatch<T>where
T: RefUnwindSafe,
impl<T> Send for PartitionMatch<T>where
T: Send,
impl<T> Sync for PartitionMatch<T>where
T: Sync,
impl<T> Unpin for PartitionMatch<T>where
T: Unpin,
impl<T> UnsafeUnpin for PartitionMatch<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for PartitionMatch<T>where
T: UnwindSafe,
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