features.h File Reference

Defines on whether to include algorithm variants. More...

Go to the source code of this file.

Macros
#define	_GLIBCXX_MERGESORT   1
	Include parallel multi-way mergesort. More...
#define	_GLIBCXX_QUICKSORT   1
	Include parallel unbalanced quicksort. More...
#define	_GLIBCXX_BAL_QUICKSORT   1
	Include parallel dynamically load-balanced quicksort. More...
#define	_GLIBCXX_FIND_GROWING_BLOCKS   1
	Include the growing blocks variant for std::find. More...
#define	_GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS   1
	Include the equal-sized blocks variant for std::find. More...
#define	_GLIBCXX_FIND_EQUAL_SPLIT   1
	Include the equal splitting variant for std::find. More...
#define	_GLIBCXX_TREE_INITIAL_SPLITTING   1
	Include the initial splitting variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end). More...
#define	_GLIBCXX_TREE_DYNAMIC_BALANCING   1
	Include the dynamic balancing variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end). More...
#define	_GLIBCXX_TREE_FULL_COPY   1
	In order to sort the input sequence of _Rb_tree::insert_unique(_IIter beg, _IIter __end) a full copy of the input elements is done. More...

Detailed Description

Defines on whether to include algorithm variants.

Less variants reduce executable size and compile time. This file is a GNU parallel extension to the Standard C++ Library.

Macro Definition Documentation

#define _GLIBCXX_BAL_QUICKSORT   1

Include parallel dynamically load-balanced quicksort.

See Also

__gnu_parallel::_Settings::sort_algorithm

#define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS   1

Include the equal-sized blocks variant for std::find.

See Also

__gnu_parallel::_Settings::find_algorithm

#define _GLIBCXX_FIND_EQUAL_SPLIT   1

Include the equal splitting variant for std::find.

See Also

__gnu_parallel::_Settings::find_algorithm

#define _GLIBCXX_FIND_GROWING_BLOCKS   1

Include the growing blocks variant for std::find.

See Also

__gnu_parallel::_Settings::find_algorithm

#define _GLIBCXX_MERGESORT   1

Include parallel multi-way mergesort.

See Also

__gnu_parallel::_Settings::sort_algorithm

#define _GLIBCXX_QUICKSORT   1

Include parallel unbalanced quicksort.

See Also

__gnu_parallel::_Settings::sort_algorithm

#define _GLIBCXX_TREE_DYNAMIC_BALANCING   1

Include the dynamic balancing variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).

See Also

__gnu_parallel::_Rb_tree

#define _GLIBCXX_TREE_FULL_COPY   1

In order to sort the input sequence of _Rb_tree::insert_unique(_IIter beg, _IIter __end) a full copy of the input elements is done.

See Also

__gnu_parallel::_Rb_tree

#define _GLIBCXX_TREE_INITIAL_SPLITTING   1

Include the initial splitting variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).

See Also

__gnu_parallel::_Rb_tree