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
|
// Begin License:
// Copyright (C) 2006-2014 Tobias Sargeant (tobias.sargeant@gmail.com).
// All rights reserved.
//
// This file is part of the Carve CSG Library (http://carve-csg.com/)
//
// This file may be used under the terms of either the GNU General
// Public License version 2 or 3 (at your option) as published by the
// Free Software Foundation and appearing in the files LICENSE.GPL2
// and LICENSE.GPL3 included in the packaging of this file.
//
// This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
// INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE.
// End:
#pragma once
#if defined(CMAKE_BUILD)
# include <carve/config.h>
#elif defined(XCODE_BUILD)
# include <carve/xcode_config.h>
#elif defined(_MSC_VER)
# include <carve/vcpp_config.h>
#else
# include <carve/config.h>
#endif
#if defined(WIN32)
# include <carve/win32.h>
#elif defined(__GNUC__)
# include <carve/gnu_cxx.h>
#endif
#if defined(CARVE_SYSTEM_BOOST)
# define BOOST_INCLUDE(x) <boost/x>
#else
# define BOOST_INCLUDE(x) <carve/external/boost/x>
#endif
#include <math.h>
#include <string>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <sstream>
#include <iomanip>
#include <carve/collection.hpp>
#include <carve/util.hpp>
#include <stdarg.h>
#define STR(x) #x
#define XSTR(x) STR(x)
/**
* \brief Top level Carve namespace.
*/
namespace carve {
static struct noinit_t {} NOINIT;
inline std::string fmtstring(const char *fmt, ...);
/**
* \brief Base class for all Carve exceptions.
*/
struct exception {
private:
mutable std::string err;
mutable std::ostringstream accum;
public:
exception(const std::string &e) : err(e), accum() { }
exception() : err(), accum() { }
exception(const exception &e) : err(e.str()), accum() { }
exception &operator=(const exception &e) {
if (this != &e) {
err = e.str();
accum.str("");
}
return *this;
}
const std::string &str() const {
if (accum.str().size() > 0) {
err += accum.str();
accum.str("");
}
return err;
}
template<typename T>
exception &operator<<(const T &t) {
accum << t;
return *this;
}
};
template<typename iter_t, typename order_t = std::less<typename std::iterator_traits<iter_t>::value_type > >
struct index_sort {
iter_t base;
order_t order;
index_sort(const iter_t &_base) : base(_base), order() { }
index_sort(const iter_t &_base, const order_t &_order) : base(_base), order(_order) { }
template<typename U>
bool operator()(const U &a, const U &b) {
return order(*(base + a), *(base + b));
}
};
template<typename iter_t, typename order_t>
index_sort<iter_t, order_t> make_index_sort(const iter_t &base, const order_t &order) {
return index_sort<iter_t, order_t>(base, order);
}
template<typename iter_t>
index_sort<iter_t> make_index_sort(const iter_t &base) {
return index_sort<iter_t>(base);
}
enum RayIntersectionClass {
RR_DEGENERATE = -2,
RR_PARALLEL = -1,
RR_NO_INTERSECTION = 0,
RR_INTERSECTION = 1
};
enum LineIntersectionClass {
COLINEAR = -1,
NO_INTERSECTION = 0,
INTERSECTION_LL = 1,
INTERSECTION_PL = 2,
INTERSECTION_LP = 3,
INTERSECTION_PP = 4
};
enum PointClass {
POINT_UNK = -2,
POINT_OUT = -1,
POINT_ON = 0,
POINT_IN = 1,
POINT_VERTEX = 2,
POINT_EDGE = 3
};
enum IntersectionClass {
INTERSECT_BAD = -1,
INTERSECT_NONE = 0,
INTERSECT_FACE = 1,
INTERSECT_VERTEX = 2,
INTERSECT_EDGE = 3,
INTERSECT_PLANE = 4,
};
extern double EPSILON;
extern double EPSILON2;
static inline void setEpsilon(double ep) { EPSILON = ep; EPSILON2 = ep * ep; }
template<typename T>
struct identity_t {
typedef T argument_type;
typedef T result_type;
const T &operator()(const T &t) const { return t; }
};
template<typename iter_t>
inline bool is_sorted(iter_t first, iter_t last) {
if (first == last) return true;
iter_t iter = first;
iter_t next = first; ++next;
for (; next != last; iter = next, ++next) {
if (*next < *iter) {
return false;
}
}
return true;
}
template<typename iter_t,
typename pred_t>
inline bool is_sorted(iter_t first, iter_t last, pred_t pred) {
if (first == last) return true;
iter_t iter = first;
iter_t next = first; ++next;
for (; next != last; iter = next, ++next) {
if (pred(*next, *iter)) {
return false;
}
}
return true;
}
inline double rangeSeparation(const std::pair<double, double> &a,
const std::pair<double, double> &b) {
if (a.second < b.first) {
return b.first - a.second;
} else if (b.second < a.first) {
return a.first - b.second;
} else {
return 0.0;
}
}
}
#if defined(_MSC_VER)
# define MACRO_BEGIN do {
# define MACRO_END __pragma(warning(push)) __pragma(warning(disable:4127)) } while(0) __pragma(warning(pop))
#else
# define MACRO_BEGIN do {
# define MACRO_END } while(0)
#endif
#if !defined(CARVE_NODEBUG)
# define CARVE_ASSERT(x) MACRO_BEGIN if (!(x)) throw carve::exception() << __FILE__ << ":" << __LINE__ << " " << #x; MACRO_END
#else
# define CARVE_ASSERT(X)
#endif
#define CARVE_FAIL(x) MACRO_BEGIN throw carve::exception() << __FILE__ << ":" << __LINE__ << " " << #x; MACRO_END
|
