@@ -40,7 +40,7 @@ TEST(BadDataTest, BadData) {
40
40
41
41
unsigned int nhits;
42
42
43
- for (int i = 0 ; i < rects.size (); i++) {
43
+ for (unsigned int i = 0 ; i < rects.size (); i++) {
44
44
tree.Insert (rects[i].min , rects[i].max , i);
45
45
values.push_back (i);
46
46
}
@@ -55,9 +55,9 @@ TEST(BadDataTest, BadData) {
55
55
EXPECT_EQ (nhits, 0 );
56
56
57
57
std::vector<Rect > collectedRects = std::vector<Rect >();
58
+ std::vector<ValueType> collectedValues = std::vector<ValueType>();
58
59
59
60
// Iterator test
60
- int itIndex = 0 ;
61
61
MyTree::Iterator it;
62
62
for (tree.GetFirst (it); !tree.IsNull (it); tree.GetNext (it)) {
63
63
int value = tree.GetAt (it);
@@ -67,13 +67,14 @@ TEST(BadDataTest, BadData) {
67
67
it.GetBounds (boundsMin, boundsMax);
68
68
collectedRects.push_back (
69
69
Rect (boundsMin[0 ], boundsMin[1 ], boundsMax[0 ], boundsMax[1 ]));
70
+ collectedValues.push_back (value);
70
71
}
71
72
72
73
EXPECT_THAT (rects, UnorderedElementsAreArray (collectedRects));
74
+ EXPECT_THAT (values, UnorderedElementsAreArray (collectedValues));
75
+ collectedValues.clear ();
73
76
74
77
// Iterator test, alternate syntax
75
- std::vector<ValueType> collectedValues = std::vector<ValueType>();
76
-
77
78
tree.GetFirst (it);
78
79
while (!it.IsNull ()) {
79
80
CoordType value = *it;
0 commit comments