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
|
// license:GPL-2.0+
// copyright-holders:Couriersud
/*
* putil.h
*
*/
#ifndef P_UTIL_H_
#define P_UTIL_H_
#include "pstring.h"
#include <initializer_list>
#include <algorithm>
#include <vector> // <<= needed by windows build
namespace plib
{
namespace util
{
const pstring buildpath(std::initializer_list<pstring> list );
const pstring environment(const pstring &var, const pstring &default_val);
}
namespace container
{
template <class C>
bool contains(C &con, const typename C::value_type &elem)
{
return std::find(con.begin(), con.end(), elem) != con.end();
}
static constexpr const std::size_t npos = static_cast<std::size_t>(-1);
template <class C>
std::size_t indexof(C &con, const typename C::value_type &elem)
{
auto it = std::find(con.begin(), con.end(), elem);
if (it != con.end())
return static_cast<std::size_t>(it - con.begin());
return npos;
}
template <class C>
void insert_at(C &con, const std::size_t index, const typename C::value_type &elem)
{
con.insert(con.begin() + static_cast<std::ptrdiff_t>(index), elem);
}
template <class C>
void remove(C &con, const typename C::value_type &elem)
{
con.erase(std::remove(con.begin(), con.end(), elem), con.end());
}
}
template <class C>
struct indexed_compare
{
explicit indexed_compare(const C& target): m_target(target) {}
bool operator()(int a, int b) const { return m_target[a] < m_target[b]; }
const C& m_target;
};
// ----------------------------------------------------------------------------------------
// string list
// ----------------------------------------------------------------------------------------
std::vector<pstring> psplit(const pstring &str, const pstring &onstr, bool ignore_empty = false);
std::vector<pstring> psplit(const pstring &str, const std::vector<pstring> &onstrl);
}
#endif /* P_UTIL_H_ */
|