/dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/ |
H A D | concurrent_hash_map.h | 1242 …nt_size = int(my_size), buckets = int(mask)+1, empty_buckets = 0, overpopulated_buckets = 0; // us… in rehash() local 1254 else if( n->next ) overpopulated_buckets++; in rehash() 1266 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in rehash() 1267 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in rehash() 1270 typeid(*this).name(), current_size, empty_buckets, overpopulated_buckets ); in rehash() 1282 …int current_size = int(my_size), buckets = int(m)+1, empty_buckets = 0, overpopulated_buckets = 0;… in clear() local 1296 else if( n->next ) overpopulated_buckets++; in clear() 1310 current_size, int(m+1), buckets, empty_buckets, overpopulated_buckets, in clear() 1317 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in clear() 1318 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in clear() [all …]
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/ |
H A D | concurrent_hash_map.h | 1317 …nt_size = int(my_size), buckets = int(mask)+1, empty_buckets = 0, overpopulated_buckets = 0; // us… in rehash() local 1329 else if( n->next ) overpopulated_buckets++; in rehash() 1341 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in rehash() 1342 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in rehash() 1350 current_size, empty_buckets, overpopulated_buckets ); in rehash() 1362 …int current_size = int(my_size), buckets = int(m)+1, empty_buckets = 0, overpopulated_buckets = 0;… in clear() local 1376 else if( n->next ) overpopulated_buckets++; in clear() 1390 current_size, int(m+1), buckets, empty_buckets, overpopulated_buckets, in clear() 1397 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in clear() 1398 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in clear() [all …]
|
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/include/tbb/ |
H A D | concurrent_hash_map.h | 1465 …nt_size = int(my_size), buckets = int(mask)+1, empty_buckets = 0, overpopulated_buckets = 0; // us… in rehash() local 1477 else if( n->next ) overpopulated_buckets++; in rehash() 1489 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in rehash() 1490 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in rehash() 1498 current_size, empty_buckets, overpopulated_buckets ); in rehash() 1510 …int current_size = int(my_size), buckets = int(m)+1, empty_buckets = 0, overpopulated_buckets = 0;… in clear() local 1524 else if( n->next ) overpopulated_buckets++; in clear() 1538 current_size, int(m+1), buckets, empty_buckets, overpopulated_buckets, in clear() 1545 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in clear() 1546 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in clear() [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/include/tbb/ |
H A D | concurrent_hash_map.h | 1465 …nt_size = int(my_size), buckets = int(mask)+1, empty_buckets = 0, overpopulated_buckets = 0; // us… in rehash() local 1477 else if( n->next ) overpopulated_buckets++; in rehash() 1489 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in rehash() 1490 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in rehash() 1498 current_size, empty_buckets, overpopulated_buckets ); in rehash() 1510 …int current_size = int(my_size), buckets = int(m)+1, empty_buckets = 0, overpopulated_buckets = 0;… in clear() local 1524 else if( n->next ) overpopulated_buckets++; in clear() 1538 current_size, int(m+1), buckets, empty_buckets, overpopulated_buckets, in clear() 1545 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in clear() 1546 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in clear() [all …]
|
/dports/devel/tbb/oneTBB-2020.3/include/tbb/ |
H A D | concurrent_hash_map.h | 1465 …nt_size = int(my_size), buckets = int(mask)+1, empty_buckets = 0, overpopulated_buckets = 0; // us… in rehash() local 1477 else if( n->next ) overpopulated_buckets++; in rehash() 1489 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in rehash() 1490 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in rehash() 1498 current_size, empty_buckets, overpopulated_buckets ); in rehash() 1510 …int current_size = int(my_size), buckets = int(m)+1, empty_buckets = 0, overpopulated_buckets = 0;… in clear() local 1524 else if( n->next ) overpopulated_buckets++; in clear() 1538 current_size, int(m+1), buckets, empty_buckets, overpopulated_buckets, in clear() 1545 else overpopulated_buckets -= current_size - buckets; // TODO: load_factor? in clear() 1546 …if( !reported && buckets >= 512 && ( 2*empty_buckets > current_size || 2*overpopulated_buckets > c… in clear() [all …]
|