pub struct Order2GraphWorkspace { /* private fields */ }Expand description
Reusable storage for a compiled scalar DAG.
Reset between rows. The boxed tape has checked fixed capacities, so every row after worker construction performs no tape or reverse-sweep allocation and no growth branches.
Implementations§
Trait Implementations§
Source§impl Debug for Order2GraphWorkspace
impl Debug for Order2GraphWorkspace
Auto Trait Implementations§
impl !Freeze for Order2GraphWorkspace
impl !RefUnwindSafe for Order2GraphWorkspace
impl !Sync for Order2GraphWorkspace
impl Send for Order2GraphWorkspace
impl Unpin for Order2GraphWorkspace
impl UnsafeUnpin for Order2GraphWorkspace
impl UnwindSafe for Order2GraphWorkspace
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<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.