9 #ifndef QHULLLINKEDLIST_H 10 #define QHULLLINKEDLIST_H 20 #include <QtCore/QList> 85 QList<T> toQList()
const;
91 bool isEmpty()
const {
return (begin_node==end_node); }
97 const T back() const { return last(); } 110 bool contains(const T &t) const; 114 iterator begin() { return begin_node; } 193 template <
typename T>
203 bool findNext(
const T &
t);
204 bool findPrevious(
const T &t);
220 template <
typename T>
231 template <
typename T>
246 template <
typename T>
261 template <
typename T>
275 template <
typename T>
290 template <
typename T>
303 i=
static_cast<T
>(i.next());
304 il=
static_cast<T
>(il.next());
314 template <
typename T>
331 template <
typename T>
350 template <
typename T>
354 while(
i !=
c->constEnd()){
362 template <
typename T>
366 while(
i!=
c->constBegin()){
378 template <
typename T>
380 operator<<(std::ostream &os, const orgQhull::QhullLinkedList<T> &qs)
383 for(i= qs.begin(); i != qs.end(); ++
i){
389 #endif // QHULLLINKEDLIST_H
bool operator!=(const const_iterator &o) const
const_iterator(const iterator &o)
const value_type * const_pointer
const_iterator & operator-=(int j)
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.
std::bidirectional_iterator_tag iterator_category
bool operator==(const QhullLinkedList< T > &o) const
bool findPrevious(const T &t)
bool operator!=(const iterator &o) const
iterator(const T &t)
Automatic conversion to iterator.
const_iterator(const T &t)
Automatic conversion to const_iterator.
const_iterator operator++(int)
const_iterator & operator+=(int j)
std::bidirectional_iterator_tag iterator_category
const T & operator*() const
const_iterator & operator++()
iterator operator-(int j) const
QhullLinkedList< T > & operator=(const QhullLinkedList< T > &other)
Copy assignment copies begin_node and end_node, but not the list elements.
iterator(const iterator &o)
bool operator==(const const_iterator &o) const
std::vector< T > toStdVector() const
bool operator!=(const const_iterator &o) const
bool operator==(const const_iterator &o) const
QhullLinkedListIterator & operator=(const QhullLinkedList< T > &container)
iterator operator+(int j) const
iterator & operator-=(int j)
const_iterator(const const_iterator &o)
const value_type & reference
QhullLinkedList< T >::const_iterator const_iterator
iterator & operator+=(int j)
const_iterator end() const
bool findNext(const T &t)
const value_type & const_reference
const_iterator operator--(int)
const QhullLinkedList< T > * c
const T * operator->() const
friend class const_iterator
const_iterator constBegin() const
const T * operator->() const
ptrdiff_t difference_type
bool contains(const T &t) const
const T & operator*() const
const_iterator & operator--()
const_iterator begin() const
bool operator==(const iterator &o) const
bool operator!=(const QhullLinkedList< T > &o) const
const_iterator & operator=(const const_iterator &o)
QhullLinkedListIterator(const QhullLinkedList< T > &container)
const value_type * pointer
iterator & operator=(const iterator &o)
ptrdiff_t difference_type
const_iterator operator-(int j) const
ptrdiff_t difference_type
const_iterator constEnd() const
const_iterator ConstIterator
const_iterator operator+(int j) const