Struct BufferFoldProvider 

pub struct BufferFoldProvider<'a> { /* private fields */ }

FoldProvider adapter wrapping a &hjkl_buffer::Buffer. Lets engine call sites ask the buffer’s fold storage about visible rows without reaching into Buffer::next_visible_row &c. directly.

Construct with BufferFoldProvider::new. Hosts that want to expose their own fold model (a separate fold tree, LSP-derived folding ranges, …) can implement FoldProvider against their own state and skip this adapter entirely.

Introduced in 0.0.32 (Patch C-β) as part of the fold-iteration relocation. Fold storage still lives on the buffer for dirty_gen / render-cache reasons; only the iteration API moved.

Implementations

impl<'a> BufferFoldProvider<'a>

pub fn new(buffer: &'a RopeBuffer) -> Self

Trait Implementations

impl FoldProvider for BufferFoldProvider<'_>

fn next_visible_row(&self, row: usize, _row_count: usize) -> Option<usize>

First visible row strictly after row, skipping hidden rows. None past the end of the buffer.

fn prev_visible_row(&self, row: usize) -> Option<usize>

First visible row strictly before row. None past the top.

fn is_row_hidden(&self, row: usize) -> bool

Is row currently hidden by a closed fold?

fn fold_at_row(&self, row: usize) -> Option<(usize, usize, bool)>

Range (start_row, end_row, closed) of the fold containing row, if any. Lets za / zo / zc find their target without iterating the full fold list.

fn apply(&mut self, op: FoldOp)

Apply a FoldOp to the underlying fold storage. Read-only providers (e.g. crate::buffer_impl::BufferFoldProvider which holds a &Buffer) and providers that don’t track folds (e.g. NoopFoldProvider) implement this as a no-op.

fn invalidate_range(&mut self, start_row: usize, end_row: usize)

Drop every fold whose range overlaps [start_row, end_row]. Edit pipelines call this after a user edit so vim’s “edits inside a fold open it” behaviour fires. Default impl forwards to FoldProvider::apply with a FoldOp::Invalidate.