bfs_tools/lib/BPlusTree.cpp

726 	//printf("before (insert \"%s\" (%d bytes) at %d):\n\n",key,*_keyLength,*_keyIndex);
743 	// "bytes" is the number of bytes written for the new key,
744 	// "bytesBefore" are the bytes before that key
745 	// "bytesAfter" are the bytes after the new key, if any
746 	int32 bytes = 0,bytesBefore = 0,bytesAfter = 0;
751 		if (!bytes)
753 		if (in == keyIndex && !bytes) {
754 			bytes = *_keyLength;
759 				inKeyLengths[in] = bytesAfter + bytesBefore + bytes;
765 		if (round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) +
780 	//printf("put %ld keys in the other node (%ld, %ld, %ld) (in = %ld)\n",out,bytesBefore,bytes,bytesAfter,in);
784 	other->all_key_length = bytes + bytesBefore + bytesAfter;
786 	//printf("-> used = %ld (bplustree_node = %ld bytes)\n",other->Used(),sizeof(bplustree_node));
798 	if (bytes) {
800 		memcpy(outKeys + bytesBefore,key,bytes);
801 		outKeyLengths[keyIndex] = bytes + bytesBefore;
806 			memcpy(outKeys + bytesBefore + bytes,inKeys + bytesBefore,bytesAfter);
834 	bytesBefore = bytesAfter = bytes = 0;
838 		//printf("in = %ld, keyIndex = %d, bytes = %ld\n",in,keyIndex,bytes);
839 		if (in == keyIndex && !bytes) {
842 			bytes = *_keyLength;
846 			if (bytes) {
847 				inKeyLengths[in] += bytes;
848 				bytesAfter = inKeyLengths[in] - bytesBefore - bytes;
858 		//printf("-> out = %ld, keylen = %ld, %ld bytes total\n",out,bytesBefore,round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) +
864 	//printf("bytes = (%ld, %ld, %ld), in = %ld, total = %ld\n",bytesBefore,bytes,bytesAfter,in,total);
871 	//printf("bytes = (%ld, %ld, %ld), in = %ld, total = %ld\n",bytesBefore,bytes,bytesAfter,in,total);
878 	node->all_key_length = bytes + bytesBefore + bytesAfter;
885 	//printf("put %ld keys in the first node (%ld, %ld, %ld) (in = %ld)\n",out,bytesBefore,bytes,bytesAfter,in);
896 		memmove(inKeys + bytesBefore + bytes,inKeys + total + bytesBefore,bytesAfter);
909 	if (bytes) {
911 		memcpy(inKeys + bytesBefore,key,bytes);
912 		outKeyLengths[keyIndex] = bytes + bytesBefore;
1167 	// of 1024 bytes - with future versions of BFS, this may be a problem