<!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++: valarray_array.tcc 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('a00638_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">valarray_array.tcc</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00638.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">// The template and inlines for the -*- C++ -*- internal _Array helper class.</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) 1997-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</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later 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,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but 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</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU 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 bits/valarray_array.tcc</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Do not attempt to use it directly. @headername{valarray}</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Written by Gabriel Dos Reis <Gabriel.Dos-Reis@DPTMaths.ENS-Cachan.Fr></span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifndef _VALARRAY_ARRAY_TCC</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _VALARRAY_ARRAY_TCC 1</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span><a class="code" href="a01541.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> {</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</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="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  __valarray_fill(_Array<_Tp> __a, <span class="keywordtype">size_t</span> __n, _Array<bool> __m,</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">const</span> _Tp& __t)</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>  _Tp* __p = __a._M_data;</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordtype">bool</span>* __ok (__m._M_data);</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i=0; __i < __n; ++__i, ++__ok, ++__p)</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">while</span> (!*__ok)</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  {</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  ++__ok;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  ++__p;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  *__p = __t;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</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="comment">// Copy n elements of a into consecutive elements of b. When m is</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// false, the corresponding element of a is skipped. m must contain</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// at least n true elements. a must contain at least n elements and</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// enough elements to match up with m through the nth true element</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// of m. I.e. if n is 10, m has 15 elements with 5 false followed</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// by 10 true, a must have 15 elements.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, _Array<_Tp> __b,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">size_t</span> __n)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordtype">bool</span>* __ok (__m._M_data);</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">for</span> (_Tp* __q = __b._M_data; __q < __b._M_data + __n;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  ++__q, ++__ok, ++__p)</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="keywordflow">while</span> (! *__ok)</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  {</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  ++__ok;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  ++__p;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  *__q = *__p;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</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="comment">// Copy n consecutive elements from a into elements of b. Elements</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// of b are skipped if the corresponding element of m is false. m</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// must contain at least n true elements. b must have at least as</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// many elements as the index of the nth true element of m. I.e. if</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// m has 15 elements with 5 false followed by 10 true, b must have</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// at least 15 elements.</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  __valarray_copy(_Array<_Tp> __a, <span class="keywordtype">size_t</span> __n, _Array<_Tp> __b,</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  _Array<bool> __m)</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  _Tp* __q (__b._M_data);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">bool</span>* __ok (__m._M_data);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">for</span> (_Tp* __p = __a._M_data; __p < __a._M_data+__n;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  ++__p, ++__ok, ++__q)</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="keywordflow">while</span> (! *__ok)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  ++__ok;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  ++__q;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  *__q = *__p;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Copy n elements from a into elements of b. Elements of a are</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// skipped if the corresponding element of m is false. Elements of</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// b are skipped if the corresponding element of k is false. m and</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// k must contain at least n true elements. a and b must have at</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// least as many elements as the index of the nth true element of m.</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  __valarray_copy(_Array<_Tp> __a, _Array<bool> __m, <span class="keywordtype">size_t</span> __n,</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  _Array<_Tp> __b, _Array<bool> __k)</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  _Tp* __q (__b._M_data);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordtype">bool</span>* __srcok (__m._M_data);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordtype">bool</span>* __dstok (__k._M_data);</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < __n;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  ++__srcok, ++__p, ++__dstok, ++__q, ++__i)</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">while</span> (! *__srcok)</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  ++__srcok;</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  ++__p;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">while</span> (! *__dstok) </div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  ++__dstok;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  ++__q;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  *__q = *__p;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// Copy n consecutive elements of e into consecutive elements of a.</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// I.e. a[i] = e[i].</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Dom></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __valarray_copy(<span class="keyword">const</span> _Expr<_Dom, _Tp>& __e, <span class="keywordtype">size_t</span> __n, _Array<_Tp> __a)</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  {</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < __n; ++__i, ++__p)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  *__p = __e[__i];</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> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// Copy n consecutive elements of e into elements of a using stride</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// s. I.e., a[0] = e[0], a[s] = e[1], a[2*s] = e[2].</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Dom></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  __valarray_copy(<span class="keyword">const</span> _Expr<_Dom, _Tp>& __e, <span class="keywordtype">size_t</span> __n,</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  _Array<_Tp> __a, <span class="keywordtype">size_t</span> __s)</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>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < __n; ++__i, __p += __s)</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  *__p = __e[__i];</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Copy n consecutive elements of e into elements of a indexed by</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// contents of i. I.e., a[i[0]] = e[0].</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Dom></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  __valarray_copy(<span class="keyword">const</span> _Expr<_Dom, _Tp>& __e, <span class="keywordtype">size_t</span> __n,</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  _Array<_Tp> __a, _Array<size_t> __i)</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">size_t</span>* __j (__i._M_data);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __k = 0; __k < __n; ++__k, ++__j)</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  __a._M_data[*__j] = __e[__k];</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// Copy n elements of e indexed by contents of f into elements of a</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// indexed by contents of i. I.e., a[i[0]] = e[f[0]].</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  __valarray_copy(_Array<_Tp> __e, _Array<size_t> __f,</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">size_t</span> __n, </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  _Array<_Tp> __a, _Array<size_t> __i)</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  {</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordtype">size_t</span>* __g (__f._M_data);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordtype">size_t</span>* __j (__i._M_data);</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __k = 0; __k < __n; ++__k, ++__j, ++__g) </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  __a._M_data[*__j] = __e._M_data[*__g];</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> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// Copy n consecutive elements of e into elements of a. Elements of</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// a are skipped if the corresponding element of m is false. m must</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// have at least n true elements and a must have at least as many</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// elements as the index of the nth true element of m. I.e. if m</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// has 5 false followed by 10 true elements and n == 10, a must have</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// at least 15 elements.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Dom></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  __valarray_copy(<span class="keyword">const</span> _Expr<_Dom, _Tp>& __e, <span class="keywordtype">size_t</span> __n,</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  _Array<_Tp> __a, _Array<bool> __m)</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordtype">bool</span>* __ok (__m._M_data);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < __n; ++__i, ++__ok, ++__p)</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="keywordflow">while</span> (! *__ok)</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  ++__ok;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  ++__p;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  *__p = __e[__i];</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</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> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp, <span class="keyword">class</span> _Dom></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  __valarray_copy_construct(<span class="keyword">const</span> _Expr<_Dom, _Tp>& __e, <span class="keywordtype">size_t</span> __n,</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  _Array<_Tp> __a)</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>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < __n; ++__i, ++__p)</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">new</span> (__p) _Tp(__e[__i]);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  __valarray_copy_construct(_Array<_Tp> __a, _Array<bool> __m,</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  _Array<_Tp> __b, <span class="keywordtype">size_t</span> __n)</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>  _Tp* __p (__a._M_data);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">bool</span>* __ok (__m._M_data);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">for</span> (_Tp* __q = __b._M_data; __q < __b._M_data+__n; ++__q, ++__ok, ++__p)</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">while</span> (! *__ok)</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>  ++__ok;</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  ++__p;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">new</span> (__q) _Tp(*__p);</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</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> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor">#endif </span><span class="comment">/* _VALARRAY_ARRAY_TCC */</span><span class="preprocessor"></span></div><div class="ttc" id="a01541_html"><div class="ttname"><a href="a01541.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</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_d56d7bef09446c5da887ab10055bb2f4.html">bits</a></li><li class="navelem"><a class="el" href="a00638.html">valarray_array.tcc</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
>
584
