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
|
/* -----------------------------------------------------------------------------
*
* Monocasual Utils
*
* -----------------------------------------------------------------------------
*
* Copyright (C) 2021-2025 Giovanni A. Zuliani | Monocasual
*
* This file is part of Monocasual Utils.
*
* Monocasual Utils 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.
*
* Monocasual Utils 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 Giada - Monocasual Utils. If not, see
* <http://www.gnu.org/licenses/>.
*
* -------------------------------------------------------------------------- */
#ifndef MONOCASUAL_UTILS_VECTOR_H
#define MONOCASUAL_UTILS_VECTOR_H
#include <algorithm>
#include <ranges>
#include <vector>
namespace mcl::utils::vector
{
/* indexOf
Returns the index of element p in container/view 'v'. Returns v.size() if
element is not found. */
template <typename T, typename P>
std::ptrdiff_t indexOf(const T& v, const P& p)
{
return std::distance(std::cbegin(v), std::find(std::cbegin(v), std::cend(v), p));
}
/* -------------------------------------------------------------------------- */
template <typename T, typename F>
auto findIf(T& v, F&& func)
{
return std::find_if(std::begin(v), std::end(v), func);
}
/* -------------------------------------------------------------------------- */
template <typename T, typename F>
bool has(const T& v, F&& func)
{
return findIf(v, func) != std::cend(v);
}
/* -------------------------------------------------------------------------- */
template <typename T, typename F>
void removeIf(T& v, F&& func)
{
v.erase(std::remove_if(v.begin(), v.end(), func), v.end());
}
template <typename T, typename V>
void remove(T& v, const V& o)
{
v.erase(std::remove(v.begin(), v.end(), o), v.end());
}
template <typename T>
void removeAt(T& v, std::size_t index)
{
v.erase(v.begin() + index);
}
/* -------------------------------------------------------------------------- */
template <typename T, typename I>
std::vector<T> cast(const I& i)
{
return {i.begin(), i.end()};
}
/* -------------------------------------------------------------------------- */
template <typename Vector, typename Default>
auto atOr(const Vector& v, std::size_t index, Default d)
{
return index < v.size() ? v[index] : d;
}
/* -------------------------------------------------------------------------- */
template <typename T>
requires std::integral<T>
constexpr auto range(T n) noexcept
{
return std::views::iota(T{0}, n);
}
} // namespace mcl::utils::vector
#endif
|
