pub struct LayoutPruneStats {
pub subtrees: u64,
pub nodes: u64,
}Expand description
Counters for the scroll-layout prune optimization, which skips
recursing into scroll-container children that lie far outside the
visible range. Recorded during each layout pass; retrieve the latest
pass’s numbers with take_prune_stats.
Fields§
§subtrees: u64Off-screen child subtrees whose recursion was skipped.
nodes: u64Total descendant nodes inside those skipped subtrees.
Trait Implementations§
Source§impl Clone for LayoutPruneStats
impl Clone for LayoutPruneStats
Source§fn clone(&self) -> LayoutPruneStats
fn clone(&self) -> LayoutPruneStats
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for LayoutPruneStats
Source§impl Debug for LayoutPruneStats
impl Debug for LayoutPruneStats
Source§impl Default for LayoutPruneStats
impl Default for LayoutPruneStats
Source§fn default() -> LayoutPruneStats
fn default() -> LayoutPruneStats
Returns the “default value” for a type. Read more
impl Eq for LayoutPruneStats
Source§impl PartialEq for LayoutPruneStats
impl PartialEq for LayoutPruneStats
Source§fn eq(&self, other: &LayoutPruneStats) -> bool
fn eq(&self, other: &LayoutPruneStats) -> bool
Tests for
self and other values to be equal, and is used by ==.impl StructuralPartialEq for LayoutPruneStats
Auto Trait Implementations§
impl Freeze for LayoutPruneStats
impl RefUnwindSafe for LayoutPruneStats
impl Send for LayoutPruneStats
impl Sync for LayoutPruneStats
impl Unpin for LayoutPruneStats
impl UnsafeUnpin for LayoutPruneStats
impl UnwindSafe for LayoutPruneStats
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
impl<T> Scalar for T
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.