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
|
// Copyright (C) 2013 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 <d2/labeled_value.h>
#include <gtest/gtest.h>
using namespace std;
using namespace isc;
using namespace isc::d2;
namespace {
/// @brief Verifies basic construction and accessors for LabeledValue.
TEST(LabeledValue, construction) {
/// Verify that an empty label is not allowed.
ASSERT_THROW(LabeledValue(1, ""), LabeledValueError);
/// Verify that a valid constructor works.
LabeledValuePtr lvp;
ASSERT_NO_THROW(lvp.reset(new LabeledValue(1, "NotBlank")));
ASSERT_TRUE(lvp);
// Verify that the value can be accessed.
EXPECT_EQ(1, lvp->getValue());
// Verify that the label can be accessed.
EXPECT_EQ("NotBlank", lvp->getLabel());
}
/// @brief Verifies the logical operators defined for LabeledValue.
TEST(LabeledValue, operators) {
LabeledValuePtr lvp1;
LabeledValuePtr lvp1Also;
LabeledValuePtr lvp2;
// Create three instances, two of which have the same numeric value.
ASSERT_NO_THROW(lvp1.reset(new LabeledValue(1, "One")));
ASSERT_NO_THROW(lvp1Also.reset(new LabeledValue(1, "OneAlso")));
ASSERT_NO_THROW(lvp2.reset(new LabeledValue(2, "Two")));
// Verify each of the operators.
EXPECT_TRUE(*lvp1 == *lvp1Also);
EXPECT_TRUE(*lvp1 != *lvp2);
EXPECT_TRUE(*lvp1 < *lvp2);
EXPECT_FALSE(*lvp2 < *lvp1);
}
/// @brief Verifies the default constructor for LabeledValueSet.
TEST(LabeledValueSet, construction) {
ASSERT_NO_THROW (LabeledValueSet());
}
/// @brief Verifies the basic operations of a LabeledValueSet.
/// Essentially we verify that we can define a set of valid entries and
/// look them up without issue.
TEST(LabeledValueSet, basicOperation) {
const char* labels[] = {"Zero", "One", "Two", "Three" };
LabeledValueSet lvset;
LabeledValuePtr lvp;
// Verify the we cannot add an empty pointer to the set.
EXPECT_THROW(lvset.add(lvp), LabeledValueError);
// Verify that we can add an entry to the set via pointer.
ASSERT_NO_THROW(lvp.reset(new LabeledValue(0, labels[0])));
EXPECT_NO_THROW(lvset.add(lvp));
// Verify that we cannot add a duplicate entry.
EXPECT_THROW(lvset.add(lvp), LabeledValueError);
// Add the remaining entries using add(int,char*) variant.
for (int i = 1; i < 3; i++) {
EXPECT_NO_THROW(lvset.add(i, labels[i]));
}
// Verify that we can't add a duplicate entry this way either.
EXPECT_THROW ((lvset.add(0, labels[0])), LabeledValueError);
// Verify that we can look up all of the defined entries properly.
for (int i = 1; i < 3; i++) {
EXPECT_TRUE(lvset.isDefined(i));
EXPECT_NO_THROW(lvp = lvset.get(i));
EXPECT_EQ(lvp->getValue(), i);
EXPECT_EQ(lvp->getLabel(), labels[i]);
EXPECT_EQ(lvset.getLabel(i), labels[i]);
}
// Verify behavior for a value that is not defined.
EXPECT_FALSE(lvset.isDefined(4));
EXPECT_NO_THROW(lvp = lvset.get(4));
EXPECT_FALSE(lvp);
EXPECT_EQ(lvset.getLabel(4), LabeledValueSet::UNDEFINED_LABEL);
}
}
|
