Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

ogdf::SListPure< E > Member List

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

back() constogdf::SListPure< E >inline
back()ogdf::SListPure< E >inline
backIterator()ogdf::SListPure< E >inline
backIterator() constogdf::SListPure< E >inline
begin()ogdf::SListPure< E >inline
begin() constogdf::SListPure< E >inline
bucketSort(int l, int h, BucketFunc< E > &f)ogdf::SListPure< E >
bucketSort(BucketFunc< E > &f)ogdf::SListPure< E >
cbegin() constogdf::SListPure< E >inline
cend() constogdf::SListPure< E >inline
chooseElement(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true) constogdf::SListPure< E >inline
chooseElement(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true)ogdf::SListPure< E >inline
chooseIterator(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true) constogdf::SListPure< E >inline
chooseIterator(std::function< bool(const E &)> includeElement=[](const E &) { return true;}, bool isFastTest=true)ogdf::SListPure< E >inline
clear()ogdf::SListPure< E >inline
conc(SListPure< E > &L2)ogdf::SListPure< E >inline
const_iterator typedefogdf::SListPure< E >
const_reference typedefogdf::SListPure< E >
copy(const SListPure< E > &L)ogdf::SListPure< E >inlineprotected
cyclicSucc(const_iterator it) constogdf::SListPure< E >inline
cyclicSucc(iterator it)ogdf::SListPure< E >inline
delSucc(iterator itBefore)ogdf::SListPure< E >inline
emplaceBack(Args &&... args)ogdf::SListPure< E >inline
emplaceFront(Args &&... args)ogdf::SListPure< E >inline
empty() constogdf::SListPure< E >inline
end()ogdf::SListPure< E >inline
end() constogdf::SListPure< E >inline
front() constogdf::SListPure< E >inline
front()ogdf::SListPure< E >inline
get(int pos) constogdf::SListPure< E >inline
get(int pos)ogdf::SListPure< E >inline
insertAfter(const E &x, iterator itBefore)ogdf::SListPure< E >inline
iterator typedefogdf::SListPure< E >
m_headogdf::SListPure< E >private
m_tailogdf::SListPure< E >private
moveFrontToBack(SListPure< E > &L2)ogdf::SListPure< E >inline
moveFrontToFront(SListPure< E > &L2)ogdf::SListPure< E >inline
moveFrontToSucc(SListPure< E > &L2, iterator itBefore)ogdf::SListPure< E >inline
operator!=(const SListPure< E > &L) constogdf::SListPure< E >inline
operator=(const SListPure< E > &L)ogdf::SListPure< E >inline
operator=(SListPure< E > &&L)ogdf::SListPure< E >inline
operator==(const SListPure< E > &L) constogdf::SListPure< E >inline
permute()ogdf::SListPure< E >inline
permute(RNG &rng)ogdf::SListPure< E >inline
permute(const int n, RNG &rng)ogdf::SListPure< E >protected
popFront()ogdf::SListPure< E >inline
popFrontRet()ogdf::SListPure< E >inline
pos(const_iterator it) constogdf::SListPure< E >inline
pushBack(const E &x)ogdf::SListPure< E >inline
pushFront(const E &x)ogdf::SListPure< E >inline
quicksort()ogdf::SListPure< E >inline
quicksort(const COMPARER &comp)ogdf::SListPure< E >inline
reassignListRefs(SListElement< E > *start=nullptr)ogdf::SListPure< E >inlineprotected
reference typedefogdf::SListPure< E >
reverse()ogdf::SListPure< E >inline
search(const E &e) constogdf::SListPure< E >inline
search(const E &e)ogdf::SListPure< E >inline
search(const E &e, const COMPARER &comp) constogdf::SListPure< E >inline
search(const E &e, const COMPARER &comp)ogdf::SListPure< E >inline
size() constogdf::SListPure< E >inlinevirtual
SListPure()ogdf::SListPure< E >inline
SListPure(std::initializer_list< E > init)ogdf::SListPure< E >inline
SListPure(const SListPure< E > &L)ogdf::SListPure< E >inline
SListPure(SListPure< E > &&L) noexceptogdf::SListPure< E >inline
value_type typedefogdf::SListPure< E >
~SListPure()ogdf::SListPure< E >inlinevirtual