pub struct UnsafeTreeNode {
pub id: usize,
pub parent: *const UnsafeTreeNode,
pub children: Vec<Box<UnsafeTreeNode>>,
}
Fields§
§id: usize
§parent: *const UnsafeTreeNode
§children: Vec<Box<UnsafeTreeNode>>
Implementations§
Source§impl UnsafeTreeNode
impl UnsafeTreeNode
pub fn from_adjacency_list( graph: &UnweightedAdjacencyList, root: usize, ) -> Box<Self>
Source§impl UnsafeTreeNode
impl UnsafeTreeNode
pub fn new(id: usize, parent: *const UnsafeTreeNode) -> Self
Trait Implementations§
Source§impl Debug for UnsafeTreeNode
impl Debug for UnsafeTreeNode
Source§impl PartialEq for UnsafeTreeNode
impl PartialEq for UnsafeTreeNode
impl Eq for UnsafeTreeNode
impl StructuralPartialEq for UnsafeTreeNode
Auto Trait Implementations§
impl Freeze for UnsafeTreeNode
impl RefUnwindSafe for UnsafeTreeNode
impl !Send for UnsafeTreeNode
impl !Sync for UnsafeTreeNode
impl Unpin for UnsafeTreeNode
impl UnwindSafe for UnsafeTreeNode
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<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.