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 | // Copyright (C) 2014-2024 Internet Systems Consortium, Inc. ("ISC")
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
#include <config.h>
#include <cc/data.h>
#include <dhcp/classify.h>
#include <util/str.h>
#include <boost/algorithm/string/classification.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <boost/algorithm/string/constants.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <boost/algorithm/string/split.hpp><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <sstream><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <vector><--- Include file: not found. Please note: Cppcheck does not need standard library headers to get proper results.
namespace isc {
namespace dhcp {
using namespace isc::data;
ClientClasses::ClientClasses(const std::string& class_names)
: container_() {
std::vector<std::string> split_text;
boost::split(split_text, class_names, boost::is_any_of(","),
boost::algorithm::token_compress_off);
for (size_t i = 0; i < split_text.size(); ++i) {
std::string trimmed = util::str::trim(split_text[i]);
// Ignore empty class names.
if (!trimmed.empty()) {
insert(ClientClass(trimmed));
}
}
}
ClientClasses::ClientClasses(const ClientClasses& other) {
for (auto const& cclass : other) {
insert(cclass);
}
}
void
ClientClasses::erase(const ClientClass& class_name) {
auto& idx = container_.get<ClassNameTag>();
auto it = idx.find(class_name);
if (it != idx.end()) {
static_cast<void>(idx.erase(it));
}
}
bool
ClientClasses::contains(const ClientClass& x) const {
auto const& idx = container_.get<ClassNameTag>();
return (idx.count(x) != 0);
}
bool
ClientClasses::intersects(const ClientClasses& cclasses) const {
if (cclasses.size() > size()) {
for (const auto& cclass : *this) {<--- Consider using std::any_of algorithm instead of a raw loop.
if (cclasses.contains(cclass)) {
return (true);
}
}
} else {
for (const auto& cclass : cclasses) {<--- Consider using std::any_of algorithm instead of a raw loop.
if (contains(cclass)) {
return (true);
}
}
}
return (false);
}
std::string
ClientClasses::toText(const std::string& separator) const {
std::stringstream s;
bool first = true;
for (auto const& class_it : *this) {
if (!first) {
s << separator;
} else {
first = false;
}
s << class_it;
}
return (s.str());
}
ElementPtr
ClientClasses::toElement() const {
ElementPtr result(Element::createList());
for (auto const& c : container_) {
result->add(Element::create(c));
}
return (result);
}
void
ClientClasses::fromElement(isc::data::ConstElementPtr cc_list) {
if (cc_list) {
clear();
if (cc_list->getType() != Element::list) {
isc_throw(BadValue, "not a List element");
}
for (auto i = 0; i < cc_list->size(); ++i) {
auto cclass = cc_list->get(i);
if (cclass->getType() != Element::string) {
isc_throw(BadValue, "elements of list must be valid strings");
}
static_cast<void>(insert(cclass->stringValue()));
}
}
}
bool
ClientClasses::equals(const ClientClasses& other) const {
return ((size() == other.size()) && std::equal(cbegin(), cend(), other.cbegin()));
}
ClientClasses&
ClientClasses::operator=(const ClientClasses& other) {
clear();
for (auto const& cclass : other) {
insert(cclass);
}
return (*this);
}
} // end of namespace isc::dhcp
} // end of namespace isc
|