34 std::vector<T>
const& src_vec,
35 std::vector<std::size_t>
const& exclude_positions)
37 std::vector<T> dest_vec;
38 if (exclude_positions.empty())
44 assert(exclude_positions.back() < src_vec.size());
46 std::copy_n(src_vec.cbegin(), exclude_positions[0],
47 std::back_inserter(dest_vec));
48 for (std::size_t i = 1; i < exclude_positions.size(); ++i)
50 std::copy_n(src_vec.cbegin() + exclude_positions[i - 1] + 1,
51 exclude_positions[i] - (exclude_positions[i - 1] + 1),
52 std::back_inserter(dest_vec));
54 std::copy(src_vec.cbegin() + exclude_positions.back() + 1, src_vec.cend(),
55 std::back_inserter(dest_vec));
62 std::vector<std::size_t>
const& exclude_positions,
63 std::vector<T>& dest_vec)
68template <
typename InputIt,
typename Predicate>
70 InputIt begin, InputIt end, Predicate predicate,
71 std::string
const& error =
"")
73 auto it = std::find_if(begin, end, predicate);
76 OGS_FATAL(
"Element not found in the input range; {:s}", error);
86template <
typename Map,
typename Key,
typename Value>
88 std::string
const& error_message)
90 auto const inserted = map.emplace(key, std::forward<Value>(value));
93 OGS_FATAL(
"{} Key `{}' already exists.", error_message, key);
102template <
typename Map,
typename Key>
103typename Map::mapped_type&
getOrError(Map& map, Key
const& key,
104 std::string
const& error_message)
106 auto it = map.find(key);
109 if constexpr (std::is_convertible<Key, std::string>::value)
111 OGS_FATAL(
"{:s} Key `{:s}' does not exist.", error_message, key);
115 OGS_FATAL(
"{:s} Key `{:s}' does not exist.", error_message,
116 std::to_string(key));
123template <
typename Map,
typename Key>
124typename Map::mapped_type
const&
getOrError(Map
const& map, Key
const& key,
125 std::string
const& error_message)
127 auto it = map.find(key);
130 if constexpr (std::is_convertible<Key, std::string>::value)
132 OGS_FATAL(
"{:s} Key `{:s}' does not exist.", error_message, key);
136 OGS_FATAL(
"{:s} Key `{:s}' does not exist.", error_message,
137 std::to_string(key));
147template <
typename Container,
typename Predicate>
149 Container
const& container,
150 Predicate&& predicate,
151 std::string
const& error_message)
153 auto it = std::find_if(begin(container), end(container), predicate);
154 if (it == end(container))
156 OGS_FATAL(
"Could not find element matching the predicate: {:s}",
167 std::sort(v.begin(), v.end());
168 auto it = std::unique(v.begin(), v.end());
169 v.erase(it, v.end());
174template <
typename T,
class Compare>
177 std::sort(v.begin(), v.end(), comp);
178 auto it = std::unique(v.begin(), v.end());
179 v.erase(it, v.end());
187template <
typename ValueType,
typename IndexType>
189 std::vector<IndexType>
const& order)
191 std::vector<ValueType> temp_v(v.size());
194 for (std::size_t i = 0; i < order.size(); i++)
196 std::swap(v[i], temp_v[order[i]]);
200template <
typename Container>
202 typename Container::value_type
const& element)
204 if (std::find(container.begin(), container.end(), element) ==
207 container.push_back(element);
211template <
typename Container>
213 Container
const& container,
typename Container::value_type
const& element)
216 std::find_if_not(container.begin(), container.end(),
217 [&element](
typename Container::value_type
const& e)
218 { return e == element; });
219 return it == container.end() ? std::nullopt : std::make_optional(*it);
227template <
typename Container>
229 typename Container::value_type
const& element)
231 auto const it = std::find(container.begin(), container.end(), element);
232 if (it == container.end())
234 return std::numeric_limits<std::size_t>::max();
236 return std::distance(container.begin(), it);
243 for (
auto item : items)
257template <
typename T1,
typename... Args>
265template <
typename List>
269 for (
auto& value : values)
271 if (
static_cast<bool>(value))
281template <
typename List>
285 for (
auto& value : values)
287 if (!
static_cast<bool>(value))
297template <
typename List>
std::vector< T > excludeObjectCopy(std::vector< T > const &src_vec, std::vector< std::size_t > const &exclude_positions)
Map::mapped_type & getOrError(Map &map, Key const &key, std::string const &error_message)
std::size_t findIndex(Container const &container, typename Container::value_type const &element)
std::iterator_traits< InputIt >::reference findElementOrError(InputIt begin, InputIt end, Predicate predicate, std::string const &error="")
void insertIfKeyUniqueElseError(Map &map, Key const &key, Value &&value, std::string const &error_message)
constexpr bool none_of(List const &values)
Checks if none of the elements in the given list are true.
void cleanupVectorElements(std::vector< T * > &items)
void uniquePushBack(Container &container, typename Container::value_type const &element)
constexpr bool all_of(List const &values)
Checks if all of the elements in the given list are true.
Container::value_type const & getIfOrError(Container const &container, Predicate &&predicate, std::string const &error_message)
void reorderVector(std::vector< ValueType > &v, std::vector< IndexType > const &order)
void makeVectorUnique(std::vector< T > &v)
std::optional< typename Container::value_type > findFirstNotEqualElement(Container const &container, typename Container::value_type const &element)
constexpr bool any_of(List const &values)
Checks if any of the elements in the given list is true.