pub struct UniqueRc<T, A = Global>{ /* private fields */ }
unique_rc_arc
)alloc
only.Expand description
A uniquely owned Rc
.
This represents an Rc
that is known to be uniquely owned – that is, have exactly one strong
reference. Multiple weak pointers can be created, but attempts to upgrade those to strong
references will fail unless the UniqueRc
they point to has been converted into a regular Rc
.
Because they are uniquely owned, the contents of a UniqueRc
can be freely mutated. A common
use case is to have an object be mutable during its initialization phase but then have it become
immutable and converted to a normal Rc
.
This can be used as a flexible way to create cyclic data structures, as in the example below.
#![feature(unique_rc_arc)]
use std::rc::{Rc, Weak, UniqueRc};
struct Gadget {
#[allow(dead_code)]
me: Weak<Gadget>,
}
fn create_gadget() -> Option<Rc<Gadget>> {
let mut rc = UniqueRc::new(Gadget {
me: Weak::new(),
});
rc.me = UniqueRc::downgrade(&rc);
Some(UniqueRc::into_rc(rc))
}
create_gadget().unwrap();
An advantage of using UniqueRc
over Rc::new_cyclic
to build cyclic data structures is that
Rc::new_cyclic
’s data_fn
parameter cannot be async or return a Result
. As shown in the
previous example, UniqueRc
allows for more flexibility in the construction of cyclic data,
including fallible or async constructors.
Implementations§
Source§impl<T> UniqueRc<T>
impl<T> UniqueRc<T>
Sourcepub fn new(value: T) -> UniqueRc<T>
🔬This is a nightly-only experimental API. (unique_rc_arc
)
pub fn new(value: T) -> UniqueRc<T>
unique_rc_arc
)Creates a new UniqueRc
.
Weak references to this UniqueRc
can be created with UniqueRc::downgrade
. Upgrading
these weak references will fail before the UniqueRc
has been converted into an Rc
.
After converting the UniqueRc
into an Rc
, any weak references created beforehand will
point to the new Rc
.
Source§impl<T, A> UniqueRc<T, A>where
A: Allocator,
impl<T, A> UniqueRc<T, A>where
A: Allocator,
Sourcepub fn new_in(value: T, alloc: A) -> UniqueRc<T, A>
🔬This is a nightly-only experimental API. (unique_rc_arc
)
pub fn new_in(value: T, alloc: A) -> UniqueRc<T, A>
unique_rc_arc
)Creates a new UniqueRc
in the provided allocator.
Weak references to this UniqueRc
can be created with UniqueRc::downgrade
. Upgrading
these weak references will fail before the UniqueRc
has been converted into an Rc
.
After converting the UniqueRc
into an Rc
, any weak references created beforehand will
point to the new Rc
.
Source§impl<T, A> UniqueRc<T, A>
impl<T, A> UniqueRc<T, A>
Trait Implementations§
Source§impl<T> AsFd for UniqueRc<T>
impl<T> AsFd for UniqueRc<T>
Source§fn as_fd(&self) -> BorrowedFd<'_>
fn as_fd(&self) -> BorrowedFd<'_>
Source§impl<T, A> BorrowMut<T> for UniqueRc<T, A>
impl<T, A> BorrowMut<T> for UniqueRc<T, A>
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T, A> Ord for UniqueRc<T, A>
impl<T, A> Ord for UniqueRc<T, A>
Source§fn cmp(&self, other: &UniqueRc<T, A>) -> Ordering
fn cmp(&self, other: &UniqueRc<T, A>) -> Ordering
Comparison for two UniqueRc
s.
The two are compared by calling cmp()
on their inner values.
§Examples
#![feature(unique_rc_arc)]
use std::rc::UniqueRc;
use std::cmp::Ordering;
let five = UniqueRc::new(5);
assert_eq!(Ordering::Less, five.cmp(&UniqueRc::new(6)));
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl<T, A> PartialEq for UniqueRc<T, A>
impl<T, A> PartialEq for UniqueRc<T, A>
Source§impl<T, A> PartialOrd for UniqueRc<T, A>
impl<T, A> PartialOrd for UniqueRc<T, A>
Source§fn partial_cmp(&self, other: &UniqueRc<T, A>) -> Option<Ordering> ⓘ
fn partial_cmp(&self, other: &UniqueRc<T, A>) -> Option<Ordering> ⓘ
Partial comparison for two UniqueRc
s.
The two are compared by calling partial_cmp()
on their inner values.
§Examples
#![feature(unique_rc_arc)]
use std::rc::UniqueRc;
use std::cmp::Ordering;
let five = UniqueRc::new(5);
assert_eq!(Some(Ordering::Less), five.partial_cmp(&UniqueRc::new(6)));
Source§fn lt(&self, other: &UniqueRc<T, A>) -> bool
fn lt(&self, other: &UniqueRc<T, A>) -> bool
Less-than comparison for two UniqueRc
s.
The two are compared by calling <
on their inner values.
§Examples
#![feature(unique_rc_arc)]
use std::rc::UniqueRc;
let five = UniqueRc::new(5);
assert!(five < UniqueRc::new(6));
Source§fn le(&self, other: &UniqueRc<T, A>) -> bool
fn le(&self, other: &UniqueRc<T, A>) -> bool
‘Less than or equal to’ comparison for two UniqueRc
s.
The two are compared by calling <=
on their inner values.
§Examples
#![feature(unique_rc_arc)]
use std::rc::UniqueRc;
let five = UniqueRc::new(5);
assert!(five <= UniqueRc::new(5));
impl<T, U, A> CoerceUnsized<UniqueRc<U, A>> for UniqueRc<T, A>
impl<T, A> DerefPure for UniqueRc<T, A>
impl<T, U> DispatchFromDyn<UniqueRc<U>> for UniqueRc<T>
impl<T, A> Eq for UniqueRc<T, A>
impl<T, A> PinCoerceUnsized for UniqueRc<T, A>
impl<T, A> !Send for UniqueRc<T, A>
impl<T, A> !Sync for UniqueRc<T, A>
impl<T, A> Unpin for UniqueRc<T, A>
Auto Trait Implementations§
impl<T, A> Freeze for UniqueRc<T, A>
impl<T, A = Global> !RefUnwindSafe for UniqueRc<T, A>
impl<T, A = Global> !UnwindSafe for UniqueRc<T, A>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of<T>() -> usize ⓘ
fn mem_align_of<T>() -> usize ⓘ
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, A> MutableStringZilla<A> for T
impl<T, A> MutableStringZilla<A> for T
§fn sz_randomize(&mut self, alphabet: A)
fn sz_randomize(&mut self, alphabet: A)
alphabet
. Read more§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<'a, T, N> StringZilla<'a, N> for T
impl<'a, T, N> StringZilla<'a, N> for T
§fn sz_find_char_from(&self, needles: N) -> Option<usize> ⓘ
fn sz_find_char_from(&self, needles: N) -> Option<usize> ⓘ
§fn sz_rfind_char_from(&self, needles: N) -> Option<usize> ⓘ
fn sz_rfind_char_from(&self, needles: N) -> Option<usize> ⓘ
§fn sz_find_char_not_from(&self, needles: N) -> Option<usize> ⓘ
fn sz_find_char_not_from(&self, needles: N) -> Option<usize> ⓘ
§fn sz_rfind_char_not_from(&self, needles: N) -> Option<usize> ⓘ
fn sz_rfind_char_not_from(&self, needles: N) -> Option<usize> ⓘ
§fn sz_edit_distance(&self, other: N) -> usize ⓘ
fn sz_edit_distance(&self, other: N) -> usize ⓘ
§fn sz_alignment_score(
&self,
other: N,
matrix: [[i8; 256]; 256],
gap: i8,
) -> isize ⓘ
fn sz_alignment_score( &self, other: N, matrix: [[i8; 256]; 256], gap: i8, ) -> isize ⓘ
self
and other
using the specified
substitution matrix and gap penalty. Read more§fn sz_matches(&'a self, needle: &'a N) -> RangeMatches<'a> ⓘ
fn sz_matches(&'a self, needle: &'a N) -> RangeMatches<'a> ⓘ
§fn sz_rmatches(&'a self, needle: &'a N) -> RangeRMatches<'a> ⓘ
fn sz_rmatches(&'a self, needle: &'a N) -> RangeRMatches<'a> ⓘ
needle
in self
, searching from the end. Read more§fn sz_splits(&'a self, needle: &'a N) -> RangeSplits<'a> ⓘ
fn sz_splits(&'a self, needle: &'a N) -> RangeSplits<'a> ⓘ
§fn sz_rsplits(&'a self, needle: &'a N) -> RangeRSplits<'a> ⓘ
fn sz_rsplits(&'a self, needle: &'a N) -> RangeRSplits<'a> ⓘ
self
that are separated by the given needle
, searching from the end. Read more§fn sz_find_first_of(&'a self, needles: &'a N) -> RangeMatches<'a> ⓘ
fn sz_find_first_of(&'a self, needles: &'a N) -> RangeMatches<'a> ⓘ
needles
within self
. Read more§fn sz_find_last_of(&'a self, needles: &'a N) -> RangeRMatches<'a> ⓘ
fn sz_find_last_of(&'a self, needles: &'a N) -> RangeRMatches<'a> ⓘ
needles
within self
, searching from the end. Read more§fn sz_find_first_not_of(&'a self, needles: &'a N) -> RangeMatches<'a> ⓘ
fn sz_find_first_not_of(&'a self, needles: &'a N) -> RangeMatches<'a> ⓘ
needles
within self
. Read more§fn sz_find_last_not_of(&'a self, needles: &'a N) -> RangeRMatches<'a> ⓘ
fn sz_find_last_not_of(&'a self, needles: &'a N) -> RangeRMatches<'a> ⓘ
needles
within self
, searching from the end. Read more