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
|
// This file is part of ff3d - http://www.freefem.org/ff3d
// Copyright (C) 2001, 2002, 2003 Stphane Del Pino
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// $Id: Intersection.hpp,v 1.3 2004/02/08 18:44:19 delpinux Exp $
#ifndef INTERSECTION_HPP
#define INTERSECTION_HPP
#include <Object.hpp>
#include <ReferenceCounting.hpp>
#include <list>
/*! \class Intersection
This is the class which defines a Virtual Reality set operation: the \a intersection.
\author Stphane Del Pino.
*/
class Intersection
: public Shape
{
private:
typedef std::list<ReferenceCounting<Object> > ObjectList;
public:
typedef std::list<ReferenceCounting<Object> >::iterator iterator;
typedef std::list<ReferenceCounting<Object> >::const_iterator const_iterator;
private:
//! The list of Shapes contained in the intersection.
ObjectList __objects;
//! Returns \p true if the point \a p is inside the Intersection.
inline bool inShape (const TinyVector<3, real_t>& p) const;
//! Prints the Intersection informations using the stream \a s.
std::ostream& put(std::ostream& s) const;
public:
const const_iterator begin() const
{
return __objects.begin();
}
iterator begin()
{
return __objects.begin();
}
const const_iterator end() const
{
return __objects.end();
}
iterator end()
{
return __objects.end();
}
//! Adds the Object \a O inside the Union.
inline void push_back(ReferenceCounting<Object> O)
{
__objects.push_back(O);
}
//! Default constructor.
Intersection();
//! Copy constructor.
Intersection(const Intersection& U);
//! Destructor.
~Intersection()
{
;
}
};
//! Returns \p true if the point \a p is inside the Intersection.
inline bool Intersection::inShape (const TinyVector<3, real_t>& p) const
{
for (Intersection::const_iterator i = __objects.begin();
i != __objects.end(); ++i) {
if (!(*(*i)).inside(p)) {
return false;
}
}
return true;
}
#endif // INTERSECTION_HPP
|
