Lines Matching full:we

19  * We know that the btree query_all function starts at the left edge and walks
20  * towards the right edge of the tree.  Therefore, we know that we can walk up
22  * to the first record/key in that block, we haven't seen this block before;
23  * and therefore we need to remember that we saw this block in the btree.
32  * the first btree record, we'll observe that bc_levels[0].ptr == 1, so we
33  * record that we saw block 1.  Then we observe that bc_levels[1].ptr == 1, so
34  * we record block 4.  The list is [1, 4].
36  * For the second btree record, we see that bc_levels[0].ptr == 2, so we exit
39  * For the 101st btree record, we've moved onto leaf block 2.  Now
40  * bc_levels[0].ptr == 1 again, so we record that we saw block 2.  We see that
41  * bc_levels[1].ptr == 2, so we exit the loop.  The list is now [1, 4, 2].
43  * For the 102nd record, bc_levels[0].ptr == 2, so we continue.
45  * For the 201st record, we've moved on to leaf block 3.
46  * bc_levels[0].ptr == 1, so we add 3 to the list.  Now it is [1, 4, 2, 3].
48  * For the 300th record we just exit, with the list being [1, 4, 2, 3].