Lines Matching refs:index
74 node->overflow_link == BPLUSTREE_NULL ? "leaf" : "index",
350 printf("\nkeys don't match (key index = %lld, %ld times in tree, "
469 int32 index = int32(1.0 * gNum * rand() / RAND_MAX);
470 if (index == gNum)
471 index = gNum - 1;
474 dumpKey(gKeys[index].data, gKeys[index].length);
484 insertTotal + gKeys[index].in);
488 status = tree->Insert(transaction, (uint8*)gKeys[index].data,
489 gKeys[index].length, gKeys[index].value);
492 bailOutWithKey(gKeys[index].data, gKeys[index].length);
496 gKeys[index].in++;
512 insertTotal + gKeys[index].in);
517 (uint8*)gKeys[index].data, gKeys[index].length,
518 gKeys[index].value);
521 bailOutWithKey(gKeys[index].data, gKeys[index].length);
525 gKeys[index].in--;
544 int32 index = int32(1.0 * gNum * rand() / RAND_MAX);
545 if (index == gNum)
546 index = gNum - 1;
549 printf("adding key %ld (%ld times in the tree)\n", index,
550 gKeys[index].in);
553 status_t status = tree->Insert(transaction, (uint8*)gKeys[index].data,
554 gKeys[index].length, gKeys[index].value);
557 bailOutWithKey(gKeys[index].data, gKeys[index].length);
559 gKeys[index].in++;
582 int32 index = int32(1.0 * gNum * rand() / RAND_MAX);
583 if (index == gNum)
584 index = gNum - 1;
586 if (gKeys[index].in == 0) {
594 printf("removing key %ld (%ld times in the tree)\n", index,
595 gKeys[index].in);
598 status_t status = tree->Remove(transaction, (uint8*)gKeys[index].data,
599 gKeys[index].length, gKeys[index].value);
602 bailOutWithKey(gKeys[index].data, gKeys[index].length);
604 gKeys[index].in--;