40   NodeRef NR = path[l].subtree(path[l].offset - 1);  in getLeftSibling()  local
44     NR = NR.subtree(NR.size() - 1);  in getLeftSibling()
45   return NR;  in getLeftSibling()
65   NodeRef NR = subtree(l);  in moveLeft()  local
69     path[l] = Entry(NR, NR.size() - 1);  in moveLeft()
70     NR = NR.subtree(NR.size() - 1);  in moveLeft()
72   path[l] = Entry(NR, NR.size() - 1);  in moveLeft()
90   NodeRef NR = path[l].subtree(path[l].offset + 1);  in getRightSibling()  local
94     NR = NR.subtree(0);  in getRightSibling()
95   return NR;  in getRightSibling()
110   NodeRef NR = subtree(l);  in moveRight()  local
113     path[l] = Entry(NR, 0);  in moveRight()
114     NR = NR.subtree(0);  in moveRight()
116   path[l] = Entry(NR, 0);  in moveRight()