Defines on whether to include algorithm variants. More...
Macros | |
#define | _GLIBCXX_BAL_QUICKSORT 1 |
Include parallel dynamically load-balanced quicksort. 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_FIND_GROWING_BLOCKS 1 |
Include the growing blocks variant for std::find. More... | |
#define | _GLIBCXX_MERGESORT 1 |
Include parallel multi-way mergesort. More... | |
#define | _GLIBCXX_QUICKSORT 1 |
Include parallel unbalanced quicksort. 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... | |
#define | _GLIBCXX_TREE_INITIAL_SPLITTING 1 |
Include the initial splitting variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end). More... | |
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.
#define _GLIBCXX_BAL_QUICKSORT 1 |
Include parallel dynamically load-balanced quicksort.
#define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1 |
Include the equal-sized blocks variant for std::find.
#define _GLIBCXX_FIND_EQUAL_SPLIT 1 |
Include the equal splitting variant for std::find.
#define _GLIBCXX_FIND_GROWING_BLOCKS 1 |
Include the growing blocks variant for std::find.
#define _GLIBCXX_MERGESORT 1 |
Include parallel multi-way mergesort.
#define _GLIBCXX_QUICKSORT 1 |
Include parallel unbalanced quicksort.
#define _GLIBCXX_TREE_DYNAMIC_BALANCING 1 |
Include the dynamic balancing variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).
#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.
#define _GLIBCXX_TREE_INITIAL_SPLITTING 1 |
Include the initial splitting variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).