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
|
/*
* Copyright 2018 Google
*
* 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 FIRESTORE_CORE_SRC_FIREBASE_FIRESTORE_IMMUTABLE_SORTED_SET_H_
#define FIRESTORE_CORE_SRC_FIREBASE_FIRESTORE_IMMUTABLE_SORTED_SET_H_
#include <algorithm>
#include <utility>
#include "Firestore/core/src/firebase/firestore/immutable/sorted_map.h"
#include "Firestore/core/src/firebase/firestore/immutable/sorted_map_base.h"
#include "Firestore/core/src/firebase/firestore/util/comparison.h"
#include "Firestore/core/src/firebase/firestore/util/hard_assert.h"
#include "Firestore/core/src/firebase/firestore/util/hashing.h"
#include "absl/base/attributes.h"
namespace firebase {
namespace firestore {
namespace immutable {
namespace impl {
// An empty value to associate with keys in the underlying map.
struct Empty {
friend bool operator==(Empty /* left */, Empty /* right */) {
return true;
}
};
} // namespace impl
template <typename K,
typename V = impl::Empty,
typename C = util::Comparator<K>,
typename M = SortedMap<K, V, C>>
class SortedSet {
public:
using size_type = typename M::size_type;
using value_type = K;
using const_iterator = typename M::const_key_iterator;
explicit SortedSet(const C& comparator = C()) : map_{comparator} {
}
explicit SortedSet(const M& map) : map_{map} {
}
explicit SortedSet(M&& map) : map_{std::move(map)} {
}
SortedSet(std::initializer_list<value_type> entries, const C& comparator = {})
: map_{comparator} {
for (auto&& value : entries) {
map_ = map_.insert(value, {});
}
}
bool empty() const {
return map_.empty();
}
size_type size() const {
return map_.size();
}
ABSL_MUST_USE_RESULT SortedSet insert(const K& key) const {
return SortedSet{map_.insert(key, {})};
}
ABSL_MUST_USE_RESULT SortedSet erase(const K& key) const {
return SortedSet{map_.erase(key)};
}
bool contains(const K& key) const {
return map_.contains(key);
}
const_iterator find(const K& key) const {
return const_iterator{map_.find(key)};
}
size_type find_index(const K& key) const {
return map_.find_index(key);
}
const_iterator min() const {
return const_iterator{map_.min()};
}
const K& max() const {
return const_iterator{map_.max()};
}
const_iterator begin() const {
return const_iterator{map_.begin()};
}
const_iterator end() const {
return const_iterator{map_.end()};
}
/**
* Returns a view of this SortedSet containing just the keys that have been
* inserted that are greater than or equal to the given key.
*/
const util::range<const_iterator> values_from(const K& key) const {
return map_.keys_from(key);
}
/**
* Returns a view of this SortedSet containing just the keys that have been
* inserted that are greater than or equal to the given start_key and less
* than the given end_key.
*/
const util::range<const_iterator> values_in(const K& start_key,
const K& end_key) const {
return map_.keys_in(start_key, end_key);
}
friend bool operator==(const SortedSet& lhs, const SortedSet& rhs) {
if (lhs.size() != rhs.size()) {
return false;
}
return std::equal(lhs.begin(), lhs.end(), rhs.begin());
}
friend bool operator!=(const SortedSet& lhs, const SortedSet& rhs) {
return !(lhs == rhs);
}
private:
M map_;
};
template <typename K, typename V, typename C>
SortedSet<K, V, C> MakeSortedSet(const SortedMap<K, V, C>& map) {
return SortedSet<K, V, C>{map};
}
} // namespace immutable
} // namespace firestore
} // namespace firebase
#endif // FIRESTORE_CORE_SRC_FIREBASE_FIRESTORE_IMMUTABLE_SORTED_SET_H_
|
