Struct ThinArc

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

A thin version of Arc.

Implementations

impl<Head, SliceItem> ThinArc<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> ThinArc<Head, SliceItem>

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

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

Create a new atomically 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 Arc. This is required, because the heap layout of Arc 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 ThinArc<Head, SliceItem>

where Arc<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 ThinArc<Head, SliceItem>

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

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

Formats the value using the given formatter.

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

where Arc<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 ThinArc<Head, SliceItem>

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

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

Mutably dereferences the value.

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

fn drop(&mut self)

Executes the destructor for this type.

impl<Head, SliceItem> From<Arc<ThinData<Head, SliceItem>>> for ThinArc<Head, SliceItem>

fn from(this: Arc<ThinData<Head, SliceItem>>) -> ThinArc<Head, SliceItem>

Converts to this type from the input type.

impl<Head, SliceItem> From<ThinArc<Head, SliceItem>> for Arc<ThinData<Head, SliceItem>>

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

Converts to this type from the input type.

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

where Arc<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<Arc<ThinData<Head, SliceItem>>> for ThinArc<Head, SliceItem>

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

fn eq(&self, other: &Arc<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 ThinArc<Head, SliceItem>

where Arc<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 ThinArc<Head, SliceItem>

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

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

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

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

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