if (um.find(j) != um.end()) { count++; } } } cout << "count:" << count << ", unordered_map:"; } // hash_map的查找 { int count = 0; progress_timer t; for (int i = 0; i<times; i++) { for (int j = 0; j<size; j++) { if (hm.find(j) != hm.end()) ...