Struct WPTResult
pub struct WPTResult {
pub nodes: HashMap<NodeId, WPNode>,
pub max_level: usize,
pub original_length: usize,
pub boundary_mode: BoundaryMode,
}Expand description
Result of WPT decomposition
Fields§
§nodes: HashMap<NodeId, WPNode>§max_level: usize§original_length: usize§boundary_mode: BoundaryModeBoundary mode used during the forward decomposition. Stored so
iwpt can use the same boundary on the inverse (and so the
per-level length progression is computed with the right rule:
ceil(N/2) for Periodic, (N + L − 1) / 2 for non-Periodic).
Implementations§
§impl WPTResult
impl WPTResult
pub fn get_node_mut(&mut self, id: &NodeId) -> Option<&mut WPNode>
pub fn get_node_mut(&mut self, id: &NodeId) -> Option<&mut WPNode>
Get mutable reference to a node
pub fn get_leaves(&self) -> Vec<&WPNode>
pub fn get_leaves(&self) -> Vec<&WPNode>
Get all leaf nodes
pub fn level_energy(&self, level: usize) -> f64
pub fn level_energy(&self, level: usize) -> f64
Calculate total energy at a level
Trait Implementations§
Auto Trait Implementations§
impl Freeze for WPTResult
impl RefUnwindSafe for WPTResult
impl Send for WPTResult
impl Sync for WPTResult
impl Unpin for WPTResult
impl UnwindSafe for WPTResult
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> IntoEither for T
impl<T> IntoEither for T
§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 more§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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.