Struct NearestRangeState 

pub struct NearestRangeState { /* private fields */ }

Tracks a range of indices near the first visible item for optimized key lookup.

Instead of searching all items (O(n)), we only search within this range. The range is calculated using a sliding window that only updates when the first visible item crosses a window boundary.

Matches JC’s LazyLayoutNearestRangeState.

Implementations

impl NearestRangeState

pub fn new(first_visible_item: usize) -> Self

Creates a new NearestRangeState with default window sizes.

pub fn with_sizes( first_visible_item: usize, sliding_window_size: usize, extra_item_count: usize, ) -> Self

Creates a NearestRangeState with custom window sizes.

pub fn range(&self) -> Range<usize>

Returns the current range of indices to search.

pub fn update(&mut self, first_visible_item: usize)

Updates the range based on the new first visible item. Only recalculates when crossing a window boundary.

Trait Implementations

impl Clone for NearestRangeState

fn clone(&self) -> NearestRangeState

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NearestRangeState

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

Formats the value using the given formatter.

impl Default for NearestRangeState

fn default() -> Self

Returns the “default value” for a type.