Struct ReducedAllocComposer

pub struct ReducedAllocComposer {
    parser: BasicParser,
    position: Position,
    anchors: HashMap<String, Rc<OptimizedValue>>,
    limits: Limits,
    resource_tracker: ResourceTracker,
    alias_expansion_stack: Vec<String>,
    current_depth: usize,
}

An optimized composer that reduces allocations

Fields

parser: BasicParser

position: Position

anchors: HashMap<String, Rc<OptimizedValue>>

Store anchors using Rc for cheap cloning

limits: Limits

resource_tracker: ResourceTracker

alias_expansion_stack: Vec<String>

current_depth: usize

Implementations

impl ReducedAllocComposer

pub fn new(input: String) -> Self

Create a new optimized composer

pub fn with_limits(input: String, limits: Limits) -> Self

Create a new optimized composer with custom limits

fn compose_node(&mut self) -> Result<Option<OptimizedValue>>

Compose a node from events with reduced allocations

fn compose_scalar_optimized( &self, value: String, style: ScalarStyle, ) -> Result<OptimizedValue>

Compose a scalar value with optimization

fn compose_sequence(&mut self) -> Result<Option<OptimizedValue>>

Compose a sequence with reduced allocations

fn compose_mapping(&mut self) -> Result<Option<OptimizedValue>>

Compose a mapping with reduced allocations

fn process_merge_key( &self, mapping: &mut IndexMap<OptimizedValue, OptimizedValue>, merge_value: &OptimizedValue, ) -> Result<()>

Process a merge key by merging values into the current mapping

Trait Implementations

impl OptimizedComposer for ReducedAllocComposer

fn check_document(&self) -> bool

Check if there are more documents available

fn compose_document(&mut self) -> Result<Option<OptimizedValue>>

Compose the next document with minimal allocations

fn position(&self) -> Position

Get the current position in the stream

fn reset(&mut self)

Reset the composer state