Trait otter_api_tests::iter::Extend
1.0.0 · source · [−]pub trait Extend<A> {
fn extend<T>(&mut self, iter: T)
where
T: IntoIterator<Item = A>;
fn extend_one(&mut self, item: A) { ... }
fn extend_reserve(&mut self, additional: usize) { ... }
}
Expand description
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>,
fn extend<T>(&mut self, iter: T) where
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)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
fn extend_reserve(&mut self, additional: usize)
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
1.52.0 · sourceimpl Extend<OsString> for OsString
impl Extend<OsString> for OsString
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = OsString>,
1.52.0 · sourceimpl<'a> Extend<&'a OsStr> for OsString
impl<'a> Extend<&'a OsStr> for OsString
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = &'a OsStr>,
1.52.0 · sourceimpl<'a> Extend<Cow<'a, OsStr>> for OsString
impl<'a> Extend<Cow<'a, OsStr>> for OsString
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = Cow<'a, OsStr>>,
1.28.0 · sourceimpl Extend<()> for ()
impl Extend<()> for ()
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = ()>,
sourcefn extend_one(&mut self, _item: ())
fn extend_one(&mut self, _item: ())
extend_one
)1.56.0 · sourceimpl<A, B, ExtendA, ExtendB> Extend<(A, B)> for (ExtendA, ExtendB) where
ExtendA: Extend<A>,
ExtendB: Extend<B>,
impl<A, B, ExtendA, ExtendB> Extend<(A, B)> for (ExtendA, ExtendB) where
ExtendA: Extend<A>,
ExtendB: Extend<B>,
sourcefn extend<T>(&mut self, into_iter: T) where
T: IntoIterator<Item = (A, B)>,
fn extend<T>(&mut self, into_iter: T) where
T: IntoIterator<Item = (A, B)>,
Allows to extend
a tuple of collections that also implement Extend
.
See also: Iterator::unzip
Examples
let mut tuple = (vec![0], vec![1]);
tuple.extend([(2, 3), (4, 5), (6, 7)]);
assert_eq!(tuple.0, [0, 2, 4, 6]);
assert_eq!(tuple.1, [1, 3, 5, 7]);
// also allows for arbitrarily nested tuples as elements
let mut nested_tuple = (vec![1], (vec![2], vec![3]));
nested_tuple.extend([(4, (5, 6)), (7, (8, 9))]);
let (a, (b, c)) = nested_tuple;
assert_eq!(a, [1, 4, 7]);
assert_eq!(b, [2, 5, 8]);
assert_eq!(c, [3, 6, 9]);
sourcefn extend_one(&mut self, item: (A, B))
fn extend_one(&mut self, item: (A, B))
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)1.2.0 · sourceimpl<'a> Extend<&'a char> for String
impl<'a> Extend<&'a char> for String
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a char>,
sourcefn extend_one(&mut self, &'a char)
fn extend_one(&mut self, &'a char)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)sourceimpl Extend<char> for String
impl Extend<char> for String
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = char>,
sourcefn extend_one(&mut self, c: char)
fn extend_one(&mut self, c: char)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)sourceimpl<T, A> Extend<T> for Vec<T, A> where
A: Allocator,
impl<T, A> Extend<T> for Vec<T, A> where
A: Allocator,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
sourcefn extend_one(&mut self, item: T)
fn extend_one(&mut self, item: T)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)1.2.0 · sourceimpl<'a, T> Extend<&'a T> for LinkedList<T> where
T: 'a + Copy,
impl<'a, T> Extend<&'a T> for LinkedList<T> where
T: 'a + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
sourcefn extend_one(&mut self, &'a T)
fn extend_one(&mut self, &'a T)
extend_one
)1.2.0 · sourceimpl<'a, T> Extend<&'a T> for BinaryHeap<T> where
T: 'a + Ord + Copy,
impl<'a, T> Extend<&'a T> for BinaryHeap<T> where
T: 'a + Ord + Copy,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
sourcefn extend_one(&mut self, &'a T)
fn extend_one(&mut self, &'a T)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)1.19.0 · sourceimpl<'a> Extend<Cow<'a, str>> for String
impl<'a> Extend<Cow<'a, str>> for String
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Cow<'a, str>>,
sourcefn extend_one(&mut self, s: Cow<'a, str>)
fn extend_one(&mut self, s: Cow<'a, str>)
extend_one
)sourceimpl<T> Extend<T> for BinaryHeap<T> where
T: Ord,
impl<T> Extend<T> for BinaryHeap<T> where
T: Ord,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
sourcefn extend_one(&mut self, item: T)
fn extend_one(&mut self, item: T)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)sourceimpl<T> Extend<T> for LinkedList<T>
impl<T> Extend<T> for LinkedList<T>
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
sourcefn extend_one(&mut self, elem: T)
fn extend_one(&mut self, elem: T)
extend_one
)1.4.0 · sourceimpl Extend<String> for String
impl Extend<String> for String
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = String>,
sourcefn extend_one(&mut self, s: String)
fn extend_one(&mut self, s: String)
extend_one
)sourceimpl<'a> Extend<&'a str> for String
impl<'a> Extend<&'a str> for String
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a str>,
sourcefn extend_one(&mut self, s: &'a str)
fn extend_one(&mut self, s: &'a str)
extend_one
)1.2.0 · sourceimpl<'a, T, A> Extend<&'a T> for Vec<T, A> where
T: 'a + Copy,
A: 'a + Allocator,
impl<'a, T, A> Extend<&'a T> for Vec<T, A> where
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.
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
sourcefn extend_one(&mut self, &'a T)
fn extend_one(&mut self, &'a T)
extend_one
)sourcefn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)impl<A> Extend<<A as Array>::Item> for SmallVec<A> where
A: Array,
impl<A> Extend<<A as Array>::Item> for SmallVec<A> where
A: Array,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = <A as Array>::Item>,
impl<'entries, EntryData> Extend<&'entries EntryData> for VecList<EntryData> where
EntryData: 'entries + Copy,
impl<'entries, EntryData> Extend<&'entries EntryData> for VecList<EntryData> where
EntryData: 'entries + Copy,
fn extend<Iter>(&mut self, iter: Iter) where
Iter: IntoIterator<Item = &'entries EntryData>,
impl<EntryData> Extend<EntryData> for VecList<EntryData>
impl<EntryData> Extend<EntryData> for VecList<EntryData>
fn extend<Iter>(&mut self, iter: Iter) where
Iter: IntoIterator<Item = EntryData>,
impl Extend<Op> for Op
impl Extend<Op> for Op
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = Op>,
impl Extend<WatchMask> for WatchMask
impl Extend<WatchMask> for WatchMask
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = WatchMask>,
impl Extend<EventMask> for EventMask
impl Extend<EventMask> for EventMask
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = EventMask>,
impl Extend<FileType> for FileType
impl Extend<FileType> for FileType
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = FileType>,
impl<A> Extend<<A as Array>::Item> for TinyVec<A> where
A: Array,
impl<A> Extend<<A as Array>::Item> for TinyVec<A> where
A: Array,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = <A as Array>::Item>,
impl<'s, T> Extend<T> for SliceVec<'s, T>
impl<'s, T> Extend<T> for SliceVec<'s, T>
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
impl<A> Extend<<A as Array>::Item> for ArrayVec<A> where
A: Array,
impl<A> Extend<<A as Array>::Item> for ArrayVec<A> where
A: Array,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = <A as Array>::Item>,
impl Extend<Transformations> for Transformations
impl Extend<Transformations> for Transformations
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = Transformations>,
impl<V> Extend<(usize, V)> for VecMap<V>
impl<V> Extend<(usize, V)> for VecMap<V>
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (usize, V)>,
sourceimpl<T> Extend<(Option<HeaderName>, T)> for HeaderMap<T>
impl<T> Extend<(Option<HeaderName>, T)> for HeaderMap<T>
sourcefn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (Option<HeaderName>, T)>,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (Option<HeaderName>, T)>,
Extend a HeaderMap
with the contents of another HeaderMap
.
This function expects the yielded items to follow the same structure as
IntoIter
.
Panics
This panics if the first yielded item does not have a HeaderName
.
Examples
let mut map = HeaderMap::new();
map.insert(ACCEPT, "text/plain".parse().unwrap());
map.insert(HOST, "hello.world".parse().unwrap());
let mut extra = HeaderMap::new();
extra.insert(HOST, "foo.bar".parse().unwrap());
extra.insert(COOKIE, "hello".parse().unwrap());
extra.append(COOKIE, "world".parse().unwrap());
map.extend(extra);
assert_eq!(map["host"], "foo.bar");
assert_eq!(map["accept"], "text/plain");
assert_eq!(map["cookie"], "hello");
let v = map.get_all("host");
assert_eq!(1, v.iter().count());
let v = map.get_all("cookie");
assert_eq!(2, v.iter().count());
sourceimpl<T> Extend<(HeaderName, T)> for HeaderMap<T>
impl<T> Extend<(HeaderName, T)> for HeaderMap<T>
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = (HeaderName, T)>,
impl<'a> Extend<&'a u8> for BytesMut
impl<'a> Extend<&'a u8> for BytesMut
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = &'a u8>,
impl Extend<u8> for BytesMut
impl Extend<u8> for BytesMut
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = u8>,
impl<Fut> Extend<Fut> for FuturesOrdered<Fut> where
Fut: Future,
impl<Fut> Extend<Fut> for FuturesOrdered<Fut> where
Fut: Future,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Fut>,
impl<Fut> Extend<Fut> for FuturesUnordered<Fut>
impl<Fut> Extend<Fut> for FuturesUnordered<Fut>
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = Fut>,
impl<St> Extend<St> for SelectAll<St> where
St: Stream + Unpin,
impl<St> Extend<St> for SelectAll<St> where
St: Stream + Unpin,
fn extend<T>(&mut self, iter: T) where
T: IntoIterator<Item = St>,
sourceimpl<'a, T, S> Extend<&'a T> for IndexSet<T, S> where
T: 'a + Hash + Eq + Copy,
S: BuildHasher,
impl<'a, T, S> Extend<&'a T> for IndexSet<T, S> where
T: 'a + Hash + Eq + Copy,
S: BuildHasher,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = &'a T>,
sourceimpl<T, S> Extend<T> for IndexSet<T, S> where
T: Hash + Eq,
S: BuildHasher,
impl<T, S> Extend<T> for IndexSet<T, S> where
T: Hash + Eq,
S: BuildHasher,
fn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = T>,
sourceimpl<'a, K, V, S> Extend<(&'a K, &'a V)> for IndexMap<K, V, S> where
K: Hash + Eq + Copy,
V: Copy,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for IndexMap<K, V, S> where
K: Hash + Eq + Copy,
V: Copy,
S: BuildHasher,
sourceimpl<K, V, S> Extend<(K, V)> for IndexMap<K, V, S> where
K: Hash + Eq,
S: BuildHasher,
impl<K, V, S> Extend<(K, V)> for IndexMap<K, V, S> where
K: Hash + Eq,
S: BuildHasher,
sourcefn extend<I>(&mut self, iterable: I) where
I: IntoIterator<Item = (K, V)>,
fn extend<I>(&mut self, iterable: I) where
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<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A> where
K: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
impl<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A> where
K: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
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)>,
impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
A: Allocator + Clone,
impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
A: Allocator + Clone,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = &'a T>,
impl<T, S, A> Extend<T> for HashSet<T, S, A> where
T: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
impl<T, S, A> Extend<T> for HashSet<T, S, A> where
T: Eq + Hash,
S: BuildHasher,
A: Allocator + Clone,
fn extend<I>(&mut self, iter: I) where
I: IntoIterator<Item = T>,
impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A> where
K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
A: Allocator + Clone,
impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A> where
K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
A: Allocator + Clone,
sourceimpl Extend<CMSOptions> for CMSOptions
impl Extend<CMSOptions> for CMSOptions
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = CMSOptions>,
sourceimpl Extend<X509VerifyFlags> for X509VerifyFlags
impl Extend<X509VerifyFlags> for X509VerifyFlags
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = X509VerifyFlags>,
sourceimpl Extend<ShutdownState> for ShutdownState
impl Extend<ShutdownState> for ShutdownState
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = ShutdownState>,
sourceimpl Extend<SslMode> for SslMode
impl Extend<SslMode> for SslMode
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SslMode>,
sourceimpl Extend<SslSessionCacheMode> for SslSessionCacheMode
impl Extend<SslSessionCacheMode> for SslSessionCacheMode
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SslSessionCacheMode>,
sourceimpl Extend<SslOptions> for SslOptions
impl Extend<SslOptions> for SslOptions
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SslOptions>,
sourceimpl Extend<ExtensionContext> for ExtensionContext
impl Extend<ExtensionContext> for ExtensionContext
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = ExtensionContext>,
sourceimpl Extend<OcspFlag> for OcspFlag
impl Extend<OcspFlag> for OcspFlag
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = OcspFlag>,
sourceimpl Extend<X509CheckFlags> for X509CheckFlags
impl Extend<X509CheckFlags> for X509CheckFlags
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = X509CheckFlags>,
sourceimpl Extend<Pkcs7Flags> for Pkcs7Flags
impl Extend<Pkcs7Flags> for Pkcs7Flags
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = Pkcs7Flags>,
sourceimpl Extend<SslVerifyMode> for SslVerifyMode
impl Extend<SslVerifyMode> for SslVerifyMode
fn extend<T>(&mut self, iterator: T) where
T: IntoIterator<Item = SslVerifyMode>,
Implementors
impl Extend<(String, Value)> for otter_api_tests::imports::toml::value::Map<String, Value>
impl Extend<(String, Value)> for otter_api_tests::serde_json::Map<String, Value>
impl Extend<AtFlags> for AtFlags
impl Extend<FallocateFlags> for FallocateFlags
impl Extend<FdFlag> for otter_api_tests::imports::nix::fcntl::FdFlag
impl Extend<OFlag> for OFlag
impl Extend<RenameFlags> for RenameFlags
impl Extend<SealFlag> for SealFlag
impl Extend<SpliceFFlags> for SpliceFFlags
impl Extend<DeleteModuleFlags> for DeleteModuleFlags
impl Extend<ModuleInitFlags> for ModuleInitFlags
impl Extend<MntFlags> for MntFlags
impl Extend<MsFlags> for otter_api_tests::imports::nix::mount::MsFlags
impl Extend<FdFlag> for otter_api_tests::imports::nix::mqueue::FdFlag
impl Extend<MQ_OFlag> for MQ_OFlag
impl Extend<InterfaceFlags> for InterfaceFlags
impl Extend<PollFlags> for PollFlags
impl Extend<CloneFlags> for CloneFlags
impl Extend<EpollCreateFlags> for EpollCreateFlags
impl Extend<EpollFlags> for EpollFlags
impl Extend<EfdFlags> for EfdFlags
impl Extend<AddWatchFlags> for AddWatchFlags
impl Extend<InitFlags> for InitFlags
impl Extend<MemFdCreateFlag> for MemFdCreateFlag
impl Extend<MRemapFlags> for MRemapFlags
impl Extend<MapFlags> for MapFlags
impl Extend<MlockAllFlags> for MlockAllFlags
impl Extend<MsFlags> for otter_api_tests::imports::nix::sys::mman::MsFlags
impl Extend<ProtFlags> for ProtFlags
impl Extend<Persona> for Persona
impl Extend<Options> for Options
impl Extend<QuotaValidFlags> for QuotaValidFlags
impl Extend<SaFlags> for SaFlags
impl Extend<SfdFlags> for SfdFlags
impl Extend<MsgFlags> for MsgFlags
impl Extend<SockFlag> for SockFlag
impl Extend<Mode> for Mode
impl Extend<SFlag> for SFlag
impl Extend<FsFlags> for FsFlags
impl Extend<ControlFlags> for ControlFlags
impl Extend<InputFlags> for InputFlags
impl Extend<LocalFlags> for LocalFlags
impl Extend<OutputFlags> for OutputFlags
impl Extend<TimerFlags> for TimerFlags
impl Extend<TimerSetTimeFlags> for TimerSetTimeFlags
impl Extend<WaitPidFlag> for WaitPidFlag
impl Extend<AccessFlags> for AccessFlags
impl<'a, I, T> Extend<&'a T> for IndexVec<I, T> where
I: Idx,
T: 'a + Copy,
impl<'a, K, V> Extend<(&'a K, &'a V)> for BTreeMap<K, V> where
K: Ord + Copy,
V: Copy,
impl<'a, K, V> Extend<(&'a K, &'a V)> for EnumMap<K, V> where
K: EnumArray<V> + Copy,
V: Copy,
impl<'a, K, V> Extend<(K, &'a V)> for SecondaryMap<K, V> where
K: Key,
V: 'a + Copy,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for otter_api_tests::shapelib::HashMap<K, V, S> where
K: Eq + Hash + Copy,
V: Copy,
S: BuildHasher,
impl<'a, K, V, S> Extend<(K, &'a V)> for SparseSecondaryMap<K, V, S> where
K: Key,
V: 'a + Copy,
S: BuildHasher,
impl<'a, T> Extend<&'a T> for BTreeSet<T> where
T: 'a + Ord + Copy,
impl<'a, T, A> Extend<&'a T> for VecDeque<T, A> where
T: 'a + Copy,
A: Allocator,
impl<'a, T, S> Extend<&'a T> for otter_api_tests::shapelib::HashSet<T, S> where
T: 'a + Eq + Hash + Copy,
S: BuildHasher,
impl<I, T> Extend<T> for IndexVec<I, T> where
I: Idx,
impl<K, V> Extend<(K, V)> for SecondaryMap<K, V> where
K: Key,
impl<K, V> Extend<(K, V)> for BTreeMap<K, V> where
K: Ord,
impl<K, V> Extend<(K, V)> for EnumMap<K, V> where
K: EnumArray<V>,
impl<K, V, S> Extend<(K, V)> for otter_api_tests::shapelib::HashMap<K, V, S> where
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.
impl<K, V, S> Extend<(K, V)> for SparseSecondaryMap<K, V, S> where
K: Key,
S: BuildHasher,
impl<L, R, A> Extend<A> for Either<L, R> where
L: Extend<A>,
R: Extend<A>,
impl<P> Extend<P> for PathBuf where
P: AsRef<Path>,
impl<T> Extend<T> for BTreeSet<T> where
T: Ord,
impl<T, A> Extend<T> for VecDeque<T, A> where
A: Allocator,
impl<T, S> Extend<T> for otter_api_tests::shapelib::HashSet<T, S> where
T: Eq + Hash,
S: BuildHasher,
impl<T, const CAP: usize> Extend<T> for otter_api_tests::shapelib::ArrayVec<T, CAP>
Extend the ArrayVec
with an iterator.
Panics if extending the vector exceeds its capacity.