Struct tract_pulse::internal::Arc 1.0.0[−][src]
pub struct Arc<T> where
T: ?Sized, { /* fields omitted */ }Expand description
A thread-safe reference-counting pointer. ‘Arc’ stands for ‘Atomically Reference Counted’.
The type Arc<T> provides shared ownership of a value of type T,
allocated in the heap. Invoking clone on Arc produces
a new Arc instance, which points to the same allocation on the heap as the
source Arc, while increasing a reference count. When the last Arc
pointer to a given allocation is destroyed, the value stored in that allocation (often
referred to as “inner value”) is also dropped.
Shared references in Rust disallow mutation by default, and Arc is no
exception: you cannot generally obtain a mutable reference to something
inside an Arc. If you need to mutate through an Arc, use
Mutex, RwLock, or one of the Atomic
types.
Thread Safety
Unlike Rc<T>, Arc<T> uses atomic operations for its reference
counting. This means that it is thread-safe. The disadvantage is that
atomic operations are more expensive than ordinary memory accesses. If you
are not sharing reference-counted allocations between threads, consider using
Rc<T> for lower overhead. Rc<T> is a safe default, because the
compiler will catch any attempt to send an Rc<T> between threads.
However, a library might choose Arc<T> in order to give library consumers
more flexibility.
Arc<T> will implement Send and Sync as long as the T implements
Send and Sync. Why can’t you put a non-thread-safe type T in an
Arc<T> to make it thread-safe? This may be a bit counter-intuitive at
first: after all, isn’t the point of Arc<T> thread safety? The key is
this: Arc<T> makes it thread safe to have multiple ownership of the same
data, but it doesn’t add thread safety to its data. Consider
Arc<RefCell<T>>. RefCell<T> isn’t Sync, and if Arc<T> was always
Send, Arc<RefCell<T>> would be as well. But then we’d have a problem:
RefCell<T> is not thread safe; it keeps track of the borrowing count using
non-atomic operations.
In the end, this means that you may need to pair Arc<T> with some sort of
std::sync type, usually Mutex<T>.
Breaking cycles with Weak
The downgrade method can be used to create a non-owning
Weak pointer. A Weak pointer can be upgraded
to an Arc, but this will return None if the value stored in the allocation has
already been dropped. In other words, Weak pointers do not keep the value
inside the allocation alive; however, they do keep the allocation
(the backing store for the value) alive.
A cycle between Arc pointers will never be deallocated. For this reason,
Weak is used to break cycles. For example, a tree could have
strong Arc pointers from parent nodes to children, and Weak
pointers from children back to their parents.
Cloning references
Creating a new reference from an existing reference-counted pointer is done using the
Clone trait implemented for Arc<T> and Weak<T>.
use std::sync::Arc; let foo = Arc::new(vec![1.0, 2.0, 3.0]); // The two syntaxes below are equivalent. let a = foo.clone(); let b = Arc::clone(&foo); // a, b, and foo are all Arcs that point to the same memory location
Deref behavior
Arc<T> automatically dereferences to T (via the Deref trait),
so you can call T’s methods on a value of type Arc<T>. To avoid name
clashes with T’s methods, the methods of Arc<T> itself are associated
functions, called using fully qualified syntax:
use std::sync::Arc; let my_arc = Arc::new(()); Arc::downgrade(&my_arc);
Arc<T>’s implementations of traits like Clone may also be called using
fully qualified syntax. Some people prefer to use fully qualified syntax,
while others prefer using method-call syntax.
use std::sync::Arc; let arc = Arc::new(()); // Method-call syntax let arc2 = arc.clone(); // Fully qualified syntax let arc3 = Arc::clone(&arc);
Weak<T> does not auto-dereference to T, because the inner value may have
already been dropped.
Examples
Sharing some immutable data between threads:
use std::sync::Arc; use std::thread; let five = Arc::new(5); for _ in 0..10 { let five = Arc::clone(&five); thread::spawn(move || { println!("{:?}", five); }); }
Sharing a mutable AtomicUsize:
use std::sync::Arc; use std::sync::atomic::{AtomicUsize, Ordering}; use std::thread; let val = Arc::new(AtomicUsize::new(5)); for _ in 0..10 { let val = Arc::clone(&val); thread::spawn(move || { let v = val.fetch_add(1, Ordering::SeqCst); println!("{:?}", v); }); }
See the rc documentation for more examples of reference
counting in general.
Implementations
impl<T> Arc<T>[src]
impl<T> Arc<T>[src]pub fn new_cyclic(data_fn: impl FnOnce(&Weak<T>) -> T) -> Arc<T>[src]
🔬 This is a nightly-only experimental API. (arc_new_cyclic)
pub fn new_cyclic(data_fn: impl FnOnce(&Weak<T>) -> T) -> Arc<T>[src]arc_new_cyclic)Constructs a new Arc<T> using a weak reference to itself. Attempting
to upgrade the weak reference before this function returns will result
in a None value. However, the weak reference may be cloned freely and
stored for use at a later time.
Examples
#![feature(arc_new_cyclic)] #![allow(dead_code)] use std::sync::{Arc, Weak}; struct Foo { me: Weak<Foo>, } let foo = Arc::new_cyclic(|me| Foo { me: me.clone(), });
pub fn new_uninit() -> Arc<MaybeUninit<T>>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub fn new_uninit() -> Arc<MaybeUninit<T>>[src]new_uninit)Constructs a new Arc with uninitialized contents.
Examples
#![feature(new_uninit)] #![feature(get_mut_unchecked)] use std::sync::Arc; let mut five = Arc::<u32>::new_uninit(); let five = unsafe { // Deferred initialization: Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5); five.assume_init() }; assert_eq!(*five, 5)
pub fn new_zeroed() -> Arc<MaybeUninit<T>>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub fn new_zeroed() -> Arc<MaybeUninit<T>>[src]new_uninit)Constructs a new Arc with uninitialized contents, with the memory
being filled with 0 bytes.
See MaybeUninit::zeroed for examples of correct and incorrect usage
of this method.
Examples
#![feature(new_uninit)] use std::sync::Arc; let zero = Arc::<u32>::new_zeroed(); let zero = unsafe { zero.assume_init() }; assert_eq!(*zero, 0)
pub fn pin(data: T) -> Pin<Arc<T>>ⓘ1.33.0[src]
pub fn pin(data: T) -> Pin<Arc<T>>ⓘ1.33.0[src]Constructs a new Pin<Arc<T>>. If T does not implement Unpin, then
data will be pinned in memory and unable to be moved.
pub fn try_new(data: T) -> Result<Arc<T>, AllocError>[src]
🔬 This is a nightly-only experimental API. (allocator_api)
pub fn try_new(data: T) -> Result<Arc<T>, AllocError>[src]allocator_api)Constructs a new Arc<T>, returning an error if allocation fails.
Examples
#![feature(allocator_api)] use std::sync::Arc; let five = Arc::try_new(5)?;
pub fn try_new_uninit() -> Result<Arc<MaybeUninit<T>>, AllocError>[src]
🔬 This is a nightly-only experimental API. (allocator_api)
pub fn try_new_uninit() -> Result<Arc<MaybeUninit<T>>, AllocError>[src]allocator_api)Constructs a new Arc with uninitialized contents, returning an error
if allocation fails.
Examples
#![feature(new_uninit, allocator_api)] #![feature(get_mut_unchecked)] use std::sync::Arc; let mut five = Arc::<u32>::try_new_uninit()?; let five = unsafe { // Deferred initialization: Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5); five.assume_init() }; assert_eq!(*five, 5);
pub fn try_new_zeroed() -> Result<Arc<MaybeUninit<T>>, AllocError>[src]
🔬 This is a nightly-only experimental API. (allocator_api)
pub fn try_new_zeroed() -> Result<Arc<MaybeUninit<T>>, AllocError>[src]allocator_api)Constructs a new Arc with uninitialized contents, with the memory
being filled with 0 bytes, returning an error if allocation fails.
See MaybeUninit::zeroed for examples of correct and incorrect usage
of this method.
Examples
#![feature(new_uninit, allocator_api)] use std::sync::Arc; let zero = Arc::<u32>::try_new_zeroed()?; let zero = unsafe { zero.assume_init() }; assert_eq!(*zero, 0);
pub fn try_unwrap(this: Arc<T>) -> Result<T, Arc<T>>1.4.0[src]
pub fn try_unwrap(this: Arc<T>) -> Result<T, Arc<T>>1.4.0[src]Returns the inner value, if the Arc has exactly one strong reference.
Otherwise, an Err is returned with the same Arc that was
passed in.
This will succeed even if there are outstanding weak references.
Examples
use std::sync::Arc; let x = Arc::new(3); assert_eq!(Arc::try_unwrap(x), Ok(3)); let x = Arc::new(4); let _y = Arc::clone(&x); assert_eq!(*Arc::try_unwrap(x).unwrap_err(), 4);
impl<T> Arc<[T]>[src]
impl<T> Arc<[T]>[src]pub fn new_uninit_slice(len: usize) -> Arc<[MaybeUninit<T>]>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub fn new_uninit_slice(len: usize) -> Arc<[MaybeUninit<T>]>[src]new_uninit)Constructs a new atomically reference-counted slice with uninitialized contents.
Examples
#![feature(new_uninit)] #![feature(get_mut_unchecked)] use std::sync::Arc; let mut values = Arc::<[u32]>::new_uninit_slice(3); let values = unsafe { // Deferred initialization: Arc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1); Arc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2); Arc::get_mut_unchecked(&mut values)[2].as_mut_ptr().write(3); values.assume_init() }; assert_eq!(*values, [1, 2, 3])
pub fn new_zeroed_slice(len: usize) -> Arc<[MaybeUninit<T>]>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub fn new_zeroed_slice(len: usize) -> Arc<[MaybeUninit<T>]>[src]new_uninit)Constructs a new atomically reference-counted slice with uninitialized contents, with the memory being
filled with 0 bytes.
See MaybeUninit::zeroed for examples of correct and
incorrect usage of this method.
Examples
#![feature(new_uninit)] use std::sync::Arc; let values = Arc::<[u32]>::new_zeroed_slice(3); let values = unsafe { values.assume_init() }; assert_eq!(*values, [0, 0, 0])
impl<T> Arc<MaybeUninit<T>>[src]
impl<T> Arc<MaybeUninit<T>>[src]pub unsafe fn assume_init(self) -> Arc<T>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub unsafe fn assume_init(self) -> Arc<T>[src]new_uninit)Converts to Arc<T>.
Safety
As with MaybeUninit::assume_init,
it is up to the caller to guarantee that the inner value
really is in an initialized state.
Calling this when the content is not yet fully initialized
causes immediate undefined behavior.
Examples
#![feature(new_uninit)] #![feature(get_mut_unchecked)] use std::sync::Arc; let mut five = Arc::<u32>::new_uninit(); let five = unsafe { // Deferred initialization: Arc::get_mut_unchecked(&mut five).as_mut_ptr().write(5); five.assume_init() }; assert_eq!(*five, 5)
impl<T> Arc<[MaybeUninit<T>]>[src]
impl<T> Arc<[MaybeUninit<T>]>[src]pub unsafe fn assume_init(self) -> Arc<[T]>[src]
🔬 This is a nightly-only experimental API. (new_uninit)
pub unsafe fn assume_init(self) -> Arc<[T]>[src]new_uninit)Converts to Arc<[T]>.
Safety
As with MaybeUninit::assume_init,
it is up to the caller to guarantee that the inner value
really is in an initialized state.
Calling this when the content is not yet fully initialized
causes immediate undefined behavior.
Examples
#![feature(new_uninit)] #![feature(get_mut_unchecked)] use std::sync::Arc; let mut values = Arc::<[u32]>::new_uninit_slice(3); let values = unsafe { // Deferred initialization: Arc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1); Arc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2); Arc::get_mut_unchecked(&mut values)[2].as_mut_ptr().write(3); values.assume_init() }; assert_eq!(*values, [1, 2, 3])
impl<T> Arc<T> where
T: ?Sized, [src]
impl<T> Arc<T> where
T: ?Sized, [src]pub fn into_raw(this: Arc<T>) -> *const T1.17.0[src]
pub fn into_raw(this: Arc<T>) -> *const T1.17.0[src]Consumes the Arc, returning the wrapped pointer.
To avoid a memory leak the pointer must be converted back to an Arc using
Arc::from_raw.
Examples
use std::sync::Arc; let x = Arc::new("hello".to_owned()); let x_ptr = Arc::into_raw(x); assert_eq!(unsafe { &*x_ptr }, "hello");
pub fn as_ptr(this: &Arc<T>) -> *const T1.45.0[src]
pub fn as_ptr(this: &Arc<T>) -> *const T1.45.0[src]Provides a raw pointer to the data.
The counts are not affected in any way and the Arc is not consumed. The pointer is valid for
as long as there are strong counts in the Arc.
Examples
use std::sync::Arc; let x = Arc::new("hello".to_owned()); let y = Arc::clone(&x); let x_ptr = Arc::as_ptr(&x); assert_eq!(x_ptr, Arc::as_ptr(&y)); assert_eq!(unsafe { &*x_ptr }, "hello");
pub unsafe fn from_raw(ptr: *const T) -> Arc<T>1.17.0[src]
pub unsafe fn from_raw(ptr: *const T) -> Arc<T>1.17.0[src]Constructs an Arc<T> from a raw pointer.
The raw pointer must have been previously returned by a call to
Arc<U>::into_raw where U must have the same size and
alignment as T. This is trivially true if U is T.
Note that if U is not T but has the same size and alignment, this is
basically like transmuting references of different types. See
mem::transmute for more information on what
restrictions apply in this case.
The user of from_raw has to make sure a specific value of T is only
dropped once.
This function is unsafe because improper use may lead to memory unsafety,
even if the returned Arc<T> is never accessed.
Examples
use std::sync::Arc; let x = Arc::new("hello".to_owned()); let x_ptr = Arc::into_raw(x); unsafe { // Convert back to an `Arc` to prevent leak. let x = Arc::from_raw(x_ptr); assert_eq!(&*x, "hello"); // Further calls to `Arc::from_raw(x_ptr)` would be memory-unsafe. } // The memory was freed when `x` went out of scope above, so `x_ptr` is now dangling!
pub fn weak_count(this: &Arc<T>) -> usize1.15.0[src]
pub fn weak_count(this: &Arc<T>) -> usize1.15.0[src]Gets the number of Weak pointers to this allocation.
Safety
This method by itself is safe, but using it correctly requires extra care. Another thread can change the weak count at any time, including potentially between calling this method and acting on the result.
Examples
use std::sync::Arc; let five = Arc::new(5); let _weak_five = Arc::downgrade(&five); // This assertion is deterministic because we haven't shared // the `Arc` or `Weak` between threads. assert_eq!(1, Arc::weak_count(&five));
pub fn strong_count(this: &Arc<T>) -> usize1.15.0[src]
pub fn strong_count(this: &Arc<T>) -> usize1.15.0[src]Gets the number of strong (Arc) pointers to this allocation.
Safety
This method by itself is safe, but using it correctly requires extra care. Another thread can change the strong count at any time, including potentially between calling this method and acting on the result.
Examples
use std::sync::Arc; let five = Arc::new(5); let _also_five = Arc::clone(&five); // This assertion is deterministic because we haven't shared // the `Arc` between threads. assert_eq!(2, Arc::strong_count(&five));
pub unsafe fn increment_strong_count(ptr: *const T)1.51.0[src]
pub unsafe fn increment_strong_count(ptr: *const T)1.51.0[src]Increments the strong reference count on the Arc<T> associated with the
provided pointer by one.
Safety
The pointer must have been obtained through Arc::into_raw, and the
associated Arc instance must be valid (i.e. the strong count must be at
least 1) for the duration of this method.
Examples
use std::sync::Arc; let five = Arc::new(5); unsafe { let ptr = Arc::into_raw(five); Arc::increment_strong_count(ptr); // This assertion is deterministic because we haven't shared // the `Arc` between threads. let five = Arc::from_raw(ptr); assert_eq!(2, Arc::strong_count(&five)); }
pub unsafe fn decrement_strong_count(ptr: *const T)1.51.0[src]
pub unsafe fn decrement_strong_count(ptr: *const T)1.51.0[src]Decrements the strong reference count on the Arc<T> associated with the
provided pointer by one.
Safety
The pointer must have been obtained through Arc::into_raw, and the
associated Arc instance must be valid (i.e. the strong count must be at
least 1) when invoking this method. This method can be used to release the final
Arc and backing storage, but should not be called after the final Arc has been
released.
Examples
use std::sync::Arc; let five = Arc::new(5); unsafe { let ptr = Arc::into_raw(five); Arc::increment_strong_count(ptr); // Those assertions are deterministic because we haven't shared // the `Arc` between threads. let five = Arc::from_raw(ptr); assert_eq!(2, Arc::strong_count(&five)); Arc::decrement_strong_count(ptr); assert_eq!(1, Arc::strong_count(&five)); }
impl<T> Arc<T> where
T: Clone, [src]
impl<T> Arc<T> where
T: Clone, [src]pub fn make_mut(this: &mut Arc<T>) -> &mut T1.4.0[src]
pub fn make_mut(this: &mut Arc<T>) -> &mut T1.4.0[src]Makes a mutable reference into the given Arc.
If there are other Arc or Weak pointers to the same allocation,
then make_mut will create a new allocation and invoke clone on the inner value
to ensure unique ownership. This is also referred to as clone-on-write.
Note that this differs from the behavior of Rc::make_mut which disassociates
any remaining Weak pointers.
See also get_mut, which will fail rather than cloning.
Examples
use std::sync::Arc; let mut data = Arc::new(5); *Arc::make_mut(&mut data) += 1; // Won't clone anything let mut other_data = Arc::clone(&data); // Won't clone inner data *Arc::make_mut(&mut data) += 1; // Clones inner data *Arc::make_mut(&mut data) += 1; // Won't clone anything *Arc::make_mut(&mut other_data) *= 2; // Won't clone anything // Now `data` and `other_data` point to different allocations. assert_eq!(*data, 8); assert_eq!(*other_data, 12);
impl<T> Arc<T> where
T: ?Sized, [src]
impl<T> Arc<T> where
T: ?Sized, [src]pub fn get_mut(this: &mut Arc<T>) -> Option<&mut T>1.4.0[src]
pub fn get_mut(this: &mut Arc<T>) -> Option<&mut T>1.4.0[src]Returns a mutable reference into the given Arc, if there are
no other Arc or Weak pointers to the same allocation.
Returns None otherwise, because it is not safe to
mutate a shared value.
See also make_mut, which will clone
the inner value when there are other pointers.
Examples
use std::sync::Arc; let mut x = Arc::new(3); *Arc::get_mut(&mut x).unwrap() = 4; assert_eq!(*x, 4); let _y = Arc::clone(&x); assert!(Arc::get_mut(&mut x).is_none());
pub unsafe fn get_mut_unchecked(this: &mut Arc<T>) -> &mut T[src]
🔬 This is a nightly-only experimental API. (get_mut_unchecked)
pub unsafe fn get_mut_unchecked(this: &mut Arc<T>) -> &mut T[src]get_mut_unchecked)Returns a mutable reference into the given Arc,
without any check.
See also get_mut, which is safe and does appropriate checks.
Safety
Any other Arc or Weak pointers to the same allocation must not be dereferenced
for the duration of the returned borrow.
This is trivially the case if no such pointers exist,
for example immediately after Arc::new.
Examples
#![feature(get_mut_unchecked)] use std::sync::Arc; let mut x = Arc::new(String::new()); unsafe { Arc::get_mut_unchecked(&mut x).push_str("foo") } assert_eq!(*x, "foo");
impl Arc<dyn Any + 'static + Sync + Send>[src]
impl Arc<dyn Any + 'static + Sync + Send>[src]pub fn downcast<T>(self) -> Result<Arc<T>, Arc<dyn Any + 'static + Sync + Send>> where
T: Any + Send + Sync + 'static, 1.29.0[src]
pub fn downcast<T>(self) -> Result<Arc<T>, Arc<dyn Any + 'static + Sync + Send>> where
T: Any + Send + Sync + 'static, 1.29.0[src]Attempt to downcast the Arc<dyn Any + Send + Sync> to a concrete type.
Examples
use std::any::Any; use std::sync::Arc; fn print_if_string(value: Arc<dyn Any + Send + Sync>) { if let Ok(string) = value.downcast::<String>() { println!("String ({}): {}", string.len(), string); } } let my_string = "Hello World".to_string(); print_if_string(Arc::new(my_string)); print_if_string(Arc::new(0i8));
Trait Implementations
impl<T> Clone for Arc<T> where
T: ?Sized, [src]
impl<T> Clone for Arc<T> where
T: ?Sized, [src]pub fn clone(&self) -> Arc<T>[src]
pub fn clone(&self) -> Arc<T>[src]Makes a clone of the Arc pointer.
This creates another pointer to the same allocation, increasing the strong reference count.
Examples
use std::sync::Arc; let five = Arc::new(5); let _ = Arc::clone(&five);
fn clone_from(&mut self, source: &Self)[src]
fn clone_from(&mut self, source: &Self)[src]Performs copy-assignment from source. Read more
impl<T> Drop for Arc<T> where
T: ?Sized, [src]
impl<T> Drop for Arc<T> where
T: ?Sized, [src]pub fn drop(&mut self)[src]
pub fn drop(&mut self)[src]Drops the Arc.
This will decrement the strong reference count. If the strong reference
count reaches zero then the only other references (if any) are
Weak, so we drop the inner value.
Examples
use std::sync::Arc; struct Foo; impl Drop for Foo { fn drop(&mut self) { println!("dropped!"); } } let foo = Arc::new(Foo); let foo2 = Arc::clone(&foo); drop(foo); // Doesn't print anything drop(foo2); // Prints "dropped!"
impl<T> Error for Arc<T> where
T: Error + ?Sized, 1.52.0[src]
impl<T> Error for Arc<T> where
T: Error + ?Sized, 1.52.0[src]pub fn description(&self) -> &str[src]
pub fn description(&self) -> &str[src]use the Display impl or to_string()
pub fn cause(&self) -> Option<&dyn Error>[src]
pub fn cause(&self) -> Option<&dyn Error>[src]replaced by Error::source, which can support downcasting
impl<'a> From<&'a Arc<Tensor>> for AttrOrInput
impl<'a> From<&'a Arc<Tensor>> for AttrOrInputpub fn from(t: &'a Arc<Tensor>) -> AttrOrInput
pub fn from(t: &'a Arc<Tensor>) -> AttrOrInputPerforms the conversion.
impl From<Arc<Tensor>> for AttrOrInput
impl From<Arc<Tensor>> for AttrOrInputpub fn from(t: Arc<Tensor>) -> AttrOrInput
pub fn from(t: Arc<Tensor>) -> AttrOrInputPerforms the conversion.
impl<'a, B> From<Cow<'a, B>> for Arc<B> where
B: ToOwned + ?Sized,
Arc<B>: From<&'a B>,
Arc<B>: From<<B as ToOwned>::Owned>, 1.45.0[src]
impl<'a, B> From<Cow<'a, B>> for Arc<B> where
B: ToOwned + ?Sized,
Arc<B>: From<&'a B>,
Arc<B>: From<<B as ToOwned>::Owned>, 1.45.0[src]impl<T> FromIterator<T> for Arc<[T]>1.37.0[src]
impl<T> FromIterator<T> for Arc<[T]>1.37.0[src]pub fn from_iter<I>(iter: I) -> Arc<[T]> where
I: IntoIterator<Item = T>, [src]
pub fn from_iter<I>(iter: I) -> Arc<[T]> where
I: IntoIterator<Item = T>, [src]Takes each element in the Iterator and collects it into an Arc<[T]>.
Performance characteristics
The general case
In the general case, collecting into Arc<[T]> is done by first
collecting into a Vec<T>. That is, when writing the following:
let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0).collect();
this behaves as if we wrote:
let evens: Arc<[u8]> = (0..10).filter(|&x| x % 2 == 0) .collect::<Vec<_>>() // The first set of allocations happens here. .into(); // A second allocation for `Arc<[T]>` happens here.
This will allocate as many times as needed for constructing the Vec<T>
and then it will allocate once for turning the Vec<T> into the Arc<[T]>.
Iterators of known length
When your Iterator implements TrustedLen and is of an exact size,
a single allocation will be made for the Arc<[T]>. For example:
let evens: Arc<[u8]> = (0..10).collect(); // Just a single allocation happens here.
impl IntoArcTensor for Arc<Tensor>
impl IntoArcTensor for Arc<Tensor>pub fn into_arc_tensor(self) -> Arc<Tensor>
pub fn into_arc_tensor(self) -> Arc<Tensor>Convert Self to a Arc
impl IntoTensor for Arc<Tensor>
impl IntoTensor for Arc<Tensor>pub fn into_tensor(self) -> Tensor
pub fn into_tensor(self) -> TensorConvert Self to a Tensor. Read more
impl<T> Ord for Arc<T> where
T: Ord + ?Sized, [src]
impl<T> Ord for Arc<T> where
T: Ord + ?Sized, [src]pub fn cmp(&self, other: &Arc<T>) -> Ordering[src]
pub fn cmp(&self, other: &Arc<T>) -> Ordering[src]Comparison for two Arcs.
The two are compared by calling cmp() on their inner values.
Examples
use std::sync::Arc; use std::cmp::Ordering; let five = Arc::new(5); assert_eq!(Ordering::Less, five.cmp(&Arc::new(6)));
impl<T> PartialEq<Arc<T>> for Arc<T> where
T: PartialEq<T> + ?Sized, [src]
impl<T> PartialEq<Arc<T>> for Arc<T> where
T: PartialEq<T> + ?Sized, [src]pub fn eq(&self, other: &Arc<T>) -> bool[src]
pub fn eq(&self, other: &Arc<T>) -> bool[src]Equality for two Arcs.
Two Arcs are equal if their inner values are equal, even if they are
stored in different allocation.
If T also implements Eq (implying reflexivity of equality),
two Arcs that point to the same allocation are always equal.
Examples
use std::sync::Arc; let five = Arc::new(5); assert!(five == Arc::new(5));
pub fn ne(&self, other: &Arc<T>) -> bool[src]
pub fn ne(&self, other: &Arc<T>) -> bool[src]Inequality for two Arcs.
Two Arcs are unequal if their inner values are unequal.
If T also implements Eq (implying reflexivity of equality),
two Arcs that point to the same value are never unequal.
Examples
use std::sync::Arc; let five = Arc::new(5); assert!(five != Arc::new(6));
impl<T> PartialOrd<Arc<T>> for Arc<T> where
T: PartialOrd<T> + ?Sized, [src]
impl<T> PartialOrd<Arc<T>> for Arc<T> where
T: PartialOrd<T> + ?Sized, [src]pub fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering>[src]
pub fn partial_cmp(&self, other: &Arc<T>) -> Option<Ordering>[src]Partial comparison for two Arcs.
The two are compared by calling partial_cmp() on their inner values.
Examples
use std::sync::Arc; use std::cmp::Ordering; let five = Arc::new(5); assert_eq!(Some(Ordering::Less), five.partial_cmp(&Arc::new(6)));
pub fn lt(&self, other: &Arc<T>) -> bool[src]
pub fn lt(&self, other: &Arc<T>) -> bool[src]Less-than comparison for two Arcs.
The two are compared by calling < on their inner values.
Examples
use std::sync::Arc; let five = Arc::new(5); assert!(five < Arc::new(6));
pub fn le(&self, other: &Arc<T>) -> bool[src]
pub fn le(&self, other: &Arc<T>) -> bool[src]‘Less than or equal to’ comparison for two Arcs.
The two are compared by calling <= on their inner values.
Examples
use std::sync::Arc; let five = Arc::new(5); assert!(five <= Arc::new(5));
impl<T, U> CoerceUnsized<Arc<U>> for Arc<T> where
T: Unsize<U> + ?Sized,
U: ?Sized, [src]
T: Unsize<U> + ?Sized,
U: ?Sized,
impl<T, U> DispatchFromDyn<Arc<U>> for Arc<T> where
T: Unsize<U> + ?Sized,
U: ?Sized, [src]
T: Unsize<U> + ?Sized,
U: ?Sized,
impl<T> Eq for Arc<T> where
T: Eq + ?Sized, [src]
T: Eq + ?Sized,
impl<T> Send for Arc<T> where
T: Sync + Send + ?Sized, [src]
T: Sync + Send + ?Sized,
impl<T> Sync for Arc<T> where
T: Sync + Send + ?Sized, [src]
T: Sync + Send + ?Sized,
impl<T> Unpin for Arc<T> where
T: ?Sized, 1.33.0[src]
T: ?Sized,
impl<T> UnwindSafe for Arc<T> where
T: RefUnwindSafe + ?Sized, 1.9.0[src]
T: RefUnwindSafe + ?Sized,
Auto Trait Implementations
impl<T: ?Sized> RefUnwindSafe for Arc<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<A, T> AsBits<T> for A where
T: BitStore + BitRegister,
A: AsRef<[T]>,
impl<A, T> AsBits<T> for A where
T: BitStore + BitRegister,
A: AsRef<[T]>, impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]pub fn borrow_mut(&mut self) -> &mut T[src]
pub fn borrow_mut(&mut self) -> &mut T[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any, [src]
impl<T> Downcast for T where
T: Any, [src]pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>ⓘNotable traits for Box<R, Global>
impl<R> Read for Box<R, Global> where
R: Read + ?Sized, impl<W> Write for Box<W, Global> where
W: Write + ?Sized, impl<F, A> Future for Box<F, A> where
A: Allocator + 'static,
F: Future + Unpin + ?Sized, type Output = <F as Future>::Output;impl<I, A> Iterator for Box<I, A> where
A: Allocator,
I: Iterator + ?Sized, type Item = <I as Iterator>::Item;[src]Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>[src]
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>[src]Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more
pub fn as_any(&self) -> &(dyn Any + 'static)[src]
pub fn as_any(&self) -> &(dyn Any + 'static)[src]Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)[src]
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)[src]Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s. Read more
impl<T> DowncastSync for T where
T: Any + Send + Sync, [src]
impl<T> DowncastSync for T where
T: Any + Send + Sync, [src]impl<T> FmtForward for T
impl<T> FmtForward for Tfn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary, Causes self to use its Binary implementation when Debug-formatted.
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display, Causes self to use its Display implementation when
Debug-formatted. Read more
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp, Causes self to use its LowerExp implementation when
Debug-formatted. Read more
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex, Causes self to use its LowerHex implementation when
Debug-formatted. Read more
fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self> where
Self: Octal, Causes self to use its Octal implementation when Debug-formatted.
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer, Causes self to use its Pointer implementation when
Debug-formatted. Read more
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp, Causes self to use its UpperExp implementation when
Debug-formatted. Read more
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex, Causes self to use its UpperHex implementation when
Debug-formatted. Read more
impl<T> Pipe for T where
T: ?Sized,
impl<T> Pipe for T where
T: ?Sized, fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> RPipes by value. This is generally the method you want to use. Read more
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R where
R: 'a, Borrows self and passes that borrow into the pipe function. Read more
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a, Mutably borrows self and passes that borrow into the pipe function. Read more
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a, Borrows self, then passes self.borrow() into the pipe function. Read more
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a, Mutably borrows self, then passes self.borrow_mut() into the pipe
function. Read more
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized, Borrows self, then passes self.as_ref() into the pipe function.
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized, Mutably borrows self, then passes self.as_mut() into the pipe
function. Read more
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a,
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a, Borrows self, then passes self.deref() into the pipe function.
impl<T> PipeAsRef for T
impl<T> PipeAsRef for Tfn pipe_as_ref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: AsRef<T>,
T: 'a,
R: 'a,
fn pipe_as_ref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: AsRef<T>,
T: 'a,
R: 'a, Pipes a trait borrow into a function that cannot normally be called in suffix position. Read more
fn pipe_as_mut<'a, T, R>(&'a mut self, func: impl FnOnce(&'a mut T) -> R) -> R where
Self: AsMut<T>,
T: 'a,
R: 'a,
fn pipe_as_mut<'a, T, R>(&'a mut self, func: impl FnOnce(&'a mut T) -> R) -> R where
Self: AsMut<T>,
T: 'a,
R: 'a, Pipes a trait mutable borrow into a function that cannot normally be called in suffix position. Read more
impl<T> PipeBorrow for T
impl<T> PipeBorrow for Tfn pipe_borrow<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Borrow<T>,
T: 'a,
R: 'a,
fn pipe_borrow<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Borrow<T>,
T: 'a,
R: 'a, Pipes a trait borrow into a function that cannot normally be called in suffix position. Read more
fn pipe_borrow_mut<'a, T, R>(
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: BorrowMut<T>,
T: 'a,
R: 'a,
fn pipe_borrow_mut<'a, T, R>(
&'a mut self,
func: impl FnOnce(&'a mut T) -> R
) -> R where
Self: BorrowMut<T>,
T: 'a,
R: 'a, Pipes a trait mutable borrow into a function that cannot normally be called in suffix position. Read more
impl<T> PipeDeref for T
impl<T> PipeDeref for Tfn pipe_deref<'a, R>(&'a self, func: impl FnOnce(&'a Self::Target) -> R) -> R where
Self: Deref,
R: 'a,
fn pipe_deref<'a, R>(&'a self, func: impl FnOnce(&'a Self::Target) -> R) -> R where
Self: Deref,
R: 'a, Pipes a dereference into a function that cannot normally be called in suffix position. Read more
fn pipe_deref_mut<'a, R>(
&'a mut self,
func: impl FnOnce(&'a mut Self::Target) -> R
) -> R where
Self: DerefMut,
R: 'a,
fn pipe_deref_mut<'a, R>(
&'a mut self,
func: impl FnOnce(&'a mut Self::Target) -> R
) -> R where
Self: DerefMut,
R: 'a, Pipes a mutable dereference into a function that cannot normally be called in suffix position. Read more
impl<T> PipeRef for T
impl<T> PipeRef for Timpl<T> Tap for T
impl<T> Tap for Tfn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized, Immutable access to the Borrow<B> of a value. Read more
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized, Mutable access to the BorrowMut<B> of a value. Read more
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized, Immutable access to the AsRef<R> view of a value. Read more
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized, Mutable access to the AsMut<R> view of a value. Read more
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized,
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self where
Self: Deref<Target = T>,
T: ?Sized, Immutable access to the Deref::Target of a value. Read more
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized,
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self where
Self: DerefMut<Target = T> + Deref,
T: ?Sized, Mutable access to the Deref::Target of a value. Read more
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> SelfCalls .tap() only in debug builds, and is erased in release builds.
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> SelfCalls .tap_mut() only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized, Calls .tap_borrow() only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized, Calls .tap_borrow_mut() only in debug builds, and is erased in release
builds. Read more
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized, Calls .tap_ref() only in debug builds, and is erased in release
builds. Read more
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized, Calls .tap_ref_mut() only in debug builds, and is erased in release
builds. Read more
impl<T> Tap for T
impl<T> Tap for Tfn tap<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R,
fn tap<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R, Provides immutable access for inspection. Read more
fn tap_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R,
fn tap_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&Self) -> R, Calls tap in debug builds, and does nothing in release builds.
fn tap_mut<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R,
fn tap_mut<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R, Provides mutable access for modification. Read more
fn tap_mut_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R,
fn tap_mut_dbg<F, R>(self, func: F) -> Self where
F: FnOnce(&mut Self) -> R, Calls tap_mut in debug builds, and does nothing in release builds.
impl<T, U> TapAsRef<U> for T where
U: ?Sized,
impl<T, U> TapAsRef<U> for T where
U: ?Sized, fn tap_ref<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R,
fn tap_ref<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R, Provides immutable access to the reference for inspection.
fn tap_ref_dbg<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R,
fn tap_ref_dbg<F, R>(self, func: F) -> Self where
Self: AsRef<T>,
F: FnOnce(&T) -> R, Calls tap_ref in debug builds, and does nothing in release builds.
fn tap_ref_mut<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
fn tap_ref_mut<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R, Provides mutable access to the reference for modification.
fn tap_ref_mut_dbg<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R,
fn tap_ref_mut_dbg<F, R>(self, func: F) -> Self where
Self: AsMut<T>,
F: FnOnce(&mut T) -> R, Calls tap_ref_mut in debug builds, and does nothing in release builds.
impl<T, U> TapBorrow<U> for T where
U: ?Sized,
impl<T, U> TapBorrow<U> for T where
U: ?Sized, fn tap_borrow<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R,
fn tap_borrow<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R, Provides immutable access to the borrow for inspection. Read more
fn tap_borrow_dbg<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R,
fn tap_borrow_dbg<F, R>(self, func: F) -> Self where
Self: Borrow<T>,
F: FnOnce(&T) -> R, Calls tap_borrow in debug builds, and does nothing in release builds.
fn tap_borrow_mut<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
fn tap_borrow_mut<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R, Provides mutable access to the borrow for modification.
fn tap_borrow_mut_dbg<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R,
fn tap_borrow_mut_dbg<F, R>(self, func: F) -> Self where
Self: BorrowMut<T>,
F: FnOnce(&mut T) -> R, Calls tap_borrow_mut in debug builds, and does nothing in release
builds. Read more
impl<T> TapDeref for T
impl<T> TapDeref for Tfn tap_deref<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
fn tap_deref<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R, Immutably dereferences self for inspection.
fn tap_deref_dbg<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R,
fn tap_deref_dbg<F, R>(self, func: F) -> Self where
Self: Deref,
F: FnOnce(&Self::Target) -> R, Calls tap_deref in debug builds, and does nothing in release builds.
fn tap_deref_mut<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
fn tap_deref_mut<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R, Mutably dereferences self for modification.
fn tap_deref_mut_dbg<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R,
fn tap_deref_mut_dbg<F, R>(self, func: F) -> Self where
Self: DerefMut,
F: FnOnce(&mut Self::Target) -> R, Calls tap_deref_mut in debug builds, and does nothing in release
builds. Read more
impl<T> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more