pub enum Node<V>where
V: Clone,{
InnerNode(InnerNode<V>),
Leaf(Leaf<V>),
}
Expand description
Nodes of a CidrMap can be either an InnerNode (with two children) or a leaf node.
Variants§
Implementations§
Trait Implementations§
source§impl<V> PartialEq for Node<V>
impl<V> PartialEq for Node<V>
impl<V> StructuralPartialEq for Node<V>where
V: Clone,
Auto Trait Implementations§
impl<V> Freeze for Node<V>where
V: Freeze,
impl<V> RefUnwindSafe for Node<V>where
V: RefUnwindSafe,
impl<V> Send for Node<V>where
V: Send,
impl<V> Sync for Node<V>where
V: Sync,
impl<V> Unpin for Node<V>where
V: Unpin,
impl<V> UnwindSafe for Node<V>where
V: 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