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
|
/****************************************************************************
**
** Copyright (C) 2021 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of Qt Creator.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
****************************************************************************/
#pragma once
#include <utils/algorithm.h>
namespace Utils {
//////// FIND
template<typename C, typename F>
[[nodiscard]] typename Utils::optional<typename C::value_type> findOptional(const C &container,
F function)
{
auto begin = std::cbegin(container);
auto end = std::cend(container);
auto it = std::find_if(begin, end, function);
return it == end ? nullopt : make_optional(*it);
}
///////// FILTER
template<typename C, typename T = typename C::value_type>
[[nodiscard]] C filterOut(const C &container, const T &value = T())
{
C out;
std::copy_if(std::begin(container), std::end(container), inserter(out), [&](const auto &item) {
return item != value;
});
return out;
}
template<typename C>
[[nodiscard]] C filtered(const C &container)
{
return filterOut(container, typename C::value_type{});
}
/////// MODIFY
template<typename SC, typename C>
void concat(C &out, const SC &container)
{
std::copy(std::begin(container), std::end(container), inserter(out));
}
template<typename C, typename T>
void erase_one(C &container, const T &value)
{
typename C::const_iterator i = std::find(std::cbegin(container), std::cend(container), value);
if (i == std::cend(container))
return;
container.erase(i);
}
template<typename C, typename T>
void prepend(C &container, const T &value)
{
container.insert(std::cbegin(container), value);
}
/////// OTHER
template<typename RC, typename SC>
[[nodiscard]] RC flatten(const SC &container)
{
RC result;
for (const auto &innerContainer : container)
concat(result, innerContainer);
return result;
}
template<template<typename, typename...> class C,
typename T,
typename... TArgs,
typename RT = typename std::decay_t<T>::value_type,
typename RC = C<RT>>
[[nodiscard]] auto flatten(const C<T, TArgs...> &container)
{
using SC = C<T, TArgs...>;
return flatten<RC, SC>(container);
}
} // namespace Utils
|
