Lines Matching defs:path
112 unsigned int path;
120 /* Calculate the path from the root to the insertion point. This is a min
123 path = 0;
125 path = (path << 1) | (n & 1);
127 /* Now traverse the heap using the path we calculated in the previous step. */
131 if (path & 1)
135 path >>= 1;
157 unsigned int path;
164 /* Calculate the path from the min (the root) to the max, the left-most node
167 path = 0;
169 path = (path << 1) | (n & 1);
171 /* Now traverse the heap using the path we calculated in the previous step. */
174 if (path & 1)
178 path >>= 1;