orgQhull::QhullLinkedList Class Reference

QhullLinkedList<T> -- A linked list modeled on QLinkedList. T is an opaque type with T(B *b), b=t.getBaseT(), t=t.next(), and t=t.prev(). The end node is a sentinel. libqhull owns the contents. QhullLinkedList does not define erase(), clear(), removeFirst(), removeLast(), pop_back(), pop_front(), fromStdList() Derived from Qt/core/tools/qlinkedlist.h and libqhull.h/FORALLfacets_() QhullLinkedList<T>::const_iterator -- STL-style iterator QhullLinkedList<T>::iterator -- STL-style iterator QhullLinkedListIterator<T> -- Java-style iterator Derived from Qt/core/tools/qiterator.h Works with Qt's foreach keyword [Qt/src/corelib/global/qglobal.h]. More...

#include </home/werner/origo/vish/modules/examples/ConvexHull/QhullLinkedList.h>

List of all members.

Classes

• class const_iterator
• class iterator

Public Types

• typedef const value_type * const_pointer
• typedef const value_type & const_reference
• typedef const_iterator ConstIterator
• typedef ptrdiff_t difference_type
• typedef iterator Iterator
• typedef value_type * pointer
• typedef value_type & reference
• typedef int size_type
• typedef T value_type

Public Member Functions

• T back () const

  Return by value which contains a pointer (e.g., typedef vertexT * QhullVertex). A reference does not make sense.
  

• iterator begin ()
• const_iterator begin () const
• const_iterator constBegin () const
• const_iterator constEnd () const
• bool contains (const T &t) const
• int count () const
• int count (const T &t) const
• bool empty () const
• iterator end ()
• const_iterator end () const
• T first () const
• T front () const
• bool isEmpty () const
• T last () const
• bool operator!= (const QhullLinkedList< T > &o) const
• bool operator== (const QhullLinkedList< T > &o) const
• QhullLinkedList (T b, T e)
• QhullLinkedList (const QhullLinkedList< T > &o)
• size_t size () const
• std::vector< T > toStdVector () const

---

Detailed Description

QhullLinkedList<T> -- A linked list modeled on QLinkedList. T is an opaque type with T(B *b), b=t.getBaseT(), t=t.next(), and t=t.prev(). The end node is a sentinel. libqhull owns the contents. QhullLinkedList does not define erase(), clear(), removeFirst(), removeLast(), pop_back(), pop_front(), fromStdList() Derived from Qt/core/tools/qlinkedlist.h and libqhull.h/FORALLfacets_() QhullLinkedList<T>::const_iterator -- STL-style iterator QhullLinkedList<T>::iterator -- STL-style iterator QhullLinkedListIterator<T> -- Java-style iterator Derived from Qt/core/tools/qiterator.h Works with Qt's foreach keyword [Qt/src/corelib/global/qglobal.h].

---

The documentation for this class was generated from the following file:

• modules/examples/ConvexHull/QhullLinkedList.h