1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
*** iterator_check ***
Test tree size: 50000
--> (0,0) (0,1) (0,2) (0,3) (0,4) (2,0) (2,1)
<-- (19998,4) (19998,3) (19998,2) (19998,1) (19998,0) (19996,4) (19996,3)
Key -1, empty range [ptr, ptr): <->
Key 0, not empty range [ptr, ptr): (0,0) (0,1) (0,2) (0,3) (0,4) <-> (0,4) (0,3) (0,2) (0,1) (0,0)
Key 10, not empty range [ptr, ptr): (10,0) (10,1) (10,2) (10,3) (10,4) <-> (10,4) (10,3) (10,2) (10,1) (10,0)
Key 15, empty range [ptr, ptr): <->
Key 19998, not empty range [ptr, eof): (19998,0) (19998,1) (19998,2) (19998,3) (19998,4) <-> (19998,4) (19998,3) (19998,2) (19998,1) (19998,0)
Key 20000, empty range [eof, eof): <->
Key -1, range [ptr, ptr): <->
Key 0, range [ptr, ptr): (0,0) (0,1) (0,2) (0,3) (0,4) <-> (0,4) (0,3) (0,2) (0,1) (0,0)
Key 10, range [ptr, ptr): (10,0) (10,1) (10,2) (10,3) (10,4) <-> (10,4) (10,3) (10,2) (10,1) (10,0)
Key 15, range [ptr, ptr): <->
Key 19998, range [ptr, eof): (19998,0) (19998,1) (19998,2) (19998,3) (19998,4) <-> (19998,4) (19998,3) (19998,2) (19998,1) (19998,0)
Key 20000, range [eof, eof): <->
*** iterator_check: done ***
*** iterator_invalidate_check ***
*** iterator_invalidate_check: done ***
*** iterator_freeze_check ***
*** iterator_freeze_check: done ***
|
