Struct yewtil::History

pub struct History<T>(_);

Wrapper that keeps track of prior values that have been assigned to it.

It keeps values that have been set for it around for the duration of its lifetime, or until they are dropped by calling reset or forget.

Prior values can be iterated over as well.

Implementations

impl<T> History<T>

pub fn new(value: T) -> Self

Creates a new history wrapper.

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

Set the value represented by the History struct.

This pushes the new value into the front of a list, where the front-most value represents the most recent value.

Example

let mut history = History::new(0);
history.set(1);

assert_eq!(*history, 1);
assert_eq!(history.count(), 2);

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

Replaces the current value without creating a history entry.

Example

let mut history = History::new(0);
history.replace(1);

assert_eq!(*history, 1);
assert_eq!(history.count(), 1);

pub fn forget(&mut self) -> bool

Removes all prior values.

This effectively sets a new "checkpoint" that can be restored by calling reset.

The returned bool indicates if any entries were removed.

Example

let mut history = History::new(0);
history.set(1);
history.set(2);

history.forget();
assert_eq!(*history, 2);
assert_eq!(history.count(), 1);

pub fn reset(&mut self) -> bool

Remove all elements except the last one, making the oldest entry the "current value".

The returned bool indicates if any entries were removed.

Example

let mut history = History::new(0);
history.set(1);
history.set(2);

history.reset();
assert_eq!(*history, 0);
assert_eq!(history.count(), 1);

pub fn dirty(&mut self) -> bool

Returns true if there is more than one entry in the history.

Example

let mut history = History::new(0);
history.set(1);
assert!(history.dirty());

pub fn count(&self) -> usize

Returns the number of entries in the history.

This will never be less than 1, as the first entry of the backing VecDeque is always occupied by the "current value" in the History struct.

Example

let mut history = History::new(0);
assert_eq!(history.count(), 1);

history.set(1);
assert_eq!(history.count(), 2);

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

Produces an iterator over references to history items ordered from newest to oldest.

pub fn into_inner(self) -> T

Gets the current value.

impl<T: PartialEq> History<T>

pub fn neq_set(&mut self, value: T) -> bool

Will only set the value if the provided value is different than the current value.

It returns true to indicate if the history's current value was updated to be the provided value.

Example

let mut history = History::new(0);
let did_set = history.neq_set(0);
assert!(!did_set);

let did_set = history.neq_set(1);
assert!(did_set);

Trait Implementations

impl<T> AsRef<T> for History<T>

fn as_ref(&self) -> &T

Performs the conversion.

impl<T> Deref for History<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T> IntoIterator for History<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.