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
|
/*
* This file is part of the TrinityCore Project. See AUTHORS file for Copyright information
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#ifndef TRINITYCORE_FLAT_SET_H
#define TRINITYCORE_FLAT_SET_H
#include <algorithm>
#include <functional>
#include <vector>
namespace Trinity::Containers
{
template <class Key, class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>
class FlatSet
{
public:
using iterator = typename KeyContainer::iterator;
using const_iterator = typename KeyContainer::const_iterator;
bool empty() const { return _storage.empty(); }
auto size() const { return _storage.size(); }
auto begin() { return _storage.begin(); }
auto begin() const { return _storage.begin(); }
auto end() { return _storage.end(); }
auto end() const { return _storage.end(); }
bool contains(Key const& value) const
{
return std::binary_search(this->begin(), this->end(), value, Compare());
}
auto find(Key const& value) const
{
auto compare = Compare();
auto end = this->end();
auto itr = std::lower_bound(this->begin(), end, value, compare);
if (itr != end && compare(value, *itr))
itr = end;
return itr;
}
auto find(Key const& value)
{
auto compare = Compare();
auto end = this->end();
auto itr = std::lower_bound(this->begin(), end, value, compare);
if (itr != end && compare(value, *itr))
itr = end;
return itr;
}
template <class... Args>
std::pair<iterator, bool> emplace(Args&&... args)
{
Key newElement(std::forward<Args>(args)...);
auto compare = Compare();
auto end = this->end();
auto itr = std::lower_bound(this->begin(), end, newElement, compare);
if (itr != end && !compare(newElement, *itr))
return { itr, false };
return { _storage.emplace(itr, std::move(newElement)), true };
}
std::pair<iterator, bool> insert(Key const& key) { return this->emplace(key); }
std::size_t erase(Key const& key)
{
auto itr = this->find(key);
if (itr == this->end())
return 0;
this->erase(itr);
return 1;
}
auto erase(const_iterator itr) { return _storage.erase(itr); }
void clear() { _storage.clear(); }
void shrink_to_fit() { _storage.shrink_to_fit(); }
friend std::strong_ordering operator<=>(FlatSet const& left, FlatSet const& right) = default;
friend bool operator==(FlatSet const& left, FlatSet const& right) = default;
private:
KeyContainer _storage;
};
}
#endif // TRINITYCORE_FLAT_SET_H
|
