<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: multiseq_selection.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00914_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">multiseq_selection.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00914.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2007-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file parallel/multiseq_selection.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Functions to find elements of a certain global __rank in</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * multiple sorted sequences. Also serves for splitting such</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * sequence sets.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * The algorithm description can be found in </span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> *</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * P. J. Varman, S. D. Scheufler, B. R. Iyer, and G. R. Ricard.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * Merging Multiple Lists on Hierarchical-Memory Multiprocessors.</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * Journal of Parallel and Distributed Computing, 12(2):171–177, 1991.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> *</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> */</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_MULTISEQ_SELECTION_H</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_MULTISEQ_SELECTION_H 1</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <<a class="code" href="a00182.html">vector</a>></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <<a class="code" href="a00119.html">queue</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> </div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a00527.html">bits/stl_algo.h</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> {<span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> /** @brief Compare __a pair of types lexicographically, ascending. */</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _T1, <span class="keyword">typename</span> _T2, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="a09507.html"> 53</a></span>  <span class="keyword">class </span><a class="code" href="a09507.html">_Lexicographic</a></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  : <span class="keyword">public</span> <a class="code" href="a07315.html">std::binary_function</a><std::pair<_T1, _T2>,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  std::pair<_T1, _T2>, bool></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  {</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  _Compare& _M_comp;</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="a09507.html">_Lexicographic</a>(_Compare& __comp) : _M_comp(__comp) { }</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  operator()(<span class="keyword">const</span> <a class="code" href="a07767.html">std::pair<_T1, _T2></a>& __p1,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">const</span> <a class="code" href="a07767.html">std::pair<_T1, _T2></a>& __p2)<span class="keyword"> const</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (_M_comp(__p1.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p2.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>))</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">if</span> (_M_comp(__p2.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p1.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>))</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> </div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="comment">// Firsts are equal.</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> __p1.<a class="code" href="a07767.html#a91179413226db12e66346d3673b7835f">second</a> < __p2.<a class="code" href="a07767.html#a91179413226db12e66346d3673b7835f">second</a>;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  }</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  };</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"></span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> /** @brief Compare __a pair of types lexicographically, descending. */</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _T1, <span class="keyword">typename</span> _T2, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="a09511.html"> 80</a></span>  <span class="keyword">class </span><a class="code" href="a09511.html">_LexicographicReverse</a> : <span class="keyword">public</span> <a class="code" href="a07315.html">std::binary_function</a><_T1, _T2, bool></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  _Compare& _M_comp;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="a09511.html">_LexicographicReverse</a>(_Compare& __comp) : _M_comp(__comp) { }</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> </div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  operator()(<span class="keyword">const</span> <a class="code" href="a07767.html">std::pair<_T1, _T2></a>& __p1,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> <a class="code" href="a07767.html">std::pair<_T1, _T2></a>& __p2)<span class="keyword"> const</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">if</span> (_M_comp(__p2.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p1.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>))</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> </div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (_M_comp(__p1.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __p2.<a class="code" href="a07767.html#a198b03cffc037835dc1dc01c926ce251">first</a>))</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// Firsts are equal.</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> __p2.<a class="code" href="a07767.html#a91179413226db12e66346d3673b7835f">second</a> < __p1.<a class="code" href="a07767.html#a91179413226db12e66346d3673b7835f">second</a>;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  };</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment"></span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment"> /** </span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"> * @brief Splits several sorted sequences at a certain global __rank,</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> * resulting in a splitting point for each sequence.</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> * The sequences are passed via a sequence of random-access</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> * iterator pairs, none of the sequences may be empty. If there</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * are several equal elements across the split, the ones on the</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> * __left side will be chosen from sequences with smaller number.</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"> * @param __begin_seqs Begin of the sequence of iterator pairs.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> * @param __end_seqs End of the sequence of iterator pairs.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"> * @param __rank The global rank to partition at.</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"> * @param __begin_offsets A random-access __sequence __begin where the</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> * __result will be stored in. Each element of the sequence is an</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"> * iterator that points to the first element on the greater part of</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"> * the respective __sequence.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> * @param __comp The ordering functor, defaults to std::less<_Tp>. </span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> */</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _RanSeqs, <span class="keyword">typename</span> _RankType, <span class="keyword">typename</span> _RankIterator,</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00122"></a><span class="lineno"><a class="line" href="a01575.html#ade1f4c5da0794c4f1a09465d4aee6c1d"> 122</a></span>  <a class="code" href="a01575.html#ade1f4c5da0794c4f1a09465d4aee6c1d">multiseq_partition</a>(_RanSeqs __begin_seqs, _RanSeqs __end_seqs,</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  _RankType __rank,</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  _RankIterator __begin_offsets,</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  _Compare __comp = <a class="code" href="a07379.html">std::less</a><</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">typename</span> std::iterator_traits<<span class="keyword">typename</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  std::iterator_traits<_RanSeqs>::value_type::</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  first_type>::value_type>()) <span class="comment">// std::less<_Tp></span></div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end_seqs - __begin_seqs)</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RanSeqs>::value_type::first_type</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  _It;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RanSeqs>::difference_type</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  _SeqNumber;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_It>::difference_type</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  _DifferenceType;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_It>::value_type _ValueType;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <a class="code" href="a09507.html">_Lexicographic<_ValueType, _SeqNumber, _Compare></a> __lcomp(__comp);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <a class="code" href="a09511.html">_LexicographicReverse<_ValueType, _SeqNumber, _Compare></a> __lrcomp(__comp);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// Number of sequences, number of elements in total (possibly</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// including padding).</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  _DifferenceType __m = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs, __end_seqs), __nn = 0,</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  __nmax, __n, __r;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  __nn += <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[__i].first,</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  __begin_seqs[__i].second);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  _GLIBCXX_PARALLEL_ASSERT(</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[__i].first,</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  __begin_seqs[__i].second) > 0);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (__rank == __nn)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  __begin_offsets[__i] = __begin_seqs[__i].second; <span class="comment">// Very end.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Return __m - 1;</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  _GLIBCXX_PARALLEL_ASSERT(__m != 0);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  _GLIBCXX_PARALLEL_ASSERT(__nn != 0);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  _GLIBCXX_PARALLEL_ASSERT(__rank >= 0);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  _GLIBCXX_PARALLEL_ASSERT(__rank < __nn);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  _DifferenceType* __ns = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  _DifferenceType* __a = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  _DifferenceType* __b = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  _DifferenceType __l;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  __ns[0] = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[0].first, __begin_seqs[0].second);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  __nmax = __ns[0];</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  {</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  __ns[__i] = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[__i].first,</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  __begin_seqs[__i].second);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  __nmax = <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>(__nmax, __ns[__i]);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  __r = <a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(__nmax) + 1;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Pad all lists to this length, at least as long as any ns[__i],</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// equality iff __nmax = 2^__k - 1.</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  __l = (1ULL << __r) - 1;</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  __a[__i] = 0;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  __b[__i] = __l;</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  __n = __l / 2;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Invariants:</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// 0 <= __a[__i] <= __ns[__i], 0 <= __b[__i] <= __l</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#define __S(__i) (__begin_seqs[__i].first)</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Initial partition.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <a class="code" href="a07923.html">std::vector<std::pair<_ValueType, _SeqNumber></a> > <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (__n < __ns[__i]) <span class="comment">//__sequence long enough</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.push_back(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__n], __i));</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  __gnu_sequential::sort(<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.begin(), <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.end(), __lcomp);</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++) <span class="comment">//conceptual infinity</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (__n >= __ns[__i]) <span class="comment">//__sequence too short, conceptual infinity</span></div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.push_back(</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[0] <span class="comment">/*__dummy element*/</span>, __i));</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  _DifferenceType __localrank = __rank / __l;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  _SeqNumber __j;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span> (__j = 0;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  __j < __localrank && ((__n + 1) <= __ns[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second]);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  ++__j)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  __a[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second] += __n + 1;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">for</span> (; __j < __m; __j++)</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  __b[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second] -= __n + 1;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// Further refinement.</span></div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keywordflow">while</span> (__n > 0)</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  __n /= 2;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  _SeqNumber __lmax_seq = -1; <span class="comment">// to avoid warning</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">const</span> _ValueType* __lmax = 0; <span class="comment">// impossible to avoid the warning?</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  {</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (!__lmax)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  {</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  __lmax = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  __lmax_seq = __i;</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  {</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="comment">// Max, favor rear sequences.</span></div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">if</span> (!__comp(__S(__i)[__a[__i] - 1], *__lmax))</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  {</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  __lmax = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  __lmax_seq = __i;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  }</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  _SeqNumber __i;</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">for</span> (__i = 0; __i < __m; __i++)</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  {</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  _DifferenceType __middle = (__b[__i] + __a[__i]) / 2;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (__lmax && __middle < __ns[__i] &&</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  __lcomp(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__middle], __i),</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(*__lmax, __lmax_seq)))</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  __a[__i] = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__a[__i] + __n + 1, __ns[__i]);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  __b[__i] -= __n + 1;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  _DifferenceType __leftsize = 0;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  __leftsize += __a[__i] / (__n + 1);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  _DifferenceType __skew = __rank / (__n + 1) - __leftsize;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> </div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (__skew > 0)</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  {</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// Move to the left, find smallest.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="a07779.html">std::priority_queue<std::pair<_ValueType, _SeqNumber></a>,</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="a07923.html">std::vector<std::pair<_ValueType, _SeqNumber></a> >,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <a class="code" href="a09511.html">_LexicographicReverse<_ValueType, _SeqNumber, _Compare></a> ></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  __pq(__lrcomp);</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (__b[__i] < __ns[__i])</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__b[__i]], __i));</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">for</span> (; __skew != 0 && !__pq.<a class="code" href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472">empty</a>(); --__skew)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  _SeqNumber __source = __pq.<a class="code" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">top</a>().second;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  __pq.<a class="code" href="a07779.html#a935091a0132d887f9d3f87686c5598ac">pop</a>();</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  __a[__source]</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__a[__source] + __n + 1, __ns[__source]);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  __b[__source] += __n + 1;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> </div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (__b[__source] < __ns[__source])</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__source)[__b[__source]], __source));</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__skew < 0)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// Move to the right, find greatest.</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="a07779.html">std::priority_queue<std::pair<_ValueType, _SeqNumber></a>,</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="a07923.html">std::vector<std::pair<_ValueType, _SeqNumber></a> >,</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="a09507.html">_Lexicographic<_ValueType, _SeqNumber, _Compare></a> ></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  __pq(__lcomp);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__a[__i] - 1], __i));</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (; __skew != 0; ++__skew)</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  _SeqNumber __source = __pq.<a class="code" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">top</a>().second;</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  __pq.<a class="code" href="a07779.html#a935091a0132d887f9d3f87686c5598ac">pop</a>();</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> </div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  __a[__source] -= __n + 1;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  __b[__source] -= __n + 1;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (__a[__source] > 0)</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  __S(__source)[__a[__source] - 1], __source));</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// Postconditions:</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// __a[__i] == __b[__i] in most cases, except when __a[__i] has been</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// clamped because of having reached the boundary</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> </div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// Now return the result, calculate the offset.</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Compare the keys on both edges of the border.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// Maximum of left edge, minimum of right edge.</span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  _ValueType* __maxleft = 0;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  _ValueType* __minright = 0;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  {</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">if</span> (!__maxleft)</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  __maxleft = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// Max, favor rear sequences.</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">if</span> (!__comp(__S(__i)[__a[__i] - 1], *__maxleft))</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  __maxleft = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">if</span> (__b[__i] < __ns[__i])</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  {</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">if</span> (!__minright)</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  __minright = &(__S(__i)[__b[__i]]);</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Min, favor fore sequences.</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (__comp(__S(__i)[__b[__i]], *__minright))</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  __minright = &(__S(__i)[__b[__i]]);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  _SeqNumber __seq = 0;</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  __begin_offsets[__i] = __S(__i) + __a[__i];</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">delete</span>[] __ns;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">delete</span>[] __a;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">delete</span>[] __b;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> </div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"></span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"> /** </span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> * @brief Selects the element at a certain global __rank from several</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> * sorted sequences.</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> <span class="comment"> *</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span> <span class="comment"> * The sequences are passed via a sequence of random-access</span></div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment"> * iterator pairs, none of the sequences may be empty.</span></div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"> * @param __begin_seqs Begin of the sequence of iterator pairs.</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> * @param __end_seqs End of the sequence of iterator pairs.</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> * @param __rank The global rank to partition at.</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> * @param __offset The rank of the selected element in the global</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> * subsequence of elements equal to the selected element. If the</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> * selected element is unique, this number is 0.</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> * @param __comp The ordering functor, defaults to std::less. </span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> */</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _RanSeqs, <span class="keyword">typename</span> _RankType,</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  _Tp</div><div class="line"><a name="l00388"></a><span class="lineno"><a class="line" href="a01575.html#a68f665a2f83172d9e12b8332ce573d5d"> 388</a></span>  <a class="code" href="a01575.html#a68f665a2f83172d9e12b8332ce573d5d">multiseq_selection</a>(_RanSeqs __begin_seqs, _RanSeqs __end_seqs,</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  _RankType __rank,</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  _RankType& __offset, _Compare __comp = <a class="code" href="a07379.html">std::less<_Tp></a>())</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__end_seqs - __begin_seqs)</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RanSeqs>::value_type::first_type</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  _It;</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_RanSeqs>::difference_type</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  _SeqNumber;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_It>::difference_type</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  _DifferenceType;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="a09507.html">_Lexicographic<_Tp, _SeqNumber, _Compare></a> __lcomp(__comp);</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <a class="code" href="a09511.html">_LexicographicReverse<_Tp, _SeqNumber, _Compare></a> __lrcomp(__comp);</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// Number of sequences, number of elements in total (possibly</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="comment">// including padding).</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  _DifferenceType __m = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs, __end_seqs);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  _DifferenceType __nn = 0;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  _DifferenceType __nmax, __n, __r;</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> </div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  __nn += <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[__i].first,</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  __begin_seqs[__i].second);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">if</span> (__m == 0 || __nn == 0 || __rank < 0 || __rank >= __nn)</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  {</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// result undefined if there is no data or __rank is outside bounds</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">throw</span> <a class="code" href="a05427.html">std::exception</a>();</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> </div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  _DifferenceType* __ns = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  _DifferenceType* __a = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  _DifferenceType* __b = <span class="keyword">new</span> _DifferenceType[__m];</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  _DifferenceType __l;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  __ns[0] = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[0].first, __begin_seqs[0].second);</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  __nmax = __ns[0];</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  {</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  __ns[__i] = <a class="code" href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a>(__begin_seqs[__i].first,</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  __begin_seqs[__i].second);</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  __nmax = <a class="code" href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a>(__nmax, __ns[__i]);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  __r = <a class="code" href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__rd_log2</a>(__nmax) + 1;</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> </div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// Pad all lists to this length, at least as long as any ns[__i],</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// equality iff __nmax = 2^__k - 1</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  __l = <a class="code" href="a01575.html#a9105a85041ac81dba62d60dc669ec169">__round_up_to_pow2</a>(__r) - 1;</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  {</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  __a[__i] = 0;</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  __b[__i] = __l;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  __n = __l / 2;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> </div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">// Invariants:</span></div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// 0 <= __a[__i] <= __ns[__i], 0 <= __b[__i] <= __l</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="preprocessor">#define __S(__i) (__begin_seqs[__i].first)</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> </div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// Initial partition.</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="a07923.html">std::vector<std::pair<_Tp, _SeqNumber></a> > <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>;</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">if</span> (__n < __ns[__i])</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.push_back(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__n], __i));</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  __gnu_sequential::sort(<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.begin(), <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.end(),</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  __lcomp, <a class="code" href="a09639.html">sequential_tag</a>());</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// Conceptual infinity.</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; __i++)</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (__n >= __ns[__i])</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>.push_back(</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[0] <span class="comment">/*__dummy element*/</span>, __i));</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  _DifferenceType __localrank = __rank / __l;</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> </div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  _SeqNumber __j;</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">for</span> (__j = 0;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  __j < __localrank && ((__n + 1) <= __ns[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second]);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  ++__j)</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  __a[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second] += __n + 1;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">for</span> (; __j < __m; ++__j)</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  __b[<a class="code" href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">__sample</a>[__j].second] -= __n + 1;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Further refinement.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">while</span> (__n > 0)</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  __n /= 2;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">const</span> _Tp* __lmax = 0;</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  {</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">if</span> (!__lmax)</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  __lmax = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  {</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keywordflow">if</span> (__comp(*__lmax, __S(__i)[__a[__i] - 1])) <span class="comment">//max</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  __lmax = &(__S(__i)[__a[__i] - 1]);</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  }</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> </div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  _SeqNumber __i;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">for</span> (__i = 0; __i < __m; __i++)</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  {</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  _DifferenceType __middle = (__b[__i] + __a[__i]) / 2;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (__lmax && __middle < __ns[__i]</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  && __comp(__S(__i)[__middle], *__lmax))</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  __a[__i] = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__a[__i] + __n + 1, __ns[__i]);</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  __b[__i] -= __n + 1;</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  }</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> </div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  _DifferenceType __leftsize = 0;</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  __leftsize += __a[__i] / (__n + 1);</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> </div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  _DifferenceType __skew = __rank / (__n + 1) - __leftsize;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> </div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">if</span> (__skew > 0)</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// Move to the left, find smallest.</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <a class="code" href="a07779.html">std::priority_queue<std::pair<_Tp, _SeqNumber></a>,</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <a class="code" href="a07923.html">std::vector<std::pair<_Tp, _SeqNumber></a> >,</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <a class="code" href="a09511.html">_LexicographicReverse<_Tp, _SeqNumber, _Compare></a> ></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  __pq(__lrcomp);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keywordflow">if</span> (__b[__i] < __ns[__i])</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__b[__i]], __i));</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">for</span> (; __skew != 0 && !__pq.<a class="code" href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472">empty</a>(); --__skew)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  _SeqNumber __source = __pq.<a class="code" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">top</a>().second;</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  __pq.<a class="code" href="a07779.html#a935091a0132d887f9d3f87686c5598ac">pop</a>();</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  __a[__source]</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  = <a class="code" href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a>(__a[__source] + __n + 1, __ns[__source]);</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  __b[__source] += __n + 1;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> </div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordflow">if</span> (__b[__source] < __ns[__source])</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__source)[__b[__source]], __source));</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (__skew < 0)</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  {</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// Move to the right, find greatest.</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <a class="code" href="a07779.html">std::priority_queue<std::pair<_Tp, _SeqNumber></a>,</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <a class="code" href="a07923.html">std::vector<std::pair<_Tp, _SeqNumber></a> >,</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <a class="code" href="a09507.html">_Lexicographic<_Tp, _SeqNumber, _Compare></a> > __pq(__lcomp);</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> </div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(__S(__i)[__a[__i] - 1], __i));</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">for</span> (; __skew != 0; ++__skew)</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  _SeqNumber __source = __pq.<a class="code" href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">top</a>().second;</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  __pq.<a class="code" href="a07779.html#a935091a0132d887f9d3f87686c5598ac">pop</a>();</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  __a[__source] -= __n + 1;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  __b[__source] -= __n + 1;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> </div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keywordflow">if</span> (__a[__source] > 0)</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  __pq.<a class="code" href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">push</a>(<a class="code" href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  __S(__source)[__a[__source] - 1], __source));</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  }</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// Postconditions:</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// __a[__i] == __b[__i] in most cases, except when __a[__i] has been</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// clamped because of having reached the boundary</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Now return the result, calculate the offset.</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// Compare the keys on both edges of the border.</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> </div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// Maximum of left edge, minimum of right edge.</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordtype">bool</span> __maxleftset = <span class="keyword">false</span>, __minrightset = <span class="keyword">false</span>;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Impossible to avoid the warning?</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  _Tp __maxleft, __minright;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  {</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">if</span> (__a[__i] > 0)</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  {</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span> (!__maxleftset)</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  {</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  __maxleft = __S(__i)[__a[__i] - 1];</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  __maxleftset = <span class="keyword">true</span>;</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  }</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  {</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// Max.</span></div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">if</span> (__comp(__maxleft, __S(__i)[__a[__i] - 1]))</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  __maxleft = __S(__i)[__a[__i] - 1];</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordflow">if</span> (__b[__i] < __ns[__i])</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (!__minrightset)</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  {</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  __minright = __S(__i)[__b[__i]];</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  __minrightset = <span class="keyword">true</span>;</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  {</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// Min.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">if</span> (__comp(__S(__i)[__b[__i]], __minright))</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  __minright = __S(__i)[__b[__i]];</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  }</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// Minright is the __splitter, in any case.</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> </div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="keywordflow">if</span> (!__maxleftset || __comp(__minright, __maxleft))</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  {</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// Good luck, everything is split unambiguously.</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  __offset = 0;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  {</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// We have to calculate an offset.</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  __offset = 0;</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> </div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">for</span> (_SeqNumber __i = 0; __i < __m; ++__i)</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  _DifferenceType lb</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  = std::lower_bound(__S(__i), __S(__i) + __ns[__i],</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  __minright,</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  __comp) - __S(__i);</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  __offset += __a[__i] - lb;</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keyword">delete</span>[] __ns;</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="keyword">delete</span>[] __a;</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keyword">delete</span>[] __b;</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> </div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">return</span> __minright;</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  }</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> }</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> </div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="preprocessor">#undef __S</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_MULTISEQ_SELECTION_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09639_html"><div class="ttname"><a href="a09639.html">__gnu_parallel::sequential_tag</a></div><div class="ttdoc">Forces sequential execution at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00042">tags.h:42</a></div></div>
<div class="ttc" id="a01575_html_a68f665a2f83172d9e12b8332ce573d5d"><div class="ttname"><a href="a01575.html#a68f665a2f83172d9e12b8332ce573d5d">__gnu_parallel::multiseq_selection</a></div><div class="ttdeci">_Tp multiseq_selection(_RanSeqs __begin_seqs, _RanSeqs __end_seqs, _RankType __rank, _RankType &__offset, _Compare __comp=std::less< _Tp >())</div><div class="ttdoc">Selects the element at a certain global __rank from several sorted sequences.</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l00388">multiseq_selection.h:388</a></div></div>
<div class="ttc" id="a07923_html"><div class="ttname"><a href="a07923.html">std::vector</a></div><div class="ttdoc">A standard container which offers fixed time access to individual elements in any order.</div><div class="ttdef"><b>Definition:</b> <a href="a00599_source.html#l00339">stl_vector.h:339</a></div></div>
<div class="ttc" id="a07379_html"><div class="ttname"><a href="a07379.html">std::less</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00340">stl_function.h:340</a></div></div>
<div class="ttc" id="a07779_html"><div class="ttname"><a href="a07779.html">std::priority_queue</a></div><div class="ttdoc">A standard container automatically sorting its contents.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00435">stl_queue.h:435</a></div></div>
<div class="ttc" id="a07767_html"><div class="ttname"><a href="a07767.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div>
<div class="ttc" id="a01541_html_a99b049793a96260d190d781f847038bc"><div class="ttname"><a href="a01541.html#a99b049793a96260d190d781f847038bc">std::distance</a></div><div class="ttdeci">_GLIBCXX17_CONSTEXPR iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">A generalization of pointer arithmetic.</div><div class="ttdef"><b>Definition:</b> <a href="a00551_source.html#l00138">stl_iterator_base_funcs.h:138</a></div></div>
<div class="ttc" id="a00527_html"><div class="ttname"><a href="a00527.html">stl_algo.h</a></div></div>
<div class="ttc" id="a01575_html_ade1f4c5da0794c4f1a09465d4aee6c1d"><div class="ttname"><a href="a01575.html#ade1f4c5da0794c4f1a09465d4aee6c1d">__gnu_parallel::multiseq_partition</a></div><div class="ttdeci">void multiseq_partition(_RanSeqs __begin_seqs, _RanSeqs __end_seqs, _RankType __rank, _RankIterator __begin_offsets, _Compare __comp=std::less< typename std::iterator_traits< typename std::iterator_traits< _RanSeqs >::value_type::first_type >::value_type >())</div><div class="ttdoc">Splits several sorted sequences at a certain global __rank, resulting in a splitting point for each s...</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l00122">multiseq_selection.h:122</a></div></div>
<div class="ttc" id="a01480_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01480.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div>
<div class="ttc" id="a00182_html"><div class="ttname"><a href="a00182.html">vector</a></div></div>
<div class="ttc" id="a07779_html_a935091a0132d887f9d3f87686c5598ac"><div class="ttname"><a href="a07779.html#a935091a0132d887f9d3f87686c5598ac">std::priority_queue::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">Removes first element.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00646">stl_queue.h:646</a></div></div>
<div class="ttc" id="a00881_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a></div><div class="ttdeci">#define _GLIBCXX_CALL(__n)</div><div class="ttdoc">Macro to produce log message when entering a function.</div><div class="ttdef"><b>Definition:</b> <a href="a00881_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a01485_html_gad48656de2f272a953455e1fff2532125"><div class="ttname"><a href="a01485.html#gad48656de2f272a953455e1fff2532125">std::min</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & min(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00195">stl_algobase.h:195</a></div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a09511_html"><div class="ttname"><a href="a09511.html">__gnu_parallel::_LexicographicReverse</a></div><div class="ttdoc">Compare __a pair of types lexicographically, descending.</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l00080">multiseq_selection.h:80</a></div></div>
<div class="ttc" id="a07779_html_a4a1c1fe5e71410e31f9af1467b7c3472"><div class="ttname"><a href="a07779.html#a4a1c1fe5e71410e31f9af1467b7c3472">std::priority_queue::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00583">stl_queue.h:583</a></div></div>
<div class="ttc" id="a07779_html_abaedbd99739eef4ac53eefb478eb3900"><div class="ttname"><a href="a07779.html#abaedbd99739eef4ac53eefb478eb3900">std::priority_queue::top</a></div><div class="ttdeci">const_reference top() const</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00596">stl_queue.h:596</a></div></div>
<div class="ttc" id="a01575_html_a9105a85041ac81dba62d60dc669ec169"><div class="ttname"><a href="a01575.html#a9105a85041ac81dba62d60dc669ec169">__gnu_parallel::__round_up_to_pow2</a></div><div class="ttdeci">_Tp __round_up_to_pow2(_Tp __x)</div><div class="ttdoc">Round up to the next greater power of 2.</div><div class="ttdef"><b>Definition:</b> <a href="a00953_source.html#l00248">random_shuffle.h:248</a></div></div>
<div class="ttc" id="a07767_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a07767.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00214">stl_pair.h:214</a></div></div>
<div class="ttc" id="a01541_html_a05a1fc441c3dfe4a8d561e947d716837"><div class="ttname"><a href="a01541.html#a05a1fc441c3dfe4a8d561e947d716837">std::__sample</a></div><div class="ttdeci">_RandomAccessIterator __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator &&__g)</div><div class="ttdoc">Reservoir sampling algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l05719">stl_algo.h:5719</a></div></div>
<div class="ttc" id="a07315_html"><div class="ttname"><a href="a07315.html">std::binary_function</a></div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00118">stl_function.h:118</a></div></div>
<div class="ttc" id="a07767_html_a91179413226db12e66346d3673b7835f"><div class="ttname"><a href="a07767.html#a91179413226db12e66346d3673b7835f">std::pair::second</a></div><div class="ttdeci">_T2 second</div><div class="ttdoc">first is a copy of the first object</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00215">stl_pair.h:215</a></div></div>
<div class="ttc" id="a07779_html_acf5286a0e5aa7354459ca1553ba54688"><div class="ttname"><a href="a07779.html#acf5286a0e5aa7354459ca1553ba54688">std::priority_queue::push</a></div><div class="ttdeci">void push(const value_type &__x)</div><div class="ttdoc">Add data to the queue.</div><div class="ttdef"><b>Definition:</b> <a href="a00575_source.html#l00611">stl_queue.h:611</a></div></div>
<div class="ttc" id="a05427_html"><div class="ttname"><a href="a05427.html">std::exception</a></div><div class="ttdoc">Base class for all library exceptions.</div><div class="ttdef"><b>Definition:</b> <a href="a00326_source.html#l00060">exception.h:60</a></div></div>
<div class="ttc" id="a09507_html"><div class="ttname"><a href="a09507.html">__gnu_parallel::_Lexicographic</a></div><div class="ttdoc">Compare __a pair of types lexicographically, ascending.</div><div class="ttdef"><b>Definition:</b> <a href="a00914_source.html#l00053">multiseq_selection.h:53</a></div></div>
<div class="ttc" id="a01575_html_ae8e1f6dc07de01f28bf591339cf8aa9c"><div class="ttname"><a href="a01575.html#ae8e1f6dc07de01f28bf591339cf8aa9c">__gnu_parallel::__rd_log2</a></div><div class="ttdeci">_Size __rd_log2(_Size __n)</div><div class="ttdoc">Calculates the rounded-down logarithm of __n for base 2.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00102">parallel/base.h:102</a></div></div>
<div class="ttc" id="a01485_html_ga84d30d8c4b3f2cbe8ec2055c34a578da"><div class="ttname"><a href="a01485.html#ga84d30d8c4b3f2cbe8ec2055c34a578da">std::max</a></div><div class="ttdeci">_GLIBCXX14_CONSTEXPR const _Tp & max(const _Tp &, const _Tp &)</div><div class="ttdoc">This does what you think it does.</div><div class="ttdef"><b>Definition:</b> <a href="a00530_source.html#l00219">stl_algobase.h:219</a></div></div>
<div class="ttc" id="a00119_html"><div class="ttname"><a href="a00119.html">queue</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_8c50ddefd65cfbc3979f354ad979e527.html">parallel</a></li><li class="navelem"><a class="el" href="a00914.html">multiseq_selection.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.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
809
