FM / algo

/usr/include/stxxl/bits/algo

Name	Size	Mode	Actions
adaptor.h	6444	0644	edit dl rm
async_schedule.h	2345	0644	edit dl rm
inmemsort.h	2066	0644	edit dl rm
intksort.h	9184	0644	edit dl rm
ksort.h	36703	0644	edit dl rm
losertree.h	7646	0644	edit dl rm
random_shuffle.h	13357	0644	edit dl rm
run_cursor.h	3074	0644	edit dl rm
scan.h	10988	0644	edit dl rm
sort.h	34436	0644	edit dl rm
sort_base.h	1418	0644	edit dl rm
sort_helper.h	4902	0644	edit dl rm
stable_ksort.h	18605	0644	edit dl rm

Edit: /usr/include/stxxl/bits/algo/sort_base.h (1418B)

#ifndef STXXL_ALGO_SORT_BASE_HEADER
#define STXXL_ALGO_SORT_BASE_HEADER

#include <cmath>
#include <stxxl/bits/common/types.h>

#ifndef STXXL_NO_WARN_RECURSIVE_SORT
#define STXXL_WARNMSG_RECURSIVE_SORT STXXL_ERRMSG
#else
#define STXXL_WARNMSG_RECURSIVE_SORT STXXL_VERBOSE
#endif

#ifndef STXXL_SORT_OPTIMAL_PREFETCHING
#define STXXL_SORT_OPTIMAL_PREFETCHING 1
#endif

#ifndef STXXL_CHECK_ORDER_IN_SORTS
#define STXXL_CHECK_ORDER_IN_SORTS 0
#endif

#ifndef STXXL_L2_SIZE
#define STXXL_L2_SIZE  (512 * 1024)
#endif

STXXL_BEGIN_NAMESPACE

// Optimal merging: merge r = pow(nruns,1/ceil(log(nruns)/log(m))) runs at once
inline unsigned_type optimal_merge_factor(unsigned_type num_runs, unsigned_type max_concurrent_runs)
{
    return unsigned_type(ceil(pow(double(num_runs), 1. / ceil(log(double(num_runs)) / log(double(max_concurrent_runs))))));
}

STXXL_END_NAMESPACE

#endif // !STXXL_ALGO_SORT_BASE_HEADER
// vim: et:ts=4:sw=4

/*************************************************************************** * include/stxxl/bits/algo/sort_base.h * * Part of the STXXL. See http://stxxl.sourceforge.net * * Copyright (C) 2009 Andreas Beckmann * * 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) **************************************************************************/ #ifndef STXXL_ALGO_SORT_BASE_HEADER #define STXXL_ALGO_SORT_BASE_HEADER #include #include #ifndef STXXL_NO_WARN_RECURSIVE_SORT #define STXXL_WARNMSG_RECURSIVE_SORT STXXL_ERRMSG #else #define STXXL_WARNMSG_RECURSIVE_SORT STXXL_VERBOSE #endif #ifndef STXXL_SORT_OPTIMAL_PREFETCHING #define STXXL_SORT_OPTIMAL_PREFETCHING 1 #endif #ifndef STXXL_CHECK_ORDER_IN_SORTS #define STXXL_CHECK_ORDER_IN_SORTS 0 #endif #ifndef STXXL_L2_SIZE #define STXXL_L2_SIZE (512 * 1024) #endif STXXL_BEGIN_NAMESPACE // Optimal merging: merge r = pow(nruns,1/ceil(log(nruns)/log(m))) runs at once inline unsigned_type optimal_merge_factor(unsigned_type num_runs, unsigned_type max_concurrent_runs) { return unsigned_type(ceil(pow(double(num_runs), 1. / ceil(log(double(num_runs)) / log(double(max_concurrent_runs)))))); } STXXL_END_NAMESPACE #endif // !STXXL_ALGO_SORT_BASE_HEADER // vim: et:ts=4:sw=4