Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::ListPure< E > Member List

This is the complete list of members for ogdf::ListPure< E >, including all inherited members.

back() constogdf::ListPure< E >inline
back()ogdf::ListPure< E >inline
begin()ogdf::ListPure< E >inline
begin() constogdf::ListPure< E >inline
bucketSort(int l, int h, BucketFunc< E > &f)ogdf::ListPure< E >
cbegin() constogdf::ListPure< E >inline
cend() constogdf::ListPure< E >inline
chooseElement(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true) constogdf::ListPure< E >inline
chooseElement(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true)ogdf::ListPure< E >inline
chooseIterator(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true) constogdf::ListPure< E >inline
chooseIterator(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true)ogdf::ListPure< E >inline
clear()ogdf::ListPure< E >inline
conc(ListPure< E > &L2)ogdf::ListPure< E >inline
concFront(ListPure< E > &L2)ogdf::ListPure< E >inline
const_iterator typedefogdf::ListPure< E >
const_reference typedefogdf::ListPure< E >
const_reverse_iterator typedefogdf::ListPure< E >
copy(const ListPure< E > &L)ogdf::ListPure< E >inlineprotected
crbegin() constogdf::ListPure< E >inline
crend() constogdf::ListPure< E >inline
cyclicPred(const_iterator it) constogdf::ListPure< E >inline
cyclicPred(iterator it)ogdf::ListPure< E >inline
cyclicPred(const_reverse_iterator it) constogdf::ListPure< E >inline
cyclicPred(reverse_iterator it)ogdf::ListPure< E >inline
cyclicSucc(const_iterator it) constogdf::ListPure< E >inline
cyclicSucc(iterator it)ogdf::ListPure< E >inline
cyclicSucc(const_reverse_iterator it) constogdf::ListPure< E >inline
cyclicSucc(reverse_iterator it)ogdf::ListPure< E >inline
del(iterator it)ogdf::ListPure< E >inline
emplaceBack(Args &&... args)ogdf::ListPure< E >inline
emplaceFront(Args &&... args)ogdf::ListPure< E >inline
empty() constogdf::ListPure< E >inline
end()ogdf::ListPure< E >inline
end() constogdf::ListPure< E >inline
exchange(iterator it1, iterator it2)ogdf::ListPure< E >inline
front() constogdf::ListPure< E >inline
front()ogdf::ListPure< E >inline
get(int pos) constogdf::ListPure< E >inline
get(int pos)ogdf::ListPure< E >inline
insert(const E &x, iterator it, Direction dir=Direction::after)ogdf::ListPure< E >inline
insertAfter(const E &x, iterator it)ogdf::ListPure< E >inline
insertBefore(const E &x, iterator it)ogdf::ListPure< E >inline
iterator typedefogdf::ListPure< E >
ListPure()ogdf::ListPure< E >inline
ListPure(std::initializer_list< E > init)ogdf::ListPure< E >inline
ListPure(const ListPure< E > &L)ogdf::ListPure< E >inline
ListPure(ListPure< E > &&L) noexceptogdf::ListPure< E >inline
m_headogdf::ListPure< E >protected
m_tailogdf::ListPure< E >protected
moveToBack(iterator it)ogdf::ListPure< E >inline
moveToBack(iterator it, ListPure< E > &L2)ogdf::ListPure< E >inline
moveToFront(iterator it)ogdf::ListPure< E >inline
moveToFront(iterator it, ListPure< E > &L2)ogdf::ListPure< E >inline
moveToPrec(iterator it, iterator itAfter)ogdf::ListPure< E >inline
moveToPrec(iterator it, ListPure< E > &L2, iterator itAfter)ogdf::ListPure< E >inline
moveToSucc(iterator it, iterator itBefore)ogdf::ListPure< E >inline
moveToSucc(iterator it, ListPure< E > &L2, iterator itBefore)ogdf::ListPure< E >inline
operator!=(const ListPure< E > &L) constogdf::ListPure< E >inline
operator=(const ListPure< E > &L)ogdf::ListPure< E >inline
operator=(ListPure< E > &&L)ogdf::ListPure< E >inline
operator==(const ListPure< E > &L) constogdf::ListPure< E >inline
permute()ogdf::ListPure< E >inline
permute(RNG &rng)ogdf::ListPure< E >inline
permute(const int n, RNG &rng)ogdf::ListPure< E >protected
popBack()ogdf::ListPure< E >inline
popBackRet()ogdf::ListPure< E >inline
popFront()ogdf::ListPure< E >inline
popFrontRet()ogdf::ListPure< E >inline
pos(const_iterator it) constogdf::ListPure< E >inline
pushBack(const E &x)ogdf::ListPure< E >inline
pushFront(const E &x)ogdf::ListPure< E >inline
quicksort()ogdf::ListPure< E >inline
quicksort(const COMPARER &comp)ogdf::ListPure< E >inline
rbegin()ogdf::ListPure< E >inline
rbegin() constogdf::ListPure< E >inline
reassignListRefs(ListElement< E > *start=nullptr)ogdf::ListPure< E >inlineprotected
reference typedefogdf::ListPure< E >
removeFirst(const E &x)ogdf::ListPure< E >inline
rend()ogdf::ListPure< E >inline
rend() constogdf::ListPure< E >inline
reverse()ogdf::ListPure< E >inline
reverse_iterator typedefogdf::ListPure< E >
search(const E &e) constogdf::ListPure< E >inline
search(const E &e)ogdf::ListPure< E >inline
search(const E &e, const COMPARER &comp) constogdf::ListPure< E >inline
search(const E &e, const COMPARER &comp)ogdf::ListPure< E >inline
size() constogdf::ListPure< E >inlinevirtual
split(iterator it, ListPure< E > &L1, ListPure< E > &L2, Direction dir=Direction::before)ogdf::ListPure< E >inline
splitAfter(iterator it, ListPure< E > &L2)ogdf::ListPure< E >inline
splitBefore(iterator it, ListPure< E > &L2)ogdf::ListPure< E >inline
swap(ListPure< E > &other)ogdf::ListPure< E >inline
value_type typedefogdf::ListPure< E >
~ListPure()ogdf::ListPure< E >inlinevirtual