Struct generic_vec::raw::Heap

#[repr(C)]pub struct Heap<T> { /* fields omitted */ }

Heap

Implementations

impl<T> Heap<T>

pub const fn new() -> Self

Create a new zero-capacity heap vector

pub const unsafe fn from_raw_parts(ptr: NonNull<T>, capacity: usize) -> Self

Create a new Heap<T>storage from the given pointer and capacity

Safety

If the capacity is non-zero

• You must have allocated the pointer from the global allocator
• The pointer must be valid to read-write for the range ptr..ptr.add(capacity)

pub const fn into_raw_parts(self) -> (NonNull<T>, usize)

Convert a Heap storage into a pointer and capacity, without deallocating the storage

Trait Implementations

impl<T> Default for Heap<T>

pub fn default() -> Self

Returns the "default value" for a type.

impl<T> Drop for Heap<T>

pub fn drop(&mut self)

Executes the destructor for this type.

impl<T> Send for Heap<T>

impl<T, U> Storage<U> for Heap<T>

pub fn is_valid_storage() -> bool

Returns true if the this storage can hold types T

pub fn capacity(&self) -> usize

The number of elements that it is valid to write to this Storage

pub fn as_ptr(&self) -> *const U

Returns a pointer to the first element

pub fn as_mut_ptr(&mut self) -> *mut U

Returns a mutable pointer to the first element

pub fn reserve(&mut self, new_capacity: usize)

Reserves space for at least new_capacity elements

pub fn try_reserve(&mut self, new_capacity: usize) -> Result<(), AllocError>

Tries to reserve space for at least new_capacity elements

impl<T, U> StorageWithCapacity<U> for Heap<T>

pub fn with_capacity(capacity: usize) -> Self

Creates a new storage with at least the given storage capacity

impl<T> Sync for Heap<T>