Dune Core Modules (unstable)
sllist.hh
Go to the documentation of this file.
3// SPDX-FileCopyrightInfo: Copyright © DUNE Project contributors, see file LICENSE.md in module root
270 class SLListIterator : public Dune::ForwardIteratorFacade<SLListIterator<T,A>, T, T&, std::size_t>
370 class SLListConstIterator : public Dune::ForwardIteratorFacade<SLListConstIterator<T,A>, const T, const T&, std::size_t>
428 class SLListModifyIterator : public Dune::ForwardIteratorFacade<SLListModifyIterator<T,A>, T, T&, std::size_t>
Base class for stl conformant forward iterators.
Definition: iteratorfacades.hh:142
void push_front(const MemberType &item)
Add a new entry to the beginning of the list.
Definition: sllist.hh:687
bool equals(const SLListConstIterator< T, A > &other) const
Equality test for the iterator facade.
Definition: sllist.hh:406
void push_back(const MemberType &item)
Add a new entry to the end of the list.
Definition: sllist.hh:643
ModifyIterator endModify()
Get an iterator capable of deleting and inserting elements.
Definition: sllist.hh:780
T & dereference() const
Dereferencing function for the iterator facade.
Definition: sllist.hh:294
typename std::allocator_traits< A >::template rebind_alloc< Element > Allocator
The allocator to use.
Definition: sllist.hh:64
void insertAfter(const T &v) const
Insert an element in the underlying list after the current position.
Definition: sllist.hh:342
SLListIterator< T, A > iterator
The mutable iterator of the list.
Definition: sllist.hh:69
void deleteNext() const
Delete the entry after the current position.
Definition: sllist.hh:353
bool equals(const SLListModifyIterator< T, A > &other) const
Equality test for the iterator facade.
Definition: sllist.hh:324
T & dereference() const
Dereferencing function for the iterator facade.
Definition: sllist.hh:446
int size() const
Get the number of elements the list contains.
Definition: sllist.hh:756
const_iterator begin() const
Get an iterator pointing to the first element in the list.
Definition: sllist.hh:768
iterator end()
Get an iterator pointing to the end of the list.
Definition: sllist.hh:774
SLList(const SLList< T1, A1 > &other)
Copy constructor with type conversion.
Definition: sllist.hh:585
bool equals(const SLListModifyIterator< T, A > &other) const
Test whether another iterator is equal.
Definition: sllist.hh:478
ModifyIterator beginModify()
Get an iterator capable of deleting and inserting elements.
Definition: sllist.hh:787
SLList< T, A > & operator=(const SLList< T, A > &other)
Assignment operator.
Definition: sllist.hh:635
SLListConstIterator< T, A > const_iterator
The constant iterator of the list.
Definition: sllist.hh:74
bool equals(const SLListConstIterator< T, A > &other) const
Equality test for the iterator facade.
Definition: sllist.hh:304
bool equals(const SLListConstIterator< T, A > &other) const
Test whether another iterator is equal.
Definition: sllist.hh:456
SLListModifyIterator< T, A > ModifyIterator
The type of the iterator capable of deletion and insertion.
Definition: sllist.hh:103
const_iterator end() const
Get an iterator pointing to the end of the list.
Definition: sllist.hh:794
void insert(const T &v)
Insert an element at the current position.
Definition: sllist.hh:505
void increment()
Increment function for the iterator facade.
Definition: sllist.hh:332
void remove()
Delete the entry at the current position.
Definition: sllist.hh:518
const T & dereference() const
Dereferencing function for the facade.
Definition: sllist.hh:396
void increment()
Increment function for the iterator facade.
Definition: sllist.hh:486
void increment()
Increment function for the iterator facade.
Definition: sllist.hh:414
bool equals(const SLListIterator< T, A > &other) const
Test whether another iterator is equal.
Definition: sllist.hh:467
iterator begin()
Get an iterator pointing to the first element in the list.
Definition: sllist.hh:762
bool equals(const SLListIterator< T, A > &other) const
Equality test for the iterator facade.
Definition: sllist.hh:314
EnableIfInterOperable< T1, T2, bool >::type operator==(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for equality.
Definition: iteratorfacades.hh:238
EnableIfInterOperable< T1, T2, bool >::type operator!=(const ForwardIteratorFacade< T1, V1, R1, D > &lhs, const ForwardIteratorFacade< T2, V2, R2, D > &rhs)
Checks for inequality.
Definition: iteratorfacades.hh:260
This file implements iterator facade classes for writing stl conformant iterators.
constexpr std::integer_sequence< T, II..., T(IN)> push_back(std::integer_sequence< T, II... >, std::integral_constant< T, IN >={})
Append an index IN to the back of the sequence.
Definition: integersequence.hh:69
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Nov 11, 23:29, 2024)