Struct KeyedSelectionModel 

pub struct KeyedSelectionModel<K: ItemKey> { /* private fields */ }

Selection state keyed by source-defined identity rather than visible index.

The selection set is exposed as a Signal<HashSet<K>> (via selection_signal) so widgets observe it reactively without polling. Cloning the model shares the same selection and anchor across all handles. The Shift+click anchor is stored as a K so it survives lazy-window evictions and visible-order changes.

Implementations

impl<K: ItemKey> KeyedSelectionModel<K>

pub fn new(mode: SelectionMode) -> Self

Create a new keyed selection model with the given mode.

pub fn mode(&self) -> SelectionMode

The selection mode.

pub fn selection_signal(&self) -> Signal<HashSet<K>>

A clone of the selection signal for reactive binding.

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

Whether key is currently selected (O(1)).

pub fn selected_keys(&self) -> Vec<K>

The currently selected keys (unordered snapshot).

pub fn count(&self) -> usize

Number of selected items.

pub fn select(&self, key: K)

Select a single key, clearing previous selection and setting the anchor.

pub fn toggle(&self, key: K)

Toggle a key (Ctrl+click in Multi mode; acts as select in Single).

pub fn extend_to(&self, target: K, ordered_keys: &[K])

Extend the selection from the anchor to target over the current visible key order (Shift+click). ordered_keys is the projection’s visible order at click time. If the anchor isn’t currently visible (scrolled out / evicted), falls back to a single-key select.

pub fn select_keys(&self, keys: impl IntoIterator<Item = K>, additive: bool)

Replace the selection with keys (or, when additive, union them in). Used by rubber-band selection. In Single mode an arbitrary one wins.

pub fn clear(&self)

Clear the selection and anchor.

pub fn prune_missing(&self, exists: impl Fn(&K) -> bool)

Drop any selected key (and the anchor) for which exists returns false. Call after a removal/reset to prune deleted rows — the index-based adjust_for_insert/adjust_for_remove are unnecessary here because keys are stable across inserts, moves, sorts and filters.

impl<K: ItemKey> KeyedSelectionModel<K>

pub fn debug_named(self, _name: impl Into<String>) -> Self

Register this model with the debug inspector under name; no-op in release builds (!cfg(debug_assertions)). Returns self for chaining.

Trait Implementations

impl<K: ItemKey> Clone for KeyedSelectionModel<K>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: ItemKey> Debug for KeyedSelectionModel<K>

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

Formats the value using the given formatter.