File: test_hash_ops.cpp

package info (click to toggle)
boost 1.33.1-10
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 100,948 kB
  • ctags: 145,103
  • sloc: cpp: 573,492; xml: 49,055; python: 15,626; ansic: 13,588; sh: 2,099; yacc: 858; makefile: 660; perl: 427; lex: 111; csh: 6
file content (93 lines) | stat: -rw-r--r-- 2,377 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/* Boost.MultiIndex test for standard hash operations.
 *
 * Copyright 2003-2005 Joaqun M Lpez Muoz.
 * 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 <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
#include <iterator>
#include "pre_multi_index.hpp"
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/hashed_index.hpp>
#include <boost/multi_index/identity.hpp>
#include <boost/test/floating_point_comparison.hpp>
#include <boost/test/test_tools.hpp>

#include <iostream>

using namespace boost::multi_index;

template<typename HashedContainer>
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<identity<int> >
  >
> 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);
}