Struct infinitree::fields::LinkedList

pub struct LinkedList<T: 'static> { /* private fields */ }

Append-only linked list that only commits incremental changes

Implementations

impl<T: 'static> LinkedList<T>

pub fn push(&self, value: impl Into<Arc<T>>)

Add a new item to the list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();
list.push(123456);

assert_eq!(list.last(), Some(123456.into()))

pub fn first_in_commit(&self) -> Option<Arc<T>>

Gets the first item of the current commit

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();

list.push(123456);
assert_eq!(list.first_in_commit(), Some(123456.into()));

list.push(111111);
assert_eq!(list.first_in_commit(), Some(123456.into()));

list.commit();
assert_eq!(list.first_in_commit(), None);

list.push(654321);
assert_eq!(list.first_in_commit(), Some(654321.into()));

pub fn first(&self) -> Option<Arc<T>>

Gets the first item of the linked list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();
list.push(123456);

assert_eq!(list.first(), Some(123456.into()));

list.push(111111);

assert_eq!(list.first(), Some(123456.into()));

pub fn last(&self) -> Option<Arc<T>>

Gets the last item of the linked list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();

list.push(123456);
assert_eq!(list.last(), Some(123456.into()));

list.push(111111);
assert_eq!(list.last(), Some(111111.into()));

pub fn commit(&self)

Move the commit pointer to the last item in the list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();

list.push(123456);
assert_eq!(list.first_in_commit(), Some(123456.into()));

list.push(111111);
assert_eq!(list.first_in_commit(), Some(123456.into()));

list.commit();
assert_eq!(list.first_in_commit(), None);

list.push(654321);
assert_eq!(list.first_in_commit(), Some(654321.into()));

pub fn clear(&self)

Move the commit pointer to the last item in the list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();

list.push(123456);
list.push(111111);
list.commit();
list.push(654321);
assert_eq!(list.first_in_commit(), Some(654321.into()));
assert_eq!(list.last(), Some(654321.into()));
assert_eq!(list.first(), Some(123456.into()));

list.clear();
assert_eq!(list.first_in_commit(), None);
assert_eq!(list.first(),None);
assert_eq!(list.last(), None);

pub fn rollback(&self)

Move the commit pointer to the last item in the list

Examples

use infinitree::fields::LinkedList;

let list = LinkedList::default();

list.push(123456);
list.push(111111);
list.commit();
list.push(654321);
assert_eq!(list.first_in_commit(), Some(654321.into()));
assert_eq!(list.last(), Some(654321.into()));
assert_eq!(list.first(), Some(123456.into()));

list.rollback();
assert_eq!(list.first_in_commit(), None);
assert_eq!(list.first(), Some(123456.into()));
assert_eq!(list.last(), Some(111111.into()));

pub fn iter(&self) -> impl Iterator<Item = Arc<T>>

Trait Implementations

impl<T: Clone + 'static> Clone for LinkedList<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: 'static> Default for LinkedList<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Index for LinkedList<T>where
    T: 'static + Value + Clone,

fn store_all(&mut self) -> Result<Vec<Intent<Box<dyn Store>>>>

Generate an Intent wrapper for each field in the Index.

fn load_all(&mut self) -> Result<Vec<Intent<Box<dyn Load>>>>

Generate an Intent wrapper for each field in the Index.