/* Boost.MultiIndex test for standard hash operations. * * Copyright 2003-2008 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/multi_index for library home page. */ #include "test_hash_ops.hpp" #include /* keep it first to prevent nasty warns in MSVC */ #include #include "pre_multi_index.hpp" #include #include #include #include #include #include using namespace boost::multi_index; template void check_load_factor(const HashedContainer& hc) { float lf=(float)hc.size()/hc.bucket_count(); BOOST_CHECK_CLOSE(lf,hc.load_factor(),1.E-6f); BOOST_CHECK(lf<=hc.max_load_factor()+1.E-6); } typedef multi_index_container< int, indexed_by< hashed_unique > > > hash_container; void test_hash_ops() { hash_container hc; BOOST_CHECK(hc.max_load_factor()==1.0f); BOOST_CHECK(hc.bucket_count()<=hc.max_bucket_count()); hc.insert(1000); hash_container::size_type buc=hc.bucket(1000); hash_container::local_iterator it0=hc.begin(buc); hash_container::local_iterator it1=hc.end(buc); BOOST_CHECK( (hash_container::size_type)std::distance(it0,it1)==hc.bucket_size(buc)&& hc.bucket_size(buc)==1&&*it0==1000); hc.clear(); for(hash_container::size_type s=2*hc.bucket_count();s--;){ hc.insert((int)s); } check_load_factor(hc); hc.max_load_factor(0.5f); BOOST_CHECK(hc.max_load_factor()==0.5f); hc.insert(-1); check_load_factor(hc); hc.rehash(1); BOOST_CHECK(hc.bucket_count()>=1); check_load_factor(hc); hc.max_load_factor(0.25f); hc.rehash(1); BOOST_CHECK(hc.bucket_count()>=1); check_load_factor(hc); hash_container::size_type bc=4*hc.bucket_count(); hc.max_load_factor(0.125f); hc.rehash(bc); BOOST_CHECK(hc.bucket_count()>=bc); check_load_factor(hc); bc=2*hc.bucket_count(); hc.rehash(bc); BOOST_CHECK(hc.bucket_count()>=bc); check_load_factor(hc); hc.clear(); hc.insert(0); hc.rehash(1); BOOST_CHECK(hc.bucket_count()>=1); check_load_factor(hc); }