Grindstone::Memory::Allocators::LinearAllocator Class Reference

A linear allocator where memory can only be deallocated when the entire allocator is cleared. More...

#include <LinearAllocator.hpp>

Public Member Functions
void	Initialize (void *ownedMemory, size_t size)
bool	Initialize (size_t size)
void *	Allocate (size_t size)
void	Clear ()
void	ClearAndZero ()
void	Destroy ()
template<typename T , typename... Args>
T *	Allocate (Args &&... params)
template<typename T >
T *	AllocateWithoutConstructor ()

Detailed Description

A linear allocator where memory can only be deallocated when the entire allocator is cleared.

Memory in a linear allocator is allocated sequentially, similar to a StackAllocator, one after the other. This removes the possibility of fragmentation, but with LinearAllocators specifically, they are never deallocated. Also known as an arena allocator.

---

The documentation for this class was generated from the following files:

• /github/workspace/sources/code/Common/Memory/Allocators/LinearAllocator.hpp
• /github/workspace/sources/code/Common/Memory/Allocators/LinearAllocator.cpp