pub struct AdjacencyTable<N, V>{ /* private fields */ }
Implementations§
Source§impl<N, V> AdjacencyTable<N, V>
impl<N, V> AdjacencyTable<N, V>
pub fn new() -> Self
pub fn capacity(&self) -> usize
pub fn clear(&mut self)
pub fn contains_key(&self, key: &N) -> bool
pub fn drain(&mut self) -> Drain<'_, N, Vec<(N, V)>>
pub fn entry(&mut self, key: N) -> Entry<'_, N, Vec<(N, V)>>
pub fn insert(&mut self, key: N, val: Vec<(N, V)>) -> Option<Vec<(N, V)>>
pub fn get(&self, key: &N) -> Option<&Vec<(N, V)>>
pub fn get_key_value(&self, key: &N) -> Option<(&N, &Vec<(N, V)>)>
pub fn get_mut(&mut self, key: &N) -> Option<&mut Vec<(N, V)>>
pub fn keys(&self) -> Keys<'_, N, Vec<(N, V)>>
pub fn len(&self) -> usize
pub fn table(self) -> HashMap<N, Vec<(N, V)>>
pub fn values(&self) -> Values<'_, N, Vec<(N, V)>>
pub fn values_mut(&mut self) -> ValuesMut<'_, N, Vec<(N, V)>>
pub fn with_capacity(capacity: usize) -> Self
Trait Implementations§
Source§impl<N, V> AsMut<AdjacencyTable<N, V>> for DirectedGraph<N, V>
impl<N, V> AsMut<AdjacencyTable<N, V>> for DirectedGraph<N, V>
Source§fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>
fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>
Converts this type into a mutable reference of the (usually inferred) input type.
Source§impl<N, V> AsMut<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
impl<N, V> AsMut<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
Source§fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>
fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>
Converts this type into a mutable reference of the (usually inferred) input type.
Source§impl<N, V> AsRef<AdjacencyTable<N, V>> for DirectedGraph<N, V>
impl<N, V> AsRef<AdjacencyTable<N, V>> for DirectedGraph<N, V>
Source§fn as_ref(&self) -> &AdjacencyTable<N, V>
fn as_ref(&self) -> &AdjacencyTable<N, V>
Converts this type into a shared reference of the (usually inferred) input type.
Source§impl<N, V> AsRef<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
impl<N, V> AsRef<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
Source§fn as_ref(&self) -> &AdjacencyTable<N, V>
fn as_ref(&self) -> &AdjacencyTable<N, V>
Converts this type into a shared reference of the (usually inferred) input type.
Source§impl<N, V> Clone for AdjacencyTable<N, V>
impl<N, V> Clone for AdjacencyTable<N, V>
Source§fn clone(&self) -> AdjacencyTable<N, V>
fn clone(&self) -> AdjacencyTable<N, V>
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 moreSource§impl<N, V> Debug for AdjacencyTable<N, V>
impl<N, V> Debug for AdjacencyTable<N, V>
Source§impl<N, V> Default for AdjacencyTable<N, V>
impl<N, V> Default for AdjacencyTable<N, V>
Source§fn default() -> AdjacencyTable<N, V>
fn default() -> AdjacencyTable<N, V>
Returns the “default value” for a type. Read more
Source§impl<'de, N, V> Deserialize<'de> for AdjacencyTable<N, V>
impl<'de, N, V> Deserialize<'de> for AdjacencyTable<N, V>
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<N, V> Extend<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>
impl<N, V> Extend<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>
Source§fn extend<T: IntoIterator<Item = (N, Vec<(N, V)>)>>(&mut self, iter: T)
fn extend<T: IntoIterator<Item = (N, Vec<(N, V)>)>>(&mut self, iter: T)
Extends a collection with the contents of an iterator. Read more
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
🔬This is a nightly-only experimental API. (
extend_one
)Extends a collection with exactly one element.
Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
🔬This is a nightly-only experimental API. (
extend_one
)Reserves capacity in a collection for the given number of additional elements. Read more
Source§impl<N, V> From<AdjacencyTable<N, V>> for DirectedGraph<N, V>
impl<N, V> From<AdjacencyTable<N, V>> for DirectedGraph<N, V>
Source§fn from(store: AdjacencyTable<N, V>) -> Self
fn from(store: AdjacencyTable<N, V>) -> Self
Converts to this type from the input type.
Source§impl<N, V> From<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
impl<N, V> From<AdjacencyTable<N, V>> for UndirectedGraph<N, V>
Source§fn from(store: AdjacencyTable<N, V>) -> Self
fn from(store: AdjacencyTable<N, V>) -> Self
Converts to this type from the input type.
Source§impl<N, V> FromIterator<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>
impl<N, V> FromIterator<(N, Vec<(N, V)>)> for AdjacencyTable<N, V>
Source§impl<N, V> Index<N> for AdjacencyTable<N, V>
impl<N, V> Index<N> for AdjacencyTable<N, V>
Source§impl<N, V> IndexMut<N> for AdjacencyTable<N, V>
impl<N, V> IndexMut<N> for AdjacencyTable<N, V>
Source§impl<N, V> IntoIterator for AdjacencyTable<N, V>
impl<N, V> IntoIterator for AdjacencyTable<N, V>
Source§impl<N, V> PartialEq for AdjacencyTable<N, V>
impl<N, V> PartialEq for AdjacencyTable<N, V>
Source§impl<N, V> Serialize for AdjacencyTable<N, V>
impl<N, V> Serialize for AdjacencyTable<N, V>
impl<N, V> Eq for AdjacencyTable<N, V>
impl<N, V> StructuralPartialEq for AdjacencyTable<N, V>
Auto Trait Implementations§
impl<N, V> Freeze for AdjacencyTable<N, V>
impl<N, V> RefUnwindSafe for AdjacencyTable<N, V>where
N: RefUnwindSafe,
V: RefUnwindSafe,
impl<N, V> Send for AdjacencyTable<N, V>
impl<N, V> Sync for AdjacencyTable<N, V>
impl<N, V> Unpin for AdjacencyTable<N, V>
impl<N, V> UnwindSafe for AdjacencyTable<N, V>where
N: UnwindSafe,
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