Struct RelPtr
#[repr(C)]pub struct RelPtr<T, O>where
T: ArchivePointee + ?Sized,{ /* private fields */ }
dep_rkyv
only.Expand description
Implementations§
§impl<T, O> RelPtr<T, O>where
O: Offset,
impl<T, O> RelPtr<T, O>where
O: Offset,
§impl<T, O> RelPtr<T, O>
impl<T, O> RelPtr<T, O>
pub fn try_emplace_invalid<E>(out: Place<RelPtr<T, O>>) -> Result<(), E> ⓘwhere
E: Source,
pub fn try_emplace_invalid<E>(out: Place<RelPtr<T, O>>) -> Result<(), E> ⓘwhere
E: Source,
Attempts to create an invalid relative pointer with default metadata.
pub fn emplace_invalid(out: Place<RelPtr<T, O>>)
pub fn emplace_invalid(out: Place<RelPtr<T, O>>)
Creates an invalid relative pointer with default metadata.
§Panics
- If an offset of
1
does not fit in anisize
- If an offset of
1
exceeds the offset storage
pub fn try_emplace_unsized<E>(
to: usize,
metadata: <T as ArchivePointee>::ArchivedMetadata,
out: Place<RelPtr<T, O>>,
) -> Result<(), E> ⓘwhere
E: Source,
pub fn try_emplace_unsized<E>(
to: usize,
metadata: <T as ArchivePointee>::ArchivedMetadata,
out: Place<RelPtr<T, O>>,
) -> Result<(), E> ⓘwhere
E: Source,
Attempts to create a relative pointer from one position to another.
pub fn emplace_unsized(
to: usize,
metadata: <T as ArchivePointee>::ArchivedMetadata,
out: Place<RelPtr<T, O>>,
)
pub fn emplace_unsized( to: usize, metadata: <T as ArchivePointee>::ArchivedMetadata, out: Place<RelPtr<T, O>>, )
Creates a relative pointer from one position to another.
§Panics
- If the offset between
from
andto
does not fit in anisize
- If the offset between
from
andto
exceeds the offset storage
pub fn base_raw(this: *mut RelPtr<T, O>) -> *mut u8
pub fn base_raw(this: *mut RelPtr<T, O>) -> *mut u8
Gets the base pointer for the pointed-to relative pointer.
pub unsafe fn offset_raw(this: *mut RelPtr<T, O>) -> isize ⓘ
pub unsafe fn offset_raw(this: *mut RelPtr<T, O>) -> isize ⓘ
Gets the offset of the pointed-to relative pointer from its base.
§Safety
this
must be non-null, properly-aligned, and point to a valid
RelPtr
.
pub unsafe fn as_ptr_raw(this: *mut RelPtr<T, O>) -> *mut T
pub unsafe fn as_ptr_raw(this: *mut RelPtr<T, O>) -> *mut T
Calculates the memory address being pointed to by the pointed-to relative pointer.
§Safety
this
must be non-null, properly-aligned, and point to a validRelPtr
.- The offset of this relative pointer, when added to its base, must be located in the same allocated object as it.
pub unsafe fn as_ptr_wrapping_raw(this: *mut RelPtr<T, O>) -> *mut T
pub unsafe fn as_ptr_wrapping_raw(this: *mut RelPtr<T, O>) -> *mut T
Calculates the memory address being pointed to by the pointed-to relative pointer using wrapping methods.
This method is a safer but potentially slower version of as_ptr_raw
.
§Safety
this
must be non-null, properly-aligned, and point to a valid
RelPtr
.
pub unsafe fn is_invalid_raw(this: *mut RelPtr<T, O>) -> bool
pub unsafe fn is_invalid_raw(this: *mut RelPtr<T, O>) -> bool
Gets whether the offset of the pointed-to relative pointer is invalid.
§Safety
this
must be non-null, properly-aligned, and point to a valid
RawRelPtr
.
pub fn base_mut(this: Seal<'_, RelPtr<T, O>>) -> *mut u8
pub fn base_mut(this: Seal<'_, RelPtr<T, O>>) -> *mut u8
Gets the mutable base pointer for this relative pointer.
pub fn is_invalid(&self) -> bool
pub fn is_invalid(&self) -> bool
Gets whether the offset of the relative pointer is 0.
pub fn metadata(&self) -> &<T as ArchivePointee>::ArchivedMetadata
pub fn metadata(&self) -> &<T as ArchivePointee>::ArchivedMetadata
Gets the metadata of the relative pointer.
pub unsafe fn as_ptr(&self) -> *const T
pub unsafe fn as_ptr(&self) -> *const T
Calculates the memory address being pointed to by this relative pointer.
§Safety
The offset of this relative pointer, when added to its base, must be located in the same allocated object as it.
pub unsafe fn as_mut_ptr(this: Seal<'_, RelPtr<T, O>>) -> *mut T
pub unsafe fn as_mut_ptr(this: Seal<'_, RelPtr<T, O>>) -> *mut T
Calculates the mutable memory address being pointed to by this relative pointer.
§Safety
The offset of this relative pointer, when added to its base, must be located in the same allocated object as it.
pub fn as_ptr_wrapping(&self) -> *const T
pub fn as_ptr_wrapping(&self) -> *const T
Calculates the memory address being pointed to by this relative pointer using wrapping methods.
This method is a safer but potentially slower version of as_ptr
.
pub fn as_mut_ptr_wrapping(this: Seal<'_, RelPtr<T, O>>) -> *mut T
pub fn as_mut_ptr_wrapping(this: Seal<'_, RelPtr<T, O>>) -> *mut T
Calculates the mutable memory address being pointed to by this relative pointer using wrapping methods.
This method is a safer but potentially slower version of as_ptr
.
Trait Implementations§
§impl<T, O, __C> CheckBytes<__C> for RelPtr<T, O>where
T: ArchivePointee + ?Sized,
__C: Fallible + ?Sized,
<__C as Fallible>::Error: Trace,
RawRelPtr<O>: CheckBytes<__C>,
<T as ArchivePointee>::ArchivedMetadata: CheckBytes<__C>,
PhantomData<T>: CheckBytes<__C>,
impl<T, O, __C> CheckBytes<__C> for RelPtr<T, O>where
T: ArchivePointee + ?Sized,
__C: Fallible + ?Sized,
<__C as Fallible>::Error: Trace,
RawRelPtr<O>: CheckBytes<__C>,
<T as ArchivePointee>::ArchivedMetadata: CheckBytes<__C>,
PhantomData<T>: CheckBytes<__C>,
impl<T, O> Portable for RelPtr<T, O>where
T: ArchivePointee + ?Sized,
RawRelPtr<O>: Portable,
<T as ArchivePointee>::ArchivedMetadata: Portable,
PhantomData<T>: Portable,
Auto Trait Implementations§
impl<T, O> Freeze for RelPtr<T, O>
impl<T, O> RefUnwindSafe for RelPtr<T, O>where
<T as ArchivePointee>::ArchivedMetadata: RefUnwindSafe,
O: RefUnwindSafe,
T: RefUnwindSafe + ?Sized,
impl<T, O> Send for RelPtr<T, O>
impl<T, O> Sync for RelPtr<T, O>
impl<T, O> !Unpin for RelPtr<T, O>
impl<T, O> UnwindSafe for RelPtr<T, O>
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,
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.