70 findNodeItem.nKey = nNode;
84 register int i1, i2, c;
94 for (i1 = 0, i2 = 0; i2 < c; i2++) {
95 if (pnEdgeset[1 + i2] != nEdge) {
96 pnSet[1 + i1++] = pnEdgeset[1 + i2];
136 findNodeItem.nKey = nNode;
150 register int i1, i2, c;
160 for (i1 = 0, i2 = 0; i2 < c; i2++) {
161 if (pnEdgeset[1 + i2] != nEdge) {
162 pnSet[1 + i1++] = pnEdgeset[1 + i2];
220 findNodeItem.nKey = nNodeId;
339 pos = top + (bot - top) / 2;
344 else if (nodeid <
id) {
347 else if (nodeid >
id) {
354 return &pref[pos * cwords];
357 findnode.
nKey = nodeid;
359 if (ptreenode && ptreenode->
pv) {
360 return ptreenode->
pv;