本文共 8752 字，大约阅读时间需要 29 分钟。
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 10 namespace zl 11 { //{ { { 12 struct equal_to 13 { 14 bool operator()(const char* s1, const char* s2) const 15 { 16 return strcmp(s1, s2) == 0; 17 } 18 }; 19 20 struct hash_string 21 : public std::unary_function 22 { 23 std::size_t 24 operator()(const std::string& __s) const 25 #ifdef __linux__ 26 { return std::tr1::Fnv_hash<>::hash(__s.data(), __s.length()); } 27 #else 28 { return std::tr1::_Fnv_hash<>::hash(__s.data(), __s.length()); } 29 #endif 30 }; 31 32 33 struct hash_charptr 34 : public std::unary_function 35 { 36 std::size_t 37 operator()(const char* __s) const 38 #ifdef __linux__ 39 { return std::tr1::Fnv_hash<>::hash(__s, strlen(__s)); } 40 #else 41 { return std::tr1::_Fnv_hash<>::hash(__s, strlen(__s)); } 42 #endif 43 }; 44 }//}}} 45 46 typedef std::list string_list; 47 typedef std::map string_map; 48 typedef __gnu_cxx::hash_map string_hash_map; 49 typedef std::tr1::unordered_map string_unordered_map; 50 51 void fill_list(string_list& slist, size_t count); 52 uint64_t current_usec(); 53 54 int main( int argc, char* argv[] ) 55 { 56 if (argc != 2 && argc != 3) 57 { 58 fprintf(stderr, "Usage:%s test_count rehash\n", argv[0]); 59 fprintf(stderr, "For example:%s 10000 rehash\n", argv[0]); 60 return -1; 61 } 62 63 size_t count = atoi(argv[1]); 64 bool rehash = false; 65 if (argc == 3) 66 { 67 rehash = true; 68 } 69 70 string_map smap; 71 string_hash_map shash_map; 72 string_unordered_map sunordered_map; 73 74 if (rehash) 75 { 76 sunordered_map.rehash(count); 77 } 78 79 string_list slist; 80 fill_list(slist, count); 81 82 uint64_t start = 0; 83 uint64_t end = 0; 84 85 uint64_t map_insert_us = 0; 86 uint64_t hash_map_insert_us = 0; 87 uint64_t unordered_map_insert_us = 0; 88 89 uint64_t map_traverse_us = 0; 90 uint64_t hash_map_traverse_us = 0; 91 uint64_t unordered_map_traverse_us = 0; 92 93 uint64_t map_find_us = 0; 94 uint64_t hash_map_find_us = 0; 95 uint64_t unordered_map_find_us = 0; 96 97 uint64_t map_delete_us = 0; 98 uint64_t hash_map_delete_us = 0; 99 uint64_t unordered_map_delete_us = 0;100 101 102 103 // Insert test104 { //{ { { 105 string_list::iterator it(slist.begin());106 string_list::iterator ite(slist.end());107 108 //map insert109 start = current_usec();110 for (int i = 0; it != ite; ++it, ++i)111 {112 smap[*it] = i;113 }114 end = current_usec();115 map_insert_us = end - start;116 117 //hash_map insert118 it = slist.begin();119 start = current_usec();120 for (int i = 0; it != ite; ++it, ++i)121 {122 shash_map[*it] = i;123 }124 end = current_usec();125 hash_map_insert_us = end - start;126 127 //unordered_map insert128 it = slist.begin();129 start = current_usec();130 for (int i = 0; it != ite; ++it, ++i)131 {132 shash_map[*it] = i;133 }134 end = current_usec();135 unordered_map_insert_us = end - start;136 }//}}}137 138 // Traverse test139 { //{ { {140 //map traverse 141 {142 string_map::iterator it(smap.begin());143 string_map::iterator ite(smap.end());144 start = current_usec();145 for (int i = 0; it != ite; ++it)146 {147 i++;148 }149 end = current_usec();150 map_traverse_us = end - start;151 }152 153 //hash_map traverse 154 {155 string_hash_map::iterator it(shash_map.begin());156 string_hash_map::iterator ite(shash_map.end());157 start = current_usec();158 for (int i = 0; it != ite; ++it)159 {160 i++;161 }162 end = current_usec();163 hash_map_traverse_us = end - start;164 }165 166 //unordered_map traverse 167 {168 string_unordered_map::iterator it(sunordered_map.begin());169 string_unordered_map::iterator ite(sunordered_map.end());170 start = current_usec();171 for (int i = 0; it != ite; ++it)172 {173 i++;174 }175 end = current_usec();176 unordered_map_traverse_us = end - start;177 }178 }//}}}179 180 // Find test181 { //{ { { 182 string_list::iterator it(slist.begin());183 string_list::iterator ite(slist.end());184 185 //map find186 start = current_usec();187 for (int i = 0; it != ite; ++it, ++i)188 {189 smap[*it] = i;190 }191 end = current_usec();192 map_find_us = end - start;193 194 //hash_map find195 it = slist.begin();196 start = current_usec();197 for (int i = 0; it != ite; ++it, ++i)198 {199 shash_map[*it] = i;200 }201 end = current_usec();202 hash_map_find_us = end - start;203 204 //unordered_map find205 it = slist.begin();206 start = current_usec();207 for (int i = 0; it != ite; ++it, ++i)208 {209 shash_map[*it] = i;210 }211 end = current_usec();212 unordered_map_find_us = end - start;213 }//}}}214 215 // Delete test216 { //{ { { 217 string_list::iterator it(slist.begin());218 string_list::iterator ite(slist.end());219 220 //map delete221 start = current_usec();222 for (int i = 0; it != ite; ++it, ++i)223 {224 smap.erase(*it);225 }226 end = current_usec();227 map_delete_us = end - start;228 229 //hash_map delete230 it = slist.begin();231 start = current_usec();232 for (int i = 0; it != ite; ++it, ++i)233 {234 shash_map.erase(*it);235 }236 end = current_usec();237 hash_map_delete_us = end - start;238 239 //unordered_map delete240 it = slist.begin();241 start = current_usec();242 for (int i = 0; it != ite; ++it, ++i)243 {244 shash_map.erase(*it);245 }246 end = current_usec();247 unordered_map_delete_us = end - start;248 }//}}}249 250 //stat output251 std::cout << " insert, count " << count << std::endl;252 std::cout << " std::map " << map_insert_us << " us\n";253 std::cout << " std::ext/hash_map " << hash_map_insert_us << " us\n";254 std::cout << "std::tr1::unordered_map " << unordered_map_insert_us << " us\n";255 256 std::cout << "\n";257 std::cout << " traverse, count " << count << std::endl;258 std::cout << " std::map " << map_traverse_us << " us\n";259 std::cout << " std::ext/hash_map " << hash_map_traverse_us << " us\n";260 std::cout << "std::tr1::unordered_map " << unordered_map_traverse_us << " us\n";261 262 std::cout << "\n";263 std::cout << " find, count " << count << std::endl;264 std::cout << " std::map " << map_find_us << " us\n";265 std::cout << " std::ext/hash_map " << hash_map_find_us << " us\n";266 std::cout << "std::tr1::unordered_map " << unordered_map_find_us << " us\n";267 268 std::cout << "\n";269 std::cout << " delete, count " << count << std::endl;270 std::cout << " std::map " << map_delete_us << " us\n";271 std::cout << " std::ext/hash_map " << hash_map_delete_us << " us\n";272 std::cout << "std::tr1::unordered_map " << unordered_map_delete_us << " us\n";273 274 275 return 0;276 }277 278 void fill_list(string_list& slist, size_t count)279 {280 for (size_t i = 0; i < count; ++i)281 {282 std::ostringstream oss;283 oss << i;284 //slist.push_back(MD5::getHexMD5(oss.str().c_str(), oss.str().length()));285 slist.push_back(oss.str());286 }287 }288 289 290 uint64_t current_usec()291 {292 struct timeval tv;293 gettimeofday( &tv, NULL );294 return tv.tv_sec * 1000 * 1000 + tv.tv_usec;295 }
转载于:https://www.cnblogs.com/Azhu/articles/4132666.html
View Code