Struct PaneBufferHistory 

pub struct PaneBufferHistory { /* private fields */ }

One pane’s buffer trail plus the walk cursor.

entries is oldest → newest; cursor indexes the entry currently displayed. Browser / jump-list semantics: visiting a new buffer while walked back truncates the forward tail.

Implementations

impl PaneBufferHistory

pub fn seeded(entry: PaneHistoryEntry) -> Self

Seed a pane’s history with the buffer it is already showing, so the first <C-6> has an origin to go back from.

pub fn entries(&self) -> &[PaneHistoryEntry]

pub fn cursor(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn current(&self) -> Option<&PaneHistoryEntry>

The entry currently displayed, if any.

pub fn update_current_position(&mut self, cursor: Position, scroll: u32)

Update the current entry’s cursor/scroll — the pane’s outgoing position, captured just before leaving for another buffer so walking back returns to where the user actually was.

pub fn repoint_current(&mut self, buffer: BufferId)

Point the current entry at a different buffer id without moving the trail.

For :e! — a reload replaces the buffer actor (new BufferId) while the pane keeps showing the same file. Pushing would put the same path in the trail twice for what the user experiences as a refresh; leaving it alone would strand the entry on a dead id.

pub fn push(&mut self, entry: PaneHistoryEntry, cap: usize)

Record a visit to entry, truncating any forward tail.

cap bounds the ring (pane.buffer-history-size); the oldest entries are evicted and cursor shifts down with them so the current position does not drift onto a different buffer.

A visit to the buffer already current is ignored — the recording chokepoint guards on this too, but keeping the structure idempotent means a second caller can’t corrupt the trail.

pub fn back(&mut self) -> Option<PaneHistoryEntry>

Step back one entry, returning the entry now current.

None at the oldest entry — the caller echoes rather than wrapping. Wrapping would turn a directional key into a cycle.

A walk never records. Moving the cursor is the whole operation; pushing here would make the forward direction unreachable.

pub fn forward(&mut self) -> Option<PaneHistoryEntry>

Step forward one entry, returning the entry now current. None at the newest entry.

pub fn jump_to(&mut self, index: usize) -> Option<PaneHistoryEntry>

Move the walk cursor to an explicit index — the picker’s random-access walk. Accepting a picker row is not a new visit, so this moves rather than pushes. Out-of-range is a no-op.

pub fn retain_live<F>(&mut self, still_live: F)

where F: Fn(BufferId) -> bool,

Drop every entry whose buffer still_live rejects, keeping the walk cursor on the nearest surviving entry.

Buffers deleted with :bd are pruned lazily as the walk passes them rather than eagerly on delete — that keeps :bd from having to know about a structure it should not know about.

Trait Implementations

impl Clone for PaneBufferHistory

fn clone(&self) -> PaneBufferHistory

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PaneBufferHistory

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

Formats the value using the given formatter.

impl Default for PaneBufferHistory

fn default() -> PaneBufferHistory

Returns the “default value” for a type.

impl Eq for PaneBufferHistory

impl PartialEq for PaneBufferHistory

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PaneBufferHistory