]>
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. | |
46 | * @see __gnu_parallel::Settings::sort_algorithm */ | |
47 | #define _GLIBCXX_MERGESORT 1 | |
48 | #endif | |
49 | ||
50 | #ifndef _GLIBCXX_QUICKSORT | |
51 | /** @def _GLIBCXX_QUICKSORT | |
52 | * @brief Include parallel unbalanced quicksort. | |
53 | * @see __gnu_parallel::Settings::sort_algorithm */ | |
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. | |
60 | * @see __gnu_parallel::Settings::sort_algorithm */ | |
61 | #define _GLIBCXX_BAL_QUICKSORT 1 | |
62 | #endif | |
63 | ||
64 | #ifndef _GLIBCXX_LOSER_TREE | |
65 | /** @def _GLIBCXX_LOSER_TREE | |
66 | * @brief Include guarded (sequences may run empty) loser tree, | |
67 | * moving objects. | |
68 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
69 | #define _GLIBCXX_LOSER_TREE 1 | |
70 | #endif | |
71 | ||
72 | #ifndef _GLIBCXX_LOSER_TREE_EXPLICIT | |
73 | /** @def _GLIBCXX_LOSER_TREE_EXPLICIT | |
74 | * @brief Include standard loser tree, storing two flags for infimum | |
75 | * and supremum. | |
76 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
77 | #define _GLIBCXX_LOSER_TREE_EXPLICIT 0 | |
78 | #endif | |
79 | ||
80 | #ifndef _GLIBCXX_LOSER_TREE_REFERENCE | |
81 | /** @def _GLIBCXX_LOSER_TREE_REFERENCE | |
82 | * @brief Include some loser tree variant. | |
83 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
84 | #define _GLIBCXX_LOSER_TREE_REFERENCE 0 | |
85 | #endif | |
86 | ||
87 | #ifndef _GLIBCXX_LOSER_TREE_POINTER | |
88 | /** @def _GLIBCXX_LOSER_TREE_POINTER | |
89 | * @brief Include some loser tree variant. | |
90 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
91 | #define _GLIBCXX_LOSER_TREE_POINTER 0 | |
92 | #endif | |
93 | ||
94 | #ifndef _GLIBCXX_LOSER_TREE_UNGUARDED | |
95 | /** @def _GLIBCXX_LOSER_TREE_UNGUARDED | |
96 | * @brief Include unguarded (sequences must not run empty) loser | |
97 | * tree, moving objects. | |
98 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
99 | #define _GLIBCXX_LOSER_TREE_UNGUARDED 1 | |
100 | #endif | |
101 | ||
102 | #ifndef _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED | |
103 | /** @def _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED | |
104 | * @brief Include some loser tree variant. | |
105 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
106 | #define _GLIBCXX_LOSER_TREE_POINTER_UNGUARDED 0 | |
107 | #endif | |
108 | ||
109 | #ifndef _GLIBCXX_LOSER_TREE_COMBINED | |
110 | /** @def _GLIBCXX_LOSER_TREE_COMBINED | |
111 | * @brief Include some loser tree variant. | |
112 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
113 | #define _GLIBCXX_LOSER_TREE_COMBINED 0 | |
114 | #endif | |
115 | ||
116 | #ifndef _GLIBCXX_LOSER_TREE_SENTINEL | |
117 | /** @def _GLIBCXX_LOSER_TREE_SENTINEL | |
118 | * @brief Include some loser tree variant. | |
119 | * @see __gnu_parallel::Settings multiway_merge_algorithm */ | |
120 | #define _GLIBCXX_LOSER_TREE_SENTINEL 0 | |
121 | #endif | |
122 | ||
123 | ||
124 | #ifndef _GLIBCXX_FIND_GROWING_BLOCKS | |
125 | /** @brief Include the growing blocks variant for std::find. | |
126 | * @see __gnu_parallel::Settings::find_distribution */ | |
127 | #define _GLIBCXX_FIND_GROWING_BLOCKS 1 | |
128 | #endif | |
129 | ||
130 | #ifndef _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS | |
131 | /** @brief Include the equal-sized blocks variant for std::find. | |
132 | * @see __gnu_parallel::Settings::find_distribution */ | |
133 | #define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1 | |
134 | #endif | |
135 | ||
136 | #ifndef _GLIBCXX_FIND_EQUAL_SPLIT | |
137 | /** @def _GLIBCXX_FIND_EQUAL_SPLIT | |
138 | * @brief Include the equal splitting variant for std::find. | |
139 | * @see __gnu_parallel::Settings::find_distribution */ | |
140 | #define _GLIBCXX_FIND_EQUAL_SPLIT 1 | |
141 | #endif | |
142 | ||
143 | ||
144 | #ifndef _GLIBCXX_TREE_INITIAL_SPLITTING | |
145 | /** @def _GLIBCXX_TREE_INITIAL_SPLITTING | |
146 | * @brief Include the initial splitting variant for | |
147 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end). | |
148 | * @see __gnu_parallel::_Rb_tree */ | |
149 | #define _GLIBCXX_TREE_INITIAL_SPLITTING 1 | |
150 | #endif | |
151 | ||
152 | #ifndef _GLIBCXX_TREE_DYNAMIC_BALANCING | |
153 | /** @def _GLIBCXX_TREE_DYNAMIC_BALANCING | |
154 | * @brief Include the dynamic balancing variant for | |
155 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end). | |
156 | * @see __gnu_parallel::_Rb_tree */ | |
157 | #define _GLIBCXX_TREE_DYNAMIC_BALANCING 1 | |
158 | #endif | |
159 | ||
160 | #ifndef _GLIBCXX_TREE_FULL_COPY | |
161 | /** @def _GLIBCXX_TREE_FULL_COPY | |
162 | * @brief In order to sort the input sequence of | |
163 | * _Rb_tree::insert_unique(InputIterator beg, InputIterator end) a | |
164 | * full copy of the input elements is done. | |
165 | * @see __gnu_parallel::_Rb_tree */ | |
166 | #define _GLIBCXX_TREE_FULL_COPY 1 | |
167 | #endif | |
168 | ||
169 | ||
170 | #endif |