Skip to main content

MemoryPool

Struct MemoryPool 

Source
pub struct MemoryPool<T> {
    pool: Vec<T>,
    chunks: Vec<Vec<T>>,
    unused: Vec<NonNull<T>>,
}

Fields§

§pool: Vec<T>§chunks: Vec<Vec<T>>§unused: Vec<NonNull<T>>

Implementations§

Source§

impl<T> MemoryPool<T>

Source

pub fn new() -> Self

Examples found in repository?
crates/competitive/src/data_structure/persistent_segment_tree.rs (line 69)
65    pub fn new(len: usize) -> Self {
66        Self {
67            len,
68            version_roots: vec![None],
69            allocator: MemoryPool::new(),
70        }
71    }
Source

pub fn with_capacity(capacity: usize) -> Self

Examples found in repository?
crates/competitive/src/data_structure/allocator.rs (line 21)
20    fn default() -> Self {
21        Self::with_capacity(CAP / 1usize.max(size_of::<T>()))
22    }
More examples
Hide additional examples
crates/competitive/src/tree/link_cut_tree.rs (line 160)
157    pub fn with_capacity(capacity: usize) -> Self {
158        Self {
159            nodes: Vec::with_capacity(capacity),
160            allocator: MemoryPool::with_capacity(capacity),
161        }
162    }
crates/competitive/src/data_structure/splay_tree.rs (line 173)
169    pub fn with_capacity(capacity: usize) -> Self {
170        Self {
171            root: None,
172            length: 0,
173            allocator: ManuallyDrop::new(MemoryPool::with_capacity(capacity)),
174        }
175    }
crates/competitive/src/data_structure/implicit_splay_tree.rs (line 226)
222    pub fn with_capacity(capacity: usize) -> Self {
223        Self {
224            root: None,
225            length: 0,
226            allocator: ManuallyDrop::new(MemoryPool::with_capacity(capacity)),
227            _marker: PhantomData,
228        }
229    }
crates/competitive/src/tree/top_tree.rs (line 313)
310    pub fn with_capacity(capacity: usize) -> Self {
311        Self {
312            nodes: Vec::with_capacity(capacity),
313            node_allocator: MemoryPool::with_capacity(capacity),
314            rake_allocator: MemoryPool::with_capacity(capacity),
315        }
316    }
crates/competitive/src/data_structure/implicit_treap.rs (line 273)
268    pub fn with_capacity(capacity: usize) -> Self {
269        Self {
270            root: None,
271            length: 0,
272            rng: Xorshift::new(),
273            allocator: ManuallyDrop::new(MemoryPool::with_capacity(capacity)),
274            _marker: PhantomData,
275        }
276    }

Trait Implementations§

Source§

impl<T> Allocator<T> for MemoryPool<T>

Source§

fn allocate(&mut self, value: T) -> NonNull<T>

Source§

fn deallocate(&mut self, ptr: NonNull<T>) -> T

Source§

impl<T: Debug> Debug for MemoryPool<T>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<T> Default for MemoryPool<T>

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl<T> Drop for MemoryPool<T>

Source§

fn drop(&mut self)

Executes the destructor for this type. Read more
Source§

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)
Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned. Read more

Auto Trait Implementations§

§

impl<T> !Send for MemoryPool<T>

§

impl<T> !Sync for MemoryPool<T>

§

impl<T> Freeze for MemoryPool<T>
where Vec<T>: Freeze, Vec<Vec<T>>: Freeze, Vec<NonNull<T>>: Freeze,

§

impl<T> RefUnwindSafe for MemoryPool<T>

§

impl<T> Unpin for MemoryPool<T>
where Vec<T>: Unpin, Vec<Vec<T>>: Unpin, Vec<NonNull<T>>: Unpin,

§

impl<T> UnsafeUnpin for MemoryPool<T>

§

impl<T> UnwindSafe for MemoryPool<T>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToArrayVecScalar for T

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.