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
|
// Copyright 2019 Blender Foundation. All rights reserved.
//
// 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
// of the License, 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
//
// Author: Sergey Sharybin
#ifndef OPENSUBDIV_EDGE_MAP_H_
#define OPENSUBDIV_EDGE_MAP_H_
#include "internal/opensubdiv_util.h"
namespace blender {
namespace opensubdiv {
// Helper class to ease dealing with edge indexing.
// Simply takes care of ensuring order of vertices is strictly defined.
class EdgeKey {
public:
inline EdgeKey();
inline EdgeKey(int v1, int v2);
inline size_t hash() const;
inline bool operator==(const EdgeKey &other) const;
// These indices are guaranteed to be so v1 < v2.
int v1;
int v2;
};
// Map from an edge defined by its vertices index to a custom tag value.
template<typename T> class EdgeTagMap {
public:
typedef EdgeKey key_type;
typedef T value_type;
inline EdgeTagMap();
// Modifiers.
inline void clear();
inline void insert(const key_type &key, const value_type &value);
inline void insert(int v1, int v2, const value_type &value);
// Lookup.
value_type &at(const key_type &key);
value_type &at(key_type &&key);
value_type &at(int v1, int v2);
value_type &operator[](const key_type &key);
value_type &operator[](key_type &&key);
protected:
unordered_map<key_type, value_type> edge_tags_;
};
////////////////////////////////////////////////////////////////////////////////
// Implementation.
// EdgeKey.
EdgeKey::EdgeKey() : v1(-1), v2(-1)
{
}
EdgeKey::EdgeKey(int v1, int v2)
{
assert(v1 >= 0);
assert(v2 >= 0);
assert(v1 != v2);
if (v1 < v2) {
this->v1 = v1;
this->v2 = v2;
}
else {
this->v1 = v2;
this->v2 = v1;
}
}
size_t EdgeKey::hash() const
{
return (static_cast<uint64_t>(v1) << 32) | v2;
}
bool EdgeKey::operator==(const EdgeKey &other) const
{
return v1 == other.v1 && v2 == other.v2;
}
// EdgeTagMap.
template<typename T> EdgeTagMap<T>::EdgeTagMap()
{
}
template<typename T> void EdgeTagMap<T>::clear()
{
edge_tags_.clear();
}
template<typename T> void EdgeTagMap<T>::insert(const key_type &key, const value_type &value)
{
edge_tags_.insert(make_pair(key, value));
}
template<typename T> void EdgeTagMap<T>::insert(int v1, int v2, const value_type &value)
{
insert(EdgeKey(v1, v2), value);
}
template<typename T> typename EdgeTagMap<T>::value_type &EdgeTagMap<T>::at(const key_type &key)
{
return edge_tags_.at[key];
}
template<typename T> typename EdgeTagMap<T>::value_type &EdgeTagMap<T>::at(key_type &&key)
{
return edge_tags_.at[key];
}
template<typename T> typename EdgeTagMap<T>::value_type &EdgeTagMap<T>::at(int v1, int v2)
{
return edge_tags_.at(EdgeKey(v1, v2));
}
template<typename T>
typename EdgeTagMap<T>::value_type &EdgeTagMap<T>::operator[](const key_type &key)
{
return edge_tags_[key];
}
template<typename T> typename EdgeTagMap<T>::value_type &EdgeTagMap<T>::operator[](key_type &&key)
{
return edge_tags_[key];
}
} // namespace opensubdiv
} // namespace blender
namespace std {
template<> struct hash<blender::opensubdiv::EdgeKey> {
std::size_t operator()(const blender::opensubdiv::EdgeKey &key) const
{
return key.hash();
}
};
} // namespace std
#endif // OPENSUBDIV_EDGE_MAP_H_
|
