Struct ChangeAwareList 

pub struct ChangeAwareList<T> { /* private fields */ }

A list that records its changes until they are captured (ChangeAwareList<T>), batching consecutive insertions and removals into ranges as upstream does.

Implementations

impl<T: Clone + PartialEq> ChangeAwareList<T>

pub fn new() -> Self

An empty list (ChangeAwareList(int capacity = -1)).

pub fn with_capacity(capacity: usize) -> Self

An empty list with room for capacity items.

pub fn from_items(items: Vec<T>) -> Self

A list of the items, whose first change adds them (ChangeAwareList(IEnumerable<T>)).

pub fn from_list(list: &ChangeAwareList<T>, copy_changes: bool) -> Self

A copy of list, with its changes or without (ChangeAwareList(ChangeAwareList<T>, bool)).

pub fn count(&self) -> usize

The number of items (Count).

pub fn is_empty(&self) -> bool

pub fn items(&self) -> &[T]

The items.

pub fn get(&self, index: usize) -> &T

The item at index (the indexer’s getter).

pub fn set(&mut self, index: usize, item: T)

Replaces the item at index (the indexer’s setter, SetItem).

pub fn add(&mut self, item: T)

Adds an item at the end (Add).

pub fn capture_changes(&mut self) -> ChangeSet<T>

The changes since the last capture, and a clean slate (CaptureChanges): removals that emptied the list are reported as one Clear.

pub fn clear(&mut self)

Removes every item (Clear).

pub fn contains(&self, item: &T) -> bool

Whether the list has item (Contains).

pub fn index_of(&self, item: &T) -> Option<usize>

The index of item (IndexOf).

pub fn index_of_with( &self, item: &T, comparer: &dyn Fn(&T, &T) -> bool, ) -> Option<usize>

The index of item by comparer (IndexOf(T, IEqualityComparer<T>)).

pub fn insert(&mut self, index: usize, item: T)

Inserts an item (Insert).

Panics

When index is beyond the end (ArgumentException).

pub fn move_item(&mut self, item: &T, destination: usize)

Moves item to destination (Move(T, int)).

pub fn refresh_with(&mut self, item: T, index: usize)

Replaces the item at index with item and reports a refresh (Refresh(T, int)).

pub fn refresh(&mut self, item: &T) -> bool

Reports a refresh of item; false when it is not in the list (Refresh(T)).

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

Reports a refresh of the item at index (RefreshAt).

pub fn remove(&mut self, item: &T) -> bool

Removes item; false when it is not in the list (Remove(T)).

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

Removes the item at index (RemoveAt).

impl<T: Clone + PartialEq> ChangeAwareList<T>

pub fn add_range(&mut self, items: Vec<T>)

Adds the items at the end (AddRange).

pub fn remove_range(&mut self, index: usize, count: usize)

Removes count items from index (RemoveRange).

Trait Implementations

impl<T: Clone + PartialEq> Default for ChangeAwareList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Clone + PartialEq> IExtendedList<T> for ChangeAwareList<T>

fn insert_range(&mut self, items: Vec<T>, index: usize)

Inserts the items at index (InsertRange).

fn move_index(&mut self, original: usize, destination: usize)

Moves the item at original to destination (Move(int, int)).

impl<T: Clone + PartialEq> IList<T> for ChangeAwareList<T>

fn count(&self) -> usize

The number of items (Count).

fn get(&self, index: usize) -> T

The item at index (the indexer’s getter).

fn set(&mut self, index: usize, item: T)

Replaces the item at index (the indexer’s setter).

fn insert(&mut self, index: usize, item: T)

Inserts an item (Insert).

fn remove_at(&mut self, index: usize)

Removes the item at index (RemoveAt).

fn clear(&mut self)

Removes every item (Clear).

fn add(&mut self, item: T)

Adds an item at the end (Add).

fn index_of(&self, item: &T) -> Option<usize>

The index of item (IndexOf).

fn remove(&mut self, item: &T) -> bool

Removes item; false when it is not in the list (Remove).

fn add_range(&mut self, items: Vec<T>)

Adds the items at the end (ListEx.AddRange): one by one unless the list adds ranges.

fn add_or_insert_range(&mut self, items: Vec<T>, index: Option<usize>)

Inserts the items at index, or adds them without an index (ListEx.AddOrInsertRange): in reverse order at the index unless the list inserts ranges, as upstream does.

fn remove_range(&mut self, index: usize, count: usize)

Removes count items from index (ListEx.RemoveRange).

fn supports_ranges(&self) -> bool

Whether the list removes ranges at once (List<T> or IExtendedList<T>).

fn move_item(&mut self, original: usize, destination: usize)

Moves the item at original to destination (the Moved case of ListEx.Clone).

fn refresh_at(&mut self, index: usize, _item: T)

Reports a refresh of the item at index (the Refresh case of ListEx.Clone): the item is removed and inserted again unless the list reports refreshes.

fn index_of_with( &self, item: &T, comparer: &dyn Fn(&T, &T) -> bool, ) -> Option<usize>

The index of item by comparer (ListEx.IndexOf(IEnumerable, T, IEqualityComparer)).