bfs_tools/lib/BPlusTree.cpp

619 	nodeAndKey.keyIndex = 0;
626 			// node that the keyIndex is not properly set here!
627 			nodeAndKey.keyIndex = 0;
633 		status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex,&nextOffset);
638 		// put the node & the correct keyIndex on the stack
735 	uint16 keyIndex = *_keyIndex;
749 		if (in == keyIndex && !bytes) {
752 			if (keyIndex < out) {
770 	if (keyIndex >= out && in > 0)
786 	int32 keys = out > keyIndex ? keyIndex : out;
797 		outKeyLengths[keyIndex] = bytes + bytesBefore;
798 		outKeyValues[keyIndex] = *_value;
803 			keys = out - keyIndex - 1;
804 			memcpy(outKeyLengths + keyIndex + 1,inKeyLengths + keyIndex,keys * sizeof(uint16));
805 			memcpy(outKeyValues + keyIndex + 1,inKeyValues + keyIndex,keys * sizeof(off_t));
811 		keyIndex--;
818 		if (in == keyIndex) {
820 			keyIndex--;
834 		//printf("in = %ld, keyIndex = %d, bytes = %ld\n",in,keyIndex,bytes);
835 		if (in == keyIndex && !bytes) {
856 		if (in > node->all_key_count && keyIndex < in)
862 	if (keyIndex >= in && keyIndex - skip < out) {
864 	} else if (keyIndex < skip)
886 	keys = keyIndex <= skip ? out : keyIndex - skip;
887 	keyIndex -= skip;
896 	in = out - keyIndex - 1;
898 		memmove(outKeyLengths + keyIndex + 1,inKeyLengths + skip + keyIndex,in * sizeof(uint16));
903 		memmove(outKeyValues + keyIndex + 1,inKeyValues + skip + keyIndex,in * sizeof(off_t));
908 		outKeyLengths[keyIndex] = bytes + bytesBefore;
909 		outKeyValues[keyIndex] = *_value;
972 			status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex);
980 					return InsertDuplicate(node,nodeAndKey.keyIndex);
990 			InsertKey(node,keyBuffer,keyLength,valueToInsert,nodeAndKey.keyIndex);
1009 			if (SplitNode(node,nodeAndKey.nodeOffset,&nodeAndKey.keyIndex,keyBuffer,&keyLength,&valueToInsert) < B_OK) {
1052 		status_t status = FindKey(node,key,keyLength,&nodeAndKey.keyIndex);
1060 			*value = node->Values()[nodeAndKey.keyIndex];