blob: 22c3b0c5a41654aa899b8726bcb29880a186b81a (
plain)
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
|
//----------------------------------------------------------------------------
/// @file int_array.hpp
/// @brief This file contains the struct int_array , which is an array of
/// uint64_t elements, being the template parameter NN the number of
/// elements in the array
///
/// @author Copyright (c) 2010 2015 Francisco José Tapia (fjtapia@gmail.com )\n
/// Distributed under the Boost Software License, Version 1.0.\n
/// ( See accompanyingfile LICENSE_1_0.txt or copy at
/// http://www.boost.org/LICENSE_1_0.txt )
/// @version 0.1
///
/// @remarks
//-----------------------------------------------------------------------------
#ifndef __BOOST_SORT_COMMON_INT_ARRAY_HPP
#define __BOOST_SORT_COMMON_INT_ARRAY_HPP
#include <cstdint>
#include <iostream>
namespace boost
{
namespace sort
{
namespace common
{
template<uint32_t NN>
struct int_array
{
uint64_t M[NN];
template<class generator>
static int_array<NN> generate(generator & gen)
{
int_array<NN> result;
for (uint32_t i = 0; i < NN; ++i)
{
result.M[i] = gen();
};
return result;
};
uint64_t counter(void) const
{
uint64_t Acc = M[0];
for (uint32_t i = 1; i < NN; Acc += M[i++])
;
return Acc;
};
};
template<class IA>
struct H_comp
{
bool operator ( )(const IA & A1, const IA & A2) const
{
return (A1.counter() < A2.counter());
};
};
template<class IA>
struct L_comp
{
bool operator ( )(const IA & A1, const IA & A2) const
{
return (A1.M[0] < A2.M[0]);
};
};
//***************************************************************************
};// End namespace benchmark
};// End namespace sort
};// End namespace boost
//***************************************************************************
#endif // end of int_array.hpp
|
