Struct ReusableIndexScratch 

pub struct ReusableIndexScratch<K, S = RandomState> { /* private fields */ }

Reusable duplicate-detection plus stable-order scratch for planner hot paths.

Implementations

impl<K, S> ReusableIndexScratch<K, S>

where K: Eq + Hash, S: BuildHasher + Default,

pub fn new() -> Self

Create empty reusable index scratch.

pub fn clear(&mut self)

Clear retained scratch entries without releasing retained capacity.

pub fn try_reserve_with<E>( &mut self, policy: ReservationPolicy, capacity: usize, seen_item: &'static str, ordered_indices_item: &'static str, failure: StagingReservationFailureAdapter<E>, ) -> Result<(), E>

Reserve duplicate-detection and ordering scratch to the requested capacity.

Errors

Returns E when either retained scratch collection cannot reserve memory.

pub fn insert_seen(&mut self, key: K) -> bool

Insert a duplicate-detection key.

pub fn push_index(&mut self, index: usize)

Append an input index to the reusable ordering buffer.

pub fn ordered_indices_mut(&mut self) -> &mut Vec<usize>

Mutable ordering buffer for planner-specific sort keys.

pub fn sort_indices_unstable_by_key_if_needed<Key, F>(&mut self, key: F)

where Key: Ord, F: FnMut(usize) -> Key,

Sort ordered indices only when the current key order is not already monotonic.

pub fn ordered_indices(&self) -> &[usize]

Ordered input indices after planner-specific sorting.

pub fn seen_capacity(&self) -> usize

Retained duplicate-detection capacity.

pub fn ordered_index_capacity(&self) -> usize

Retained ordering capacity.

Trait Implementations

impl<K, S> Debug for ReusableIndexScratch<K, S>

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

Formats the value using the given formatter.

impl<K, S> Default for ReusableIndexScratch<K, S>

where S: Default,

fn default() -> Self

Returns the “default value” for a type.