Lines Matching refs:btNodes
80 @synthesize btNodes;
104 btNodes = btNodeArray;
130 //tmp.btNodes[0] = self;
164 told = btNodes[0];
205 // newnode.lnodeid = tnew.btNodes[0].nodeid;
235 if ( t.nodeType == BTNODE ) t = t.btNodes[i];
285 del = [btNodes[i] internaldelete:dkp];
288 tsb = btNodes[i];
307 if ( btNodes[i].numkeys >= BTHNODESIZE+1 ) {
315 self.btNodes[0] = tsb;
317 if ( self.btNodes[i+1].numkeys > BTHNODESIZE+1 ) { /* carry from right */
326 if ( self.btNodes[i-1].numkeys > BTHNODESIZE+1 ) { /* carry from left */
332 tsb = self.btNodes[i];
367 q = [self.btNodes[i] internalinsert:kp value:value split:h];
374 tmp = self.btNodes[numkeys-1];
377 tmp = self.btNodes[i];
396 btNodes[hi] = value;
408 btNodes[hi] = value;
417 b.btNodes[hi] = value;
432 t0 = btNodes[i];
433 t1 = btNodes[i-1];
435 [t0 insinnode:t1.keys[nkey] value:t1.btNodes[nkey]];
447 t0 = btNodes[i];
448 t1 = btNodes[i+1];
449 [t0 insinnode:t1.keys[0] value:t1.btNodes[0]];
468 n0 = self.btNodes[j];
472 numrecs -= ((self.nodeType == LEAF)?1:btNodes[j].numrecs);
486 btNodes[j] = value;
492 numrecs += btNodes[j].numrecs;
503 t0 = btNodes[i];
504 t1 = btNodes[i+1];
509 t0.btNodes[j] = t1.btNodes[k];
522 tr = btNodes[i+1];
549 t1.btNodes[i] = btNodes[j];
550 t1.numrecs += ((nodeType == LEAF) ? 1 : btNodes[j].numrecs);
551 numrecs -= ((nodeType == LEAF) ? 1 : btNodes[j].numrecs);
553 btNodes[j] = nil;
574 tmp = t.btNodes[i];
581 t.btNodes[i] = nil;
620 if ( t.btNodes[j] != nil ) [self printtree:t.btNodes[j]];
641 if ( t.btNodes[i] != nil ) puttree(l, t.btNodes[i]);
660 btNodes[j] = btNodes[j+1];
674 btNodes[k] = btNodes[k-1];
677 btNodes[j] = nil;
693 t = t.btNodes[0];
698 if ( t.btNodes[i] != nil ) {
720 t = t.btNodes[0];
725 if ( t.btNodes[i] != nil ) {
726 dict.ptrBuffer[idx++] = (id) t.btNodes[i];
742 … [str appendString:[NSString stringWithFormat:@"btnodes[%d]=%@\n", i, [btNodes[i] description]]];