1.0.0[−][src]Trait competitive_hpp::prelude::__std_iter::Extend
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
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = A>,
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
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
extend_one
)Reserves capacity in a collection for the given number of additional elements.
The default implementation does nothing.
Implementations on Foreign Types
impl<P> Extend<P> for PathBuf where
P: AsRef<Path>,
[src]
P: AsRef<Path>,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = P>,
[src]
I: IntoIterator<Item = P>,
fn extend_one(&mut self, p: P)
[src]
impl Extend<()> for ()
[src]
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = ()>,
[src]
T: IntoIterator<Item = ()>,
fn extend_one(&mut self, _item: ())
[src]
impl<'a> Extend<Cow<'a, str>> for String
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Cow<'a, str>>,
[src]
I: IntoIterator<Item = Cow<'a, str>>,
fn extend_one(&mut self, s: Cow<'a, str>)
[src]
impl Extend<char> for String
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = char>,
[src]
I: IntoIterator<Item = char>,
fn extend_one(&mut self, c: char)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a> Extend<&'a str> for String
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a str>,
[src]
I: IntoIterator<Item = &'a str>,
fn extend_one(&mut self, s: &'a str)
[src]
impl<T> Extend<T> for Vec<T>
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
fn extend_one(&mut self, item: T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T> Extend<&'a T> for Vec<T> where
T: 'a + Copy,
[src]
T: 'a + Copy,
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.
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &'a T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl Extend<String> for String
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = String>,
[src]
I: IntoIterator<Item = String>,
fn extend_one(&mut self, s: String)
[src]
impl<'a> Extend<&'a char> for String
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a char>,
[src]
I: IntoIterator<Item = &'a char>,
fn extend_one(&mut self, &'a char)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T, S> Extend<T> for HashSet<T, S> where
S: BuildHasher,
T: Eq + Hash,
S: BuildHasher,
T: Eq + Hash,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
I: IntoIterator<Item = T>,
impl<'a, T, S> Extend<&'a T> for HashSet<T, S> where
S: BuildHasher,
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
T: 'a + Eq + Hash + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
I: IntoIterator<Item = &'a T>,
impl<K, V, S> Extend<(K, V)> for HashMap<K, V, S> where
K: Eq + Hash,
S: BuildHasher,
K: Eq + Hash,
S: BuildHasher,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (K, V)>,
T: IntoIterator<Item = (K, V)>,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for HashMap<K, V, S> where
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
impl<K, V, S> Extend<(K, V)> for IndexMap<K, V, S> where
K: Hash + Eq,
S: BuildHasher,
[src]
K: Hash + Eq,
S: BuildHasher,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = (K, V)>,
[src]
I: IntoIterator<Item = (K, V)>,
Extend the map with all key-value pairs in the iterable.
This is equivalent to calling insert
for each of
them in order, which means that for keys that already existed
in the map, their value is updated but it keeps the existing order.
New keys are inserted in the order they appear in the sequence. If equivalents of a key occur more than once, the last corresponding value prevails.
impl<T, S> Extend<T> for IndexSet<T, S> where
S: BuildHasher,
T: Hash + Eq,
[src]
S: BuildHasher,
T: Hash + Eq,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for IndexMap<K, V, S> where
K: Hash + Eq + Copy,
S: BuildHasher,
V: Copy,
[src]
K: Hash + Eq + Copy,
S: BuildHasher,
V: Copy,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = (&'a K, &'a V)>,
[src]
I: IntoIterator<Item = (&'a K, &'a V)>,
Extend the map with all key-value pairs in the iterable.
See the first extend method for more details.
impl<'a, T, S> Extend<&'a T> for IndexSet<T, S> where
S: BuildHasher,
T: Hash + Eq + Copy + 'a,
[src]
S: BuildHasher,
T: Hash + Eq + Copy + 'a,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
Implementors
impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where
K: Ord + Copy,
V: Copy,
[src]
K: Ord + Copy,
V: Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (&'a K, &'a V)>,
[src]
I: IntoIterator<Item = (&'a K, &'a V)>,
fn extend_one(&mut self, (&'a K, &'a V))
[src]
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for competitive_hpp::prelude::HashMap<K, V, S> where
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
[src]
K: Eq + Hash + Copy,
S: BuildHasher,
V: Copy,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (&'a K, &'a V)>,
[src]
T: IntoIterator<Item = (&'a K, &'a V)>,
fn extend_one(&mut self, (&'a K, &'a V))
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T> Extend<&'a T> for BTreeSet<T> where
T: 'a + Ord + Copy,
[src]
T: 'a + Ord + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &'a T)
[src]
impl<'a, T> Extend<&'a T> for BinaryHeap<T> where
T: 'a + Ord + Copy,
[src]
T: 'a + Ord + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &'a T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T> Extend<&'a T> for LinkedList<T> where
T: 'a + Copy,
[src]
T: 'a + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &'a T)
[src]
impl<'a, T> Extend<&'a T> for VecDeque<T> where
T: 'a + Copy,
[src]
T: 'a + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<'a, T, S> Extend<&'a T> for competitive_hpp::prelude::HashSet<T, S> where
S: BuildHasher,
T: 'a + Eq + Hash + Copy,
[src]
S: BuildHasher,
T: 'a + Eq + Hash + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
[src]
I: IntoIterator<Item = &'a T>,
fn extend_one(&mut self, &'a T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<A> Extend<A> for VecDeque<A>
[src]
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = A>,
[src]
T: IntoIterator<Item = A>,
fn extend_one(&mut self, elem: A)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where
K: Ord,
[src]
K: Ord,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (K, V)>,
[src]
T: IntoIterator<Item = (K, V)>,
fn extend_one(&mut self, (K, V))
[src]
impl<K, V, S> Extend<(K, V)> for competitive_hpp::prelude::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.
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = (K, V)>,
[src]
T: IntoIterator<Item = (K, V)>,
fn extend_one(&mut self, (K, V))
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<L, R, A> Extend<A> for Either<L, R> where
L: Extend<A>,
R: Extend<A>,
[src]
L: Extend<A>,
R: Extend<A>,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = A>,
[src]
T: IntoIterator<Item = A>,
impl<T> Extend<T> for BTreeSet<T> where
T: Ord,
[src]
T: Ord,
fn extend<Iter>(&mut self, iter: Iter) where
Iter: IntoIterator<Item = T>,
[src]
Iter: IntoIterator<Item = T>,
fn extend_one(&mut self, elem: T)
[src]
impl<T> Extend<T> for BinaryHeap<T> where
T: Ord,
[src]
T: Ord,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
fn extend_one(&mut self, item: T)
[src]
fn extend_reserve(&mut self, additional: usize)
[src]
impl<T> Extend<T> for LinkedList<T>
[src]
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,
fn extend_one(&mut self, elem: T)
[src]
impl<T, S> Extend<T> for competitive_hpp::prelude::HashSet<T, S> where
S: BuildHasher,
T: Eq + Hash,
[src]
S: BuildHasher,
T: Eq + Hash,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
[src]
I: IntoIterator<Item = T>,