Lines Matching defs:next
393 // if the node is out of duplicates, we go directly to the next one
564 status_t BPlusTree::FindKey(bplustree_node *node,uint8 *key,uint16 keyLength,uint16 *index,off_t *next)
570 if (next)
571 *next = node->overflow_link;
600 if (next)
601 *next = values[i];
608 if (next)
611 *next = node->overflow_link;
613 *next = values[saveIndex];
820 // of the next node (which can also be the new key to insert)