mirror of
https://github.com/PhasicFlow/phasicFlow.git
synced 2025-06-22 16:28:30 +00:00
documentation for v1.0
This commit is contained in:
@ -146,11 +146,11 @@ $(document).ready(function(){initNavTree('stdAlgorithms_8hpp_source.html',''); i
|
||||
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">return</span> <a class="code" href="VectorFwd_8hpp.html#a4ba4960022e5995b2a43437d211d8f60">std::count_if</a>(</div>
|
||||
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  std::execution::par_unseq,</div>
|
||||
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  first, first+numElems,</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  [=](<span class="keyword">const</span> Type& check){ <span class="keywordflow">return</span> <a class="code" href="namespacepFlow.html#aaf1dcea055a0402beff3cec1b0849d74">equal</a>(check,val);} );</div>
|
||||
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  [=](<span class="keyword">const</span> Type& check){ <span class="keywordflow">return</span> <a class="code" href="namespacepFlow.html#ac51b1f978c0296b63a19e0033906c25c">equal</a>(check,val);} );</div>
|
||||
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">else</span></div>
|
||||
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">return</span> <a class="code" href="VectorFwd_8hpp.html#a4ba4960022e5995b2a43437d211d8f60">std::count_if</a>(</div>
|
||||
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  first, first+numElems,</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  [=](<span class="keyword">const</span> Type& check){ <span class="keywordflow">return</span> <a class="code" href="namespacepFlow.html#aaf1dcea055a0402beff3cec1b0849d74">equal</a>(check,val);} );</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  [=](<span class="keyword">const</span> Type& check){ <span class="keywordflow">return</span> <a class="code" href="namespacepFlow.html#ac51b1f978c0296b63a19e0033906c25c">equal</a>(check,val);} );</div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> 0; <span class="comment">// for nvcc</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>  </div>
|
||||
@ -355,13 +355,14 @@ $(document).ready(function(){initNavTree('stdAlgorithms_8hpp_source.html',''); i
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_ad30cea35761980fcb0cc884b631342d6"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#ad30cea35761980fcb0cc884b631342d6">pFlow::algorithms::STD::fillSelected</a></div><div class="ttdeci">INLINE_FUNCTION_H void fillSelected(Type *first, const indexType *indices, const int32 numElems, const Type val)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00063">stdAlgorithms.hpp:63</a></div></div>
|
||||
<div class="ttc" id="aalgorithmFunctions_8hpp_html"><div class="ttname"><a href="algorithmFunctions_8hpp.html">algorithmFunctions.hpp</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html">pFlow::algorithms::STD</a></div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00031">stdAlgorithms.hpp:31</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_html_ac51b1f978c0296b63a19e0033906c25c"><div class="ttname"><a href="namespacepFlow.html#ac51b1f978c0296b63a19e0033906c25c">pFlow::equal</a></div><div class="ttdeci">INLINE_FUNCTION_HD bool equal(const box &b1, const box &b2, real tol=smallValue)</div><div class="ttdef"><b>Definition:</b> <a href="box_8hpp_source.html#l00135">box.hpp:135</a></div></div>
|
||||
<div class="ttc" id="aVectorFwd_8hpp_html_a4ba4960022e5995b2a43437d211d8f60"><div class="ttname"><a href="VectorFwd_8hpp.html#a4ba4960022e5995b2a43437d211d8f60">count_if</a></div><div class="ttdeci">auto count_if(const Vector< T, Allocator > &vec, UnaryPredicate p)</div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_a058cd3d3eaf32c8c8c974173bcc18aca"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#a058cd3d3eaf32c8c8c974173bcc18aca">pFlow::algorithms::STD::exclusiveScan</a></div><div class="ttdeci">void exclusiveScan(Type *first, DestType *dFirst, int32 numElems)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00204">stdAlgorithms.hpp:204</a></div></div>
|
||||
<div class="ttc" id="apFlowMacros_8hpp_html"><div class="ttname"><a href="pFlowMacros_8hpp.html">pFlowMacros.hpp</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_html_aae6ad039f09c0676db11bd114136a3fa"><div class="ttname"><a href="namespacepFlow.html#aae6ad039f09c0676db11bd114136a3fa">pFlow::int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="builtinTypes_8hpp_source.html#l00053">builtinTypes.hpp:53</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_html_aae6ad039f09c0676db11bd114136a3fa"><div class="ttname"><a href="namespacepFlow.html#aae6ad039f09c0676db11bd114136a3fa">pFlow::int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="builtinTypes_8hpp_source.html#l00050">builtinTypes.hpp:50</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_a6e6a9b83a6c54e8d07490393d9a79ecd"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#a6e6a9b83a6c54e8d07490393d9a79ecd">pFlow::algorithms::STD::min</a></div><div class="ttdeci">INLINE_FUNCTION_H Type min(const Type *first, int32 numElems)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00129">stdAlgorithms.hpp:129</a></div></div>
|
||||
<div class="ttc" id="aVectorFwd_8hpp_html_a5fde7b7d3d438de86ad820bfa1e51b34"><div class="ttname"><a href="VectorFwd_8hpp.html#a5fde7b7d3d438de86ad820bfa1e51b34">fill</a></div><div class="ttdeci">void fill(Vector< T, Allocator > &vec, const T &val)</div></div>
|
||||
<div class="ttc" id="apFlowMacros_8hpp_html_a542d326bc30e30d52e9deb402759b872"><div class="ttname"><a href="pFlowMacros_8hpp.html#a542d326bc30e30d52e9deb402759b872">INLINE_FUNCTION_H</a></div><div class="ttdeci">#define INLINE_FUNCTION_H</div><div class="ttdef"><b>Definition:</b> <a href="pFlowMacros_8hpp_source.html#l00053">pFlowMacros.hpp:53</a></div></div>
|
||||
<div class="ttc" id="apFlowMacros_8hpp_html_a542d326bc30e30d52e9deb402759b872"><div class="ttname"><a href="pFlowMacros_8hpp.html#a542d326bc30e30d52e9deb402759b872">INLINE_FUNCTION_H</a></div><div class="ttdeci">#define INLINE_FUNCTION_H</div><div class="ttdef"><b>Definition:</b> <a href="pFlowMacros_8hpp_source.html#l00057">pFlowMacros.hpp:57</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_a7e1903612a89a800818a1e8ed40b1c61"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#a7e1903612a89a800818a1e8ed40b1c61">pFlow::algorithms::STD::fill</a></div><div class="ttdeci">INLINE_FUNCTION_H void fill(Type *first, int32 numElems, const Type &val)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00053">stdAlgorithms.hpp:53</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_a577015d933f32e2f5b5de5dbe21eb555"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#a577015d933f32e2f5b5de5dbe21eb555">pFlow::algorithms::STD::fillSequence</a></div><div class="ttdeci">INLINE_FUNCTION_H void fillSequence(Type *first, int32 numElems, const Type &firstVal)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00098">stdAlgorithms.hpp:98</a></div></div>
|
||||
<div class="ttc" id="aVectorFwd_8hpp_html_a7e83353786d5cf3406a036b434c7df25"><div class="ttname"><a href="VectorFwd_8hpp.html#a7e83353786d5cf3406a036b434c7df25">sort</a></div><div class="ttdeci">void sort(Vector< T, Allocator > &vec)</div></div>
|
||||
@ -369,7 +370,6 @@ $(document).ready(function(){initNavTree('stdAlgorithms_8hpp_source.html',''); i
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_af645f7face856614b2d5e1ff94b83960"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#af645f7face856614b2d5e1ff94b83960">pFlow::algorithms::STD::permuteSort</a></div><div class="ttdeci">INLINE_FUNCTION_H void permuteSort(const Type *first, PermuteType *pFirst, int32 numElems)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00188">stdAlgorithms.hpp:188</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_1_1algorithms_1_1STD_html_a4a07b7729b1205459f95e03bce7f9f14"><div class="ttname"><a href="namespacepFlow_1_1algorithms_1_1STD.html#a4a07b7729b1205459f95e03bce7f9f14">pFlow::algorithms::STD::sort</a></div><div class="ttdeci">INLINE_FUNCTION_H void sort(Type *first, int32 numElems)</div><div class="ttdef"><b>Definition:</b> <a href="stdAlgorithms_8hpp_source.html#l00146">stdAlgorithms.hpp:146</a></div></div>
|
||||
<div class="ttc" id="astructpFlow_1_1algorithms_1_1less_html"><div class="ttname"><a href="structpFlow_1_1algorithms_1_1less.html">pFlow::algorithms::less</a></div><div class="ttdef"><b>Definition:</b> <a href="algorithmFunctions_8hpp_source.html#l00039">algorithmFunctions.hpp:39</a></div></div>
|
||||
<div class="ttc" id="anamespacepFlow_html_aaf1dcea055a0402beff3cec1b0849d74"><div class="ttname"><a href="namespacepFlow.html#aaf1dcea055a0402beff3cec1b0849d74">pFlow::equal</a></div><div class="ttdeci">INLINE_FUNCTION_HD bool equal(const real &s1, const real &s2)</div><div class="ttdef"><b>Definition:</b> <a href="bTypesFunctions_8hpp_source.html#l00188">bTypesFunctions.hpp:188</a></div></div>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_cd7a5046d028e114fc17b2ebc2bd02d2.html">phasicFlow</a></li><li class="navelem"><a class="el" href="dir_67ea7e018387beaa79e21cb1dea6a3ab.html">algorithms</a></li><li class="navelem"><a class="el" href="stdAlgorithms_8hpp.html">stdAlgorithms.hpp</a></li>
|
||||
|
Reference in New Issue
Block a user