Lines Matching refs:l
31 unsigned l = Level - 1; in getLeftSibling() local
32 while (l && path[l].offset == 0) in getLeftSibling()
33 --l; in getLeftSibling()
36 if (path[l].offset == 0) in getLeftSibling()
40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling()
43 for (++l; l != Level; ++l) in getLeftSibling()
52 unsigned l = 0; in moveLeft() local
54 l = Level - 1; in moveLeft()
55 while (path[l].offset == 0) { in moveLeft()
56 assert(l != 0 && "Cannot move beyond begin()"); in moveLeft()
57 --l; in moveLeft()
64 --path[l].offset; in moveLeft()
65 NodeRef NR = subtree(l); in moveLeft()
68 for (++l; l != Level; ++l) { in moveLeft()
69 path[l] = Entry(NR, NR.size() - 1); in moveLeft()
72 path[l] = Entry(NR, NR.size() - 1); in moveLeft()
81 unsigned l = Level - 1; in getRightSibling() local
82 while (l && atLastEntry(l)) in getRightSibling()
83 --l; in getRightSibling()
86 if (atLastEntry(l)) in getRightSibling()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling()
93 for (++l; l != Level; ++l) in getRightSibling()
102 unsigned l = Level - 1; in moveRight() local
103 while (l && atLastEntry(l)) in moveRight()
104 --l; in moveRight()
108 if (++path[l].offset == path[l].size) in moveRight()
110 NodeRef NR = subtree(l); in moveRight()
112 for (++l; l != Level; ++l) { in moveRight()
113 path[l] = Entry(NR, 0); in moveRight()
116 path[l] = Entry(NR, 0); in moveRight()