[−][src]Trait outils::types::Keys
Trees implementing this trait are able to return an iterator over the search keys held by the implementing struct.
Required methods
fn keys(&'slf self) -> Box<dyn Iterator<Item = (NodeIndex<Ix>, &'slf K)> + 'slf>
Returns a boxed iterator over the search keys and their corresponding
tree node indices held by self
.
Implementors
impl<'slf, K, V> Keys<'slf, K, usize> for AaTree<K, V> where
K: 'slf + KeyType,
V: ValueType,
[src]
K: 'slf + KeyType,
V: ValueType,
fn keys(&'slf self) -> Box<dyn Iterator<Item = (NodeIndex, &'slf K)> + 'slf>
[src]
Returns a boxed iterator over the search keys and their corresponding
tree node indices held by self
. The keys are returned in the order
of the search keys.
impl<'slf, K, V, W> Keys<'slf, K, usize> for WeightedAaTree<K, V, W> where
K: 'slf + KeyType,
V: ValueType,
W: WeightType,
[src]
K: 'slf + KeyType,
V: ValueType,
W: WeightType,