Lines Matching defs:NR
39 // NR is the subtree containing our left sibling.
40 NodeRef NR = path[l].subtree(path[l].offset - 1);
44 NR = NR.subtree(NR.size() - 1);
45 return NR;
63 // NR is the subtree containing our left sibling.
65 NodeRef NR = subtree(l);
69 path[l] = Entry(NR, NR.size() - 1);
70 NR = NR.subtree(NR.size() - 1);
72 path[l] = Entry(NR, NR.size() - 1);
89 // NR is the subtree containing our right sibling.
90 NodeRef NR = path[l].subtree(path[l].offset + 1);
94 NR = NR.subtree(0);
95 return NR;
106 // NR is the subtree containing our right sibling. If we hit end(), we have
110 NodeRef NR = subtree(l);
113 path[l] = Entry(NR, 0);
114 NR = NR.subtree(0);
116 path[l] = Entry(NR, 0);
