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
|
// Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.0 (2010/01/01)
#ifndef INTERVALSET_H
#define INTERVALSET_H
#include <vector>
// Disjoint sets of half-open intervals of the form [min,max) with min < max.
template <typename Scalar>
class IntervalSet
{
public:
// Construction and destruction. The non-default constructor requires
// that xmin < xmax.
IntervalSet ();
IntervalSet (const IntervalSet& intervalSet);
IntervalSet (Scalar xmin, Scalar xmax);
~IntervalSet ();
// The number of intervals in the set.
int GetNumIntervals () const;
// The i-th interval is [xmin,xmax). The values xmin and xmax are valid
// only when 0 <= i < GetNumIntervals().
bool GetInterval (int i, Scalar& xmin, Scalar& xmax) const;
// Make this set empty.
void Clear ();
// Insert [xmin,xmax) into the set. This is a Boolean 'union' operation.
// The operation is successful only when xmin < xmax.
bool Insert (Scalar xmin, Scalar xmax);
// Remove [xmin,xmax) from the set. This is a Boolean 'difference'
// operation. The operation is successful only when xmin < xmax.
bool Remove (Scalar xmin, Scalar xmax);
// Boolean operations of sets. If you want to know the indices of the
// input intervals that contributed to an output interval, pass an
// array in the last component to store the pairs of indices. It is
// possible that a pair has a -1 component. In this case, only the
// nonnegative component contributed.
static void Union (const IntervalSet& input0,
const IntervalSet& input1, IntervalSet& output);
static void Intersection (const IntervalSet& input0,
const IntervalSet& input1, IntervalSet& output);
static void Difference (const IntervalSet& input0,
const IntervalSet& input1, IntervalSet& output);
static void ExclusiveOr (const IntervalSet& input0,
const IntervalSet& input1, IntervalSet& output);
// For use by RectangleSet<Scalar>.
typedef void (*Operator)(const IntervalSet&, const IntervalSet&,
IntervalSet&);
private:
// The array of endpoints has an even number of elements. The i-th
// interval is [mEndPoints[2*i],mEndPoints[2*i+1]).
std::vector<Scalar> mEndpoints;
};
#include "IntervalSet.inl"
#endif
|
