Trait wasmtime_environ::__core::clone::Clone 1.0.0[−][src]
pub trait Clone {
fn clone(&self) -> Self;
fn clone_from(&mut self, source: &Self) { ... }
}
Expand description
A common trait for the ability to explicitly duplicate an object.
Differs from Copy
in that Copy
is implicit and an inexpensive bit-wise copy, while
Clone
is always explicit and may or may not be expensive. In order to enforce
these characteristics, Rust does not allow you to reimplement Copy
, but you
may reimplement Clone
and run arbitrary code.
Since Clone
is more general than Copy
, you can automatically make anything
Copy
be Clone
as well.
Derivable
This trait can be used with #[derive]
if all fields are Clone
. The derive
d
implementation of Clone
calls clone
on each field.
For a generic struct, #[derive]
implements Clone
conditionally by adding bound Clone
on
generic parameters.
// `derive` implements Clone for Reading<T> when T is Clone.
#[derive(Clone)]
struct Reading<T> {
frequency: T,
}
How can I implement Clone
?
Types that are Copy
should have a trivial implementation of Clone
. More formally:
if T: Copy
, x: T
, and y: &T
, then let x = y.clone();
is equivalent to let x = *y;
.
Manual implementations should be careful to uphold this invariant; however, unsafe code
must not rely on it to ensure memory safety.
An example is a generic struct holding a function pointer. In this case, the
implementation of Clone
cannot be derive
d, but can be implemented as:
struct Generate<T>(fn() -> T);
impl<T> Copy for Generate<T> {}
impl<T> Clone for Generate<T> {
fn clone(&self) -> Self {
*self
}
}
Additional implementors
In addition to the implementors listed below,
the following types also implement Clone
:
- Function item types (i.e., the distinct types defined for each function)
- Function pointer types (e.g.,
fn() -> i32
) - Array types, for all sizes, if the item type also implements
Clone
(e.g.,[i32; 123456]
) - Tuple types, if each component also implements
Clone
(e.g.,()
,(i32, bool)
) - Closure types, if they capture no value from the environment
or if all such captured values implement
Clone
themselves. Note that variables captured by shared reference always implementClone
(even if the referent doesn’t), while variables captured by mutable reference never implementClone
.
Required methods
Provided methods
fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
.
a.clone_from(&b)
is equivalent to a = b.clone()
in functionality,
but can be overridden to reuse the resources of a
to avoid unnecessary
allocations.
Implementations on Foreign Types
pub fn clone(&self) -> Intersection<'_, T, S>ⓘNotable traits for Intersection<'a, T, S>impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn clone(&self) -> Difference<'_, T, S>ⓘNotable traits for Difference<'a, T, S>impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn clone(&self) -> SymmetricDifference<'_, T, S>ⓘNotable traits for SymmetricDifference<'a, T, S>impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for SymmetricDifference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn clone(&self) -> Components<'a>ⓘNotable traits for Components<'a>impl<'a> Iterator for Components<'a> type Item = Component<'a>;
impl<'a> Iterator for Components<'a> type Item = Component<'a>;
Clone a sender to send to other threads.
Note, be aware of the lifetime of the sender because all senders
(including the original) need to be dropped in order for
Receiver::recv
to stop blocking.
Shared references can be cloned, but mutable references cannot!
Shared references can be cloned, but mutable references cannot!
pub fn clone(&self) -> Difference<'_, T>ⓘNotable traits for Difference<'a, T>impl<'a, T> Iterator for Difference<'a, T> where
T: Ord, type Item = &'a T;
impl<'a, T> Iterator for Difference<'a, T> where
T: Ord, type Item = &'a T;
pub fn clone(&self) -> Intersection<'_, T>ⓘNotable traits for Intersection<'a, T>impl<'a, T> Iterator for Intersection<'a, T> where
T: Ord, type Item = &'a T;
impl<'a, T> Iterator for Intersection<'a, T> where
T: Ord, type Item = &'a T;
pub fn clone(&self) -> SymmetricDifference<'_, T>ⓘNotable traits for SymmetricDifference<'a, T>impl<'a, T> Iterator for SymmetricDifference<'a, T> where
T: Ord, type Item = &'a T;
impl<'a, T> Iterator for SymmetricDifference<'a, T> where
T: Ord, type Item = &'a T;
pub fn clone(&self) -> IntoIterSorted<T>ⓘNotable traits for IntoIterSorted<T>impl<T> Iterator for IntoIterSorted<T> where
T: Ord, type Item = T;
impl<T> Iterator for IntoIterSorted<T> where
T: Ord, type Item = T;
Returns a new box with a clone()
of this box’s contents.
Examples
let x = Box::new(5);
let y = x.clone();
// The value is the same
assert_eq!(x, y);
// But they are unique objects
assert_ne!(&*x as *const i32, &*y as *const i32);
Copies source
’s contents into self
without creating a new allocation.
Examples
let x = Box::new(5);
let mut y = Box::new(10);
let yp: *const i32 = &*y;
y.clone_from(&x);
// The value is the same
assert_eq!(x, y);
// And no allocation occurred
assert_eq!(yp, &*y);
impl<'data, 'file, Elf, R> Clone for ElfSymbol<'data, 'file, Elf, R> where
'data: 'file,
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Endian: Clone,
<Elf as FileHeader>::Sym: Clone,
impl<'data, 'file, Elf, R> Clone for ElfSymbol<'data, 'file, Elf, R> where
'data: 'file,
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Endian: Clone,
<Elf as FileHeader>::Sym: Clone,
impl<'data, Elf> Clone for VerdefIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VerdefIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf, R> Clone for SymbolTable<'data, Elf, R> where
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Sym: Clone,
impl<'data, Elf, R> Clone for SymbolTable<'data, Elf, R> where
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Sym: Clone,
impl<'data, Elf> Clone for VernauxIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VernauxIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VersionTable<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VersionTable<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VerneedIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VerneedIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf, R> Clone for SectionTable<'data, Elf, R> where
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::SectionHeader: Clone,
impl<'data, Elf, R> Clone for SectionTable<'data, Elf, R> where
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::SectionHeader: Clone,
impl<'data, 'file, Elf, R> Clone for ElfSymbolTable<'data, 'file, Elf, R> where
'data: 'file,
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Endian: Clone,
impl<'data, 'file, Elf, R> Clone for ElfSymbolTable<'data, 'file, Elf, R> where
'data: 'file,
Elf: Clone + FileHeader,
R: Clone + ReadRef<'data>,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VerdauxIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
impl<'data, Elf> Clone for VerdauxIterator<'data, Elf> where
Elf: Clone + FileHeader,
<Elf as FileHeader>::Endian: Clone,
pub fn clone(&self) -> SymmetricDifference<'_, T, S1, S2>ⓘNotable traits for SymmetricDifference<'a, T, S1, S2>impl<'a, T, S1, S2> Iterator for SymmetricDifference<'a, T, S1, S2> where
T: Eq + Hash,
S1: BuildHasher,
S2: BuildHasher, type Item = &'a T;
impl<'a, T, S1, S2> Iterator for SymmetricDifference<'a, T, S1, S2> where
T: Eq + Hash,
S1: BuildHasher,
S2: BuildHasher, type Item = &'a T;
pub fn clone(&self) -> Intersection<'_, T, S>ⓘNotable traits for Intersection<'a, T, S>impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Intersection<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
pub fn clone(&self) -> Difference<'_, T, S>ⓘNotable traits for Difference<'a, T, S>impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'a, T, S> Iterator for Difference<'a, T, S> where
T: Eq + Hash,
S: BuildHasher, type Item = &'a T;
impl<'_, K> Clone for Iter<'_, K>
impl<'_, K> Clone for Iter<'_, K>
impl<'_, K, V> Clone for Values<'_, K, V>
impl<'_, K, V> Clone for Values<'_, K, V>
impl<T> Clone for RawIter<T>
impl<T> Clone for RawIter<T>
pub fn clone(&self) -> HashMap<K, V, S, A>
pub fn clone_from(&mut self, source: &HashMap<K, V, S, A>)
pub fn clone(&self) -> HashSet<T, S, A>
pub fn clone_from(&mut self, source: &HashSet<T, S, A>)
pub fn clone(&self) -> RawTable<T, A>
pub fn clone_from(&mut self, source: &RawTable<T, A>)
impl<'_, K, V> Clone for Keys<'_, K, V>
impl<'_, K, V> Clone for Keys<'_, K, V>
impl<'_, K, V> Clone for Iter<'_, K, V>
impl<'_, K, V> Clone for Iter<'_, K, V>
impl<R, Program, Offset> Clone for LineRows<R, Program, Offset> where
R: Clone + Reader<Offset = Offset>,
Program: Clone + LineProgram<R, Offset>,
Offset: Clone + ReaderOffset,
impl<R, Program, Offset> Clone for LineRows<R, Program, Offset> where
R: Clone + Reader<Offset = Offset>,
Program: Clone + LineProgram<R, Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for UnitHeader<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for UnitHeader<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for AttributeValue<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for AttributeValue<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for CompleteLineProgram<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for CompleteLineProgram<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<'bases, Section, R> Clone for CfiEntriesIter<'bases, Section, R> where
Section: Clone + UnwindSection<R>,
R: Clone + Reader,
impl<'bases, Section, R> Clone for CfiEntriesIter<'bases, Section, R> where
Section: Clone + UnwindSection<R>,
R: Clone + Reader,
impl<R, Offset> Clone for IncompleteLineProgram<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<R, Offset> Clone for IncompleteLineProgram<R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<'abbrev, 'unit, R, Offset> Clone for DebuggingInformationEntry<'abbrev, 'unit, R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
impl<'abbrev, 'unit, R, Offset> Clone for DebuggingInformationEntry<'abbrev, 'unit, R, Offset> where
R: Clone + Reader<Offset = Offset>,
Offset: Clone + ReaderOffset,
pub fn clone(&self) -> RegisterRuleIter<'iter, R>ⓘNotable traits for RegisterRuleIter<'iter, R>impl<'iter, R> Iterator for RegisterRuleIter<'iter, R> where
R: Reader, type Item = &'iter (Register, RegisterRule<R>);
impl<'iter, R> Iterator for RegisterRuleIter<'iter, R> where
R: Reader, type Item = &'iter (Register, RegisterRule<R>);