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.
Go to the source code of this file.
#define _GLIBCXX_BAL_QUICKSORT |
#define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS |
#define _GLIBCXX_FIND_EQUAL_SPLIT |
#define _GLIBCXX_FIND_GROWING_BLOCKS |
#define _GLIBCXX_LOSER_TREE |
Include guarded (sequences may run empty) loser tree, moving objects.
Definition at line 69 of file features.h.
#define _GLIBCXX_LOSER_TREE_COMBINED |
Include some loser tree variant.
Definition at line 113 of file features.h.
#define _GLIBCXX_LOSER_TREE_EXPLICIT |
Include standard loser tree, storing two flags for infimum and supremum.
Definition at line 77 of file features.h.
#define _GLIBCXX_LOSER_TREE_POINTER |
Include some loser tree variant.
Definition at line 91 of file features.h.
#define _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED |
Include some loser tree variant.
Definition at line 106 of file features.h.
#define _GLIBCXX_LOSER_TREE_REFERENCE |
Include some loser tree variant.
Definition at line 84 of file features.h.
#define _GLIBCXX_LOSER_TREE_SENTINEL |
Include some loser tree variant.
Definition at line 120 of file features.h.
#define _GLIBCXX_LOSER_TREE_UNGUARDED |
Include unguarded (sequences must not run empty) loser tree, moving objects.
Definition at line 99 of file features.h.
#define _GLIBCXX_MERGESORT |
#define _GLIBCXX_QUICKSORT |
#define _GLIBCXX_TREE_DYNAMIC_BALANCING |
Include the dynamic balancing variant for _Rb_tree::insert_unique(InputIterator beg, InputIterator end).
Definition at line 157 of file features.h.
#define _GLIBCXX_TREE_FULL_COPY |
In order to sort the input sequence of _Rb_tree::insert_unique(InputIterator beg, InputIterator end) a full copy of the input elements is done.
Definition at line 166 of file features.h.
#define _GLIBCXX_TREE_INITIAL_SPLITTING |
Include the initial splitting variant for _Rb_tree::insert_unique(InputIterator beg, InputIterator end).
Definition at line 149 of file features.h.