@@ -14,29 +14,26 @@ auto fakeImage = [](Size s) {
14
14
return img;
15
15
};
16
16
17
- TEST (Level, Constructor) {
18
- DEMData::Level level (4 , 2 );
19
- EXPECT_EQ (level.dim , 4 );
20
- EXPECT_EQ (level.border , 2 );
21
- EXPECT_EQ (level.stride , 8 );
22
- EXPECT_EQ (level.image .bytes (), size_t (8 *8 *4 ));
23
- }
24
-
25
- TEST (Level, RoundTrip) {
26
- DEMData::Level level (4 , 2 );
27
- level.set (0 , 0 , 255 );
28
- EXPECT_EQ (level.get (0 ,0 ), 255 );
29
- }
30
-
31
17
TEST (DEMData, Constructor) {
32
18
PremultipliedImage image = fakeImage ({16 , 16 });
33
19
DEMData pyramid (image);
34
20
35
- EXPECT_TRUE (pyramid.isLoaded ());
36
- EXPECT_EQ (pyramid.level .dim , 16 );
37
- EXPECT_EQ (pyramid.level .border , 8 );
21
+ EXPECT_EQ (pyramid.dim , 16 );
22
+ EXPECT_EQ (pyramid.border , 8 );
23
+ EXPECT_EQ (pyramid.stride , 32 );
24
+ EXPECT_EQ (pyramid.getImage ()->bytes (), size_t (32 *32 *4 ));
25
+ EXPECT_EQ (pyramid.dim , 16 );
26
+ EXPECT_EQ (pyramid.border , 8 );
38
27
};
39
28
29
+ TEST (DEMData, RoundTrip) {
30
+ PremultipliedImage image = fakeImage ({16 , 16 });
31
+ DEMData pyramid (image);
32
+
33
+ pyramid.set (4 , 6 , 255 );
34
+ EXPECT_EQ (pyramid.get (4 , 6 ), 255 );
35
+ }
36
+
40
37
TEST (DEMData, InitialBackfill) {
41
38
42
39
PremultipliedImage image1 = fakeImage ({4 , 4 });
@@ -47,7 +44,7 @@ TEST(DEMData, InitialBackfill) {
47
44
// with a non-empty pixel value
48
45
for (int x = -1 ; x < 5 ; x++){
49
46
for (int y = -1 ; y < 5 ; y ++) {
50
- if (dem1.level . get (x, y) == -65536 ) {
47
+ if (dem1.get (x, y) == -65536 ) {
51
48
nonempty = false ;
52
49
break ;
53
50
}
@@ -59,7 +56,7 @@ TEST(DEMData, InitialBackfill) {
59
56
int vertx[] = {-1 , 4 };
60
57
for (int x : vertx) {
61
58
for (int y = 0 ; y < 4 ; y++) {
62
- if (dem1.level . get (x, y) != dem1. level .get (x < 0 ? x + 1 : x - 1 , y)) {
59
+ if (dem1.get (x, y) != dem1.get (x < 0 ? x + 1 : x - 1 , y)) {
63
60
verticalBorderMatch = false ;
64
61
break ;
65
62
}
@@ -73,7 +70,7 @@ TEST(DEMData, InitialBackfill) {
73
70
int horiz[] = {-1 , 4 };
74
71
for (int y : horiz) {
75
72
for (int x = 0 ; x < 4 ; x++) {
76
- if (dem1.level . get (x, y) != dem1. level .get (x, y < 0 ? y + 1 : y - 1 )) {
73
+ if (dem1.get (x, y) != dem1.get (x, y < 0 ? y + 1 : y - 1 )) {
77
74
horizontalBorderMatch = false ;
78
75
break ;
79
76
}
@@ -83,13 +80,13 @@ TEST(DEMData, InitialBackfill) {
83
80
84
81
EXPECT_TRUE (horizontalBorderMatch);
85
82
// -1, 1 corner initially equal to closest corner data
86
- EXPECT_TRUE (dem1.level . get (-1 , 4 ) == dem1. level .get (0 , 3 ));
83
+ EXPECT_TRUE (dem1.get (-1 , 4 ) == dem1.get (0 , 3 ));
87
84
// 1, 1 corner initially equal to closest corner data
88
- EXPECT_TRUE (dem1.level . get (4 , 4 ) == dem1. level .get (3 , 3 ));
85
+ EXPECT_TRUE (dem1.get (4 , 4 ) == dem1.get (3 , 3 ));
89
86
// -1, -1 corner initially equal to closest corner data
90
- EXPECT_TRUE (dem1.level . get (-1 , -1 ) == dem1. level .get (0 , 0 ));
87
+ EXPECT_TRUE (dem1.get (-1 , -1 ) == dem1.get (0 , 0 ));
91
88
// -1, 1 corner initially equal to closest corner data
92
- EXPECT_TRUE (dem1.level . get (4 , -1 ) == dem1. level .get (3 , 0 ));
89
+ EXPECT_TRUE (dem1.get (4 , -1 ) == dem1.get (3 , 0 ));
93
90
};
94
91
95
92
TEST (DEMData, BackfillNeighbor) {
@@ -103,41 +100,41 @@ TEST(DEMData, BackfillNeighbor) {
103
100
for (int y = 0 ; y < 4 ; y++) {
104
101
// dx = -1, dy = 0, so the left edge of dem1 should equal the right edge of dem0
105
102
// backfills Left neighbor
106
- EXPECT_TRUE (dem0.level . get (-1 , y) == dem1. level .get (3 , y));
103
+ EXPECT_TRUE (dem0.get (-1 , y) == dem1.get (3 , y));
107
104
108
105
}
109
106
110
107
dem0.backfillBorder (dem1, 0 , -1 );
111
108
// backfills TopCenter neighbor
112
109
for (int x = 0 ; x < 4 ; x++) {
113
- EXPECT_TRUE (dem0.level . get (x, -1 ) == dem1. level .get (x, 3 ));
110
+ EXPECT_TRUE (dem0.get (x, -1 ) == dem1.get (x, 3 ));
114
111
}
115
112
116
113
dem0.backfillBorder (dem1, 1 , 0 );
117
- // backfills Right neighb// backfulls TopRight neighboror
114
+ // backfills Right neighbor
118
115
for (int y = 0 ; y < 4 ; y++) {
119
- EXPECT_TRUE (dem0.level . get (4 , y) == dem1. level .get (0 , y));
116
+ EXPECT_TRUE (dem0.get (4 , y) == dem1.get (0 , y));
120
117
}
121
118
122
119
dem0.backfillBorder (dem1, 0 , 1 );
123
120
// backfills BottomCenter neighbor
124
121
for (int x = 0 ; x < 4 ; x++) {
125
- EXPECT_TRUE (dem0.level . get (x, 4 ) == dem1. level .get (x, 0 ));
122
+ EXPECT_TRUE (dem0.get (x, 4 ) == dem1.get (x, 0 ));
126
123
}
127
124
128
125
dem0.backfillBorder (dem1, -1 , 1 );
129
126
// backfulls TopRight neighbor
130
- EXPECT_TRUE (dem0.level . get (-1 , 4 ) == dem1. level .get (3 , 0 ));
127
+ EXPECT_TRUE (dem0.get (-1 , 4 ) == dem1.get (3 , 0 ));
131
128
132
129
dem0.backfillBorder (dem1, 1 , 1 );
133
130
// backfulls BottomRight neighbor
134
- EXPECT_TRUE (dem0.level . get (4 , 4 ) == dem1. level .get (0 , 0 ));
131
+ EXPECT_TRUE (dem0.get (4 , 4 ) == dem1.get (0 , 0 ));
135
132
136
133
dem0.backfillBorder (dem1, -1 , -1 );
137
134
// backfulls TopLeft neighbor
138
- EXPECT_TRUE (dem0.level . get (-1 , -1 ) == dem1. level .get (3 , 3 ));
135
+ EXPECT_TRUE (dem0.get (-1 , -1 ) == dem1.get (3 , 3 ));
139
136
140
137
dem0.backfillBorder (dem1, 1 , -1 );
141
138
// backfulls BottomLeft neighbor
142
- EXPECT_TRUE (dem0.level . get (4 , -1 ) == dem1. level .get (0 , 3 ));
139
+ EXPECT_TRUE (dem0.get (4 , -1 ) == dem1.get (0 , 3 ));
143
140
};
0 commit comments