#include #include #include #include #include #include #include #include #include int main() { const uint32_t numElements = 4<<10; const uint32_t numIterations = 16; // { int64_t elapsed = -bx::getHPCounter(); for (uint32_t ii = 0; ii < numIterations; ++ii) { typedef tinystl::unordered_map TinyStlUnorderedMap; TinyStlUnorderedMap map; // map.reserve(numElements); for (uint32_t jj = 0; jj < numElements; ++jj) { tinystl::pair ok = map.insert(tinystl::make_pair(uint64_t(jj), uint16_t(jj) ) ); assert(ok.second); } for (uint32_t jj = 0; jj < numElements; ++jj) { bool ok = bx::mapRemove(map, uint64_t(jj) ); assert(ok); } assert(map.size() == 0); } elapsed += bx::getHPCounter(); printf(" TinyStl: %15f\n", double(elapsed) ); } /// { int64_t elapsed = -bx::getHPCounter(); for (uint32_t ii = 0; ii < numIterations; ++ii) { typedef std::unordered_map StdUnorderedMap; StdUnorderedMap map; map.reserve(numElements); for (uint32_t jj = 0; jj < numElements; ++jj) { std::pair ok = map.insert(std::make_pair(uint64_t(jj), uint16_t(jj) ) ); assert(ok.second); } for (uint32_t jj = 0; jj < numElements; ++jj) { bool ok = bx::mapRemove(map, uint64_t(jj) ); assert(ok); } assert(map.size() == 0); } elapsed += bx::getHPCounter(); printf(" STL: %15f\n", double(elapsed) ); } /// { int64_t elapsed = -bx::getHPCounter(); for (uint32_t ii = 0; ii < numIterations; ++ii) { typedef bx::HandleHashMapT HandleHashMap; HandleHashMap map; for (uint32_t jj = 0; jj < numElements; ++jj) { bool ok = map.insert(jj, uint16_t(jj) ); assert(ok); } for (uint32_t jj = 0; jj < numElements; ++jj) { bool ok = map.removeByKey(uint64_t(jj) ); assert(ok); } assert(map.getNumElements() == 0); } elapsed += bx::getHPCounter(); printf("HandleHashMap: %15f\n", double(elapsed) ); } return EXIT_SUCCESS; }