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
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#ifndef TENSORFLOW_CORE_LIB_GTL_COMPACTPTRSET_H_
#define TENSORFLOW_CORE_LIB_GTL_COMPACTPTRSET_H_
#include <type_traits>
#include "tensorflow/core/lib/gtl/flatset.h"
namespace tensorflow {
namespace gtl {
// CompactPointerSet<T> is like a std::unordered_set<T> but is optimized
// for small sets (<= 1 element). T must be a pointer type.
template <typename T>
class CompactPointerSet {
private:
using BigRep = FlatSet<T>;
public:
using value_type = T;
CompactPointerSet() : rep_(0) {}
~CompactPointerSet() {
static_assert(
std::is_pointer<T>::value,
"CompactPointerSet<T> can only be used with T's that are pointers");
if (isbig()) delete big();
}
CompactPointerSet(const CompactPointerSet& other) : rep_(0) { *this = other; }
CompactPointerSet& operator=(const CompactPointerSet& other) {
if (this == &other) return *this;
if (other.isbig()) {
// big => any
if (!isbig()) MakeBig();
*big() = *other.big();
} else if (isbig()) {
// !big => big
big()->clear();
if (other.rep_ != 0) {
big()->insert(reinterpret_cast<T>(other.rep_));
}
} else {
// !big => !big
rep_ = other.rep_;
}
return *this;
}
class iterator {
public:
typedef ssize_t difference_type;
typedef T value_type;
typedef const T* pointer;
typedef const T& reference;
typedef ::std::forward_iterator_tag iterator_category;
explicit iterator(uintptr_t rep)
: bigrep_(false), single_(reinterpret_cast<T>(rep)) {}
explicit iterator(typename BigRep::iterator iter)
: bigrep_(true), single_(nullptr), iter_(iter) {}
iterator& operator++() {
if (bigrep_) {
++iter_;
} else {
DCHECK(single_ != nullptr);
single_ = nullptr;
}
return *this;
}
// maybe post-increment?
bool operator==(const iterator& other) const {
if (bigrep_) {
return iter_ == other.iter_;
} else {
return single_ == other.single_;
}
}
bool operator!=(const iterator& other) const { return !(*this == other); }
const T& operator*() const {
if (bigrep_) {
return *iter_;
} else {
DCHECK(single_ != nullptr);
return single_;
}
}
private:
friend class CompactPointerSet;
bool bigrep_;
T single_;
typename BigRep::iterator iter_;
};
using const_iterator = iterator;
bool empty() const { return isbig() ? big()->empty() : (rep_ == 0); }
size_t size() const { return isbig() ? big()->size() : (rep_ == 0 ? 0 : 1); }
void clear() {
if (isbig()) {
delete big();
}
rep_ = 0;
}
std::pair<iterator, bool> insert(T elem) {
if (!isbig()) {
if (rep_ == 0) {
uintptr_t v = reinterpret_cast<uintptr_t>(elem);
if (v == 0 || ((v & 0x3) != 0)) {
// Cannot use small representation for nullptr. Fall through.
} else {
rep_ = v;
return {iterator(v), true};
}
}
MakeBig();
}
auto p = big()->insert(elem);
return {iterator(p.first), p.second};
}
template <typename InputIter>
void insert(InputIter begin, InputIter end) {
for (; begin != end; ++begin) {
insert(*begin);
}
}
const_iterator begin() const {
return isbig() ? iterator(big()->begin()) : iterator(rep_);
}
const_iterator end() const {
return isbig() ? iterator(big()->end()) : iterator(0);
}
iterator find(T elem) const {
if (rep_ == reinterpret_cast<uintptr_t>(elem)) {
return iterator(rep_);
} else if (!isbig()) {
return iterator(0);
} else {
return iterator(big()->find(elem));
}
}
size_t count(T elem) const { return find(elem) != end() ? 1 : 0; }
size_t erase(T elem) {
if (!isbig()) {
if (rep_ == reinterpret_cast<uintptr_t>(elem)) {
rep_ = 0;
return 1;
} else {
return 0;
}
} else {
return big()->erase(elem);
}
}
private:
// Size rep_
// -------------------------------------------------------------------------
// 0 0
// 1 The pointer itself (bottom bits == 00)
// large Pointer to a BigRep (bottom bits == 01)
uintptr_t rep_;
bool isbig() const { return (rep_ & 0x3) == 1; }
BigRep* big() const {
DCHECK(isbig());
return reinterpret_cast<BigRep*>(rep_ - 1);
}
void MakeBig() {
DCHECK(!isbig());
BigRep* big = new BigRep;
if (rep_ != 0) {
big->insert(reinterpret_cast<T>(rep_));
}
rep_ = reinterpret_cast<uintptr_t>(big) + 0x1;
}
};
} // namespace gtl
} // namespace tensorflow
#endif // TENSORFLOW_CORE_LIB_GTL_COMPACTPTRSET_H_
|
