On this page
Struct std::rc::Rc
pub struct Rc<T, A = Global>
where
A: Allocator,
T: ?Sized,{ /* private fields */ }
A single-threaded reference-counting pointer. ‘Rc’ stands for ‘Reference Counted’.
See the module-level documentation for more details.
The inherent methods of Rc
are all associated functions, which means that you have to call them as e.g., Rc::get_mut(&mut value)
instead of value.get_mut()
. This avoids conflicts with methods of the inner type T
.
Implementations
impl<T> Rc<T>
pub fn new(value: T) -> Rc<T>
Constructs a new Rc<T>
.
Examples
use std::rc::Rc;
let five = Rc::new(5);
pub fn new_cyclic<F>(data_fn: F) -> Rc<T>
where
F: FnOnce(&Weak<T>) -> T,
Constructs a new Rc<T>
while giving you a Weak<T>
to the allocation, to allow you to construct a T
which holds a weak pointer to itself.
Generally, a structure circularly referencing itself, either directly or indirectly, should not hold a strong reference to itself to prevent a memory leak. Using this function, you get access to the weak pointer during the initialization of T
, before the Rc<T>
is created, such that you can clone and store it inside the T
.
new_cyclic
first allocates the managed allocation for the Rc<T>
, then calls your closure, giving it a Weak<T>
to this allocation, and only afterwards completes the construction of the Rc<T>
by placing the T
returned from your closure into the allocation.
Since the new Rc<T>
is not fully-constructed until Rc<T>::new_cyclic
returns, calling upgrade
on the weak reference inside your closure will fail and result in a None
value.
Panics
If data_fn
panics, the panic is propagated to the caller, and the temporary Weak<T>
is dropped normally.
Examples
use std::rc::{Rc, Weak};
struct Gadget {
me: Weak<Gadget>,
}
impl Gadget {
/// Construct a reference counted Gadget.
fn new() -> Rc<Self> {
// `me` is a `Weak<Gadget>` pointing at the new allocation of the
// `Rc` we're constructing.
Rc::new_cyclic(|me| {
// Create the actual struct here.
Gadget { me: me.clone() }
})
}
/// Return a reference counted pointer to Self.
fn me(&self) -> Rc<Self> {
self.me.upgrade().unwrap()
}
}
pub fn new_uninit() -> Rc<MaybeUninit<T>>
new_uninit
#63291)
Constructs a new Rc
with uninitialized contents.
Examples
#![feature(new_uninit)]
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let mut five = Rc::<u32>::new_uninit();
// Deferred initialization:
Rc::get_mut(&mut five).unwrap().write(5);
let five = unsafe { five.assume_init() };
assert_eq!(*five, 5)
pub fn new_zeroed() -> Rc<MaybeUninit<T>>
new_uninit
#63291)
Constructs a new Rc
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::rc::Rc;
let zero = Rc::<u32>::new_zeroed();
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0)
pub fn try_new(value: T) -> Result<Rc<T>, AllocError>
allocator_api
#32838)
Constructs a new Rc<T>
, returning an error if the allocation fails
Examples
#![feature(allocator_api)]
use std::rc::Rc;
let five = Rc::try_new(5);
pub fn try_new_uninit() -> Result<Rc<MaybeUninit<T>>, AllocError>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents, returning an error if the allocation fails
Examples
#![feature(allocator_api, new_uninit)]
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let mut five = Rc::<u32>::try_new_uninit()?;
// Deferred initialization:
Rc::get_mut(&mut five).unwrap().write(5);
let five = unsafe { five.assume_init() };
assert_eq!(*five, 5);
pub fn try_new_zeroed() -> Result<Rc<MaybeUninit<T>>, AllocError>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents, with the memory being filled with 0
bytes, returning an error if the allocation fails
See MaybeUninit::zeroed
for examples of correct and incorrect usage of this method.
Examples
#![feature(allocator_api, new_uninit)]
use std::rc::Rc;
let zero = Rc::<u32>::try_new_zeroed()?;
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0);
pub fn pin(value: T) -> Pin<Rc<T>>
Constructs a new Pin<Rc<T>>
. If T
does not implement Unpin
, then value
will be pinned in memory and unable to be moved.
impl<T, A> Rc<T, A>
where
A: Allocator,
pub fn allocator(this: &Rc<T, A>) -> &A
allocator_api
#32838)
Returns a reference to the underlying allocator.
Note: this is an associated function, which means that you have to call it as Rc::allocator(&r)
instead of r.allocator()
. This is so that there is no conflict with a method on the inner type.
pub fn new_in(value: T, alloc: A) -> Rc<T, A>
allocator_api
#32838)
Constructs a new Rc
in the provided allocator.
Examples
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let five = Rc::new_in(5, System);
pub fn new_uninit_in(alloc: A) -> Rc<MaybeUninit<T>, A>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents in the provided allocator.
Examples
#![feature(new_uninit)]
#![feature(get_mut_unchecked)]
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let mut five = Rc::<u32, _>::new_uninit_in(System);
let five = unsafe {
// Deferred initialization:
Rc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);
five.assume_init()
};
assert_eq!(*five, 5)
pub fn new_zeroed_in(alloc: A) -> Rc<MaybeUninit<T>, A>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents, with the memory being filled with 0
bytes, in the provided allocator.
See MaybeUninit::zeroed
for examples of correct and incorrect usage of this method.
Examples
#![feature(new_uninit)]
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let zero = Rc::<u32, _>::new_zeroed_in(System);
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0)
pub fn try_new_in(value: T, alloc: A) -> Result<Rc<T, A>, AllocError>
allocator_api
#32838)
Constructs a new Rc<T>
in the provided allocator, returning an error if the allocation fails
Examples
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let five = Rc::try_new_in(5, System);
pub fn try_new_uninit_in(alloc: A) -> Result<Rc<MaybeUninit<T>, A>, AllocError>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents, in the provided allocator, returning an error if the allocation fails
Examples
#![feature(allocator_api, new_uninit)]
#![feature(get_mut_unchecked)]
use std::rc::Rc;
use std::alloc::System;
let mut five = Rc::<u32, _>::try_new_uninit_in(System)?;
let five = unsafe {
// Deferred initialization:
Rc::get_mut_unchecked(&mut five).as_mut_ptr().write(5);
five.assume_init()
};
assert_eq!(*five, 5);
pub fn try_new_zeroed_in(alloc: A) -> Result<Rc<MaybeUninit<T>, A>, AllocError>
allocator_api
#32838)
Constructs a new Rc
with uninitialized contents, with the memory being filled with 0
bytes, in the provided allocator, returning an error if the allocation fails
See MaybeUninit::zeroed
for examples of correct and incorrect usage of this method.
Examples
#![feature(allocator_api, new_uninit)]
use std::rc::Rc;
use std::alloc::System;
let zero = Rc::<u32, _>::try_new_zeroed_in(System)?;
let zero = unsafe { zero.assume_init() };
assert_eq!(*zero, 0);
pub fn pin_in(value: T, alloc: A) -> Pin<Rc<T, A>>
allocator_api
#32838)
Constructs a new Pin<Rc<T>>
in the provided allocator. If T
does not implement Unpin
, then value
will be pinned in memory and unable to be moved.
pub fn try_unwrap(this: Rc<T, A>) -> Result<T, Rc<T, A>>
Returns the inner value, if the Rc
has exactly one strong reference.
Otherwise, an Err
is returned with the same Rc
that was passed in.
This will succeed even if there are outstanding weak references.
Examples
use std::rc::Rc;
let x = Rc::new(3);
assert_eq!(Rc::try_unwrap(x), Ok(3));
let x = Rc::new(4);
let _y = Rc::clone(&x);
assert_eq!(*Rc::try_unwrap(x).unwrap_err(), 4);
pub fn into_inner(this: Rc<T, A>) -> Option<T>
Returns the inner value, if the Rc
has exactly one strong reference.
Otherwise, None
is returned and the Rc
is dropped.
This will succeed even if there are outstanding weak references.
If Rc::into_inner
is called on every clone of this Rc
, it is guaranteed that exactly one of the calls returns the inner value. This means in particular that the inner value is not dropped.
This is equivalent to Rc::try_unwrap(this).ok()
. (Note that these are not equivalent for Arc
, due to race conditions that do not apply to Rc
.)
impl<T> Rc<[T]>
pub fn new_uninit_slice(len: usize) -> Rc<[MaybeUninit<T>]>
new_uninit
#63291)
Constructs a new reference-counted slice with uninitialized contents.
Examples
#![feature(new_uninit)]
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let mut values = Rc::<[u32]>::new_uninit_slice(3);
// Deferred initialization:
let data = Rc::get_mut(&mut values).unwrap();
data[0].write(1);
data[1].write(2);
data[2].write(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [1, 2, 3])
pub fn new_zeroed_slice(len: usize) -> Rc<[MaybeUninit<T>]>
new_uninit
#63291)
Constructs a new 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::rc::Rc;
let values = Rc::<[u32]>::new_zeroed_slice(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0])
impl<T, A> Rc<[T], A>
where
A: Allocator,
pub fn new_uninit_slice_in(len: usize, alloc: A) -> Rc<[MaybeUninit<T>], A>
allocator_api
#32838)
Constructs a new reference-counted slice with uninitialized contents.
Examples
#![feature(new_uninit)]
#![feature(get_mut_unchecked)]
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let mut values = Rc::<[u32], _>::new_uninit_slice_in(3, System);
let values = unsafe {
// Deferred initialization:
Rc::get_mut_unchecked(&mut values)[0].as_mut_ptr().write(1);
Rc::get_mut_unchecked(&mut values)[1].as_mut_ptr().write(2);
Rc::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_in(len: usize, alloc: A) -> Rc<[MaybeUninit<T>], A>
allocator_api
#32838)
Constructs a new 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)]
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let values = Rc::<[u32], _>::new_zeroed_slice_in(3, System);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [0, 0, 0])
impl<T, A> Rc<MaybeUninit<T>, A>
where
A: Allocator,
pub unsafe fn assume_init(self) -> Rc<T, A>
where
A: Clone,
new_uninit
#63291)
Converts to Rc<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::rc::Rc;
let mut five = Rc::<u32>::new_uninit();
// Deferred initialization:
Rc::get_mut(&mut five).unwrap().write(5);
let five = unsafe { five.assume_init() };
assert_eq!(*five, 5)
impl<T, A> Rc<[MaybeUninit<T>], A>
where
A: Allocator,
pub unsafe fn assume_init(self) -> Rc<[T], A>
where
A: Clone,
new_uninit
#63291)
Converts to Rc<[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::rc::Rc;
let mut values = Rc::<[u32]>::new_uninit_slice(3);
// Deferred initialization:
let data = Rc::get_mut(&mut values).unwrap();
data[0].write(1);
data[1].write(2);
data[2].write(3);
let values = unsafe { values.assume_init() };
assert_eq!(*values, [1, 2, 3])
impl<T> Rc<T>
where
T: ?Sized,
pub unsafe fn from_raw(ptr: *const T) -> Rc<T>
Constructs an Rc<T>
from a raw pointer.
The raw pointer must have been previously returned by a call to Rc<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 raw pointer must point to a block of memory allocated by the global allocator
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 Rc<T>
is never accessed.
Examples
use std::rc::Rc;
let x = Rc::new("hello".to_owned());
let x_ptr = Rc::into_raw(x);
unsafe {
// Convert back to an `Rc` to prevent leak.
let x = Rc::from_raw(x_ptr);
assert_eq!(&*x, "hello");
// Further calls to `Rc::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 unsafe fn increment_strong_count(ptr: *const T)
Increments the strong reference count on the Rc<T>
associated with the provided pointer by one.
Safety
The pointer must have been obtained through Rc::into_raw
, the associated Rc
instance must be valid (i.e. the strong count must be at least 1) for the duration of this method, and ptr
must point to a block of memory allocated by the global allocator.
Examples
use std::rc::Rc;
let five = Rc::new(5);
unsafe {
let ptr = Rc::into_raw(five);
Rc::increment_strong_count(ptr);
let five = Rc::from_raw(ptr);
assert_eq!(2, Rc::strong_count(&five));
}
pub unsafe fn decrement_strong_count(ptr: *const T)
Decrements the strong reference count on the Rc<T>
associated with the provided pointer by one.
Safety
The pointer must have been obtained through Rc::into_raw
, the associated Rc
instance must be valid (i.e. the strong count must be at least 1) when invoking this method, and ptr
must point to a block of memory allocated by the global allocator. This method can be used to release the final Rc
and backing storage, but should not be called after the final Rc
has been released.
Examples
use std::rc::Rc;
let five = Rc::new(5);
unsafe {
let ptr = Rc::into_raw(five);
Rc::increment_strong_count(ptr);
let five = Rc::from_raw(ptr);
assert_eq!(2, Rc::strong_count(&five));
Rc::decrement_strong_count(ptr);
assert_eq!(1, Rc::strong_count(&five));
}
impl<T, A> Rc<T, A>
where
A: Allocator,
T: ?Sized,
pub fn into_raw(this: Rc<T, A>) -> *const T
Consumes the Rc
, returning the wrapped pointer.
To avoid a memory leak the pointer must be converted back to an Rc
using Rc::from_raw
.
Examples
use std::rc::Rc;
let x = Rc::new("hello".to_owned());
let x_ptr = Rc::into_raw(x);
assert_eq!(unsafe { &*x_ptr }, "hello");
pub fn as_ptr(this: &Rc<T, A>) -> *const T
Provides a raw pointer to the data.
The counts are not affected in any way and the Rc
is not consumed. The pointer is valid for as long there are strong counts in the Rc
.
Examples
use std::rc::Rc;
let x = Rc::new("hello".to_owned());
let y = Rc::clone(&x);
let x_ptr = Rc::as_ptr(&x);
assert_eq!(x_ptr, Rc::as_ptr(&y));
assert_eq!(unsafe { &*x_ptr }, "hello");
pub unsafe fn from_raw_in(ptr: *const T, alloc: A) -> Rc<T, A>
allocator_api
#32838)
Constructs an Rc<T, A>
from a raw pointer in the provided allocator.
The raw pointer must have been previously returned by a call to Rc<U, A>::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 raw pointer must point to a block of memory allocated by alloc
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 Rc<T>
is never accessed.
Examples
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let x = Rc::new_in("hello".to_owned(), System);
let x_ptr = Rc::into_raw(x);
unsafe {
// Convert back to an `Rc` to prevent leak.
let x = Rc::from_raw_in(x_ptr, System);
assert_eq!(&*x, "hello");
// Further calls to `Rc::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 downgrade(this: &Rc<T, A>) -> Weak<T, A>
where
A: Clone,
Creates a new Weak
pointer to this allocation.
Examples
use std::rc::Rc;
let five = Rc::new(5);
let weak_five = Rc::downgrade(&five);
pub fn weak_count(this: &Rc<T, A>) -> usize
Gets the number of Weak
pointers to this allocation.
Examples
use std::rc::Rc;
let five = Rc::new(5);
let _weak_five = Rc::downgrade(&five);
assert_eq!(1, Rc::weak_count(&five));
pub fn strong_count(this: &Rc<T, A>) -> usize
Gets the number of strong (Rc
) pointers to this allocation.
Examples
use std::rc::Rc;
let five = Rc::new(5);
let _also_five = Rc::clone(&five);
assert_eq!(2, Rc::strong_count(&five));
pub unsafe fn increment_strong_count_in(ptr: *const T, alloc: A)
where
A: Clone,
allocator_api
#32838)
Increments the strong reference count on the Rc<T>
associated with the provided pointer by one.
Safety
The pointer must have been obtained through Rc::into_raw
, the associated Rc
instance must be valid (i.e. the strong count must be at least 1) for the duration of this method, and ptr
must point to a block of memory allocated by alloc
Examples
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let five = Rc::new_in(5, System);
unsafe {
let ptr = Rc::into_raw(five);
Rc::increment_strong_count_in(ptr, System);
let five = Rc::from_raw_in(ptr, System);
assert_eq!(2, Rc::strong_count(&five));
}
pub unsafe fn decrement_strong_count_in(ptr: *const T, alloc: A)
allocator_api
#32838)
Decrements the strong reference count on the Rc<T>
associated with the provided pointer by one.
Safety
The pointer must have been obtained through Rc::into_raw
, the associated Rc
instance must be valid (i.e. the strong count must be at least 1) when invoking this method, and ptr
must point to a block of memory allocated by alloc
. This method can be used to release the final Rc
and backing storage, but should not be called after the final Rc
has been released.
Examples
#![feature(allocator_api)]
use std::rc::Rc;
use std::alloc::System;
let five = Rc::new_in(5, System);
unsafe {
let ptr = Rc::into_raw(five);
Rc::increment_strong_count_in(ptr, System);
let five = Rc::from_raw_in(ptr, System);
assert_eq!(2, Rc::strong_count(&five));
Rc::decrement_strong_count_in(ptr, System);
assert_eq!(1, Rc::strong_count(&five));
}
pub fn get_mut(this: &mut Rc<T, A>) -> Option<&mut T>
Returns a mutable reference into the given Rc
, if there are no other Rc
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 Rc
pointers.
Examples
use std::rc::Rc;
let mut x = Rc::new(3);
*Rc::get_mut(&mut x).unwrap() = 4;
assert_eq!(*x, 4);
let _y = Rc::clone(&x);
assert!(Rc::get_mut(&mut x).is_none());
pub unsafe fn get_mut_unchecked(this: &mut Rc<T, A>) -> &mut T
get_mut_unchecked
#63292)
Returns a mutable reference into the given Rc
, without any check.
See also get_mut
, which is safe and does appropriate checks.
Safety
If any other Rc
or Weak
pointers to the same allocation exist, then they must not be dereferenced or have active borrows for the duration of the returned borrow, and their inner type must be exactly the same as the inner type of this Rc (including lifetimes). This is trivially the case if no such pointers exist, for example immediately after Rc::new
.
Examples
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let mut x = Rc::new(String::new());
unsafe {
Rc::get_mut_unchecked(&mut x).push_str("foo")
}
assert_eq!(*x, "foo");
Other Rc
pointers to the same allocation must be to the same type.
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let x: Rc<str> = Rc::from("Hello, world!");
let mut y: Rc<[u8]> = x.clone().into();
unsafe {
// this is Undefined Behavior, because x's inner type is str, not [u8]
Rc::get_mut_unchecked(&mut y).fill(0xff); // 0xff is invalid in UTF-8
}
println!("{}", &*x); // Invalid UTF-8 in a str
Other Rc
pointers to the same allocation must be to the exact same type, including lifetimes.
#![feature(get_mut_unchecked)]
use std::rc::Rc;
let x: Rc<&str> = Rc::new("Hello, world!");
{
let s = String::from("Oh, no!");
let mut y: Rc<&str> = x.clone().into();
unsafe {
// this is Undefined Behavior, because x's inner type
// is &'long str, not &'short str
*Rc::get_mut_unchecked(&mut y) = &s;
}
}
println!("{}", &*x); // Use-after-free
pub fn ptr_eq(this: &Rc<T, A>, other: &Rc<T, A>) -> bool
Returns true
if the two Rc
s point to the same allocation in a vein similar to ptr::eq
. This function ignores the metadata of dyn Trait
pointers.
Examples
use std::rc::Rc;
let five = Rc::new(5);
let same_five = Rc::clone(&five);
let other_five = Rc::new(5);
assert!(Rc::ptr_eq(&five, &same_five));
assert!(!Rc::ptr_eq(&five, &other_five));
impl<T, A> Rc<T, A>
where
T: Clone,
A: Allocator + Clone,
pub fn make_mut(this: &mut Rc<T, A>) -> &mut T
Makes a mutable reference into the given Rc
.
If there are other Rc
pointers to the same allocation, then make_mut
will clone
the inner value to a new allocation to ensure unique ownership. This is also referred to as clone-on-write.
However, if there are no other Rc
pointers to this allocation, but some Weak
pointers, then the Weak
pointers will be disassociated and the inner value will not be cloned.
See also get_mut
, which will fail rather than cloning the inner value or disassociating Weak
pointers.
Examples
use std::rc::Rc;
let mut data = Rc::new(5);
*Rc::make_mut(&mut data) += 1; // Won't clone anything
let mut other_data = Rc::clone(&data); // Won't clone inner data
*Rc::make_mut(&mut data) += 1; // Clones inner data
*Rc::make_mut(&mut data) += 1; // Won't clone anything
*Rc::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);
Weak
pointers will be disassociated:
use std::rc::Rc;
let mut data = Rc::new(75);
let weak = Rc::downgrade(&data);
assert!(75 == *data);
assert!(75 == *weak.upgrade().unwrap());
*Rc::make_mut(&mut data) += 1;
assert!(76 == *data);
assert!(weak.upgrade().is_none());
pub fn unwrap_or_clone(this: Rc<T, A>) -> T
arc_unwrap_or_clone
#93610)
If we have the only reference to T
then unwrap it. Otherwise, clone T
and return the clone.
Assuming rc_t
is of type Rc<T>
, this function is functionally equivalent to (*rc_t).clone()
, but will avoid cloning the inner value where possible.
Examples
#![feature(arc_unwrap_or_clone)]
let inner = String::from("test");
let ptr = inner.as_ptr();
let rc = Rc::new(inner);
let inner = Rc::unwrap_or_clone(rc);
// The inner value was not cloned
assert!(ptr::eq(ptr, inner.as_ptr()));
let rc = Rc::new(inner);
let rc2 = rc.clone();
let inner = Rc::unwrap_or_clone(rc);
// Because there were 2 references, we had to clone the inner value.
assert!(!ptr::eq(ptr, inner.as_ptr()));
// `rc2` is the last reference, so when we unwrap it we get back
// the original `String`.
let inner = Rc::unwrap_or_clone(rc2);
assert!(ptr::eq(ptr, inner.as_ptr()));
impl<A> Rc<dyn Any, A>
where
A: Allocator + Clone,
pub fn downcast<T>(self) -> Result<Rc<T, A>, Rc<dyn Any, A>>
where
T: Any,
Attempt to downcast the Rc<dyn Any>
to a concrete type.
Examples
use std::any::Any;
use std::rc::Rc;
fn print_if_string(value: Rc<dyn Any>) {
if let Ok(string) = value.downcast::<String>() {
println!("String ({}): {}", string.len(), string);
}
}
let my_string = "Hello World".to_string();
print_if_string(Rc::new(my_string));
print_if_string(Rc::new(0i8));
pub unsafe fn downcast_unchecked<T>(self) -> Rc<T, A>
where
T: Any,
downcast_unchecked
#90850)
Downcasts the Rc<dyn Any>
to a concrete type.
For a safe alternative see downcast
.
Examples
#![feature(downcast_unchecked)]
use std::any::Any;
use std::rc::Rc;
let x: Rc<dyn Any> = Rc::new(1_usize);
unsafe {
assert_eq!(*x.downcast_unchecked::<usize>(), 1);
}
Safety
The contained value must be of type T
. Calling this method with the incorrect type is undefined behavior.
Trait Implementations
impl<T: AsFd> AsFd for Rc<T>
impl<T: AsHandle> AsHandle for Rc<T>Available on Windows only.
impl<T: AsRawFd> AsRawFd for Rc<T>
impl<T, A> AsRef<T> for Rc<T, A>
where
A: Allocator,
T: ?Sized,
fn as_ref(&self) -> &T
impl<T: AsSocket> AsSocket for Rc<T>Available on Windows only.
fn as_socket(&self) -> BorrowedSocket<'_>
impl<T, A> Borrow<T> for Rc<T, A>
where
A: Allocator,
T: ?Sized,
impl<T, A> Clone for Rc<T, A>
where
A: Allocator + Clone,
T: ?Sized,
fn clone(&self) -> Rc<T, A>
Makes a clone of the Rc
pointer.
This creates another pointer to the same allocation, increasing the strong reference count.
Examples
use std::rc::Rc;
let five = Rc::new(5);
let _ = Rc::clone(&five);
fn clone_from(&mut self, source: &Self)
source
. Read more
impl<T, A> Debug for Rc<T, A>
where
T: Debug + ?Sized,
A: Allocator,
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl<T> Default for Rc<T>
where
T: Default,
fn default() -> Rc<T>
Creates a new Rc<T>
, with the Default
value for T
.
Examples
use std::rc::Rc;
let x: Rc<i32> = Default::default();
assert_eq!(*x, 0);
impl<T, A> Deref for Rc<T, A>
where
A: Allocator,
T: ?Sized,
type Target = T
fn deref(&self) -> &T
impl<T, A> Display for Rc<T, A>
where
T: Display + ?Sized,
A: Allocator,
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl<T, A> Drop for Rc<T, A>
where
A: Allocator,
T: ?Sized,
fn drop(&mut self)
Drops the Rc
.
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::rc::Rc;
struct Foo;
impl Drop for Foo {
fn drop(&mut self) {
println!("dropped!");
}
}
let foo = Rc::new(Foo);
let foo2 = Rc::clone(&foo);
drop(foo); // Doesn't print anything
drop(foo2); // Prints "dropped!"
impl<T> From<&[T]> for Rc<[T]>
where
T: Clone,
fn from(v: &[T]) -> Rc<[T]>
Allocate a reference-counted slice and fill it by cloning v
’s items.
Example
let original: &[i32] = &[1, 2, 3];
let shared: Rc<[i32]> = Rc::from(original);
assert_eq!(&[1, 2, 3], &shared[..]);
impl From<&CStr> for Rc<CStr>
fn from(s: &CStr) -> Rc<CStr>
Converts a &CStr
into a Rc<CStr>
, by copying the contents into a newly allocated Rc
.
impl From<&OsStr> for Rc<OsStr>
impl From<&Path> for Rc<Path>
fn from(s: &Path) -> Rc<Path>
impl From<&str> for Rc<str>
fn from(v: &str) -> Rc<str>
Allocate a reference-counted string slice and copy v
into it.
Example
let shared: Rc<str> = Rc::from("statue");
assert_eq!("statue", &shared[..]);
impl<T, const N: usize> From<[T; N]> for Rc<[T]>
fn from(v: [T; N]) -> Rc<[T]>
Converts a [T; N]
into an Rc<[T]>
.
The conversion moves the array into a newly allocated Rc
.
Example
let original: [i32; 3] = [1, 2, 3];
let shared: Rc<[i32]> = Rc::from(original);
assert_eq!(&[1, 2, 3], &shared[..]);
impl<T, A> From<Box<T, A>> for Rc<T, A>
where
A: Allocator,
T: ?Sized,
fn from(v: Box<T, A>) -> Rc<T, A>
Move a boxed object to a new, reference counted, allocation.
Example
let original: Box<i32> = Box::new(1);
let shared: Rc<i32> = Rc::from(original);
assert_eq!(1, *shared);
impl From<CString> for Rc<CStr>
fn from(s: CString) -> Rc<CStr>
impl<'a, B> From<Cow<'a, B>> for Rc<B>
where
B: ToOwned + ?Sized,
Rc<B>: From<&'a B> + From<<B as ToOwned>::Owned>,
fn from(cow: Cow<'a, B>) -> Rc<B>
Create a reference-counted pointer from a clone-on-write pointer by copying its content.
Example
let cow: Cow<'_, str> = Cow::Borrowed("eggplant");
let shared: Rc<str> = Rc::from(cow);
assert_eq!("eggplant", &shared[..]);
impl From<OsString> for Rc<OsStr>
fn from(s: OsString) -> Rc<OsStr>
impl From<PathBuf> for Rc<Path>
fn from(s: PathBuf) -> Rc<Path>
impl From<Rc<str>> for Rc<[u8]>
fn from(rc: Rc<str>) -> Rc<[u8]>
Converts a reference-counted string slice into a byte slice.
Example
let string: Rc<str> = Rc::from("eggplant");
let bytes: Rc<[u8]> = Rc::from(string);
assert_eq!("eggplant".as_bytes(), bytes.as_ref());
impl From<String> for Rc<str>
fn from(v: String) -> Rc<str>
Allocate a reference-counted string slice and copy v
into it.
Example
let original: String = "statue".to_owned();
let shared: Rc<str> = Rc::from(original);
assert_eq!("statue", &shared[..]);
impl<T> From<T> for Rc<T>
fn from(t: T) -> Rc<T>
Converts a generic type T
into an Rc<T>
The conversion allocates on the heap and moves t
from the stack into it.
Example
let x = 5;
let rc = Rc::new(5);
assert_eq!(Rc::from(x), rc);
impl<T, A> From<Vec<T, A>> for Rc<[T], A>
where
A: Allocator,
fn from(v: Vec<T, A>) -> Rc<[T], A>
Allocate a reference-counted slice and move v
’s items into it.
Example
let unique: Vec<i32> = vec![1, 2, 3];
let shared: Rc<[i32]> = Rc::from(unique);
assert_eq!(&[1, 2, 3], &shared[..]);
impl<T> FromIterator<T> for Rc<[T]>
fn from_iter<I>(iter: I) -> Rc<[T]>
where
I: IntoIterator<Item = T>,
Takes each element in the Iterator
and collects it into an Rc<[T]>
.
Performance characteristics
The general case
In the general case, collecting into Rc<[T]>
is done by first collecting into a Vec<T>
. That is, when writing the following:
let evens: Rc<[u8]> = (0..10).filter(|&x| x % 2 == 0).collect();
this behaves as if we wrote:
let evens: Rc<[u8]> = (0..10).filter(|&x| x % 2 == 0)
.collect::<Vec<_>>() // The first set of allocations happens here.
.into(); // A second allocation for `Rc<[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 Rc<[T]>
.
Iterators of known length
When your Iterator
implements TrustedLen
and is of an exact size, a single allocation will be made for the Rc<[T]>
. For example:
let evens: Rc<[u8]> = (0..10).collect(); // Just a single allocation happens here.
impl<T, A> Hash for Rc<T, A>
where
T: Hash + ?Sized,
A: Allocator,
fn hash<H>(&self, state: &mut H)
where
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H)
where
H: Hasher,
Self: Sized,
impl<T, A> Ord for Rc<T, A>
where
T: Ord + ?Sized,
A: Allocator,
fn cmp(&self, other: &Rc<T, A>) -> Ordering
Comparison for two Rc
s.
The two are compared by calling cmp()
on their inner values.
Examples
use std::rc::Rc;
use std::cmp::Ordering;
let five = Rc::new(5);
assert_eq!(Ordering::Less, five.cmp(&Rc::new(6)));
fn max(self, other: Self) -> Self
where
Self: Sized,
fn min(self, other: Self) -> Self
where
Self: Sized,
fn clamp(self, min: Self, max: Self) -> Self
where
Self: Sized + PartialOrd,
impl<T, A> PartialEq for Rc<T, A>
where
T: PartialEq + ?Sized,
A: Allocator,
fn eq(&self, other: &Rc<T, A>) -> bool
Equality for two Rc
s.
Two Rc
s 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 Rc
s that point to the same allocation are always equal.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five == Rc::new(5));
fn ne(&self, other: &Rc<T, A>) -> bool
Inequality for two Rc
s.
Two Rc
s are not equal if their inner values are not equal.
If T
also implements Eq
(implying reflexivity of equality), two Rc
s that point to the same allocation are always equal.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five != Rc::new(6));
impl<T, A> PartialOrd for Rc<T, A>
where
T: PartialOrd + ?Sized,
A: Allocator,
fn partial_cmp(&self, other: &Rc<T, A>) -> Option<Ordering>
Partial comparison for two Rc
s.
The two are compared by calling partial_cmp()
on their inner values.
Examples
use std::rc::Rc;
use std::cmp::Ordering;
let five = Rc::new(5);
assert_eq!(Some(Ordering::Less), five.partial_cmp(&Rc::new(6)));
fn lt(&self, other: &Rc<T, A>) -> bool
Less-than comparison for two Rc
s.
The two are compared by calling <
on their inner values.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five < Rc::new(6));
fn le(&self, other: &Rc<T, A>) -> bool
‘Less than or equal to’ comparison for two Rc
s.
The two are compared by calling <=
on their inner values.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five <= Rc::new(5));
fn gt(&self, other: &Rc<T, A>) -> bool
Greater-than comparison for two Rc
s.
The two are compared by calling >
on their inner values.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five > Rc::new(4));
fn ge(&self, other: &Rc<T, A>) -> bool
‘Greater than or equal to’ comparison for two Rc
s.
The two are compared by calling >=
on their inner values.
Examples
use std::rc::Rc;
let five = Rc::new(5);
assert!(five >= Rc::new(5));
impl<T, A> Pointer for Rc<T, A>
where
A: Allocator,
T: ?Sized,
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
impl<T, const N: usize> TryFrom<Rc<[T]>> for Rc<[T; N]>
type Error = Rc<[T]>
fn try_from(
boxed_slice: Rc<[T]>
) -> Result<Rc<[T; N]>, <Rc<[T; N]> as TryFrom<Rc<[T]>>>::Error>
impl<T, U, A> CoerceUnsized<Rc<U, A>> for Rc<T, A>
where
T: Unsize<U> + ?Sized,
A: Allocator,
U: ?Sized,
impl<T, U> DispatchFromDyn<Rc<U>> for Rc<T>
where
T: Unsize<U> + ?Sized,
U: ?Sized,
impl<T, A> Eq for Rc<T, A>
where
T: Eq + ?Sized,
A: Allocator,
impl<T, A> RefUnwindSafe for Rc<T, A>
where
T: RefUnwindSafe + ?Sized,
A: Allocator + UnwindSafe,
impl<T, A> !Send for Rc<T, A>
where
A: Allocator,
T: ?Sized,
impl<T, A> !Sync for Rc<T, A>
where
A: Allocator,
T: ?Sized,
impl<T, A> Unpin for Rc<T, A>
where
A: Allocator,
T: ?Sized,
impl<T, A> UnwindSafe for Rc<T, A>
where
T: RefUnwindSafe + ?Sized,
A: Allocator + UnwindSafe,
Blanket Implementations
impl<T> Any for T
where
T: 'static + ?Sized,
impl<T> Borrow<T> for T
where
T: ?Sized,
impl<T> BorrowMut<T> for T
where
T: ?Sized,
impl<T> From<!> for T
fn from(t: !) -> T
impl<T> From<T> for T
fn from(t: T) -> T
Returns the argument unchanged.
impl<T, U> Into<U> for T
where
U: From<T>,
fn into(self) -> U
Calls U::from(self)
.
That is, this conversion is whatever the implementation of From<T> for U
chooses to do.
impl<T> ToOwned for T
where
T: Clone,
type Owned = T
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)
impl<T> ToString for T
where
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T
where
U: Into<T>,
type Error = Infallible
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
impl<T, U> TryInto<U> for T
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/rc/struct.Rc.html