pub trait Extend<A> {
// Required method
fn extend<T>(&mut self, iter: T)
where T: IntoIterator<Item = A>;
// Provided methods
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§
1.0.0 · Sourcefn 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
// 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§
Sourcefn extend_one(&mut self, item: A)
🔬This is a nightly-only experimental API. (extend_one
)
fn extend_one(&mut self, item: A)
extend_one
)Extends a collection with exactly one element.
Sourcefn extend_reserve(&mut self, additional: usize)
🔬This is a nightly-only experimental API. (extend_one
)
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.
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§
impl Extend<(String, Value)> for serde_json::map::Map<String, Value>
impl Extend<(String, Value)> for Map<String, Value>
impl Extend<AsciiChar> for String
impl Extend<char> for String
impl Extend<u8> for BytesMut
impl Extend<u8> for SimpleAssembler
impl Extend<()> for ()
impl Extend<String> for String
impl Extend<OsString> for OsString
impl Extend<CipherCtxFlags> for CipherCtxFlags
impl Extend<CMSOptions> for CMSOptions
impl Extend<OcspFlag> for OcspFlag
impl Extend<Pkcs7Flags> for Pkcs7Flags
impl Extend<ExtensionContext> for ExtensionContext
impl Extend<ShutdownState> for ShutdownState
impl Extend<SslMode> for SslMode
impl Extend<SslOptions> for SslOptions
impl Extend<SslSessionCacheMode> for SslSessionCacheMode
impl Extend<SslVerifyMode> for SslVerifyMode
impl Extend<X509CheckFlags> for X509CheckFlags
impl Extend<X509VerifyFlags> for X509VerifyFlags
impl Extend<Access> for Access
impl Extend<AtFlags> for AtFlags
impl Extend<BeginFlags> for BeginFlags
impl Extend<Bytes> for BytesMut
impl Extend<CreateFlags> for CreateFlags
impl Extend<CreateFlags> for CreateFlags
impl Extend<DupFlags> for DupFlags
impl Extend<EventFlags> for EventFlags
impl Extend<EventMask> for EventMask
impl Extend<EventfdFlags> for EventfdFlags
impl Extend<FallocateFlags> for FallocateFlags
impl Extend<FdFlags> for FdFlags
impl Extend<FloatingPointEmulationControl> for FloatingPointEmulationControl
impl Extend<FloatingPointExceptionMode> for FloatingPointExceptionMode
impl Extend<IFlags> for IFlags
impl Extend<MembarrierQuery> for MembarrierQuery
impl Extend<MemfdFlags> for MemfdFlags
impl Extend<Mode> for Mode
impl Extend<MountFlags> for MountFlags
impl Extend<MountPropagationFlags> for MountPropagationFlags
impl Extend<OFlags> for OFlags
impl Extend<PidfdFlags> for PidfdFlags
impl Extend<PidfdGetfdFlags> for PidfdGetfdFlags
impl Extend<PipeFlags> for PipeFlags
impl Extend<PollFlags> for PollFlags
impl Extend<ReadFlags> for ReadFlags
impl Extend<ReadWriteFlags> for ReadWriteFlags
impl Extend<RecvFlags> for RecvFlags
impl Extend<RelayFlags> for RelayFlags
impl Extend<RenameFlags> for RenameFlags
impl Extend<ResolveFlags> for ResolveFlags
impl Extend<SealFlags> for SealFlags
impl Extend<SendFlags> for SendFlags
impl Extend<SockaddrXdpFlags> for SockaddrXdpFlags
impl Extend<SocketFlags> for SocketFlags
impl Extend<SpeculationFeatureControl> for SpeculationFeatureControl
impl Extend<SpeculationFeatureState> for SpeculationFeatureState
impl Extend<SpliceFlags> for SpliceFlags
impl Extend<StatVfsMountFlags> for StatVfsMountFlags
impl Extend<StatxFlags> for StatxFlags
impl Extend<Table> for ArrayOfTables
impl Extend<TimerfdFlags> for TimerfdFlags
impl Extend<TimerfdTimerFlags> for TimerfdTimerFlags
impl Extend<TrustAnchor<'static>> for RootCertStore
impl Extend<UnalignedAccessControl> for UnalignedAccessControl
impl Extend<UnmountFlags> for UnmountFlags
impl Extend<WaitOptions> for WaitOptions
impl Extend<WaitidOptions> for WaitidOptions
impl Extend<WatchFlags> for WatchFlags
impl Extend<WatchMask> for WatchMask
impl Extend<XattrFlags> for XattrFlags
impl Extend<XdpDescOptions> for XdpDescOptions
impl Extend<XdpOptionsFlags> for XdpOptionsFlags
impl Extend<XdpRingFlags> for XdpRingFlags
impl Extend<XdpUmemRegFlags> for XdpUmemRegFlags
impl<'a> Extend<&'a AsciiChar> for String
impl<'a> Extend<&'a char> for String
impl<'a> Extend<&'a str> for String
impl<'a> Extend<&'a u8> for BytesMut
impl<'a> Extend<&'a u8> for PrefixedPayload
impl<'a> Extend<&'a u8> for SimpleAssembler
impl<'a> Extend<&'a OsStr> for OsString
impl<'a> Extend<Cow<'a, str>> for String
impl<'a> Extend<Cow<'a, OsStr>> for OsString
impl<'a> Extend<u8> for UncommittedModifier<'a>
impl<'a, 'b> Extend<&'b u8> for UncommittedModifier<'a>
impl<'a, 'b, R> Extend<&'b u8> for Modifier<'a, R>where
R: Relocation,
impl<'a, K, V> Extend<(K, &'a V)> for SecondaryMap<K, V>
impl<'a, K, V> Extend<&'a V> for TiVec<K, V>where
V: 'a + Copy,
impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
impl<'a, K, V, S> Extend<(&'a <K as WeakElement>::Strong, &'a V)> for PtrWeakKeyHashMap<K, V, S>where
K: 'a + WeakElement,
<K as WeakElement>::Strong: Clone + Deref,
V: 'a + Clone,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a <K as WeakElement>::Strong, &'a V)> for WeakKeyHashMap<K, V, S>
impl<'a, K, V, S> Extend<(&'a K, &'a <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S>where
K: 'a + Eq + Hash + Clone,
V: 'a + WeakElement,
<V as WeakElement>::Strong: Clone,
S: BuildHasher,
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for tor_hsservice::internal_prelude::HashMap<K, V, S>
impl<'a, K, V, S> Extend<(&'a K, &'a V)> for IndexMap<K, V, S>
impl<'a, K, V, S> Extend<(K, &'a V)> for SparseSecondaryMap<K, V, S>
impl<'a, K, V, S, A> Extend<&'a (K, V)> for HashMap<K, V, S, A>
Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.
impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A>
Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.
impl<'a, M, T1, T2, O1, O2> Extend<BitRef<'a, M, T2, O2>> for BitVec<T1, O1>where
M: Mutability,
T1: BitStore,
T2: BitStore,
O1: BitOrder,
O2: BitOrder,
§Bit-Vector Extension by Proxy References
DO NOT use this. You clearly have a bit-slice. Use
.extend_from_bitslice()
instead!
Iterating over a bit-slice requires loading from memory and constructing a proxy reference for each bit. This is needlessly slow; the specialized method is able to avoid this per-bit cost and possibly even use batched operations.
impl<'a, R> Extend<&'a u8> for Assembler<R>where
R: Relocation,
impl<'a, R> Extend<&'a u8> for VecAssembler<R>where
R: Relocation,
impl<'a, R> Extend<u8> for Modifier<'a, R>where
R: Relocation,
impl<'a, T, A> Extend<&'a T> for BinaryHeap<T, A>
impl<'a, T, A> Extend<&'a T> for VecDeque<T, A>
impl<'a, T, A> Extend<&'a T> for BTreeSet<T, A>
impl<'a, T, A> Extend<&'a T> for LinkedList<T, A>
impl<'a, T, A> Extend<&'a T> for Vec<T, A>
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.
impl<'a, T, O> Extend<&'a bool> for BitVec<T, O>where
T: BitStore,
O: BitOrder,
impl<'a, T, O> Extend<&'a T> for BitVec<T, O>where
T: BitStore,
O: BitOrder,
impl<'a, T, S> Extend<&'a T> for tor_hsservice::internal_prelude::HashSet<T, S>
impl<'a, T, S> Extend<&'a T> for IndexSet<T, S>
impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A>
impl<'slice, 'fd> Extend<SendAncillaryMessage<'slice, 'fd>> for SendAncillaryBuffer<'_, 'slice, 'fd>
impl<A> Extend<<A as Array>::Item> for SmallVec<A>where
A: Array,
impl<A> Extend<Box<str, A>> for Stringwhere
A: Allocator,
impl<A> Extend<A> for AsciiStringwhere
A: AsRef<AsciiStr>,
impl<A, EA> Extend<(A₁, A₂, …, Aₙ)> for (EA₁, EA₂, …, EAₙ)where
EA: Extend<A>,
This trait is implemented for tuples up to twelve items long. The impl
s for 1- and 3- through 12-ary tuples were stabilized after 2-tuples, in 1.85.0.
impl<E, T> Extend<T> for RetryError<E>where
T: Into<E>,
impl<Fut> Extend<Fut> for FuturesOrdered<Fut>where
Fut: Future,
impl<Fut> Extend<Fut> for FuturesUnordered<Fut>
impl<I, P, H> Extend<(I, P)> for DoublePriorityQueue<I, P, H>
impl<I, P, H> Extend<(I, P)> for PriorityQueue<I, P, H>
impl<ID> Extend<ID> for RelayIdSetwhere
ID: Into<RelayId>,
impl<K, V> Extend<(Range<K>, V)> for RangeMap<K, V>
impl<K, V> Extend<(RangeInclusive<K>, V)> for RangeInclusiveMap<K, V>
impl<K, V> Extend<(K, V)> for SecondaryMap<K, V>where
K: Key,
impl<K, V> Extend<(K, V)> for InlineTable
impl<K, V> Extend<(K, V)> for Table
impl<K, V> Extend<V> for TiVec<K, V>
impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
impl<K, V, S> Extend<(<K as WeakElement>::Strong, <V as WeakElement>::Strong)> for PtrWeakWeakHashMap<K, V, S>
impl<K, V, S> Extend<(<K as WeakElement>::Strong, <V as WeakElement>::Strong)> for WeakWeakHashMap<K, V, S>
impl<K, V, S> Extend<(<K as WeakElement>::Strong, V)> for PtrWeakKeyHashMap<K, V, S>
impl<K, V, S> Extend<(<K as WeakElement>::Strong, V)> for WeakKeyHashMap<K, V, S>where
K: WeakKey,
S: BuildHasher,
impl<K, V, S> Extend<(K, <V as WeakElement>::Strong)> for WeakValueHashMap<K, V, S>
impl<K, V, S> Extend<(K, V)> for tor_hsservice::internal_prelude::HashMap<K, V, S>
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<K, V, S> Extend<(K, V)> for IndexMap<K, V, S>
impl<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>
Inserts all new key-values from the iterator and replaces values with existing keys with new values returned from the iterator.
impl<L, R, A> Extend<A> for Either<L, R>
impl<P> Extend<P> for tor_hsservice::internal_prelude::PathBuf
impl<P> Extend<P> for PathBufwhere
P: AsRef<Path>,
impl<R> Extend<u8> for Assembler<R>where
R: Relocation,
impl<R> Extend<u8> for VecAssembler<R>where
R: Relocation,
impl<St> Extend<St> for SelectAll<St>
impl<T> Extend<(Option<HeaderName>, T)> for HeaderMap<T>
impl<T> Extend<(String, T)> for NetParams<T>
impl<T> Extend<(HeaderName, T)> for HeaderMap<T>
impl<T> Extend<Range<T>> for RangeSet<T>
impl<T> Extend<RangeInclusive<T>> for RangeInclusiveSet<T>
impl<T> Extend<T> for BoundedVecDeque<T>
impl<T, A> Extend<T> for BinaryHeap<T, A>
impl<T, A> Extend<T> for VecDeque<T, A>where
A: Allocator,
impl<T, A> Extend<T> for BTreeSet<T, A>
impl<T, A> Extend<T> for LinkedList<T, A>where
A: Allocator,
impl<T, A> Extend<T> for Vec<T, A>where
A: Allocator,
impl<T, O> Extend<bool> for BitVec<T, O>where
T: BitStore,
O: BitOrder,
§Bit-Vector Extension
This extends a bit-vector from anything that produces individual bits.
§Original
§Notes
This .extend()
call is the second-slowest possible way to append bits into a
bit-vector, faster only than calling iter.for_each(|bit| bv.push(bit))
.
DO NOT use this if you have any other choice.
If you are extending a bit-vector from the contents of a bit-slice, then you
should use .extend_from_bitslice()
instead. That method is specialized to
perform upfront allocation and, where possible, use a batch copy rather than
copying each bit individually from the source into the bit-vector.
impl<T, O> Extend<T> for BitVec<T, O>where
T: BitStore,
O: BitOrder,
impl<T, S> Extend<<T as WeakElement>::Strong> for PtrWeakHashSet<T, S>
impl<T, S> Extend<<T as WeakElement>::Strong> for WeakHashSet<T, S>where
T: WeakKey,
S: BuildHasher,
impl<T, S> Extend<T> for tor_hsservice::internal_prelude::HashSet<T, S>
impl<T, S> Extend<T> for IndexSet<T, S>
impl<T, S, A> Extend<T> for HashSet<T, S, A>
impl<T, const CAP: usize> Extend<T> for ArrayVec<T, CAP>
Extend the ArrayVec
with an iterator.
Panics if extending the vector exceeds its capacity.