pub struct DstStack<DST: ?Sized, BUF: DstBuf> { /* private fields */ }
Available on crate feature
unsafe_layout
only.Expand description
A statically allocated LIFO stack of DSTs.
Note: Each item in the stack takes at least one slot in the buffer (to store the metadata)
Implementations§
Source§impl<DST: ?Sized, BUF: DstBuf> DstStack<DST, BUF>
impl<DST: ?Sized, BUF: DstBuf> DstStack<DST, BUF>
Sourcepub const fn new_const() -> Selfwhere
BUF: ConstDefault,
pub const fn new_const() -> Selfwhere
BUF: ConstDefault,
Constructs a new (empty) stack, in compile-time.
Sourcepub const fn with_buffer(buffer: BUF) -> Self
pub const fn with_buffer(buffer: BUF) -> Self
Constructs a new (empty) stack using the given buffer
.
Sourcepub fn push<VAL, F: FnOnce(&VAL) -> &DST>(
&mut self,
v: VAL,
f: F,
) -> Result<(), VAL> ⓘwhere
(VAL, BUF::Inner): MemAligned,
pub fn push<VAL, F: FnOnce(&VAL) -> &DST>(
&mut self,
v: VAL,
f: F,
) -> Result<(), VAL> ⓘwhere
(VAL, BUF::Inner): MemAligned,
Pushes a value at the top of the stack.
let mut stack = DstStack::<[u8], DstArray<u64, 8>>::new();
stack.push([1, 2,3], |v| v);
Sourcepub fn top_mut(&mut self) -> Option<&mut DST> ⓘ
pub fn top_mut(&mut self) -> Option<&mut DST> ⓘ
Returns an exclusive reference to the top item on the stack.
Sourcepub const fn iter(&self) -> DstStackIter<'_, DST, BUF> ⓘ
pub const fn iter(&self) -> DstStackIter<'_, DST, BUF> ⓘ
Returns an immutable iterator (yields references to items, in the order they would be popped).
§Examples
let mut list = DstStack::<str, DstArray<usize, 8>>::new();
list.push_str("Hello");
list.push_str("world");
let mut it = list.iter();
assert_eq!(it.next(), Some("world"));
assert_eq!(it.next(), Some("Hello"));
assert_eq!(it.next(), None);
Sourcepub fn iter_mut(&mut self) -> DstStackIterMut<'_, DST, BUF> ⓘ
pub fn iter_mut(&mut self) -> DstStackIterMut<'_, DST, BUF> ⓘ
Returns a mutable iterator.
§Examples
let mut list = DstStack::<[u8], DstArray<usize, 8>>::new();
list.push_copied(&[1,2,3]);
list.push_copied(&[9]);
for v in list.iter_mut() {
v[0] -= 1;
}
let mut it = list.iter();
assert_eq!(it.next(), Some(&[8][..]));
assert_eq!(it.next(), Some(&[0,2,3][..]));
assert_eq!(it.next(), None);
Source§impl<BUF: DstBuf, DST: Clone> DstStack<[DST], BUF>where
(DST, BUF::Inner): MemAligned,
impl<BUF: DstBuf, DST: Clone> DstStack<[DST], BUF>where
(DST, BUF::Inner): MemAligned,
Source§impl<BUF: DstBuf, DST> DstStack<[DST], BUF>where
(DST, BUF::Inner): MemAligned,
impl<BUF: DstBuf, DST> DstStack<[DST], BUF>where
(DST, BUF::Inner): MemAligned,
Sourcepub fn push_from_iter(
&mut self,
iter: impl ExactSizeIterator<Item = DST>,
) -> Result<(), ()> ⓘ
pub fn push_from_iter( &mut self, iter: impl ExactSizeIterator<Item = DST>, ) -> Result<(), ()> ⓘ
Pushes an item, populated from an exact-sized iterator.
§Examples
let mut stack = DstStack::<[u8], DstArray<usize, 8>>::new();
stack.push_from_iter(0..10);
assert_eq!(stack.top().unwrap(), &[0,1,2,3,4,5,6,7,8,9]);
Trait Implementations§
Auto Trait Implementations§
impl<DST, BUF> Freeze for DstStack<DST, BUF>
impl<DST, BUF> RefUnwindSafe for DstStack<DST, BUF>
impl<DST, BUF> !Send for DstStack<DST, BUF>
impl<DST, BUF> !Sync for DstStack<DST, BUF>
impl<DST, BUF> Unpin for DstStack<DST, BUF>
impl<DST, BUF> UnwindSafe for DstStack<DST, BUF>
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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
Mutably borrows from an owned value. Read more
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
The alignment of this type in bytes.
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Returns the alignment of this type in bytes.
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 = _
Know whether dropping values of this type matters, in compile-time.
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Returns the alignment of the pointed-to value in bytes. Read more
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Returns the size of the pointed-to value in bytes. Read more
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
Returns
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
Forgets about
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
Available on crate feature
unsafe_layout
only.Returns the value of type
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
Available on crate feature
unsafe_layout
only.Returns the value of type
T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
Available on crate feature
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> ⓘ
Converts
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> ⓘ
Converts
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> ⓘ
Returns the layout of the type.
§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
Returns whether the given value has been niched. Read more
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out
indicating that a T
is niched.