pub struct DictDefault<T> { /* private fields */ }
Expand description
A sparse entry engine that uses a [BTreeMap] to store data.
§Examples
use graph_theory::GraphEngine;
Implementations§
Source§impl<T> DictDefault<T>
impl<T> DictDefault<T>
pub fn new(node: T, edge: T) -> DictDefault<T>
Trait Implementations§
Source§impl<T> Clone for DictDefault<T>where
T: Clone,
impl<T> Clone for DictDefault<T>where
T: Clone,
Source§fn clone(&self) -> DictDefault<T>
fn clone(&self) -> DictDefault<T>
Returns a duplicate of the value. Read more
1.0.0 · Source§const fn clone_from(&mut self, source: &Self)
const fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreAuto Trait Implementations§
impl<T> Freeze for DictDefault<T>where
T: Freeze,
impl<T> RefUnwindSafe for DictDefault<T>where
T: RefUnwindSafe,
impl<T> Send for DictDefault<T>where
T: Send,
impl<T> Sync for DictDefault<T>where
T: Sync,
impl<T> Unpin for DictDefault<T>where
T: Unpin,
impl<T> UnwindSafe for DictDefault<T>where
T: UnwindSafe + RefUnwindSafe,
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