FM / common

/usr/include/boost/sort/common

Name	Size	Mode	Actions
util/	-	0755	rm
deque_cnc.hpp	15624	0644	edit dl rm
file_vector.hpp	9526	0644	edit dl rm
indirect.hpp	5235	0644	edit dl rm
int_array.hpp	1900	0644	edit dl rm
merge_block.hpp	16242	0644	edit dl rm
merge_four.hpp	12151	0644	edit dl rm
merge_vector.hpp	7490	0644	edit dl rm
pivot.hpp	5195	0644	edit dl rm
range.hpp	18138	0644	edit dl rm
rearrange.hpp	5526	0644	edit dl rm
scheduler.hpp	10860	0644	edit dl rm
sort_basic.hpp	14600	0644	edit dl rm
spinlock.hpp	3110	0644	edit dl rm
stack_cnc.hpp	5895	0644	edit dl rm
time_measure.hpp	2478	0644	edit dl rm

Edit: /usr/include/boost/sort/common/int_array.hpp (1900B)

#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

//---------------------------------------------------------------------------- /// @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 #include namespace boost { namespace sort { namespace common { template struct int_array { uint64_t M[NN]; template static int_array generate(generator & gen) { int_array 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 struct H_comp { bool operator ( )(const IA & A1, const IA & A2) const { return (A1.counter() < A2.counter()); }; }; template 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