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
|
/*
* SOLID - Software Library for Interference Detection
*
* Copyright (C) 2001-2003 Dtecta. All rights reserved.
*
* This library may be distributed under the terms of the Q Public License
* (QPL) as defined by Trolltech AS of Norway and appearing in the file
* LICENSE.QPL included in the packaging of this file.
*
* This library may be distributed and/or modified under the terms of the
* GNU General Public License (GPL) version 2 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This library is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Commercial use or any other use of this library not covered by either
* the QPL or the GPL requires an additional license from Dtecta.
* Please contact info@dtecta.com for enquiries about the terms of commercial
* use of this library.
*/
#ifndef BP_ENDPOINTLIST_H
#define BP_ENDPOINTLIST_H
//#define PARANOID
#include <vector>
#include "BP_Endpoint.h"
#include "BP_ProxyList.h"
class BP_Scene;
typedef bool (*T_Overlap)(const BP_Proxy& a, const BP_Proxy& b);
class BP_EndpointList : public std::vector<BP_Endpoint> {
public:
BP_EndpointList() {}
DT_Index stab(const BP_Endpoint& pos, BP_ProxyList& proxies) const;
DT_Index stab(DT_Scalar pos, BP_ProxyList& proxies) const
{
return stab(BP_Endpoint(pos, BP_Endpoint::MINIMUM, 0), proxies);
}
void range(const BP_Endpoint& min, const BP_Endpoint& max,
DT_Index& first, DT_Index& last, BP_ProxyList& proxies) const;
void range(DT_Scalar lb, DT_Scalar ub, DT_Index& first, DT_Index& last, BP_ProxyList& proxies) const
{
range(BP_Endpoint(lb, BP_Endpoint::MINIMUM, 0),
BP_Endpoint(ub, BP_Endpoint::MAXIMUM, 0),
first, last, proxies);
}
void addInterval(const BP_Endpoint& min, const BP_Endpoint& max, BP_ProxyList& proxies);
void removeInterval(DT_Index first, DT_Index last, BP_ProxyList& proxies);
void move(DT_Index index, DT_Scalar pos, Uint32 type, BP_Scene& scene, T_Overlap overlap);
DT_Scalar nextLambda(DT_Index& index, DT_Scalar source, DT_Scalar target) const;
private:
void encounters(const BP_Endpoint& a, const BP_Endpoint& b,
BP_Scene& scene, T_Overlap overlap);
#ifdef PARANOID
bool invariant() const
{
DT_Count count = 0;
DT_Index i;
for (i = 0; i != size(); ++i)
{
const BP_Endpoint& endpoint = (*this)[i];
if (endpoint.getType() == BP_Endpoint::MINIMUM)
{
++count;
}
else
{
--count;
}
if (endpoint.getCount() != count)
{
return false;
}
if (endpoint.getIndex() != i)
{
return false;
}
}
return true;
}
#else
bool invariant() const { return true; }
#endif
};
#endif
|
