Repository navigation
Expand file tree
/
Copy pathtiny_set.h
More file actions
64 lines (55 loc) · 1.73 KB
/
Copy pathtiny_set.h
File metadata and controls
64 lines (55 loc) · 1.73 KB
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
// Copyright 2018 Google LLC
//
// 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 CC_TINY_SET_H_
#define CC_TINY_SET_H_
#include "cc/inline_vector.h"
namespace minigo {
// tiny_set is a very simple set-like container that uses inline storage.
// Since insertions into the set are O(N), tiny_set should only be used for a
// very small number of elements.
// The Position code uses tiny_sets to keep track of neighboring groups of a
// point on the board.
template <typename T, int Capacity>
class tiny_set : private inline_vector<T, Capacity> {
using impl = inline_vector<T, Capacity>;
public:
using impl::begin;
using impl::empty;
using impl::end;
using impl::size;
using impl::operator[];
// Insert an element into the set.
// Returns true if the insertion took place, or false if the element was
// already present in the set.
bool insert(const T& x) {
for (const auto& y : *this) {
if (x == y) {
return false;
}
}
impl::push_back(x);
return true;
}
// Returns true if the set contains x.
bool contains(const T& x) const {
for (const auto& y : *this) {
if (x == y) {
return true;
}
}
return false;
}
};
} // namespace minigo
#endif // CC_TINY_SET_H_