Template Class CursorList

Defined in File CursorList.h

Nested Relationships

Nested Types

Template Class CursorList::Iterator

Class Documentation

template<class T> class CursorList

a SEQUENCE realized with cursors in a CursorSpace

Public Types

using Item = T : the type of the items

using Pos = long: the cursor of the cell before the item

using value_type = T 

using size_type = std::size_t

using difference_type = std::ptrdiff_t

using reference = T&

using const_reference = const T&

using iterator = Iterator<false>

using const_iterator = Iterator<true>

Public Functions

CursorList(void): the empty list, in a space of its own

explicit CursorList(std::shared_ptr<CursorSpace<T>> S): the empty list in the space S, shared with other lists

CursorList(std::initializer_list<T> items): the list of the given items, in a space of its own

CursorList(const CursorList &other): a copy of the items of other, in the same space

CursorList(CursorList &&other) noexcept: the cells of other, which is left empty in the same space

CursorList &operator=(CursorList other) noexcept

~CursorList()

void swap(CursorList &other) noexcept

bool empty(void) const

bool finished(Pos p) const: true on \( pos_{-1} \) = -1 and on \( pos_n \)

Pos head(void) const: \( pos_0 \), i.e., 0

Pos tail(void) const: the position of the last item, O( n )

Pos next(Pos p) const

Pre:: p is not \( pos_n \)

Pos prev(Pos p) const: O( n )

Pos insert(Pos p, const T &v)

puts v in position p, the new item taking the position p

Pre:: p is not \( pos_{-1} \)
Post:: read( p ) is v

Pos remove(Pos p)

removes the item in position p, whose successor takes the position p

Pre:: p holds an item

const T &read(Pos p) const

Pre:: p holds an item

void write(Pos p, const T &v)

Pre:: p holds an item
Post:: read( p ) is v

bool operator==(const CursorList &o) const: the same items in the same order

const CursorSpace<T> &space(void) const: the space of the list

long first(void) const: the cursor of the first cell, 0 if the list is empty

inline iterator begin(void)

inline iterator end(void)

inline const_iterator begin(void) const

inline const_iterator end(void) const

inline const_iterator cbegin(void) const

inline const_iterator cend(void) const

template<std::input_iterator I, std::sentinel_for<I> S> CursorList(I first, S last): the list of the items of [ first , last ), in their order

void push_front(const T &v): v at the front, for std::front_inserter

template<bool Const> class Iterator

the iterator, on items const if Const

Public Types

using iterator_category = std::forward_iterator_tag

using value_type = T 

using difference_type = std::ptrdiff_t

using reference = std::conditional_t<Const, const T&, T&>

using pointer = std::conditional_t<Const, const T*, T*>

Public Functions

Iterator(void) = default

inline Iterator(Space *S, long c)

template<bool C> inline Iterator(const Iterator<C> &o): the const iterator from the other one

inline reference operator*(void) const

inline pointer operator->(void) const

inline Iterator &operator++(void)

inline Iterator operator++(int)

bool operator==(const Iterator &o) const = default