An iterator that always continues to yield None
when exhausted.
Calling next on a fused iterator that has returned None
once is guaranteed
to return None
again. This trait should be implemented by all iterators
that behave this way because it allows for some significant optimizations.
Note: In general, you should not use FusedIterator
in generic bounds if
you need a fused iterator. Instead, you should just call Iterator::fuse
on the iterator. If the iterator is already fused, the additional Fuse
wrapper will be a no-op with no performance penalty.
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::Drain<'a, K, V> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::Iter<'a, K, V> | |
impl<K, V> FusedIterator for nom::lib::std::collections::hash_map::IntoIter<K, V> | |
impl<K> FusedIterator for nom::lib::std::collections::hash_set::IntoIter<K> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::ValuesMut<'a, K, V> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::Keys<'a, K, V> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::Values<'a, K, V> | |
impl<'a, T, S> FusedIterator for nom::lib::std::collections::hash_set::Union<'a, T, S> where S: BuildHasher, T: Eq + Hash, | |
impl<'a, K> FusedIterator for nom::lib::std::collections::hash_set::Drain<'a, K> | |
impl<'a, K> FusedIterator for nom::lib::std::collections::hash_set::Iter<'a, K> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::hash_map::IterMut<'a, K, V> | |
impl<T> FusedIterator for Once<T> | |
impl<'a> FusedIterator for Bytes<'a> | |
impl<'a, T> FusedIterator for nom::lib::std::slice::Iter<'a, T> | |
impl<'a, P> FusedIterator for nom::lib::std::str::Split<'a, P> where P: Pattern<'a>, | |
impl<'a, T, P> FusedIterator for nom::lib::std::slice::SplitN<'a, T, P> where P: FnMut(&T) -> bool, | |
impl<T> FusedIterator for nom::lib::std::result::IntoIter<T> | |
impl<'a, A> FusedIterator for nom::lib::std::option::IterMut<'a, A> | |
impl<'a, T, P> FusedIterator for nom::lib::std::slice::RSplitN<'a, T, P> where P: FnMut(&T) -> bool, | |
impl<'a, T> FusedIterator for nom::lib::std::result::IterMut<'a, T> | |
impl<A> FusedIterator for nom::lib::std::ops::Range<A> where A: Step, | |
impl<'a, P> FusedIterator for nom::lib::std::str::SplitN<'a, P> where P: Pattern<'a>, | |
impl<'a> FusedIterator for Chars<'a> | |
impl<T> FusedIterator for Empty<T> | |
impl<'a, T> FusedIterator for Chunks<'a, T> | |
impl<'a, T> FusedIterator for nom::lib::std::result::Iter<'a, T> | |
impl<'a, T> FusedIterator for nom::lib::std::slice::IterMut<'a, T> | |
impl<'a, A> FusedIterator for nom::lib::std::option::Iter<'a, A> | |
impl<'a, T, P> FusedIterator for nom::lib::std::slice::Split<'a, T, P> where P: FnMut(&T) -> bool, | |
impl<'a> FusedIterator for Lines<'a> | |
impl<'a, T> FusedIterator for Windows<'a, T> | |
impl<'a, T> FusedIterator for ChunksMut<'a, T> | |
impl<A> FusedIterator for nom::lib::std::option::IntoIter<A> | |
impl<'a, T, P> FusedIterator for nom::lib::std::slice::RSplit<'a, T, P> where P: FnMut(&T) -> bool, | |
impl<'a, T> FusedIterator for nom::lib::std::collections::btree_set::Iter<'a, T> | |
impl<'a, K, V> FusedIterator for RangeMut<'a, K, V> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::linked_list::Iter<'a, T> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::vec_deque::Iter<'a, T> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::Range<'a, K, V> | |
impl<T> FusedIterator for nom::lib::std::collections::vec_deque::IntoIter<T> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::btree_set::Difference<'a, T> where T: Ord, | |
impl<'a, T> FusedIterator for nom::lib::std::collections::vec_deque::Drain<'a, T> where T: 'a, | |
impl<'a, T> FusedIterator for nom::lib::std::collections::btree_set::Range<'a, T> | |
impl<'a> FusedIterator for nom::lib::std::string::Drain<'a> | |
impl<'a, T> FusedIterator for nom::lib::std::vec::Drain<'a, T> | |
impl<T> FusedIterator for nom::lib::std::collections::btree_set::IntoIter<T> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::Iter<'a, K, V> | |
impl<T> FusedIterator for nom::lib::std::collections::linked_list::IntoIter<T> | |
impl<K, V> FusedIterator for nom::lib::std::collections::btree_map::IntoIter<K, V> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::ValuesMut<'a, K, V> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::binary_heap::Iter<'a, T> | |
impl<T> FusedIterator for nom::lib::std::collections::binary_heap::IntoIter<T> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::IterMut<'a, K, V> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::btree_set::Intersection<'a, T> where T: Ord, | |
impl<'a, T> FusedIterator for nom::lib::std::collections::linked_list::IterMut<'a, T> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::Values<'a, K, V> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::btree_set::Union<'a, T> where T: Ord, | |
impl<'a, T> FusedIterator for nom::lib::std::collections::vec_deque::IterMut<'a, T> | |
impl<'a, K, V> FusedIterator for nom::lib::std::collections::btree_map::Keys<'a, K, V> | |
impl<'a, T> FusedIterator for nom::lib::std::collections::binary_heap::Drain<'a, T> where T: 'a, | |
impl<T> FusedIterator for nom::lib::std::vec::IntoIter<T> | |