This repository was archived by the owner on Dec 5, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalgorithm_8h_source.html
215 lines (213 loc) · 29.2 KB
/
algorithm_8h_source.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
<!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.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>swift: src/blackmisc/algorithm.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="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="doxygen-awesome.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">swift
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_68267d1309a1af8e8297ef4c3efbcdba.html">src</a></li><li class="navelem"><a class="el" href="dir_9687d2aaac47be79d7525830e55feee8.html">blackmisc</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">algorithm.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="algorithm_8h.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">// SPDX-FileCopyrightText: Copyright (C) 2014 swift Project Community / Contributors</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-swift-pilot-client-1</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>  </div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>  </div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#ifndef BLACKMISC_ALGORITHM_H</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#define BLACKMISC_ALGORITHM_H</span></div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>  </div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <QtGlobal></span></div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <algorithm></span></div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <iterator></span></div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="preprocessor">#include <utility></span></div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include <random></span></div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <tuple></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="keyword">namespace </span><a class="code" href="namespace_black_misc.html">BlackMisc</a></div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> {</div>
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> I, <span class="keyword">typename</span> J></div>
<div class="line"><a name="l00024"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#aa918138f03d3ca52f9ff8008ead74b72"> 24</a></span>  <span class="keyword">auto</span> <a class="code" href="namespace_black_misc.html#aa918138f03d3ca52f9ff8008ead74b72">removeIfIn</a>(I begin1, I end1, J begin2, J end2)</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  {</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  <span class="keyword">auto</span> newEnd = end1;</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  std::for_each(begin2, end2, [&](<span class="keyword">const</span> <span class="keyword">auto</span> &rm) {</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">const</span> <span class="keyword">auto</span> found = std::find(begin1, end1, rm);</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  Q_ASSERT(found != end1);</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  <span class="keywordflow">if</span> (newEnd == end1) { newEnd = found; }</div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">else</span> { newEnd = std::move(begin1, found, newEnd); }</div>
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  begin1 = std::next(found);</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  });</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">if</span> (newEnd != end1) { newEnd = std::move(begin1, end1, newEnd); }</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">return</span> newEnd;</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>  </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">namespace </span>Private</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">inline</span> std::mt19937 &defaultRandomGenerator()</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>  thread_local std::mt19937 rng(std::random_device {}());</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">return</span> rng;</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>  }</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> ForwardIt, <span class="keyword">typename</span> OutputIt, <span class="keyword">typename</span> Generator></div>
<div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#a3ec2397131a0f780a4d7cf18dda9cbd1"> 53</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#a3ec2397131a0f780a4d7cf18dda9cbd1">copyRandomElements</a>(ForwardIt in, ForwardIt <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, OutputIt out, <span class="keywordtype">int</span> n, Generator &&rng)</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>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> size = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(std::distance(in, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>)); in != <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a> && n > 0; ++in, --size)</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="keywordflow">if</span> (std::uniform_int_distribution<>(0, size - 1)(rng) < n)</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  *out++ = *in;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  --n;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</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>  }</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> ForwardIt, <span class="keyword">typename</span> OutputIt></div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#a2d591d748d4ba98a4626747234d18772"> 69</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#a3ec2397131a0f780a4d7cf18dda9cbd1">copyRandomElements</a>(ForwardIt in, ForwardIt <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, OutputIt out, <span class="keywordtype">int</span> n)</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <a class="code" href="namespace_black_misc.html#a3ec2397131a0f780a4d7cf18dda9cbd1">copyRandomElements</a>(in, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, out, n, Private::defaultRandomGenerator());</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>  </div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> ForwardIt, <span class="keyword">typename</span> OutputIt, <span class="keyword">typename</span> Generator></div>
<div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#af210f9e81bfdb9abf5ed177df2dd862a"> 78</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#af210f9e81bfdb9abf5ed177df2dd862a">copySampleElements</a>(ForwardIt in, ForwardIt <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, OutputIt out, <span class="keywordtype">int</span> n, Generator &&rng)</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>  <span class="keyword">const</span> <span class="keyword">auto</span> size = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(std::distance(in, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>));</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < std::min(n, size); ++i)</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">const</span> <span class="keyword">auto</span> index = std::uniform_int_distribution<>(0, std::max(size / n, 1) - 1)(rng);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  std::advance(in, index);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  *out++ = *in;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  std::advance(in, std::max(size / n, 1) - index);</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>  }</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> ForwardIt, <span class="keyword">typename</span> OutputIt></div>
<div class="line"><a name="l00094"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#ac2881ec2da4e12a6a2e6099595ae1bcb"> 94</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#af210f9e81bfdb9abf5ed177df2dd862a">copySampleElements</a>(ForwardIt in, ForwardIt <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, OutputIt out, <span class="keywordtype">int</span> n)</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  {</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="code" href="namespace_black_misc.html#af210f9e81bfdb9abf5ed177df2dd862a">copySampleElements</a>(in, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, out, n, Private::defaultRandomGenerator());</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>  </div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> I, <span class="keyword">typename</span> F></div>
<div class="line"><a name="l00112"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#a2f8ed585265f07cc9c5b1934ac93783e"> 112</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#a2f8ed585265f07cc9c5b1934ac93783e">topologicalSort</a>(I <a class="code" href="namespace_black_misc.html#abd59d3c98e887ac782799880a51687c6">begin</a>, I <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, F comparator)</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">using</span> value_type = <span class="keyword">typename</span> std::iterator_traits<I>::value_type;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">auto</span> part = <a class="code" href="namespace_black_misc.html#abd59d3c98e887ac782799880a51687c6">begin</a>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">while</span> (part != <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>)</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  {</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">auto</span> newPart = std::partition(part, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, [=](<span class="keyword">const</span> value_type &a) {</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">return</span> std::none_of(part, <a class="code" href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">end</a>, [=, &a](<span class="keyword">const</span> value_type &b) {</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">return</span> comparator(b, a);</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  });</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  });</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  Q_ASSERT_X(newPart != part, <span class="stringliteral">"BlackMisc::topologicalSort"</span>, <span class="stringliteral">"Cyclic less-than relation detected (not a partial ordering)"</span>);</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  part = newPart;</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>  }</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> F></div>
<div class="line"><a name="l00141"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#a36fc0d2dafb0d7b8c26ece95bd731ffe"> 141</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#a36fc0d2dafb0d7b8c26ece95bd731ffe">topologicallySortedInsert</a>(C &container, T &&value, F comparator)</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="keyword">using</span> value_type = <span class="keyword">typename</span> C::value_type;</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keyword">using</span> reverse = std::reverse_iterator<typename C::iterator>;</div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">auto</span> rit = std::find_if(reverse(container.end()), reverse(container.begin()), [=, &value](<span class="keyword">const</span> value_type &lhs) {</div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  return comparator(lhs, value);</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>  Q_ASSERT_X(std::none_of(rit, reverse(container.begin()), [=, &value](<span class="keyword">const</span> value_type &rhs) { return comparator(value, rhs); }),</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="stringliteral">"BlackMisc::topologicallySortedInsert"</span>, <span class="stringliteral">"Cyclic less-than relation detected (not a partial ordering)"</span>);</div>
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  container.insert(rit.base(), std::forward<T>(value));</div>
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  </div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">namespace </span>Private</div>
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> F, <span class="keywordtype">size_t</span>... Is></div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordtype">void</span> tupleForEachPairImpl(T &&tuple, F &&visitor, std::index_sequence<Is...>)</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="comment">// cppcheck-suppress accessForwarded</span></div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  (<span class="keyword">static_cast<</span><span class="keywordtype">void</span><span class="keyword">></span>(std::forward<F>(visitor)(std::get<Is * 2>(std::forward<T>(tuple)), std::get<Is * 2 + 1>(std::forward<T>(tuple)))), ...);</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  }</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> F></div>
<div class="line"><a name="l00168"></a><span class="lineno"><a class="line" href="namespace_black_misc.html#adbb6a47a2ad158aa7b88e1f498c45dc3"> 168</a></span>  <span class="keywordtype">void</span> <a class="code" href="namespace_black_misc.html#adbb6a47a2ad158aa7b88e1f498c45dc3">tupleForEachPair</a>(T &&tuple, F &&visitor)</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>  <span class="keyword">using</span> seq = std::make_index_sequence<std::tuple_size_v<std::decay_t<T>> / 2>;</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> Private::tupleForEachPairImpl(std::forward<T>(tuple), std::forward<F>(visitor), seq());</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> }</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> <span class="preprocessor">#endif</span></div>
<div class="ttc" id="anamespace_black_misc_html"><div class="ttname"><a href="namespace_black_misc.html">BlackMisc</a></div><div class="ttdoc">Base and utility classes available in all other projects.</div><div class="ttdef"><b>Definition:</b> <a href="aircraftmatcher_8h_source.html#l00028">aircraftmatcher.h:29</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_a2f8ed585265f07cc9c5b1934ac93783e"><div class="ttname"><a href="namespace_black_misc.html#a2f8ed585265f07cc9c5b1934ac93783e">BlackMisc::topologicalSort</a></div><div class="ttdeci">void topologicalSort(I begin, I end, F comparator)</div><div class="ttdoc">Topological sorting algorithm.</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00112">algorithm.h:112</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_a36fc0d2dafb0d7b8c26ece95bd731ffe"><div class="ttname"><a href="namespace_black_misc.html#a36fc0d2dafb0d7b8c26ece95bd731ffe">BlackMisc::topologicallySortedInsert</a></div><div class="ttdeci">void topologicallySortedInsert(C &container, T &&value, F comparator)</div><div class="ttdoc">Insert an element into a sequential container while preserving the topological ordering of the contai...</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00141">algorithm.h:141</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_a3ec2397131a0f780a4d7cf18dda9cbd1"><div class="ttname"><a href="namespace_black_misc.html#a3ec2397131a0f780a4d7cf18dda9cbd1">BlackMisc::copyRandomElements</a></div><div class="ttdeci">void copyRandomElements(ForwardIt in, ForwardIt end, OutputIt out, int n, Generator &&rng)</div><div class="ttdoc">Use the random number generator rng to choose n elements from the range [in,end) and copy them to out...</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00053">algorithm.h:53</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_a96eeaa3619ee69eac98268c5164e0bce"><div class="ttname"><a href="namespace_black_misc.html#a96eeaa3619ee69eac98268c5164e0bce">BlackMisc::end</a></div><div class="ttdeci">T::const_iterator end(const LockFreeReader< T > &reader)</div><div class="ttdoc">Non-member begin() and end() for so LockFree containers can be used in ranged for loops.</div><div class="ttdef"><b>Definition:</b> <a href="lockfree_8h_source.html#l00336">lockfree.h:336</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_aa918138f03d3ca52f9ff8008ead74b72"><div class="ttname"><a href="namespace_black_misc.html#aa918138f03d3ca52f9ff8008ead74b72">BlackMisc::removeIfIn</a></div><div class="ttdeci">auto removeIfIn(I begin1, I end1, J begin2, J end2)</div><div class="ttdoc">Removes those elements in range 1 that appear also in range 2 leaving only those that do not appear i...</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00024">algorithm.h:24</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_abd59d3c98e887ac782799880a51687c6"><div class="ttname"><a href="namespace_black_misc.html#abd59d3c98e887ac782799880a51687c6">BlackMisc::begin</a></div><div class="ttdeci">T::const_iterator begin(const LockFreeReader< T > &reader)</div><div class="ttdoc">Non-member begin() and end() for so LockFree containers can be used in ranged for loops.</div><div class="ttdef"><b>Definition:</b> <a href="lockfree_8h_source.html#l00330">lockfree.h:330</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_adbb6a47a2ad158aa7b88e1f498c45dc3"><div class="ttname"><a href="namespace_black_misc.html#adbb6a47a2ad158aa7b88e1f498c45dc3">BlackMisc::tupleForEachPair</a></div><div class="ttdeci">void tupleForEachPair(T &&tuple, F &&visitor)</div><div class="ttdoc">Invoke a visitor function on each pair of elements of a tuple in order.</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00168">algorithm.h:168</a></div></div>
<div class="ttc" id="anamespace_black_misc_html_af210f9e81bfdb9abf5ed177df2dd862a"><div class="ttname"><a href="namespace_black_misc.html#af210f9e81bfdb9abf5ed177df2dd862a">BlackMisc::copySampleElements</a></div><div class="ttdeci">void copySampleElements(ForwardIt in, ForwardIt end, OutputIt out, int n, Generator &&rng)</div><div class="ttdoc">Split the range [in,end) into n equal chunks and use the random number generator rng to choose one el...</div><div class="ttdef"><b>Definition:</b> <a href="algorithm_8h_source.html#l00078">algorithm.h:78</a></div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Dec 3 2023 18:38:39 for swift by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1
</small></address>
</body>
</html>