Trait nom::lib::std::prelude::v1::rust_2015::Extend 1.0.0[−][src]
Extend a collection with the contents of an iterator.
Iterators produce a series of values, and collections can also be thought
of as a series of values. The Extend
trait bridges this gap, allowing you
to extend a collection by including the contents of that iterator. When
extending a collection with an already existing key, that entry is updated
or, in the case of collections that permit multiple entries with equal
keys, that entry is inserted.
Examples
Basic usage:
// You can extend a String with some chars: let mut message = String::from("The first three letters are: "); message.extend(&['a', 'b', 'c']); assert_eq!("abc", &message[29..32]);
Implementing Extend
:
// A sample collection, that's just a wrapper over Vec<T> #[derive(Debug)] struct MyCollection(Vec<i32>); // Let's give it some methods so we can create one and add things // to it. impl MyCollection { fn new() -> MyCollection { MyCollection(Vec::new()) } fn add(&mut self, elem: i32) { self.0.push(elem); } } // since MyCollection has a list of i32s, we implement Extend for i32 impl Extend<i32> for MyCollection { // This is a bit simpler with the concrete type signature: we can call // extend on anything which can be turned into an Iterator which gives // us i32s. Because we need i32s to put into MyCollection. fn extend<T: IntoIterator<Item=i32>>(&mut self, iter: T) { // The implementation is very straightforward: loop through the // iterator, and add() each element to ourselves. for elem in iter { self.add(elem); } } } let mut c = MyCollection::new(); c.add(5); c.add(6); c.add(7); // let's extend our collection with three more numbers c.extend(vec![1, 2, 3]); // we've added these elements onto the end assert_eq!("MyCollection([5, 6, 7, 1, 2, 3])", format!("{:?}", c));
Required methods
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = A>,
[src]
T: IntoIterator<Item = A>,
Extends a collection with the contents of an iterator.
As this is the only required method for this trait, the trait-level docs contain more details.
Examples
Basic usage:
// You can extend a String with some chars: let mut message = String::from("abc"); message.extend(['d', 'e', 'f'].iter()); assert_eq!("abcdef", &message);
Provided methods
pub fn extend_one(&mut self, item: A)
[src]
extend_one
)Extends a collection with exactly one element.
pub fn extend_reserve(&mut self, additional: usize)
[src]
extend_one
)Reserves capacity in a collection for the given number of additional elements.
The default implementation does nothing.
Implementations on Foreign Types
impl<'a> Extend<Cow<'a, OsStr>> for OsString
[src]
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = Cow<'a, OsStr>>,
[src]
T: IntoIterator<Item = Cow<'a, OsStr>>,
impl Extend<OsString> for OsString
[src]
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = OsString>,
[src]
T: IntoIterator<Item = OsString>,
impl<'a> Extend<&'a OsStr> for OsString
[src]
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = &'a OsStr>,
[src]
T: IntoIterator<Item = &'a OsStr>,
impl<P> Extend<P> for PathBuf where
P: AsRef<Path>,
[src]
P: AsRef<Path>,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = P>,
[src]
I: IntoIterator<Item = P>,
pub fn extend_one(&mut self, p: P)
[src]
impl Extend<()> for ()
[src]
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = ()>,
[src]
T: IntoIterator<Item = ()>,
pub fn extend_one(&mut self, _item: ())
[src]
Implementors
impl Extend<char> for String
[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = char>,
[src]
I: IntoIterator<Item = char>,
pub fn extend_one(&mut self, c: char)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl Extend<Box<str, Global>> for String
1.45.0[src]
impl Extend<String> for String
1.4.0[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = String>,
[src]
I: IntoIterator<Item = String>,
pub fn extend_one(&mut self, s: String)
[src]
impl<'a> Extend<&'a char> for String
1.2.0[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a char>,
[src]
I: IntoIterator<Item = &'a char>,
pub fn extend_one(&mut self, &'a char)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a> Extend<&'a str> for String
[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a str>,
[src]
I: IntoIterator<Item = &'a str>,
pub fn extend_one(&mut self, s: &'a str)
[src]
impl<'a> Extend<Cow<'a, str>> for String
1.19.0[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Cow<'a, str>>,
[src]
I: IntoIterator<Item = Cow<'a, str>>,
pub fn extend_one(&mut self, s: Cow<'a, str>)
[src]
impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where
K: Ord + Copy,
V: Copy,
1.2.0[src]
K: Ord + Copy,
V: Copy,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (&'a K, &'a V)>,
[src]
I: IntoIterator<Item = (&'a K, &'a V)>,
pub fn extend_one(&mut self, (&'a K, &'a V))
[src]
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
1.4.0[src]
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (&'a K, &'a V)>,
[src]
T: IntoIterator<Item = (&'a K, &'a V)>,
pub fn extend_one(&mut self, (&'a K, &'a V))
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T> Extend<&'a T> for BTreeSet<T> where
T: 'a + Ord + Copy,
1.2.0[src]
T: 'a + Ord + Copy,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &'a T)
[src]
impl<'a, T> Extend<&'a T> for BinaryHeap<T> where
T: 'a + Ord + Copy,
1.2.0[src]
T: 'a + Ord + Copy,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &'a T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T> Extend<&'a T> for LinkedList<T> where
T: 'a + Copy,
1.2.0[src]
T: 'a + Copy,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &'a T)
[src]
impl<'a, T> Extend<&'a T> for VecDeque<T> where
T: 'a + Copy,
1.2.0[src]
T: 'a + Copy,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T, A> Extend<&'a T> for Vec<T, A> where
T: 'a + Copy,
A: 'a + Allocator,
1.2.0[src]
T: 'a + Copy,
A: 'a + Allocator,
Extend implementation that copies elements out of references before pushing them onto the Vec.
This implementation is specialized for slice iterators, where it uses copy_from_slice
to
append the entire slice at once.
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &'a T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T, S> Extend<&'a T> for HashSet<T, S> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
1.4.0[src]
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
pub fn extend_one(&mut self, &'a T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<A> Extend<A> for VecDeque<A>
[src]
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = A>,
[src]
T: IntoIterator<Item = A>,
pub fn extend_one(&mut self, elem: A)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where
K: Ord,
[src]
K: Ord,
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (K, V)>,
[src]
T: IntoIterator<Item = (K, V)>,
pub fn extend_one(&mut self, (K, V))
[src]
impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
[src]
K: Eq + Hash,
S: BuildHasher,
Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.
pub fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (K, V)>,
[src]
T: IntoIterator<Item = (K, V)>,
pub fn extend_one(&mut self, (K, V))
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<T> Extend<T> for BTreeSet<T> where
T: Ord,
[src]
T: Ord,
pub fn extend<Iter>(&mut self, iter: Iter) where
Iter: IntoIterator<Item = T>,
[src]
Iter: IntoIterator<Item = T>,
pub fn extend_one(&mut self, elem: T)
[src]
impl<T> Extend<T> for BinaryHeap<T> where
T: Ord,
[src]
T: Ord,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
pub fn extend_one(&mut self, item: T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<T> Extend<T> for LinkedList<T>
[src]
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
pub fn extend_one(&mut self, elem: T)
[src]
impl<T, A> Extend<T> for Vec<T, A> where
A: Allocator,
[src]
A: Allocator,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
pub fn extend_one(&mut self, item: T)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<T, S> Extend<T> for HashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
[src]
T: Eq + Hash,
S: BuildHasher,
pub fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,