Lines Matching refs:btNodes
67 @synthesize btNodes;
91 btNodes = btNodeArray;
109 //tmp.btNodes[0] = self;
143 told = btNodes[0];
184 // newnode.lnodeid = tnew.btNodes[0].nodeid;
214 if ( t.nodeType == BTNODE ) t = t.btNodes[i];
264 del = [btNodes[i] internaldelete:dkp];
267 tsb = btNodes[i];
286 if ( btNodes[i].numkeys >= BTHNODESIZE+1 ) {
294 self.btNodes[0] = tsb;
296 if ( self.btNodes[i+1].numkeys > BTHNODESIZE+1 ) { /* carry from right */
305 if ( self.btNodes[i-1].numkeys > BTHNODESIZE+1 ) { /* carry from left */
311 tsb = self.btNodes[i];
346 q = [self.btNodes[i] internalinsert:kp value:value split:h];
353 tmp = self.btNodes[numkeys-1];
356 tmp = self.btNodes[i];
375 btNodes[hi] = value;
387 btNodes[hi] = value;
396 b.btNodes[hi] = value;
411 t0 = btNodes[i];
412 t1 = btNodes[i-1];
414 [t0 insinnode:t1.keys[nkey] value:t1.btNodes[nkey]];
426 t0 = btNodes[i];
427 t1 = btNodes[i+1];
428 [t0 insinnode:t1.keys[0] value:t1.btNodes[0]];
447 n0 = self.btNodes[j];
451 numrecs -= ((self.nodeType == LEAF)?1:btNodes[j].numrecs);
465 btNodes[j] = value;
471 numrecs += btNodes[j].numrecs;
482 t0 = btNodes[i];
483 t1 = btNodes[i+1];
488 t0.btNodes[j] = t1.btNodes[k];
501 tr = btNodes[i+1];
528 t1.btNodes[i] = btNodes[j];
529 t1.numrecs += ((nodeType == LEAF) ? 1 : btNodes[j].numrecs);
530 numrecs -= ((nodeType == LEAF) ? 1 : btNodes[j].numrecs);
532 btNodes[j] = nil;
553 tmp = t.btNodes[i];
560 t.btNodes[i] = nil;
599 if ( t.btNodes[j] != nil ) [self printtree:t.btNodes[j]];
620 if ( t.btNodes[i] != nil ) puttree(l, t.btNodes[i]);
639 btNodes[j] = btNodes[j+1];
653 btNodes[k] = btNodes[k-1];
656 btNodes[j] = nil;
672 t = t.btNodes[0];
677 if ( t.btNodes[i] != nil ) {
699 t = t.btNodes[0];
704 if ( t.btNodes[i] != nil ) {
705 dict.ptrBuffer[idx++] = (id) t.btNodes[i];