| libstdc++
    | 
Go to the source code of this file.
| Macros | |
| #define | _GLIBCXX_BAL_QUICKSORT | 
| #define | _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS | 
| #define | _GLIBCXX_FIND_EQUAL_SPLIT | 
| #define | _GLIBCXX_FIND_GROWING_BLOCKS | 
| #define | _GLIBCXX_MERGESORT | 
| #define | _GLIBCXX_QUICKSORT | 
| #define | _GLIBCXX_TREE_DYNAMIC_BALANCING | 
| #define | _GLIBCXX_TREE_FULL_COPY | 
| #define | _GLIBCXX_TREE_INITIAL_SPLITTING | 
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.
Definition in file features.h.
| #define _GLIBCXX_BAL_QUICKSORT | 
Include parallel dynamically load-balanced quicksort.
Definition at line 55 of file features.h.
| #define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS | 
Include the equal-sized blocks variant for std::find.
Definition at line 67 of file features.h.
| #define _GLIBCXX_FIND_EQUAL_SPLIT | 
Include the equal splitting variant for std::find.
Definition at line 74 of file features.h.
| #define _GLIBCXX_FIND_GROWING_BLOCKS | 
Include the growing blocks variant for std::find.
Definition at line 61 of file features.h.
| #define _GLIBCXX_MERGESORT | 
Include parallel multi-way mergesort.
Definition at line 41 of file features.h.
| #define _GLIBCXX_QUICKSORT | 
Include parallel unbalanced quicksort.
Definition at line 48 of file features.h.
| #define _GLIBCXX_TREE_DYNAMIC_BALANCING | 
Include the dynamic balancing variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).
Definition at line 91 of file features.h.
| #define _GLIBCXX_TREE_FULL_COPY | 
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.
Definition at line 100 of file features.h.
| #define _GLIBCXX_TREE_INITIAL_SPLITTING | 
Include the initial splitting variant for _Rb_tree::insert_unique(_IIter beg, _IIter __end).
Definition at line 83 of file features.h.