pub struct Weak<T, A = Global>{ /* private fields */ }
dep_bumpalo
only.Expand description
Weak
is a version of Rc
that holds a non-owning reference to the
managed allocation.
The allocation is accessed by calling upgrade
on the Weak
pointer, which returns an Option<Rc<T>>
.
Since a Weak
reference does not count towards ownership, it will not
prevent the value stored in the allocation from being dropped, and Weak
itself makes no
guarantees about the value still being present. Thus it may return None
when upgrade
d. Note however that a Weak
reference does prevent the allocation
itself (the backing store) from being deallocated.
A Weak
pointer is useful for keeping a temporary reference to the allocation
managed by Rc
without preventing its inner value from being dropped. It is also used to
prevent circular references between Rc
pointers, since mutual owning references
would never allow either Rc
to be dropped. For example, a tree could
have strong Rc
pointers from parent nodes to children, and Weak
pointers from children back to their parents.
The typical way to obtain a Weak
pointer is to call Rc::downgrade
.
Implementations§
Source§impl<T> Weak<T>
impl<T> Weak<T>
Source§impl<T, A> Weak<T, A>where
A: Allocator,
impl<T, A> Weak<T, A>where
A: Allocator,
Source§impl<T> Weak<T>where
T: ?Sized,
impl<T> Weak<T>where
T: ?Sized,
1.45.0 · Sourcepub unsafe fn from_raw(ptr: *const T) -> Weak<T>
Available on crate feature alloc
only.
pub unsafe fn from_raw(ptr: *const T) -> Weak<T>
alloc
only.Converts a raw pointer previously created by into_raw
back into Weak<T>
.
This can be used to safely get a strong reference (by calling upgrade
later) or to deallocate the weak count by dropping the Weak<T>
.
It takes ownership of one weak reference (with the exception of pointers created by new
,
as these don’t own anything; the method still works on them).
§Safety
The pointer must have originated from the into_raw
and must still own its potential
weak reference, and ptr
must point to a block of memory allocated by the global allocator.
It is allowed for the strong count to be 0 at the time of calling this. Nevertheless, this
takes ownership of one weak reference currently represented as a raw pointer (the weak
count is not modified by this operation) and therefore it must be paired with a previous
call to into_raw
.
§Examples
use std::rc::{Rc, Weak};
let strong = Rc::new("hello".to_owned());
let raw_1 = Rc::downgrade(&strong).into_raw();
let raw_2 = Rc::downgrade(&strong).into_raw();
assert_eq!(2, Rc::weak_count(&strong));
assert_eq!("hello", &*unsafe { Weak::from_raw(raw_1) }.upgrade().unwrap());
assert_eq!(1, Rc::weak_count(&strong));
drop(strong);
// Decrement the last weak count.
assert!(unsafe { Weak::from_raw(raw_2) }.upgrade().is_none());
Source§impl<T, A> Weak<T, A>
impl<T, A> Weak<T, A>
Sourcepub fn allocator(&self) -> &A
🔬This is a nightly-only experimental API. (allocator_api
)Available on crate feature alloc
only.
pub fn allocator(&self) -> &A
allocator_api
)alloc
only.Returns a reference to the underlying allocator.
1.45.0 · Sourcepub fn as_ptr(&self) -> *const T
Available on crate feature alloc
only.
pub fn as_ptr(&self) -> *const T
alloc
only.Returns a raw pointer to the object T
pointed to by this Weak<T>
.
The pointer is valid only if there are some strong references. The pointer may be dangling,
unaligned or even null
otherwise.
§Examples
use std::rc::Rc;
use std::ptr;
let strong = Rc::new("hello".to_owned());
let weak = Rc::downgrade(&strong);
// Both point to the same object
assert!(ptr::eq(&*strong, weak.as_ptr()));
// The strong here keeps it alive, so we can still access the object.
assert_eq!("hello", unsafe { &*weak.as_ptr() });
drop(strong);
// But not any more. We can do weak.as_ptr(), but accessing the pointer would lead to
// undefined behavior.
// assert_eq!("hello", unsafe { &*weak.as_ptr() });
1.45.0 · Sourcepub fn into_raw(self) -> *const T
Available on crate feature alloc
only.
pub fn into_raw(self) -> *const T
alloc
only.Consumes the Weak<T>
and turns it into a raw pointer.
This converts the weak pointer into a raw pointer, while still preserving the ownership of
one weak reference (the weak count is not modified by this operation). It can be turned
back into the Weak<T>
with from_raw
.
The same restrictions of accessing the target of the pointer as with
as_ptr
apply.
§Examples
use std::rc::{Rc, Weak};
let strong = Rc::new("hello".to_owned());
let weak = Rc::downgrade(&strong);
let raw = weak.into_raw();
assert_eq!(1, Rc::weak_count(&strong));
assert_eq!("hello", unsafe { &*raw });
drop(unsafe { Weak::from_raw(raw) });
assert_eq!(0, Rc::weak_count(&strong));
Sourcepub fn into_raw_with_allocator(self) -> (*const T, A) ⓘ
🔬This is a nightly-only experimental API. (allocator_api
)Available on crate feature alloc
only.
pub fn into_raw_with_allocator(self) -> (*const T, A) ⓘ
allocator_api
)alloc
only.Consumes the Weak<T>
, returning the wrapped pointer and allocator.
This converts the weak pointer into a raw pointer, while still preserving the ownership of
one weak reference (the weak count is not modified by this operation). It can be turned
back into the Weak<T>
with from_raw_in
.
The same restrictions of accessing the target of the pointer as with
as_ptr
apply.
§Examples
#![feature(allocator_api)]
use std::rc::{Rc, Weak};
use std::alloc::System;
let strong = Rc::new_in("hello".to_owned(), System);
let weak = Rc::downgrade(&strong);
let (raw, alloc) = weak.into_raw_with_allocator();
assert_eq!(1, Rc::weak_count(&strong));
assert_eq!("hello", unsafe { &*raw });
drop(unsafe { Weak::from_raw_in(raw, alloc) });
assert_eq!(0, Rc::weak_count(&strong));
Sourcepub unsafe fn from_raw_in(ptr: *const T, alloc: A) -> Weak<T, A>
🔬This is a nightly-only experimental API. (allocator_api
)Available on crate feature alloc
only.
pub unsafe fn from_raw_in(ptr: *const T, alloc: A) -> Weak<T, A>
allocator_api
)alloc
only.Converts a raw pointer previously created by into_raw
back into Weak<T>
.
This can be used to safely get a strong reference (by calling upgrade
later) or to deallocate the weak count by dropping the Weak<T>
.
It takes ownership of one weak reference (with the exception of pointers created by new
,
as these don’t own anything; the method still works on them).
§Safety
The pointer must have originated from the into_raw
and must still own its potential
weak reference, and ptr
must point to a block of memory allocated by alloc
.
It is allowed for the strong count to be 0 at the time of calling this. Nevertheless, this
takes ownership of one weak reference currently represented as a raw pointer (the weak
count is not modified by this operation) and therefore it must be paired with a previous
call to into_raw
.
§Examples
use std::rc::{Rc, Weak};
let strong = Rc::new("hello".to_owned());
let raw_1 = Rc::downgrade(&strong).into_raw();
let raw_2 = Rc::downgrade(&strong).into_raw();
assert_eq!(2, Rc::weak_count(&strong));
assert_eq!("hello", &*unsafe { Weak::from_raw(raw_1) }.upgrade().unwrap());
assert_eq!(1, Rc::weak_count(&strong));
drop(strong);
// Decrement the last weak count.
assert!(unsafe { Weak::from_raw(raw_2) }.upgrade().is_none());
1.4.0 · Sourcepub fn upgrade(&self) -> Option<Rc<T, A>> ⓘwhere
A: Clone,
Available on crate feature alloc
only.
pub fn upgrade(&self) -> Option<Rc<T, A>> ⓘwhere
A: Clone,
alloc
only.Attempts to upgrade the Weak
pointer to an Rc
, delaying
dropping of the inner value if successful.
Returns None
if the inner value has since been dropped.
§Examples
use std::rc::Rc;
let five = Rc::new(5);
let weak_five = Rc::downgrade(&five);
let strong_five: Option<Rc<_>> = weak_five.upgrade();
assert!(strong_five.is_some());
// Destroy all strong pointers.
drop(strong_five);
drop(five);
assert!(weak_five.upgrade().is_none());
1.41.0 · Sourcepub fn strong_count(&self) -> usize ⓘ
Available on crate feature alloc
only.
pub fn strong_count(&self) -> usize ⓘ
alloc
only.Gets the number of strong (Rc
) pointers pointing to this allocation.
If self
was created using Weak::new
, this will return 0.
1.41.0 · Sourcepub fn weak_count(&self) -> usize ⓘ
Available on crate feature alloc
only.
pub fn weak_count(&self) -> usize ⓘ
alloc
only.Gets the number of Weak
pointers pointing to this allocation.
If no strong pointers remain, this will return zero.
1.39.0 · Sourcepub fn ptr_eq(&self, other: &Weak<T, A>) -> bool
Available on crate feature alloc
only.
pub fn ptr_eq(&self, other: &Weak<T, A>) -> bool
alloc
only.Returns true
if the two Weak
s point to the same allocation similar to ptr::eq
, or if
both don’t point to any allocation (because they were created with Weak::new()
). However,
this function ignores the metadata of dyn Trait
pointers.
§Notes
Since this compares pointers it means that Weak::new()
will equal each
other, even though they don’t point to any allocation.
§Examples
use std::rc::Rc;
let first_rc = Rc::new(5);
let first = Rc::downgrade(&first_rc);
let second = Rc::downgrade(&first_rc);
assert!(first.ptr_eq(&second));
let third_rc = Rc::new(5);
let third = Rc::downgrade(&third_rc);
assert!(!first.ptr_eq(&third));
Comparing Weak::new
.
use std::rc::{Rc, Weak};
let first = Weak::new();
let second = Weak::new();
assert!(first.ptr_eq(&second));
let third_rc = Rc::new(());
let third = Rc::downgrade(&third_rc);
assert!(!first.ptr_eq(&third));
Trait Implementations§
§impl<T> Archive for Weak<T>where
T: ArchiveUnsized + ?Sized,
impl<T> Archive for Weak<T>where
T: ArchiveUnsized + ?Sized,
§type Archived = ArchivedRcWeak<<T as ArchiveUnsized>::Archived, RcFlavor>
type Archived = ArchivedRcWeak<<T as ArchiveUnsized>::Archived, RcFlavor>
§type Resolver = RcWeakResolver
type Resolver = RcWeakResolver
§fn resolve(
&self,
resolver: <Weak<T> as Archive>::Resolver,
out: Place<<Weak<T> as Archive>::Archived>,
)
fn resolve( &self, resolver: <Weak<T> as Archive>::Resolver, out: Place<<Weak<T> as Archive>::Archived>, )
§const COPY_OPTIMIZATION: CopyOptimization<Self> = _
const COPY_OPTIMIZATION: CopyOptimization<Self> = _
serialize
. Read more1.4.0 · Source§impl<T, A> Clone for Weak<T, A>
impl<T, A> Clone for Weak<T, A>
Source§fn clone(&self) -> Weak<T, A>
fn clone(&self) -> Weak<T, A>
Makes a clone of the Weak
pointer that points to the same allocation.
§Examples
use std::rc::{Rc, Weak};
let weak_five = Rc::downgrade(&Rc::new(5));
let _ = Weak::clone(&weak_five);
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<T: ConstDefault> ConstDefault for RcWeak<T>
impl<T: ConstDefault> ConstDefault for RcWeak<T>
§impl<T, D> Deserialize<Weak<T>, D> for ArchivedRcWeak<<T as ArchiveUnsized>::Archived, RcFlavor>
impl<T, D> Deserialize<Weak<T>, D> for ArchivedRcWeak<<T as ArchiveUnsized>::Archived, RcFlavor>
1.4.0 · Source§impl<T, A> Drop for Weak<T, A>
impl<T, A> Drop for Weak<T, A>
Source§fn drop(&mut self)
fn drop(&mut self)
Drops the Weak
pointer.
§Examples
use std::rc::{Rc, Weak};
struct Foo;
impl Drop for Foo {
fn drop(&mut self) {
println!("dropped!");
}
}
let foo = Rc::new(Foo);
let weak_foo = Rc::downgrade(&foo);
let other_weak_foo = Weak::clone(&weak_foo);
drop(weak_foo); // Doesn't print anything
drop(foo); // Prints "dropped!"
assert!(other_weak_foo.upgrade().is_none());
impl<T, U, A> CoerceUnsized<Weak<U, A>> for Weak<T, A>
impl<T, U> DispatchFromDyn<Weak<U>> for Weak<T>
impl<T, A> PinCoerceUnsized for Weak<T, A>
impl<T, A> !Send for Weak<T, A>
impl<T, A> !Sync for Weak<T, A>
Auto Trait Implementations§
impl<T, A> Freeze for Weak<T, A>
impl<T, A = Global> !RefUnwindSafe for Weak<T, A>
impl<T, A> Unpin for Weak<T, A>
impl<T, A = Global> !UnwindSafe for Weak<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
§impl<T> ArchiveUnsized for Twhere
T: Archive,
impl<T> ArchiveUnsized for Twhere
T: Archive,
§type Archived = <T as Archive>::Archived
type Archived = <T as Archive>::Archived
Archive
, it may be
unsized. Read more§fn archived_metadata(
&self,
) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata
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,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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_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, 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.