Struct GraphCacheLimits 

pub struct GraphCacheLimits { /* private fields */ }

The retention ceilings one cache is bounded by.

There is no default. An editor, a continuous-integration process, and a batch consumer have different retention budgets, and a library that chose one implicitly would spend a host’s memory on its behalf. Zero disables retention for a category without disabling the computation behind it.

Implementations

impl GraphCacheLimits

pub fn new( max_source_projections: u32, max_exact_graphs: u32, max_selected_indexes_per_graph: u32, max_derived_products_per_graph: u32, ) -> Self

Ceilings for the four retention categories.

pub fn max_source_projections(self) -> u32

How many source-unit projections may be retained.

pub fn max_exact_graphs(self) -> u32

How many exact graphs may be retained.

pub fn max_selected_indexes_per_graph(self) -> u32

How many edge-selection index sets may be retained per cached graph.

pub fn max_derived_products_per_graph(self) -> u32

How many derived products may be retained per cached graph.

Trait Implementations

impl Clone for GraphCacheLimits

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphCacheLimits

impl Debug for GraphCacheLimits

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

Formats the value using the given formatter.

impl Eq for GraphCacheLimits

impl PartialEq for GraphCacheLimits

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphCacheLimits