Searched refs:elements_count (Results 1 – 3 of 3) sorted by relevance
227 void fill_and_catch(Container& q, std::size_t elements_count) { in fill_and_catch() argument229 for (std::size_t i = 0; i < elements_count; ++i) { in fill_and_catch()241 CHECK(TrackableItem::object_addresses.size() == 2 * elements_count / 3); in fill_and_catch()243 CHECK(TrackableItem::object_addresses.size() == elements_count); in fill_and_catch()255 const std::size_t elements_count = 100000; in test_tracking_dtors_on_clear() local258 fill_and_catch(q, elements_count); in test_tracking_dtors_on_clear()271 fill_and_catch(q, elements_count); in test_tracking_dtors_on_clear()
1639 const std::size_t elements_count = 100; in test_with_minimalistic_objects() local1643 for (std::size_t i = 0; i < elements_count; ++i) { in test_with_minimalistic_objects()1646 test_basics(default_container, elements_count); in test_with_minimalistic_objects()1652 for (std::size_t i = 0; i < elements_count; ++i) { in test_with_minimalistic_objects()1655 test_basics(default_container, elements_count); in test_with_minimalistic_objects()1658 for (std::size_t i = 0; i < elements_count; ++i) { in test_with_minimalistic_objects()1670 CHECK(element_counter == elements_count); in test_with_minimalistic_objects()
676 void reserve( size_type elements_count ) { in reserve() argument683 while (necessary_bucket_count * max_load_factor() < elements_count) { in reserve()