HomeSort by relevance Sort by last modified time
    Searched refs:hum (Results 1 - 3 of 3) sorted by null

  /external/stlport/test/unit/
unordered_test.cpp 436 umset hum; local
440 hum.insert(magic);
447 hum.insert(r);
451 if ((float)(hum.size() + 1) / (float)hum.bucket_count() > hum.max_load_factor()) {
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
453 for (size_t b = 0; b < hum.bucket_count(); ++b) {
454 if (hum.bucket_size(b) != 0)
    [all...]
  /ndk/tests/device/test-gnustl-full/unit/
unordered_test.cpp 436 umset hum; local
440 hum.insert(magic);
447 hum.insert(r);
451 if ((float)(hum.size() + 1) / (float)hum.bucket_count() > hum.max_load_factor()) {
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
453 for (size_t b = 0; b < hum.bucket_count(); ++b) {
454 if (hum.bucket_size(b) != 0)
    [all...]
  /ndk/tests/device/test-stlport/unit/
unordered_test.cpp 436 umset hum; local
440 hum.insert(magic);
447 hum.insert(r);
451 if ((float)(hum.size() + 1) / (float)hum.bucket_count() > hum.max_load_factor()) {
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
453 for (size_t b = 0; b < hum.bucket_count(); ++b) {
454 if (hum.bucket_size(b) != 0)
    [all...]

Completed in 23 milliseconds