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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
// Copyright Contributors to the DNF5 project.
// Copyright Contributors to the libdnf project.
// SPDX-License-Identifier: LGPL-2.1-or-later
//
// This file is part of libdnf: https://github.com/rpm-software-management/libdnf/
//
// Libdnf is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 2.1 of the License, or
// (at your option) any later version.
//
// Libdnf 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with libdnf. If not, see <https://www.gnu.org/licenses/>.
#ifndef LIBDNF5_COMMON_SACK_QUERY_HPP
#define LIBDNF5_COMMON_SACK_QUERY_HPP
#include "match_int64.hpp"
#include "match_string.hpp"
#include "query_cmp.hpp"
#include "libdnf5/common/exception.hpp"
#include "libdnf5/common/set.hpp"
#include "libdnf5/defs.h"
#include <cstdint>
#include <map>
#include <set>
#include <string>
#include <vector>
namespace libdnf5::sack {
LIBDNF_API extern const BgettextMessage msg_err_exact_one_object;
/// Query is a Set with filtering capabilities.
template <typename T>
class Query : public Set<T> {
public:
using FilterFunctionBool = bool(const T & obj);
using FilterFunctionCString = char *(const T & obj);
using FilterFunctionInt64 = int64_t(const T & obj);
using FilterFunctionString = std::string(const T & obj);
using FilterFunctionVectorInt64 = std::vector<int64_t>(const T & obj);
using FilterFunctionVectorString = std::vector<std::string>(const T & obj);
Query() = default;
explicit Query(const Set<T> & src_set) : Set<T>::Set(src_set) {}
explicit Query(Set<T> && src_set) : Set<T>::Set(std::move(src_set)) {}
void filter(std::string (*getter)(const T &), const std::string & pattern, QueryCmp cmp);
void filter(std::vector<std::string> (*getter)(const T &), const std::string & pattern, QueryCmp cmp);
void filter(std::string (*getter)(const T &), const std::vector<std::string> & patterns, QueryCmp cmp);
void filter(std::vector<std::string> (*getter)(const T &), const std::vector<std::string> & patterns, QueryCmp cmp);
void filter(int64_t (*getter)(const T &), int64_t pattern, QueryCmp cmp);
void filter(std::vector<int64_t> (*getter)(const T &), int64_t pattern, QueryCmp cmp);
void filter(int64_t (*getter)(const T &), const std::vector<int64_t> & patterns, QueryCmp cmp);
void filter(std::vector<int64_t> (*getter)(const T &), const std::vector<int64_t> & patterns, QueryCmp cmp);
void filter(bool (*getter)(const T &), bool pattern, QueryCmp cmp);
void filter(char * (*getter)(const T &), const std::string & pattern, QueryCmp cmp);
/// Get a single object. Raise an exception if none or multiple objects match the query.
const T & get() const {
if (get_data().size() == 1) {
return *get_data().begin();
}
throw RuntimeError(msg_err_exact_one_object);
}
/// List all objects matching the query.
const std::set<T> & list() const noexcept { return get_data(); }
// operators; OR at least
// copy()
using Set<T>::get_data;
private:
static void throw_except_one_object();
};
template <typename T>
inline void Query<T>::filter(Query<T>::FilterFunctionString * getter, const std::string & pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (match_string(value, cmp, pattern)) {
++it;
} else {
// TODO(jrohel): Modifying of iterated dataset. Performance? Can be implement better?
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(Query<T>::FilterFunctionVectorString * getter, const std::string & pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto values = getter(*it);
if (match_string(values, cmp, pattern)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(
Query<T>::FilterFunctionString * getter, const std::vector<std::string> & patterns, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (match_string(value, cmp, patterns)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(
Query<T>::FilterFunctionVectorString * getter, const std::vector<std::string> & patterns, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto values = getter(*it);
if (match_string(values, cmp, patterns)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(FilterFunctionInt64 * getter, int64_t pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (match_int64(value, cmp, pattern)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(FilterFunctionVectorInt64 * getter, int64_t pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto values = getter(*it);
if (match_int64(values, cmp, pattern)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(FilterFunctionInt64 * getter, const std::vector<int64_t> & patterns, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (match_int64(value, cmp, patterns)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(FilterFunctionVectorInt64 * getter, const std::vector<int64_t> & patterns, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto values = getter(*it);
if (match_int64(values, cmp, patterns)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
// TODO: other cmp
template <typename T>
inline void Query<T>::filter(Query<T>::FilterFunctionBool * getter, bool pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (cmp == QueryCmp::EQ && value == pattern) {
++it;
} else {
it = get_data().erase(it);
}
}
}
template <typename T>
inline void Query<T>::filter(Query<T>::FilterFunctionCString * getter, const std::string & pattern, QueryCmp cmp) {
for (auto it = get_data().begin(); it != get_data().end();) {
auto value = getter(*it);
if (match_string(value, cmp, pattern)) {
++it;
} else {
it = get_data().erase(it);
}
}
}
} // namespace libdnf5::sack
#endif
|
