/usr/include/libqhullcpp/QhullPoints.h is in libqhull-dev 2015.2-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 | /****************************************************************************
**
** Copyright (c) 2009-2015 C.B. Barber. All rights reserved.
** $Id: //main/2015/qhull/src/libqhullcpp/QhullPoints.h#4 $$Change: 2066 $
** $DateTime: 2016/01/18 19:29:17 $$Author: bbarber $
**
****************************************************************************/
#ifndef QHULLPOINTS_H
#define QHULLPOINTS_H
extern "C" {
#include "libqhull_r/qhull_ra.h"
}
#include "libqhullcpp/QhullPoint.h"
#include <cstddef> // ptrdiff_t, size_t
#include <ostream>
namespace orgQhull {
#//!\name Defined here
class QhullPoints; //!< One or more points Coordinate pointers with dimension and iterators
class QhullPointsIterator; //!< Java-style iterator
//! QhullPoints are an array of QhullPoint as pointers into an array of coordinates.
//! For Qhull/QhullQh, QhullPoints must use hull_dim. Can change QhullPoint to input_dim if needed for Delaunay input site
class QhullPoints {
private:
#//!\name Fields
coordT * point_first; //!< First coordinate of an array of points of point_dimension
coordT * point_end; //!< End of point coordinates (end>=first). Trailing coordinates ignored
QhullQh * qh_qh; //!< Maybe initialized NULL to allow ownership by RboxPoints
//!< qh_qh used for QhullPoint() and qh_qh->hull_dim in constructor
int point_dimension; //!< Dimension, >=0
public:
#//!\name Subtypes
class const_iterator;
class iterator;
typedef QhullPoints::const_iterator ConstIterator;
typedef QhullPoints::iterator Iterator;
#//!\name Construct
//! QhullPoint, PointCoordinates, and QhullPoints have similar constructors
//! If Qhull/QhullQh is not initialized, then QhullPoints.dimension() is zero unless explicitly set
//! Cannot define QhullPoints(int pointDimension) since it is ambiguous with QhullPoints(QhullQh *qqh)
QhullPoints() : point_first(0), point_end(0), qh_qh(0), point_dimension(0) { }
QhullPoints(int pointDimension, countT coordinateCount2, coordT *c) : point_first(c), point_end(c+coordinateCount2), qh_qh(0), point_dimension(pointDimension) { QHULL_ASSERT(pointDimension>=0); }
explicit QhullPoints(const Qhull &q);
QhullPoints(const Qhull &q, countT coordinateCount2, coordT *c);
QhullPoints(const Qhull &q, int pointDimension, countT coordinateCount2, coordT *c);
explicit QhullPoints(QhullQh *qqh) : point_first(0), point_end(0), qh_qh(qqh), point_dimension(qqh ? qqh->hull_dim : 0) { }
QhullPoints(QhullQh *qqh, countT coordinateCount2, coordT *c) : point_first(c), point_end(c+coordinateCount2), qh_qh(qqh), point_dimension(qqh ? qqh->hull_dim : 0) { QHULL_ASSERT(qqh && qqh->hull_dim>0); }
QhullPoints(QhullQh *qqh, int pointDimension, countT coordinateCount2, coordT *c);
//! Copy constructor copies pointers but not contents. Needed for return by value and parameter passing.
QhullPoints(const QhullPoints &other) : point_first(other.point_first), point_end(other.point_end), qh_qh(other.qh_qh), point_dimension(other.point_dimension) {}
QhullPoints & operator=(const QhullPoints &other) { point_first= other.point_first; point_end= other.point_end; qh_qh= other.qh_qh; point_dimension= other.point_dimension; return *this; }
~QhullPoints() {}
public:
#//!\name Conversion
#ifndef QHULL_NO_STL
std::vector<QhullPoint> toStdVector() const;
#endif //QHULL_NO_STL
#ifdef QHULL_USES_QT
QList<QhullPoint> toQList() const;
#endif //QHULL_USES_QT
#//!\name GetSet
// Constructs QhullPoint. Cannot return reference.
const QhullPoint at(countT idx) const { /* point_first==0 caught by point_end assert */ coordT *p= point_first+idx*point_dimension; QHULL_ASSERT(p<point_end); return QhullPoint(qh_qh, point_dimension, p); }
// Constructs QhullPoint. Cannot return reference.
const QhullPoint back() const { return last(); }
QhullPoint back() { return last(); }
ConstIterator begin() const { return ConstIterator(*this); }
Iterator begin() { return Iterator(*this); }
ConstIterator constBegin() const { return ConstIterator(*this); }
const coordT * constData() const { return point_first; }
ConstIterator constEnd() const { return ConstIterator(qh_qh, point_dimension, point_end); }
coordT * coordinates() const { return point_first; }
countT coordinateCount() const { return (countT)(point_end-point_first); } // WARN64
countT count() const { return (countT)size(); } // WARN64
const coordT * data() const { return point_first; }
coordT * data() { return point_first; }
void defineAs(int pointDimension, countT coordinatesCount, coordT *c) { QHULL_ASSERT(pointDimension>=0 && coordinatesCount>=0 && c!=0); point_first= c; point_end= c+coordinatesCount; point_dimension= pointDimension; }
void defineAs(countT coordinatesCount, coordT *c) { QHULL_ASSERT((point_dimension>0 && coordinatesCount>=0 && c!=0) || (c==0 && coordinatesCount==0)); point_first= c; point_end= c+coordinatesCount; }
void defineAs(const QhullPoints &other) { point_first= other.point_first; point_end= other.point_end; qh_qh= other.qh_qh; point_dimension= other.point_dimension; }
int dimension() const { return point_dimension; }
ConstIterator end() const { return ConstIterator(qh_qh, point_dimension, point_end); }
Iterator end() { return Iterator(qh_qh, point_dimension, point_end); }
coordT * extraCoordinates() const { return extraCoordinatesCount() ? (point_end-extraCoordinatesCount()) : 0; }
countT extraCoordinatesCount() const; // WARN64
// Constructs QhullPoint. Cannot return reference.
const QhullPoint first() const { return QhullPoint(qh_qh, point_dimension, point_first); }
QhullPoint first() { return QhullPoint(qh_qh, point_dimension, point_first); }
// Constructs QhullPoint. Cannot return reference.
const QhullPoint front() const { return first(); }
QhullPoint front() { return first(); }
bool includesCoordinates(const coordT *c) const { return c>=point_first && c<point_end; }
bool isEmpty() const { return (point_end==point_first || point_dimension==0); }
// Constructs QhullPoint. Cannot return reference.
const QhullPoint last() const { QHULL_ASSERT(point_first!=0); return QhullPoint(qh_qh, point_dimension, point_end - point_dimension); }
QhullPoint last() { QHULL_ASSERT(point_first!=0); return QhullPoint(qh_qh, point_dimension, point_end - point_dimension); }
bool operator==(const QhullPoints &other) const;
bool operator!=(const QhullPoints &other) const { return ! operator==(other); }
QhullPoint operator[](countT idx) const { return at(idx); }
QhullQh * qh() const { return qh_qh; }
void resetQhullQh(QhullQh *qqh);
void setDimension(int d) { point_dimension= d; }
size_t size() const { return point_dimension ? (point_end-point_first)/point_dimension : 0; }
QhullPoint value(countT idx) const;
QhullPoint value(countT idx, QhullPoint &defaultValue) const;
#//!\name Methods
bool contains(const QhullPoint &t) const;
countT count(const QhullPoint &t) const;
countT indexOf(const coordT *pointCoordinates) const;
countT indexOf(const coordT *pointCoordinates, int noThrow) const;
countT indexOf(const QhullPoint &t) const;
countT lastIndexOf(const QhullPoint &t) const;
//! Returns a subset of the points, not a copy
QhullPoints mid(countT idx, countT length= -1) const;
#//!\name QhullPoints::iterator
// Modeled on qlist.h w/o QT_STRICT_ITERATORS
// before const_iterator for conversion with comparison operators
// See: QhullSet.h
class iterator : public QhullPoint {
public:
typedef std::random_access_iterator_tag iterator_category;
typedef QhullPoint value_type;
typedef value_type * pointer;
typedef value_type & reference;
typedef ptrdiff_t difference_type;
explicit iterator(const QhullPoints &ps) : QhullPoint(ps.qh(), ps.dimension(), ps.coordinates()) {}
iterator(const int pointDimension, coordT *c): QhullPoint(pointDimension, c) {}
iterator(const Qhull &q, coordT *c): QhullPoint(q, c) {}
iterator(const Qhull &q, int pointDimension, coordT *c): QhullPoint(q, pointDimension, c) {}
iterator(QhullQh *qqh, coordT *c): QhullPoint(qqh, c) {}
iterator(QhullQh *qqh, int pointDimension, coordT *c): QhullPoint(qqh, pointDimension, c) {}
iterator(const iterator &other): QhullPoint(*other) {}
iterator & operator=(const iterator &other) { defineAs( const_cast<iterator &>(other)); return *this; }
// Need 'const QhullPoint' to maintain const
const QhullPoint & operator*() const { return *this; }
QhullPoint & operator*() { return *this; }
const QhullPoint * operator->() const { return this; }
QhullPoint * operator->() { return this; }
// value instead of reference since advancePoint() modifies self
QhullPoint operator[](countT idx) const { QhullPoint result= *this; result.advancePoint(idx); return result; }
bool operator==(const iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return (point_coordinates==o.point_coordinates && point_dimension==o.point_dimension); }
bool operator!=(const iterator &o) const { return !operator==(o); }
bool operator<(const iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates < o.point_coordinates; }
bool operator<=(const iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates <= o.point_coordinates; }
bool operator>(const iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates > o.point_coordinates; }
bool operator>=(const iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates >= o.point_coordinates; }
// reinterpret_cast to break circular dependency
bool operator==(const QhullPoints::const_iterator &o) const { QHULL_ASSERT(qh_qh==reinterpret_cast<const iterator &>(o).qh_qh); return (point_coordinates==reinterpret_cast<const iterator &>(o).point_coordinates && point_dimension==reinterpret_cast<const iterator &>(o).point_dimension); }
bool operator!=(const QhullPoints::const_iterator &o) const { return !operator==(reinterpret_cast<const iterator &>(o)); }
bool operator<(const QhullPoints::const_iterator &o) const { QHULL_ASSERT(qh_qh==reinterpret_cast<const iterator &>(o).qh_qh); return point_coordinates < reinterpret_cast<const iterator &>(o).point_coordinates; }
bool operator<=(const QhullPoints::const_iterator &o) const { QHULL_ASSERT(qh_qh==reinterpret_cast<const iterator &>(o).qh_qh); return point_coordinates <= reinterpret_cast<const iterator &>(o).point_coordinates; }
bool operator>(const QhullPoints::const_iterator &o) const { QHULL_ASSERT(qh_qh==reinterpret_cast<const iterator &>(o).qh_qh); return point_coordinates > reinterpret_cast<const iterator &>(o).point_coordinates; }
bool operator>=(const QhullPoints::const_iterator &o) const { QHULL_ASSERT(qh_qh==reinterpret_cast<const iterator &>(o).qh_qh); return point_coordinates >= reinterpret_cast<const iterator &>(o).point_coordinates; }
iterator & operator++() { advancePoint(1); return *this; }
iterator operator++(int) { iterator n= *this; operator++(); return iterator(n); }
iterator & operator--() { advancePoint(-1); return *this; }
iterator operator--(int) { iterator n= *this; operator--(); return iterator(n); }
iterator & operator+=(countT idx) { advancePoint(idx); return *this; }
iterator & operator-=(countT idx) { advancePoint(-idx); return *this; }
iterator operator+(countT idx) const { iterator n= *this; n.advancePoint(idx); return n; }
iterator operator-(countT idx) const { iterator n= *this; n.advancePoint(-idx); return n; }
difference_type operator-(iterator o) const { QHULL_ASSERT(qh_qh==o.qh_qh && point_dimension==o.point_dimension); return (point_dimension ? (point_coordinates-o.point_coordinates)/point_dimension : 0); }
};//QhullPoints::iterator
#//!\name QhullPoints::const_iterator
//!\todo FIXUP QH11018 const_iterator same as iterator. SHould have a common definition
class const_iterator : public QhullPoint {
public:
typedef std::random_access_iterator_tag iterator_category;
typedef QhullPoint value_type;
typedef const value_type * pointer;
typedef const value_type & reference;
typedef ptrdiff_t difference_type;
const_iterator(const QhullPoints::iterator &o) : QhullPoint(*o) {}
explicit const_iterator(const QhullPoints &ps) : QhullPoint(ps.qh(), ps.dimension(), ps.coordinates()) {}
const_iterator(const int pointDimension, coordT *c): QhullPoint(pointDimension, c) {}
const_iterator(const Qhull &q, coordT *c): QhullPoint(q, c) {}
const_iterator(const Qhull &q, int pointDimension, coordT *c): QhullPoint(q, pointDimension, c) {}
const_iterator(QhullQh *qqh, coordT *c): QhullPoint(qqh, c) {}
const_iterator(QhullQh *qqh, int pointDimension, coordT *c): QhullPoint(qqh, pointDimension, c) {}
const_iterator(const const_iterator &o) : QhullPoint(*o) {}
const_iterator &operator=(const const_iterator &o) { defineAs(const_cast<const_iterator &>(o)); return *this; }
// value/non-const since advancePoint(1), etc. modifies self
const QhullPoint & operator*() const { return *this; }
const QhullPoint * operator->() const { return this; }
// value instead of reference since advancePoint() modifies self
const QhullPoint operator[](countT idx) const { QhullPoint n= *this; n.advancePoint(idx); return n; }
bool operator==(const const_iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return (point_coordinates==o.point_coordinates && point_dimension==o.point_dimension); }
bool operator!=(const const_iterator &o) const { return ! operator==(o); }
bool operator<(const const_iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates < o.point_coordinates; }
bool operator<=(const const_iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates <= o.point_coordinates; }
bool operator>(const const_iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates > o.point_coordinates; }
bool operator>=(const const_iterator &o) const { QHULL_ASSERT(qh_qh==o.qh_qh); return point_coordinates >= o.point_coordinates; }
const_iterator &operator++() { advancePoint(1); return *this; }
const_iterator operator++(int) { const_iterator n= *this; operator++(); return const_iterator(n); }
const_iterator &operator--() { advancePoint(-1); return *this; }
const_iterator operator--(int) { const_iterator n= *this; operator--(); return const_iterator(n); }
const_iterator &operator+=(countT idx) { advancePoint(idx); return *this; }
const_iterator &operator-=(countT idx) { advancePoint(-idx); return *this; }
const_iterator operator+(countT idx) const { const_iterator n= *this; n.advancePoint(idx); return n; }
const_iterator operator-(countT idx) const { const_iterator n= *this; n.advancePoint(-idx); return n; }
difference_type operator-(const_iterator o) const { QHULL_ASSERT(qh_qh==o.qh_qh && point_dimension==o.point_dimension); return (point_dimension ? (point_coordinates-o.point_coordinates)/point_dimension : 0); }
};//QhullPoints::const_iterator
#//!\name IO
struct PrintPoints{
const QhullPoints *points;
const char * point_message;
bool with_identifier;
PrintPoints(const char *message, bool withIdentifier, const QhullPoints &ps) : points(&ps), point_message(message), with_identifier(withIdentifier) {}
};//PrintPoints
PrintPoints print(const char *message) const { return PrintPoints(message, false, *this); }
PrintPoints printWithIdentifier(const char *message) const { return PrintPoints(message, true, *this); }
};//QhullPoints
// Instead of QHULL_DECLARE_SEQUENTIAL_ITERATOR because next(),etc would return a reference to a temporary
class QhullPointsIterator
{
typedef QhullPoints::const_iterator const_iterator;
#//!\name Fields
private:
const QhullPoints *ps;
const_iterator i;
public:
QhullPointsIterator(const QhullPoints &other) : ps(&other), i(ps->constBegin()) {}
QhullPointsIterator &operator=(const QhullPoints &other) { ps = &other; i = ps->constBegin(); return *this; }
bool findNext(const QhullPoint &t);
bool findPrevious(const QhullPoint &t);
bool hasNext() const { return i != ps->constEnd(); }
bool hasPrevious() const { return i != ps->constBegin(); }
QhullPoint next() { return *i++; }
QhullPoint peekNext() const { return *i; }
QhullPoint peekPrevious() const { const_iterator p = i; return *--p; }
QhullPoint previous() { return *--i; }
void toBack() { i = ps->constEnd(); }
void toFront() { i = ps->constBegin(); }
};//QhullPointsIterator
}//namespace orgQhull
#//!\name Global
std::ostream & operator<<(std::ostream &os, const orgQhull::QhullPoints &p);
std::ostream & operator<<(std::ostream &os, const orgQhull::QhullPoints::PrintPoints &pr);
#endif // QHULLPOINTS_H
|