<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: features.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a00869.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">features.h</div> </div>
</div>
<div class="contents">
<a href="a00869.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2007, 2009 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00006"></a>00006 <span class="comment">// software; you can redistribute it and/or modify it under the terms</span>
<a name="l00007"></a>00007 <span class="comment">// of the GNU General Public License as published by the Free Software</span>
<a name="l00008"></a>00008 <span class="comment">// Foundation; either version 3, or (at your option) any later</span>
<a name="l00009"></a>00009 <span class="comment">// version.</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="comment">// This library is distributed in the hope that it will be useful, but</span>
<a name="l00012"></a>00012 <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span>
<a name="l00014"></a>00014 <span class="comment">// General Public License for more details.</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00017"></a>00017 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00018"></a>00018 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00021"></a>00021 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00022"></a>00022 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00023"></a>00023 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024 <span class="comment"></span>
<a name="l00025"></a>00025 <span class="comment">/** @file parallel/features.h</span>
<a name="l00026"></a>00026 <span class="comment"> * @brief Defines on whether to include algorithm variants.</span>
<a name="l00027"></a>00027 <span class="comment"> *</span>
<a name="l00028"></a>00028 <span class="comment"> * Less variants reduce executable size and compile time.</span>
<a name="l00029"></a>00029 <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span>
<a name="l00030"></a>00030 <span class="comment"> */</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="comment">// Written by Johannes Singler.</span>
<a name="l00033"></a>00033
<a name="l00034"></a>00034 <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_FEATURES_H</span>
<a name="l00035"></a>00035 <span class="preprocessor"></span><span class="preprocessor">#define _GLIBCXX_PARALLEL_FEATURES_H 1</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span>
<a name="l00037"></a>00037 <span class="preprocessor">#ifndef _GLIBCXX_MERGESORT</span>
<a name="l00038"></a>00038 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_MERGESORT</span>
<a name="l00039"></a>00039 <span class="comment"> * @brief Include parallel multi-way mergesort.</span>
<a name="l00040"></a>00040 <span class="comment"> * @see __gnu_parallel::_Settings::sort_algorithm */</span>
<a name="l00041"></a><a class="code" href="a00869.html#a5a1bbd3fbfff354d33cb7e8f936b5b69">00041</a> <span class="preprocessor">#define _GLIBCXX_MERGESORT 1</span>
<a name="l00042"></a>00042 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span>
<a name="l00044"></a>00044 <span class="preprocessor">#ifndef _GLIBCXX_QUICKSORT</span>
<a name="l00045"></a>00045 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_QUICKSORT</span>
<a name="l00046"></a>00046 <span class="comment"> * @brief Include parallel unbalanced quicksort.</span>
<a name="l00047"></a>00047 <span class="comment"> * @see __gnu_parallel::_Settings::sort_algorithm */</span>
<a name="l00048"></a><a class="code" href="a00869.html#a7e8edbf30b1dd460c124a51f19326c54">00048</a> <span class="preprocessor">#define _GLIBCXX_QUICKSORT 1</span>
<a name="l00049"></a>00049 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00050"></a>00050 <span class="preprocessor"></span>
<a name="l00051"></a>00051 <span class="preprocessor">#ifndef _GLIBCXX_BAL_QUICKSORT</span>
<a name="l00052"></a>00052 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_BAL_QUICKSORT</span>
<a name="l00053"></a>00053 <span class="comment"> * @brief Include parallel dynamically load-balanced quicksort.</span>
<a name="l00054"></a>00054 <span class="comment"> * @see __gnu_parallel::_Settings::sort_algorithm */</span>
<a name="l00055"></a><a class="code" href="a00869.html#a4ac4aa3381d184b69356349a4156c9a1">00055</a> <span class="preprocessor">#define _GLIBCXX_BAL_QUICKSORT 1</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00057"></a>00057 <span class="preprocessor"></span>
<a name="l00058"></a>00058 <span class="preprocessor">#ifndef _GLIBCXX_FIND_GROWING_BLOCKS</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span><span class="comment">/** @brief Include the growing blocks variant for std::find.</span>
<a name="l00060"></a>00060 <span class="comment"> * @see __gnu_parallel::_Settings::find_algorithm */</span>
<a name="l00061"></a><a class="code" href="a00869.html#aacdbb33fc99834c968be42e5c95f2b2a">00061</a> <span class="preprocessor">#define _GLIBCXX_FIND_GROWING_BLOCKS 1</span>
<a name="l00062"></a>00062 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00063"></a>00063 <span class="preprocessor"></span>
<a name="l00064"></a>00064 <span class="preprocessor">#ifndef _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS</span>
<a name="l00065"></a>00065 <span class="preprocessor"></span><span class="comment">/** @brief Include the equal-sized blocks variant for std::find.</span>
<a name="l00066"></a>00066 <span class="comment"> * @see __gnu_parallel::_Settings::find_algorithm */</span>
<a name="l00067"></a><a class="code" href="a00869.html#a877a31358045791c3ae6e6af28e5620b">00067</a> <span class="preprocessor">#define _GLIBCXX_FIND_CONSTANT_SIZE_BLOCKS 1</span>
<a name="l00068"></a>00068 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00069"></a>00069 <span class="preprocessor"></span>
<a name="l00070"></a>00070 <span class="preprocessor">#ifndef _GLIBCXX_FIND_EQUAL_SPLIT</span>
<a name="l00071"></a>00071 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_FIND_EQUAL_SPLIT</span>
<a name="l00072"></a>00072 <span class="comment"> * @brief Include the equal splitting variant for std::find.</span>
<a name="l00073"></a>00073 <span class="comment"> * @see __gnu_parallel::_Settings::find_algorithm */</span>
<a name="l00074"></a><a class="code" href="a00869.html#ae75a033707c0c6b314226230008cda14">00074</a> <span class="preprocessor">#define _GLIBCXX_FIND_EQUAL_SPLIT 1</span>
<a name="l00075"></a>00075 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00076"></a>00076 <span class="preprocessor"></span>
<a name="l00077"></a>00077
<a name="l00078"></a>00078 <span class="preprocessor">#ifndef _GLIBCXX_TREE_INITIAL_SPLITTING</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_TREE_INITIAL_SPLITTING</span>
<a name="l00080"></a>00080 <span class="comment"> * @brief Include the initial splitting variant for</span>
<a name="l00081"></a>00081 <span class="comment"> * _Rb_tree::insert_unique(_IIter beg, _IIter __end).</span>
<a name="l00082"></a>00082 <span class="comment"> * @see __gnu_parallel::_Rb_tree */</span>
<a name="l00083"></a><a class="code" href="a00869.html#a0fed891f7960bcaefb44e5b250200103">00083</a> <span class="preprocessor">#define _GLIBCXX_TREE_INITIAL_SPLITTING 1</span>
<a name="l00084"></a>00084 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00085"></a>00085 <span class="preprocessor"></span>
<a name="l00086"></a>00086 <span class="preprocessor">#ifndef _GLIBCXX_TREE_DYNAMIC_BALANCING</span>
<a name="l00087"></a>00087 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_TREE_DYNAMIC_BALANCING</span>
<a name="l00088"></a>00088 <span class="comment"> * @brief Include the dynamic balancing variant for</span>
<a name="l00089"></a>00089 <span class="comment"> * _Rb_tree::insert_unique(_IIter beg, _IIter __end).</span>
<a name="l00090"></a>00090 <span class="comment"> * @see __gnu_parallel::_Rb_tree */</span>
<a name="l00091"></a><a class="code" href="a00869.html#ac2af42746e6dc89868203d94e5b5d9b6">00091</a> <span class="preprocessor">#define _GLIBCXX_TREE_DYNAMIC_BALANCING 1</span>
<a name="l00092"></a>00092 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00093"></a>00093 <span class="preprocessor"></span>
<a name="l00094"></a>00094 <span class="preprocessor">#ifndef _GLIBCXX_TREE_FULL_COPY</span>
<a name="l00095"></a>00095 <span class="preprocessor"></span><span class="comment">/** @def _GLIBCXX_TREE_FULL_COPY</span>
<a name="l00096"></a>00096 <span class="comment"> * @brief In order to sort the input sequence of</span>
<a name="l00097"></a>00097 <span class="comment"> * _Rb_tree::insert_unique(_IIter beg, _IIter __end) a</span>
<a name="l00098"></a>00098 <span class="comment"> * full copy of the input elements is done.</span>
<a name="l00099"></a>00099 <span class="comment"> * @see __gnu_parallel::_Rb_tree */</span>
<a name="l00100"></a><a class="code" href="a00869.html#a0f36c3f495024eff415809e6ec827c6d">00100</a> <span class="preprocessor">#define _GLIBCXX_TREE_FULL_COPY 1</span>
<a name="l00101"></a>00101 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00102"></a>00102 <span class="preprocessor"></span>
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_FEATURES_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00869.html">features.h</a> </li>
<li class="footer">Generated by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
</ul>
</div>
</body>
</html>
