Namespaces
QhullIterator.h File Reference
#include "libqhull_r/qhull_ra.h"
#include <assert.h>
#include <iterator>
#include <string>
#include <vector>
Include dependency graph for QhullIterator.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 orgQhull
 QhullRidgeQhull's ridge structure, ridgeT, as a C++ class.
 

Macros

Defined here
#define QHULL_DECLARE_SEQUENTIAL_ITERATOR(C, T)
 
#define QHULL_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR(C, T)
 
#define QHULL_DECLARE_SET_ITERATOR(C)
 
#define QHULL_DECLARE_MUTABLE_SET_ITERATOR(C)
 

Macro Definition Documentation

◆ QHULL_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR

#define QHULL_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR (   C,
 
)

Definition at line 64 of file QhullIterator.h.

◆ QHULL_DECLARE_MUTABLE_SET_ITERATOR

#define QHULL_DECLARE_MUTABLE_SET_ITERATOR (   C)

Definition at line 132 of file QhullIterator.h.

◆ QHULL_DECLARE_SEQUENTIAL_ITERATOR

#define QHULL_DECLARE_SEQUENTIAL_ITERATOR (   C,
 
)
Value:
\
class C##Iterator \
{ \
typedef C::const_iterator const_iterator; \
const C *c; \
const_iterator i; \
public: \
inline C##Iterator(const C &container) \
: c(&container), i(c->constBegin()) {} \
inline C##Iterator &operator=(const C &container) \
{ c = &container; i = c->constBegin(); return *this; } \
inline void toFront() { i = c->constBegin(); } \
inline void toBack() { i = c->constEnd(); } \
inline bool hasNext() const { return i != c->constEnd(); } \
inline const T &next() { return *i++; } \
inline const T &peekNext() const { return *i; } \
inline bool hasPrevious() const { return i != c->constBegin(); } \
inline const T &previous() { return *--i; } \
inline const T &peekPrevious() const { const_iterator p = i; return *--p; } \
inline bool findNext(const T &t) \
{ while (i != c->constEnd()) if (*i++ == t) return true; return false; } \
inline bool findPrevious(const T &t) \
{ while (i != c->constBegin()) if (*(--i) == t) return true; \
return false; } \
};
t
c

Only QHULL_DECLARE_SEQUENTIAL_ITERATOR is used in libqhullcpp. The others need further development QHULL_DECLARE_SEQUENTIAL_ITERATOR(C) – Declare a Java-style iterator QHULL_DECLARE_MUTABLE_SEQUENTIAL_ITERATOR(C) – Declare a mutable Java-style iterator QHULL_DECLARE_SET_ITERATOR(C) – Declare a set iterator QHULL_DECLARE_MUTABLE_SET_ITERATOR(C) – Declare a mutable set iterator Derived from Qt/core/tools/qiterator.h and qset_r.h/FOREACHsetelement_()

Definition at line 33 of file QhullIterator.h.

◆ QHULL_DECLARE_SET_ITERATOR

#define QHULL_DECLARE_SET_ITERATOR (   C)
Value:
\
template <class T> \
class Qhull##C##Iterator \
{ \
typedef typename Qhull##C<T>::const_iterator const_iterator; \
Qhull##C<T> c; \
const_iterator i; \
public: \
inline Qhull##C##Iterator(const Qhull##C<T> &container) \
: c(container), i(c.constBegin()) {} \
inline Qhull##C##Iterator &operator=(const Qhull##C<T> &container) \
{ c = container; i = c.constBegin(); return *this; } \
inline void toFront() { i = c.constBegin(); } \
inline void toBack() { i = c.constEnd(); } \
inline bool hasNext() const { return i != c.constEnd(); } \
inline const T &next() { return *i++; } \
inline const T &peekNext() const { return *i; } \
inline bool hasPrevious() const { return i != c.constBegin(); } \
inline const T &previous() { return *--i; } \
inline const T &peekPrevious() const { const_iterator p = i; return *--p; } \
inline bool findNext(const T &t) \
{ while (i != c.constEnd()) if (*i++ == t) return true; return false; } \
inline bool findPrevious(const T &t) \
{ while (i != c.constBegin()) if (*(--i) == t) return true; \
return false; } \
};
t
c

Definition at line 103 of file QhullIterator.h.



hpp-fcl
Author(s):
autogenerated on Fri Jun 2 2023 02:39:02