1*38fd1498Szrj // -*- C++ -*- 2*38fd1498Szrj 3*38fd1498Szrj // Copyright (C) 2007-2018 Free Software Foundation, Inc. 4*38fd1498Szrj // 5*38fd1498Szrj // This file is part of the GNU ISO C++ Library. This library is free 6*38fd1498Szrj // software; you can redistribute it and/or modify it under the terms 7*38fd1498Szrj // of the GNU General Public License as published by the Free Software 8*38fd1498Szrj // Foundation; either version 3, or (at your option) any later 9*38fd1498Szrj // version. 10*38fd1498Szrj 11*38fd1498Szrj // This library is distributed in the hope that it will be useful, but 12*38fd1498Szrj // WITHOUT ANY WARRANTY; without even the implied warranty of 13*38fd1498Szrj // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14*38fd1498Szrj // General Public License for more details. 15*38fd1498Szrj 16*38fd1498Szrj // Under Section 7 of GPL version 3, you are granted additional 17*38fd1498Szrj // permissions described in the GCC Runtime Library Exception, version 18*38fd1498Szrj // 3.1, as published by the Free Software Foundation. 19*38fd1498Szrj 20*38fd1498Szrj // You should have received a copy of the GNU General Public License and 21*38fd1498Szrj // a copy of the GCC Runtime Library Exception along with this program; 22*38fd1498Szrj // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see 23*38fd1498Szrj // <http://www.gnu.org/licenses/>. 24*38fd1498Szrj 25*38fd1498Szrj /** @file parallel/features.h 26*38fd1498Szrj * @brief Defines on whether to include algorithm variants. 27*38fd1498Szrj * 28*38fd1498Szrj * Less variants reduce executable size and compile time. 29*38fd1498Szrj * This file is a GNU parallel extension to the Standard C++ Library. 30*38fd1498Szrj */ 31*38fd1498Szrj 32*38fd1498Szrj // Written by Johannes Singler. 33*38fd1498Szrj 34*38fd1498Szrj #ifndef _GLIBCXX_PARALLEL_FEATURES_H 35*38fd1498Szrj #define _GLIBCXX_PARALLEL_FEATURES_H 1 36*38fd1498Szrj 37*38fd1498Szrj #ifndef _GLIBCXX_MERGESORT 38*38fd1498Szrj /** @def _GLIBCXX_MERGESORT 39*38fd1498Szrj * @brief Include parallel multi-way mergesort. 40*38fd1498Szrj * @see __gnu_parallel::_Settings::sort_algorithm */ 41*38fd1498Szrj #define _GLIBCXX_MERGESORT 1 42*38fd1498Szrj #endif 43*38fd1498Szrj 44*38fd1498Szrj #ifndef _GLIBCXX_QUICKSORT 45*38fd1498Szrj /** @def _GLIBCXX_QUICKSORT 46*38fd1498Szrj * @brief Include parallel unbalanced quicksort. 47*38fd1498Szrj * @see __gnu_parallel::_Settings::sort_algorithm */ 48*38fd1498Szrj #define _GLIBCXX_QUICKSORT 1 49*38fd1498Szrj #endif 50*38fd1498Szrj 51*38fd1498Szrj #ifndef _GLIBCXX_BAL_QUICKSORT 52*38fd1498Szrj /** @def _GLIBCXX_BAL_QUICKSORT 53*38fd1498Szrj * @brief Include parallel dynamically load-balanced quicksort. 54*38fd1498Szrj * @see __gnu_parallel::_Settings::sort_algorithm */ 55*38fd1498Szrj #define _GLIBCXX_BAL_QUICKSORT 1 56*38fd1498Szrj #endif 57*38fd1498Szrj 58*38fd1498Szrj #ifndef _GLIBCXX_FIND_GROWING_BLOCKS 59*38fd1498Szrj /** @brief Include the growing blocks variant for std::find. 60*38fd1498Szrj * @see __gnu_parallel::_Settings::find_algorithm */ 61*38fd1498Szrj #define _GLIBCXX_FIND_GROWING_BLOCKS 1 62*38fd1498Szrj #endif 63*38fd1498Szrj 64*38fd1498Szrj #ifndef _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 65*38fd1498Szrj /** @brief Include the equal-sized blocks variant for std::find. 66*38fd1498Szrj * @see __gnu_parallel::_Settings::find_algorithm */ 67*38fd1498Szrj #define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1 68*38fd1498Szrj #endif 69*38fd1498Szrj 70*38fd1498Szrj #ifndef _GLIBCXX_FIND_EQUAL_SPLIT 71*38fd1498Szrj /** @def _GLIBCXX_FIND_EQUAL_SPLIT 72*38fd1498Szrj * @brief Include the equal splitting variant for std::find. 73*38fd1498Szrj * @see __gnu_parallel::_Settings::find_algorithm */ 74*38fd1498Szrj #define _GLIBCXX_FIND_EQUAL_SPLIT 1 75*38fd1498Szrj #endif 76*38fd1498Szrj 77*38fd1498Szrj 78*38fd1498Szrj #ifndef _GLIBCXX_TREE_INITIAL_SPLITTING 79*38fd1498Szrj /** @def _GLIBCXX_TREE_INITIAL_SPLITTING 80*38fd1498Szrj * @brief Include the initial splitting variant for 81*38fd1498Szrj * _Rb_tree::insert_unique(_IIter beg, _IIter __end). 82*38fd1498Szrj * @see __gnu_parallel::_Rb_tree */ 83*38fd1498Szrj #define _GLIBCXX_TREE_INITIAL_SPLITTING 1 84*38fd1498Szrj #endif 85*38fd1498Szrj 86*38fd1498Szrj #ifndef _GLIBCXX_TREE_DYNAMIC_BALANCING 87*38fd1498Szrj /** @def _GLIBCXX_TREE_DYNAMIC_BALANCING 88*38fd1498Szrj * @brief Include the dynamic balancing variant for 89*38fd1498Szrj * _Rb_tree::insert_unique(_IIter beg, _IIter __end). 90*38fd1498Szrj * @see __gnu_parallel::_Rb_tree */ 91*38fd1498Szrj #define _GLIBCXX_TREE_DYNAMIC_BALANCING 1 92*38fd1498Szrj #endif 93*38fd1498Szrj 94*38fd1498Szrj #ifndef _GLIBCXX_TREE_FULL_COPY 95*38fd1498Szrj /** @def _GLIBCXX_TREE_FULL_COPY 96*38fd1498Szrj * @brief In order to sort the input sequence of 97*38fd1498Szrj * _Rb_tree::insert_unique(_IIter beg, _IIter __end) a 98*38fd1498Szrj * full copy of the input elements is done. 99*38fd1498Szrj * @see __gnu_parallel::_Rb_tree */ 100*38fd1498Szrj #define _GLIBCXX_TREE_FULL_COPY 1 101*38fd1498Szrj #endif 102*38fd1498Szrj 103*38fd1498Szrj 104*38fd1498Szrj #endif /* _GLIBCXX_PARALLEL_FEATURES_H */ 105