@@ -34,7 +34,7 @@ TEST_CASE("split cursor dup sort") {
34
34
WorkerPool pool{1 };
35
35
db::test_util::MockCursorDupSort csdp;
36
36
37
- SECTION (" 0 maching bits: seek_both, key not exists" ) {
37
+ SECTION (" 0 matching bits: seek_both, key not exists" ) {
38
38
SplitCursorDupSort sc (csdp, kKey , kLocation , 0 , silkworm::kAddressLength , 0 );
39
39
40
40
EXPECT_CALL (csdp, seek_both (_, _))
@@ -50,7 +50,7 @@ TEST_CASE("split cursor dup sort") {
50
50
CHECK (silkworm::to_hex (skv.value ).empty ());
51
51
}
52
52
53
- SECTION (" evmc:.address maching bits: seek_both, key not exists" ) {
53
+ SECTION (" evmc:.address matching bits: seek_both, key not exists" ) {
54
54
SplitCursorDupSort sc (csdp, kKey , kLocation , 8 * silkworm::kAddressLength , silkworm::kAddressLength ,
55
55
silkworm::kHashLength );
56
56
@@ -67,7 +67,7 @@ TEST_CASE("split cursor dup sort") {
67
67
CHECK (silkworm::to_hex (skv.value ).empty ());
68
68
}
69
69
70
- SECTION (" evmc:.address odd maching bits: seek_both, key not exists" ) {
70
+ SECTION (" evmc:.address odd matching bits: seek_both, key not exists" ) {
71
71
SplitCursorDupSort sc (csdp, kKey , kLocation , 153 , silkworm::kAddressLength ,
72
72
silkworm::kHashLength );
73
73
@@ -84,7 +84,7 @@ TEST_CASE("split cursor dup sort") {
84
84
CHECK (silkworm::to_hex (skv.value ).empty ());
85
85
}
86
86
87
- SECTION (" evmc:.address maching bits: seek_both, key exists" ) {
87
+ SECTION (" evmc:.address matching bits: seek_both, key exists" ) {
88
88
SplitCursorDupSort sc (csdp, kKey , kLocation , 8 * silkworm::kAddressLength , silkworm::kAddressLength ,
89
89
silkworm::kHashLength );
90
90
@@ -118,7 +118,7 @@ TEST_CASE("split cursor dup sort") {
118
118
CHECK (silkworm::to_hex (skv.value ).empty ());
119
119
}
120
120
121
- SECTION (" evmc:.address maching bits: next_dup, key exists empty key" ) {
121
+ SECTION (" evmc:.address matching bits: next_dup, key exists empty key" ) {
122
122
SplitCursorDupSort sc (csdp, kKey , kLocation , 8 * silkworm::kAddressLength , silkworm::kAddressLength ,
123
123
silkworm::kHashLength );
124
124
@@ -135,7 +135,7 @@ TEST_CASE("split cursor dup sort") {
135
135
CHECK (silkworm::to_hex (skv.value ).empty ());
136
136
}
137
137
138
- SECTION (" evmc:.address maching bits: next_dup, key exists wrong key last byte" ) {
138
+ SECTION (" evmc:.address matching bits: next_dup, key exists wrong key last byte" ) {
139
139
SplitCursorDupSort sc (csdp, kKey , kLocation , 8 * silkworm::kAddressLength , silkworm::kAddressLength ,
140
140
silkworm::kHashLength );
141
141
@@ -152,7 +152,7 @@ TEST_CASE("split cursor dup sort") {
152
152
CHECK (silkworm::to_hex (skv.value ).empty ());
153
153
}
154
154
155
- SECTION (" evmc:.address maching bits: next_dup, key exists wrong key first byte" ) {
155
+ SECTION (" evmc:.address matching bits: next_dup, key exists wrong key first byte" ) {
156
156
SplitCursorDupSort sc (csdp, kKey , kLocation , 8 * silkworm::kAddressLength , silkworm::kAddressLength ,
157
157
silkworm::kHashLength );
158
158
@@ -174,7 +174,7 @@ TEST_CASE("split cursor") {
174
174
WorkerPool pool{1 };
175
175
db::test_util::MockCursor csdp;
176
176
177
- SECTION (" 0 maching bits: seek, key not exists" ) {
177
+ SECTION (" 0 matching bits: seek, key not exists" ) {
178
178
SplitCursor sc (csdp, kKey , 0 , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
179
179
180
180
EXPECT_CALL (csdp, seek (_))
@@ -190,7 +190,7 @@ TEST_CASE("split cursor") {
190
190
CHECK (silkworm::to_hex (skv.value ).empty ());
191
191
}
192
192
193
- SECTION (" evmc:.address maching bits: seek, key not exists" ) {
193
+ SECTION (" evmc:.address matching bits: seek, key not exists" ) {
194
194
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
195
195
196
196
EXPECT_CALL (csdp, seek (_))
@@ -206,7 +206,7 @@ TEST_CASE("split cursor") {
206
206
CHECK (silkworm::to_hex (skv.value ).empty ());
207
207
}
208
208
209
- SECTION (" evmc:.address odd maching bits: seek, key not exists" ) {
209
+ SECTION (" evmc:.address odd matching bits: seek, key not exists" ) {
210
210
SplitCursor sc (csdp, kKey , 131 , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
211
211
212
212
EXPECT_CALL (csdp, seek (_))
@@ -222,7 +222,7 @@ TEST_CASE("split cursor") {
222
222
CHECK (silkworm::to_hex (skv.value ).empty ());
223
223
}
224
224
225
- SECTION (" evmc:.address maching bits: seek, key exists" ) {
225
+ SECTION (" evmc:.address matching bits: seek, key exists" ) {
226
226
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
227
227
228
228
EXPECT_CALL (csdp, seek (_))
@@ -238,7 +238,7 @@ TEST_CASE("split cursor") {
238
238
CHECK (silkworm::to_hex (skv.value ) == " 0000000000000000000000000000000000000000000000000000000000000001134567" );
239
239
}
240
240
241
- SECTION (" evmc:.address maching bits: next_dup, key exists short key" ) {
241
+ SECTION (" evmc:.address matching bits: next_dup, key exists short key" ) {
242
242
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
243
243
244
244
EXPECT_CALL (csdp, next ())
@@ -254,7 +254,7 @@ TEST_CASE("split cursor") {
254
254
CHECK (silkworm::to_hex (skv.value ).empty ());
255
255
}
256
256
257
- SECTION (" evmc:.address maching bits: next, empty key" ) {
257
+ SECTION (" evmc:.address matching bits: next, empty key" ) {
258
258
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
259
259
260
260
EXPECT_CALL (csdp, next ())
@@ -270,7 +270,7 @@ TEST_CASE("split cursor") {
270
270
CHECK (silkworm::to_hex (skv.value ).empty ());
271
271
}
272
272
273
- SECTION (" evmc:.address maching bits: next, key exists wrong key last byte" ) {
273
+ SECTION (" evmc:.address matching bits: next, key exists wrong key last byte" ) {
274
274
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
275
275
EXPECT_CALL (csdp, next ())
276
276
.WillOnce (InvokeWithoutArgs ([]() -> Task<KeyValue> {
@@ -285,7 +285,7 @@ TEST_CASE("split cursor") {
285
285
CHECK (silkworm::to_hex (skv.value ).empty ());
286
286
}
287
287
288
- SECTION (" evmc:.address maching bits: next, key exists wrong key first byte" ) {
288
+ SECTION (" evmc:.address matching bits: next, key exists wrong key first byte" ) {
289
289
SplitCursor sc (csdp, kKey , 8 * silkworm::kAddressLength , silkworm::kAddressLength , 0 , silkworm::kAddressLength );
290
290
291
291
EXPECT_CALL (csdp, next ())
@@ -301,4 +301,5 @@ TEST_CASE("split cursor") {
301
301
CHECK (silkworm::to_hex (skv.value ).empty ());
302
302
}
303
303
}
304
+
304
305
} // namespace silkworm::rpc::ethdb
0 commit comments