I decided to use the one-array version (thin_sherwood_map) after all …

…because it's faster for successful lookups than the two-array version (fat_sherwood_map). And I want lookups to be fast.
skarupke · May 31, 2014 · c430c1d · c430c1d
1 parent a1ac6ca
commit c430c1d
Show file tree

Hide file tree

Showing 10 changed files with 1,225 additions and 1,210 deletions.
diff --git a/boost_test/exception/containers.hpp b/boost_test/exception/containers.hpp
@@ -26,7 +26,7 @@ typedef thin_sherwood_map<
 	test::exception::hash,
 	test::exception::equal_to,
 	test::exception::allocator2<test::exception::object> > test_map;
-typedef thin_sherwood_map<
+typedef fat_sherwood_map<
 	test::exception::object,
 	test::exception::object,
 	test::exception::hash,

diff --git a/boost_test/objects/exception.hpp b/boost_test/objects/exception.hpp
@@ -547,6 +547,10 @@ namespace exception
 			test::detail::tracker().track_construct((void*) p, sizeof(T), tag_);
         }
 #endif
+		void construct(T* p, T && to_move) {
+			new(p) T(boost::move(to_move));
+			test::detail::tracker().track_construct((void*) p, sizeof(T), tag_);
+		}
 
         void destroy(T* p) {
 			test::detail::tracker().track_destroy((void*) p, sizeof(T), tag_);