Struct MemoryPlanOptions 

pub struct MemoryPlanOptions {
    pub allocate_params: bool,
    pub allocate_inputs: bool,
    pub allocate_constants: bool,
}

Assign buffers using a greedy best-fit algorithm.

Sorts buffers by size (largest first), then for each buffer finds the smallest free gap in the arena during its live interval. This is a simplified version of XLA’s GlobalDecreasingSizeBestFitHeap. Controls which graph boundaries receive arena slots during planning.

Inference graphs use Self::inference (all boundaries allocated). Backward graphs in a training pair use Self::backward_activations_only: parameters borrow offsets from the forward plan via SharedWeightLayout so weights are not stored twice in the activation arena.

Fields

allocate_params: bool

allocate_inputs: bool

allocate_constants: bool

Implementations

impl MemoryPlanOptions

pub fn inference() -> Self

pub fn backward_activations_only() -> Self

Activations + inputs/constants only; params bound via SharedWeightLayout.

Trait Implementations

impl Clone for MemoryPlanOptions

fn clone(&self) -> MemoryPlanOptions

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MemoryPlanOptions

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

Formats the value using the given formatter.

impl Default for MemoryPlanOptions

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for MemoryPlanOptions

fn eq(&self, other: &MemoryPlanOptions) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for MemoryPlanOptions

impl Eq for MemoryPlanOptions

impl StructuralPartialEq for MemoryPlanOptions