Struct VecHistoric 

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

Implementations

impl<T> VecHistoric<T>

pub fn pop_back(&mut self) -> Option<T>

Removes the last element from a vector and returns it, or None if it is empty. History and selects are wiped for preventing index shifting

pub fn pop_front(&mut self) -> Option<T>

Removes the last element from a vector and returns it, or None if it is empty. History and selects are wiped for preventing index shifting

pub fn push_back(&mut self, value: T)

Appends an element to the back of a VecHistoric.

Panics

Panics if the number of elements in the VecHistoric overflows a usize.

pub fn push_front(&mut self, value: T)

Appends an element to the front of a VecHistoric. History and selects are wiped for preventing index shifting

Panics

Panics if the number of elements in the VecHistoric overflows a usize.

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

Inserts an element at position index within the vector History and selects are wiped for preventing index shifting

Panics

Panics if index > len.

pub fn insert_many(&mut self, index: usize, iter: impl IntoIterator<Item = T>)

Inserts elements or iterator at position index within the vector History and selects are wiped for preventing index shifting

Panics

Panics if index > len.

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

Removes an element from the VecHistoric and returns it. History and selects are wiped for preventing index shifting

Panics

Panics if index >= self.len().

Computational amount

O(n), n = |index - self.gap()|

pub fn len(&self) -> usize

Returns the number of elements in the VecHistoric.

pub fn is_empty(&self) -> bool

Returns true if the VecHistoric contains no elements.

pub fn clear(&mut self)

Clears the GapBuffer, removing all values. History and selects are wiped for preventing index shifting

Note that this method has no effect on the allocated capacity of the GapBuffer.

pub fn drain(&mut self, range: impl RangeBounds<usize>) -> Drain<'_, T>

Creates a draining iterator that removes the specified range in the GapBuffer and yields the removed items. History and selects are wiped for preventing index shifting

• Note 1: The element range is removed even if the iterator is only partially consumed or not consumed at all.
• Note 2: It is unspecified how many elements are removed from the GapBuffer if the Drain value is leaked.

Panics

Panics if the range is out of bounds.

pub fn get_inner_data(&self) -> &GapBuffer<T>

Returns inner gap_buffer.

pub fn get_inner_data_mut(&mut self) -> &mut GapBuffer<T>

Returns inner gap_buffer.

impl<T> VecHistoric<T>

pub fn undo(&mut self) -> Vec<T>

Undo last action in the collection and returns erased elements of it If history len is 0 OR an action contains no elements returns empty vec

pub fn clear_history(&mut self) -> Vec<T>

Clears the history and returns all elements of all erased actions

pub fn clear_selects(&mut self)

Clears selects

pub fn len_selects(&self) -> usize

Returns the count of selected elements

pub fn len_history(&self) -> usize

Returns the count of actions

pub fn iter_selects(&self) -> Iter<'_, usize>

Returns the iterator of selections

pub fn iter_history(&self) -> Iter<'_, Action<T>>

Returns the iterator of history

pub fn get_selected(&self) -> Vec<&T>

Returns the values of selected elements

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

Selects an element by index

pub fn deselect(&mut self, index: usize) -> bool

Deselects an element by index

pub fn is_selected(&mut self, index: usize) -> bool

Returns true if an element is selected

pub fn deselect_all(&mut self)

Deselect all elements

pub fn select_all(&mut self)

Selects all elements

pub fn pop_back_historic(&mut self) -> Option<&T>

Removes the last element from a VecHistoric and returns its address, or None if it is empty. Creates an action in history sequence

pub fn pop_front_historic(&mut self) -> Option<&T>

Removes the first element from a VecHistoric and returns its address, or None if it is empty. Creates an action in history sequence

pub fn push_back_historic(&mut self, value: T)

Appends an element to the back of a VecHistoric. Creates an action in history sequence

Panics

Panics if the number of elements in the VecHistoric overflows a usize.

pub fn push_front_historic(&mut self, value: T)

Appends an element to the front of a VecHistoric. Creates an action in history sequence

Panics

Panics if the number of elements in the VecHistoric overflows a usize.

pub fn insert_historic(&mut self, index: usize, value: T)

Inserts an element at position index within the VecHistoric Selects the inserted element Creates an action in history sequence

Panics

Panics if index > len.

pub fn insert_many_historic( &mut self, index: usize, iter: impl IntoIterator<Item = T>, )

Inserts an elements or iterator at position index within the VecHistoric Selects the inserted elements Creates an action in history sequence

Panics

Panics if index > len.

pub fn remove_selects(&mut self) -> Vec<T>

Removes selected elements and returns them

pub fn remove_selects_historic(&mut self) -> &Vec<T>

Removes selected elements and returns address of the removed elements Creates an action in history sequence

pub fn move_selects(&mut self, to_index: usize)

Moves selected elements to a specific position index History and selects are wiped for preventing index shifting

pub fn move_selects_historic(&mut self, to_index: usize)

Moves selected elements to a specific position index Creates an action in history sequence

impl<T> VecHistoric<T>

pub fn from_data(data: GapBuffer<T>) -> Self

pub fn new() -> Self

Creates an empty collection.

pub fn with_capacity(cap: usize) -> Self

Creates an empty collection with the specified capacity (if supported).

pub fn from_slice(slice: &[T]) -> Self

where T: Clone,

Creates a collection from a slice by cloning each element.

pub fn from_array<const N: usize>(arr: [T; N]) -> Self

Creates a collection from an array.

pub fn repeat(value: T, n: usize) -> Self

where T: Clone,

Creates a collection with n clones of a given value.

pub fn to_owned_from(slice: &[T]) -> Self

where T: Clone,

Converts a slice into a collection (alias to from_slice).

Trait Implementations

impl<T: Clone> Clone for VecHistoric<T>

fn clone(&self) -> VecHistoric<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for VecHistoric<T>

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

Formats the value using the given formatter.

impl<T> Extend<T> for VecHistoric<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> From<GapBuffer<T>> for VecHistoric<T>

fn from(other: GapBuffer<T>) -> Self

Converts to this type from the input type.

impl<T> FromIterator<T> for VecHistoric<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: Hash> Hash for VecHistoric<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Index<usize> for VecHistoric<T>

type Output = T

The returned type after indexing.

fn index(&self, idx: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<T> IndexMut<usize> for VecHistoric<T>

fn index_mut(&mut self, idx: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<'a, T> IntoIterator for &'a VecHistoric<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Chain<Iter<'a, T>, Iter<'a, T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut VecHistoric<T>

type Item = &'a mut T

The type of the elements being iterated over.

type IntoIter = Chain<IterMut<'a, T>, IterMut<'a, T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for VecHistoric<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> Ord for VecHistoric<T>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for VecHistoric<T>

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialOrd> PartialOrd for VecHistoric<T>

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Eq> Eq for VecHistoric<T>