]>
Commit | Line | Data |
---|---|---|
c2ba9709 JS |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2007 Free Software Foundation, Inc. | |
4 | // | |
5 | // This file is part of the GNU ISO C++ Library. This library is free | |
6 | // software; you can redistribute it and/or modify it under the terms | |
7 | // of the GNU General Public License as published by the Free Software | |
8 | // Foundation; either version 2, or (at your option) any later | |
9 | // version. | |
10 | ||
11 | // This library is distributed in the hope that it will be useful, but | |
12 | // WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | // General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License | |
17 | // along with this library; see the file COPYING. If not, write to | |
18 | // the Free Software Foundation, 59 Temple Place - Suite 330, Boston, | |
19 | // MA 02111-1307, USA. | |
20 | ||
21 | // As a special exception, you may use this file as part of a free | |
22 | // software library without restriction. Specifically, if other files | |
23 | // instantiate templates or use macros or inline functions from this | |
24 | // file, or you compile this file and link it with other files to | |
25 | // produce an executable, this file does not by itself cause the | |
26 | // resulting executable to be covered by the GNU General Public | |
27 | // License. This exception does not however invalidate any other | |
28 | // reasons why the executable file might be covered by the GNU General | |
29 | // Public License. | |
30 | ||
31 | /** @file parallel/features.h | |
32 | * @brief Defines on whether to include algorithm variants. | |
33 | * | |
34 | * Less variants reduce executable size and compile time. | |
35 | * This file is a GNU parallel extension to the Standard C++ Library. | |
36 | */ | |
37 | ||
38 | // Written by Johannes Singler. | |
39 | ||
40 | #ifndef _GLIBCXX_PARALLEL_FEATURES_H | |
41 | #define _GLIBCXX_PARALLEL_FEATURES_H 1 | |
42 | ||
43 | #ifndef _GLIBCXX_MERGESORT | |
44 | /** @def _GLIBCXX_MERGESORT | |
45 | * @brief Include parallel multi-way mergesort. | |
ee1b5fc5 | 46 | * @see __gnu_parallel::_Settings::sort_algorithm */ |
c2ba9709 JS |
47 | #define _GLIBCXX_MERGESORT 1 |
48 | #endif | |
49 | ||
50 | #ifndef _GLIBCXX_QUICKSORT | |
51 | /** @def _GLIBCXX_QUICKSORT | |
52 | * @brief Include parallel unbalanced quicksort. | |
ee1b5fc5 | 53 | * @see __gnu_parallel::_Settings::sort_algorithm */ |
c2ba9709 JS |
54 | #define _GLIBCXX_QUICKSORT 1 |
55 | #endif | |
56 | ||
57 | #ifndef _GLIBCXX_BAL_QUICKSORT | |
58 | /** @def _GLIBCXX_BAL_QUICKSORT | |
59 | * @brief Include parallel dynamically load-balanced quicksort. | |
ee1b5fc5 | 60 | * @see __gnu_parallel::_Settings::sort_algorithm */ |
c2ba9709 JS |
61 | #define _GLIBCXX_BAL_QUICKSORT 1 |
62 | #endif | |
63 | ||
c2ba9709 JS |
64 | #ifndef _GLIBCXX_FIND_GROWING_BLOCKS |
65 | /** @brief Include the growing blocks variant for std::find. | |
ee1b5fc5 | 66 | * @see __gnu_parallel::_Settings::find_algorithm */ |
c2ba9709 JS |
67 | #define _GLIBCXX_FIND_GROWING_BLOCKS 1 |
68 | #endif | |
69 | ||
70 | #ifndef _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS | |
71 | /** @brief Include the equal-sized blocks variant for std::find. | |
ee1b5fc5 | 72 | * @see __gnu_parallel::_Settings::find_algorithm */ |
c2ba9709 JS |
73 | #define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1 |
74 | #endif | |
75 | ||
76 | #ifndef _GLIBCXX_FIND_EQUAL_SPLIT | |
77 | /** @def _GLIBCXX_FIND_EQUAL_SPLIT | |
78 | * @brief Include the equal splitting variant for std::find. | |
ee1b5fc5 | 79 | * @see __gnu_parallel::_Settings::find_algorithm */ |
c2ba9709 JS |
80 | #define _GLIBCXX_FIND_EQUAL_SPLIT 1 |
81 | #endif | |
82 | ||
83 | ||
84 | #ifndef _GLIBCXX_TREE_INITIAL_SPLITTING | |
85 | /** @def _GLIBCXX_TREE_INITIAL_SPLITTING | |
86 | * @brief Include the initial splitting variant for | |
87 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end). | |
88 | * @see __gnu_parallel::_Rb_tree */ | |
89 | #define _GLIBCXX_TREE_INITIAL_SPLITTING 1 | |
90 | #endif | |
91 | ||
92 | #ifndef _GLIBCXX_TREE_DYNAMIC_BALANCING | |
93 | /** @def _GLIBCXX_TREE_DYNAMIC_BALANCING | |
94 | * @brief Include the dynamic balancing variant for | |
95 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end). | |
96 | * @see __gnu_parallel::_Rb_tree */ | |
97 | #define _GLIBCXX_TREE_DYNAMIC_BALANCING 1 | |
98 | #endif | |
99 | ||
100 | #ifndef _GLIBCXX_TREE_FULL_COPY | |
101 | /** @def _GLIBCXX_TREE_FULL_COPY | |
102 | * @brief In order to sort the input sequence of | |
103 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end) a | |
104 | * full copy of the input elements is done. | |
105 | * @see __gnu_parallel::_Rb_tree */ | |
106 | #define _GLIBCXX_TREE_FULL_COPY 1 | |
107 | #endif | |
108 | ||
109 | ||
110 | #endif |