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
|
/* Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "tensorflow/core/graph/edgeset.h"
#include <vector>
#include "tensorflow/core/graph/graph.h"
#include "tensorflow/core/platform/test.h"
namespace tensorflow {
class EdgeSetTest : public ::testing::Test {
public:
EdgeSetTest() : edges_(nullptr), eset_(nullptr) {}
~EdgeSetTest() override {
delete eset_;
delete[] edges_;
}
void MakeEdgeSet(int n) {
delete eset_;
delete[] edges_;
edges_ = new Edge[n];
eset_ = new EdgeSet;
model_.clear();
for (int i = 0; i < n; i++) {
eset_->insert(&edges_[i]);
model_.insert(&edges_[i]);
}
}
void CheckSame() {
EXPECT_EQ(model_.size(), eset_->size());
EXPECT_EQ(model_.empty(), eset_->empty());
std::vector<const Edge*> modelv(model_.begin(), model_.end());
std::vector<const Edge*> esetv(eset_->begin(), eset_->end());
std::sort(modelv.begin(), modelv.end());
std::sort(esetv.begin(), esetv.end());
EXPECT_EQ(modelv.size(), esetv.size());
for (size_t i = 0; i < modelv.size(); i++) {
EXPECT_EQ(modelv[i], esetv[i]) << i;
}
}
Edge nonexistent_;
Edge* edges_;
EdgeSet* eset_;
std::set<const Edge*> model_;
};
namespace {
TEST_F(EdgeSetTest, Ops) {
for (int n : {0, 1, 2, 3, 4, 10}) {
MakeEdgeSet(n);
CheckSame();
EXPECT_EQ((n == 0), eset_->empty());
EXPECT_EQ(n, eset_->size());
eset_->clear();
model_.clear();
CheckSame();
eset_->insert(&edges_[0]);
model_.insert(&edges_[0]);
CheckSame();
}
}
// Try insert/erase of existing elements at different positions.
TEST_F(EdgeSetTest, Exists) {
for (int n : {0, 1, 2, 3, 4, 10}) {
MakeEdgeSet(n);
for (int pos = 0; pos < n; pos++) {
MakeEdgeSet(n);
auto p = eset_->insert(&edges_[pos]);
EXPECT_FALSE(p.second);
EXPECT_EQ(&edges_[pos], *p.first);
EXPECT_EQ(1, eset_->erase(&edges_[pos]));
model_.erase(&edges_[pos]);
CheckSame();
}
}
}
// Try insert/erase of non-existent element.
TEST_F(EdgeSetTest, DoesNotExist) {
for (int n : {0, 1, 2, 3, 4, 10}) {
MakeEdgeSet(n);
EXPECT_EQ(0, eset_->erase(&nonexistent_));
auto p = eset_->insert(&nonexistent_);
EXPECT_TRUE(p.second);
EXPECT_EQ(&nonexistent_, *p.first);
}
}
} // namespace
} // namespace tensorflow
|
