summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorJan Holesovsky <kendy@suse.cz>2013-01-31 21:06:42 +0100
committerJan Holesovsky <kendy@suse.cz>2013-01-31 21:06:42 +0100
commita16616044711b2af07284edbb6b49facccc5fa20 (patch)
tree2a5b00f671041740c9c389029377d04830a9f0e7
parent2bcd2598ad45738079889752577fa1cb6f7e0c93 (diff)
Dense B+ tree: Don't initilize NodeWithIndex in the default constructor.
It is not necessary, and valgrind suggests it takes us some time. Indeed: BigPtrArray - append: 45 msec BigPtrArray - insert at front: 6580 msec BigPtrArray - insert in the middle: 3081 msec DenseBPlusTree - append: 47 msec DenseBPlusTree - insert at front: 167 msec DenseBPlusTree - insert in the middle: 87 msec I am happy now, I do not think I can do it any better. Change-Id: If7c6882daf712af37db4b43c13ab6aedb0086da0
-rw-r--r--sw/inc/densebplustree.hxx2
1 files changed, 1 insertions, 1 deletions
diff --git a/sw/inc/densebplustree.hxx b/sw/inc/densebplustree.hxx
index be3252ae8abb..90cb4008fb0a 100644
--- a/sw/inc/densebplustree.hxx
+++ b/sw/inc/densebplustree.hxx
@@ -96,7 +96,7 @@ private:
DBPTreeNode< Key, Value > *pNode;
Key nIndex;
- NodeWithIndex() : pNode( NULL ), nIndex( 0 ) {}
+ NodeWithIndex() {}
NodeWithIndex( DBPTreeNode< Key, Value > *p, Key n ) : pNode( p ), nIndex( n ) {}
};