Struct GreedyMemoryPool 

pub struct GreedyMemoryPool {
    pool_size: usize,
    used: AtomicUsize,
}

A MemoryPool that implements a greedy first-come first-serve limit.

This pool works well for queries that do not need to spill or have a single spillable operator. See FairSpillPool if there are multiple spillable operators that all will spill.

Fields

pool_size: usize

used: AtomicUsize

Implementations

impl GreedyMemoryPool

pub fn new(pool_size: usize) -> GreedyMemoryPool

Create a new pool that can allocate up to pool_size bytes

Trait Implementations

impl Debug for GreedyMemoryPool

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

Formats the value using the given formatter.

impl MemoryPool for GreedyMemoryPool

fn grow(&self, _reservation: &MemoryReservation, additional: usize)

Infallibly grow the provided reservation by additional bytes

fn shrink(&self, _reservation: &MemoryReservation, shrink: usize)

Infallibly shrink the provided reservation by shrink bytes

fn try_grow( &self, reservation: &MemoryReservation, additional: usize, ) -> Result<(), DataFusionError>

Attempt to grow the provided reservation by additional bytes

fn reserved(&self) -> usize

Return the total amount of memory reserved

fn memory_limit(&self) -> MemoryLimit

Return the memory limit of the pool

fn register(&self, _consumer: &MemoryConsumer)

Registers a new MemoryConsumer

fn unregister(&self, _consumer: &MemoryConsumer)

Records the destruction of a MemoryReservation with MemoryConsumer