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
|
// Copyright (C) 2013 Internet Systems Consortium, Inc. ("ISC")
//
// Permission to use, copy, modify, and/or distribute this software for any
// purpose with or without fee is hereby granted, provided that the above
// copyright notice and this permission notice appear in all copies.
//
// THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
// REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
// AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
// INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
// LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
// OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
// PERFORMANCE OF THIS SOFTWARE.
#include <d2/labeled_value.h>
namespace isc {
namespace d2 {
/**************************** LabeledValue ****************************/
LabeledValue::LabeledValue(const int value, const std::string& label)
: value_(value), label_(label) {
if (label.empty()) {
isc_throw(LabeledValueError, "labels cannot be empty");
}
}
LabeledValue::~LabeledValue(){
}
int
LabeledValue::getValue() const {
return (value_);
}
std::string
LabeledValue::getLabel() const {
return (label_);
}
bool
LabeledValue::operator==(const LabeledValue& other) const {
return (this->value_ == other.value_);
}
bool
LabeledValue::operator!=(const LabeledValue& other) const {
return (this->value_ != other.value_);
}
bool
LabeledValue::operator<(const LabeledValue& other) const {
return (this->value_ < other.value_);
}
std::ostream& operator<<(std::ostream& os, const LabeledValue& vlp) {
os << vlp.getLabel();
return (os);
}
/**************************** LabeledValueSet ****************************/
const char* LabeledValueSet::UNDEFINED_LABEL = "UNDEFINED";
LabeledValueSet::LabeledValueSet(){
}
LabeledValueSet::~LabeledValueSet() {
}
void
LabeledValueSet::add(LabeledValuePtr entry) {
if (!entry) {
isc_throw(LabeledValueError, "cannot add an null entry to set");
}
const int value = entry->getValue();
if (isDefined(value)) {
isc_throw(LabeledValueError,
"value: " << value << " is already defined as: "
<< getLabel(value));
}
map_[entry->getValue()]=entry;
}
void
LabeledValueSet::add(const int value, const std::string& label) {
add (LabeledValuePtr(new LabeledValue(value,label)));
}
const LabeledValuePtr&
LabeledValueSet::get(int value) {
static LabeledValuePtr undefined;
LabeledValueMap::iterator it = map_.find(value);
if (it != map_.end()) {
return ((*it).second);
}
// Return an empty pointer when not found.
return (undefined);
}
bool
LabeledValueSet::isDefined(const int value) const {
LabeledValueMap::const_iterator it = map_.find(value);
return (it != map_.end());
}
std::string
LabeledValueSet::getLabel(const int value) const {
LabeledValueMap::const_iterator it = map_.find(value);
if (it != map_.end()) {
const LabeledValuePtr& ptr = (*it).second;
return (ptr->getLabel());
}
return (std::string(UNDEFINED_LABEL));
}
} // namespace isc::d2
} // namespace isc
|
