138     static bool equal( const UnorderedType& c, Iterator begin, Iterator end ) {  in equal()
139         if (std::size_t(std::distance(begin, end)) != c.size()) {  in equal()
144             if (!c.contains(Value<UnorderedType>::key(*it))) {  in equal()
153 void CustomExamine( Table c, const std::list<typename Table::value_type>& lst ) {  in CustomExamine()  argument
155     const Table constC = c;  in CustomExamine()
157     const size_type bucket_count = c.unsafe_bucket_count();  in CustomExamine()
158     REQUIRE(c.unsafe_max_bucket_count() >= bucket_count);  in CustomExamine()
162         const size_type size = c.unsafe_bucket_size(i);  in CustomExamine()
165         REQUIRE(std::distance(c.unsafe_begin(i), c.unsafe_end(i)) == diff_type(size));  in CustomExamine()
166         REQUIRE(std::distance(c.unsafe_cbegin(i), c.unsafe_cend(i)) == diff_type(size));  in CustomExamine()
175         const size_type index = c.unsafe_bucket(Value<Table>::key(*it));  in CustomExamine()
177 …REQUIRE(std::search(c.unsafe_begin(index), c.unsafe_end(index), prev_it, it, utils::IsEqual()) != …  in CustomExamine()
180     c.rehash(2*bucket_count);  in CustomExamine()
181     REQUIRE(c.unsafe_bucket_count() > bucket_count);  in CustomExamine()
183     auto count = 2 * c.max_load_factor() * c.unsafe_bucket_count();  in CustomExamine()
184     c.reserve(size_type(count));  in CustomExamine()
185     REQUIRE(c.max_load_factor() * c.unsafe_bucket_count() >= count);  in CustomExamine()
187     REQUIRE(c.load_factor() <= c.max_load_factor());  in CustomExamine()
188     c.max_load_factor(1.0f);  in CustomExamine()
189     c.hash_function();  in CustomExamine()
190     c.key_eq();  in CustomExamine()
194 void Examine( Table c, const std::list<typename Table::value_type>& lst ) {  in Examine()  argument
195     CommonExamine<DefCtorPresent>(c, lst);  in Examine()
196     CustomExamine<DefCtorPresent>(c, lst);  in Examine()