boost_unordered 0.1.0

Boost C++ library boost_unordered packaged using Zanbil
Documentation 
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108


// Copyright 2005-2009 Daniel James.
// 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)

#if !defined(BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER)
#define BOOST_UNORDERED_TEST_HELPERS_RANDOM_VALUES_HEADER

#include "./generators.hpp"
#include "./list.hpp"
#include "./metafunctions.hpp"
#include <boost/type_traits/conditional.hpp>
#include <algorithm>

namespace test {
  template <class X> struct unordered_generator_set
  {
    typedef typename X::value_type value_type;

    random_generator type_;

    unordered_generator_set(random_generator type) : type_(type) {}

    template <class T> void fill(T& x, std::size_t len)
    {
      value_type* value_ptr = 0;
      len += x.size();

      for (std::size_t i = 0; i < len; ++i) {
        value_type value = generate(value_ptr, type_);

        std::size_t count =
          type_ == generate_collisions ? random_value(5) + 1 : 1;

        for (std::size_t j = 0; j < count; ++j) {
          x.push_back(value);
        }
      }
    }
  };

  template <class X> struct unordered_generator_map
  {
    typedef typename X::key_type key_type;
    typedef typename X::mapped_type mapped_type;

    random_generator type_;

    unordered_generator_map(random_generator type) : type_(type) {}

    template <class T> void fill(T& x, std::size_t len)
    {
      key_type* key_ptr = 0;
      mapped_type* mapped_ptr = 0;

      for (std::size_t i = 0; i < len; ++i) {
        key_type key = generate(key_ptr, type_);

        std::size_t count =
          type_ == generate_collisions ? random_value(5) + 1 : 1;

        for (std::size_t j = 0; j < count; ++j) {
          x.push_back(std::pair<key_type const, mapped_type>(
            key, generate(mapped_ptr, type_)));
        }
      }
    }
  };

  template <class X>
  struct unordered_generator_base
      : public boost::conditional<test::is_set<X>::value,
          test::unordered_generator_set<X>, test::unordered_generator_map<X> >
  {
  };

  template <class X>
  struct unordered_generator : public unordered_generator_base<X>::type
  {
    typedef typename unordered_generator_base<X>::type base;

    unordered_generator(random_generator const& type = default_generator)
        : base(type)
    {
    }
  };

  template <class X>
  struct random_values : public test::list<typename X::value_type>
  {
    random_values() {}

    explicit random_values(std::size_t count,
      test::random_generator const& generator = test::default_generator)
    {
      fill(count, generator);
    }

    void fill(std::size_t count,
      test::random_generator const& generator = test::default_generator)
    {
      test::unordered_generator<X> gen(generator);
      gen.fill(*this, count);
    }
  };
}

#endif