Struct BuiltinCompactAlgorithm 

pub struct BuiltinCompactAlgorithm;

The shipped default algorithm. All hooks are the trait defaults (builtin behavior).

Trait Implementations

impl Clone for BuiltinCompactAlgorithm

fn clone(&self) -> BuiltinCompactAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl CompactAlgorithm for BuiltinCompactAlgorithm

fn name(&self) -> &str

Canonical name — matched against CompactionSettings.algorithm.

fn decide_compact<'life0, 'life1, 'async_trait>( &'life0 self, context_tokens: u64, context_window: u32, settings: &'life1 CompactionSettings, ) -> Pin<Box<dyn Future<Output = bool> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Decide whether a compaction should trigger at this context level. Default: the builtin 80%-of-window heuristic.

fn select_cut_point<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, entries: &'life1 [SessionTreeEntry], settings: &'life2 CompactionSettings, ) -> Pin<Box<dyn Future<Output = CutPointResult> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Choose the cut point (entries[..cut] get folded). Must land on a valid index in [0, entries.len()]. Default: turn-boundary-safe keep_recent_tokens walk.

fn summarize_prefix<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, request: &'life1 SummarizeRequest<'life2>, ) -> Pin<Box<dyn Future<Output = Result<SummaryOutcome, SummarizeError>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait,

Summarize the folded prefix. Default: LLM summarization with the budget-retry loop.

impl Copy for BuiltinCompactAlgorithm

impl Debug for BuiltinCompactAlgorithm

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

Formats the value using the given formatter.

impl Default for BuiltinCompactAlgorithm

fn default() -> BuiltinCompactAlgorithm

Returns the “default value” for a type.