Struct ThinRc

pub struct ThinRc<Head, SliceItem> { /* private fields */ }

A thin version of Rc.

Implementations

impl<Head, SliceItem> ThinRc<Head, SliceItem>

pub unsafe fn from_erased(ptr: ErasedPtr) -> Self

Construct an owned pointer from an erased pointer.

Safety

This pointer must logically own a valid instance of Self.

pub fn erase(this: Self) -> ErasedPtr

Convert this owned pointer into an erased pointer.

To avoid a memory leak the pointer must be converted back using Self::from_erased.

impl<Head, SliceItem> ThinRc<Head, SliceItem>

pub fn new<I>(head: Head, slice: I) -> Self

where I: IntoIterator<Item = SliceItem>, I::IntoIter: ExactSizeIterator,

Create a new reference counted ThinData with the given head and slice.

Panics

Panics if the slice iterator incorrectly reports its length.

Note on allocation

This currently creates a ThinBox first and then moves that into an Rc. This is required, because the heap layout of Rc is not stable, and custom DSTs need to be manually allocated.

This will be eliminated in the future if/when the reference counted heap layout is stabilized.

Trait Implementations

impl<Head, SliceItem> Clone for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Head, SliceItem> Debug for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Head, SliceItem> Deref for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Deref,

type Target = ThinData<Head, SliceItem>

The resulting type after dereferencing.

fn deref(&self) -> &ThinData<Head, SliceItem>

Dereferences the value.

impl<Head, SliceItem> DerefMut for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: DerefMut,

fn deref_mut(&mut self) -> &mut ThinData<Head, SliceItem>

Mutably dereferences the value.

impl<Head, SliceItem> Drop for ThinRc<Head, SliceItem>

fn drop(&mut self)

Executes the destructor for this type.

impl<Head, SliceItem> From<Rc<ThinData<Head, SliceItem>>> for ThinRc<Head, SliceItem>

fn from(this: Rc<ThinData<Head, SliceItem>>) -> ThinRc<Head, SliceItem>

Converts to this type from the input type.

impl<Head, SliceItem> From<ThinRc<Head, SliceItem>> for Rc<ThinData<Head, SliceItem>>

fn from(this: ThinRc<Head, SliceItem>) -> Self

Converts to this type from the input type.

impl<Head, SliceItem> Hash for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Hash,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Head, SliceItem> PartialEq<Rc<ThinData<Head, SliceItem>>> for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: PartialEq,

fn eq(&self, other: &Rc<ThinData<Head, SliceItem>>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Head, SliceItem> PartialEq for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: PartialEq,

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Head, SliceItem> Eq for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Eq,

impl<Head, SliceItem> Send for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Send,

impl<Head, SliceItem> Sync for ThinRc<Head, SliceItem>

where Rc<ThinData<Head, SliceItem>>: Sync,