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
|
/* ByGivenOrder.h
Copyright (c) 2022 by Michael Zahniser
Endless Sky 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 3 of the License, or (at your option) any later version.
Endless Sky 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 <https://www.gnu.org/licenses/>.
*/
#pragma once
#include <algorithm>
#include <vector>
// Compare Ts according to the order specified at construction time.
// Unknown Ts are considered larger than any known one.
template<class T>
class ByGivenOrder {
public:
explicit ByGivenOrder(const std::vector<T> &order)
: order(order)
{}
bool operator()(const T &a, const T &b) const
{
const auto findA = std::find(order.begin(), order.end(), a);
const auto findB = std::find(order.begin(), order.end(), b);
if(findA == order.end() && findB == order.end())
{
// Neither a nor b is a known value. Fall back to default comparison.
return a < b;
}
else
{
// Whichever is first in the array is considered smaller.
return findA < findB;
}
}
private:
const std::vector<T> ℴ
};
|
