pub struct Stack<N> { /* private fields */ }
Expand description
A vertical group of elements, drawn from top to bottom.
Also see Sequence
for a horizontal group of elements.
Implementations§
Trait Implementations§
source§impl<N> FromIterator<N> for Stack<N>
impl<N> FromIterator<N> for Stack<N>
source§fn from_iter<T: IntoIterator<Item = N>>(iter: T) -> Self
fn from_iter<T: IntoIterator<Item = N>>(iter: T) -> Self
Creates a value from an iterator. Read more
source§impl<N> Node for Stack<N>where
N: Node,
impl<N> Node for Stack<N>where N: Node,
source§fn entry_height(&self) -> i64
fn entry_height(&self) -> i64
The vertical distance from this element’s top to where the entering,
connecting path is drawn. Read more
source§fn height_below_entry(&self) -> i64
fn height_below_entry(&self) -> i64
The vertical distance from the height of the connecting path to the bottom.
Auto Trait Implementations§
impl<N> RefUnwindSafe for Stack<N>where N: RefUnwindSafe,
impl<N> Send for Stack<N>where N: Send,
impl<N> Sync for Stack<N>where N: Sync,
impl<N> Unpin for Stack<N>where N: Unpin,
impl<N> UnwindSafe for Stack<N>where N: 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