multiseq_selection.h File Reference

#include <stxxl/bits/namespace.h>
#include <stxxl/bits/parallel/types.h>
#include <stxxl/bits/parallel/compiletime_settings.h>
#include <vector>
#include <queue>
#include <cstdlib>
#include <algorithm>

Go to the source code of this file.

Classes
class	stxxl::parallel::lexicographic< T1, T2, Comparator >
	Compare a pair of types lexcigraphically, ascending. More...
class	stxxl::parallel::lexicographic_rev< T1, T2, Comparator >
	Compare a pair of types lexcigraphically, descending. More...

Namespaces
	stxxl
	STXXL library namespace
	stxxl::parallel

Macros
#define	S(i)   (begin_seqs[i].first)
#define	S(i)   (begin_seqs[i].first)

Functions
template<typename RanSeqs , typename RankType , typename RankIterator , typename Comparator >
void	stxxl::parallel::multiseq_partition (const RanSeqs &begin_seqs, const RanSeqs &end_seqs, const RankType &rank, RankIterator begin_offsets, Comparator comp=std::less< typename std::iterator_traits< typename std::iterator_traits< RanSeqs >::value_type::first_type >::value_type >())
	Splits several sorted sequences at a certain global rank, resulting in a splitting point for each sequence. More...
template<typename ValueType , typename RanSeqs , typename RankType , typename Comparator >
ValueType	stxxl::parallel::multiseq_selection (const RanSeqs &begin_seqs, const RanSeqs &end_seqs, const RankType &rank, RankType &offset, Comparator comp=std::less< ValueType >())
	Selects the element at a certain global rank from several sorted sequences. More...

Macro Definition Documentation

#define S

(

i

)

(begin_seqs[i].first)

Examples:

examples/applications/skew3.cpp.

Referenced by stxxl::parallel::multiseq_partition(), and stxxl::parallel::multiseq_selection().

#define S

(

i

)

(begin_seqs[i].first)