-
Notifications
You must be signed in to change notification settings - Fork 0
/
annotated.html
333 lines (331 loc) · 83.7 KB
/
annotated.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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.11"/>
<title>tlx: Class List</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">
$(document).ready(initResizable);
$(window).load(resizeHeight);
</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>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script><script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js"></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">tlx
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li class="current"><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</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">
$(document).ready(function(){initNavTree('annotated.html','');});
</script>
<div id="doc-content">
<!-- 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 class="header">
<div class="headertitle">
<div class="title">Class List</div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock">Here are the classes, structs, unions and interfaces with brief descriptions:</div><div class="directory">
<div class="levels">[detail level <span onclick="javascript:toggleLevel(1);">1</span><span onclick="javascript:toggleLevel(2);">2</span><span onclick="javascript:toggleLevel(3);">3</span><span onclick="javascript:toggleLevel(4);">4</span>]</div><table class="directory">
<tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_0_" class="arrow" onclick="toggleFolder('0_')">►</span><span class="icona"><span class="icon">N</span></span><b>std</b></td><td class="desc">STL namespace </td></tr>
<tr id="row_0_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structstd_1_1hash_3_01tlx_1_1StringView_01_4.html" target="_self">hash< tlx::StringView ></a></td><td class="desc"></td></tr>
<tr id="row_1_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_1_" class="arrow" onclick="toggleFolder('1_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx.html" target="_self">tlx</a></td><td class="desc"></td></tr>
<tr id="row_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1meta__detail.html" target="_self">meta_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1meta__detail_1_1CallForRangeImpl.html" target="_self">CallForRangeImpl</a></td><td class="desc">Helper for call_for_range: general recursive case </td></tr>
<tr id="row_1_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1meta__detail_1_1CallForRangeImpl_3_01Index_00_010_00_01Functor_01_4.html" target="_self">CallForRangeImpl< Index, 0, Functor ></a></td><td class="desc">Helper for call_for_range: base case </td></tr>
<tr id="row_1_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1meta__detail_1_1make__index__sequence__helper.html" target="_self">make_index_sequence_helper</a></td><td class="desc"></td></tr>
<tr id="row_1_0_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1meta__detail_1_1make__index__sequence__helper_3_010_00_01Indexes_8_8_8_01_4.html" target="_self">make_index_sequence_helper< 0, Indexes... ></a></td><td class="desc"></td></tr>
<tr id="row_1_0_4_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1meta__detail_1_1VMapForRangeImpl.html" target="_self">VMapForRangeImpl</a></td><td class="desc">Helper for vmap_for_range: general recursive case </td></tr>
<tr id="row_1_0_5_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1meta__detail_1_1VMapForRangeImpl_3_01Index_00_010_00_01Functor_01_4.html" target="_self">VMapForRangeImpl< Index, 0, Functor ></a></td><td class="desc">Helper for vmap_for_range: base case </td></tr>
<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1multisequence__partition__detail.html" target="_self">multisequence_partition_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multisequence__partition__detail_1_1lexicographic.html" target="_self">lexicographic</a></td><td class="desc">Compare a pair of types lexicographically, ascending </td></tr>
<tr id="row_1_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multisequence__partition__detail_1_1lexicographic__rev.html" target="_self">lexicographic_rev</a></td><td class="desc">Compare a pair of types lexicographically, descending </td></tr>
<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_2_" class="arrow" onclick="toggleFolder('1_2_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1multisequence__selection__detail.html" target="_self">multisequence_selection_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multisequence__selection__detail_1_1lexicographic.html" target="_self">lexicographic</a></td><td class="desc">Compare a pair of types lexicographically, ascending </td></tr>
<tr id="row_1_2_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multisequence__selection__detail_1_1lexicographic__rev.html" target="_self">lexicographic_rev</a></td><td class="desc">Compare a pair of types lexicographically, descending </td></tr>
<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_3_" class="arrow" onclick="toggleFolder('1_3_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1multiway__merge__detail.html" target="_self">multiway_merge_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multiway__merge__detail_1_1guarded__iterator.html" target="_self">guarded_iterator</a></td><td class="desc">Iterator wrapper supporting an implicit supremum at the end of the sequence, dominating all comparisons </td></tr>
<tr id="row_1_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1multiway__merge__detail_1_1unguarded__iterator.html" target="_self">unguarded_iterator</a></td><td class="desc"></td></tr>
<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_4_" class="arrow" onclick="toggleFolder('1_4_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1parallel__mergesort__detail.html" target="_self">parallel_mergesort_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_4_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1parallel__mergesort__detail_1_1PMWMSPiece.html" target="_self">PMWMSPiece</a></td><td class="desc">Subsequence description </td></tr>
<tr id="row_1_4_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1parallel__mergesort__detail_1_1PMWMSSortingData.html" target="_self">PMWMSSortingData</a></td><td class="desc">Data accessed by all threads </td></tr>
<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_5_" class="arrow" onclick="toggleFolder('1_5_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1radix__heap__detail.html" target="_self">radix_heap_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArray.html" target="_self">BitArray</a></td><td class="desc">A <a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArray.html" title="A BitArray of fixed size supporting reading, setting, and clearing of individual bits. ">BitArray</a> of fixed size supporting reading, setting, and clearing of individual bits </td></tr>
<tr id="row_1_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArrayRecursive.html" target="_self">BitArrayRecursive</a></td><td class="desc">Internal implementation of <a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArray.html" title="A BitArray of fixed size supporting reading, setting, and clearing of individual bits. ">BitArray</a>; do not invoke directly </td></tr>
<tr id="row_1_5_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArrayRecursive_3_01Size_00_01false_01_4.html" target="_self">BitArrayRecursive< Size, false ></a></td><td class="desc"></td></tr>
<tr id="row_1_5_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1BitArrayRecursive_3_01Size_00_01true_01_4.html" target="_self">BitArrayRecursive< Size, true ></a></td><td class="desc"></td></tr>
<tr id="row_1_5_4_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1BucketComputation.html" target="_self">BucketComputation</a></td><td class="desc"></td></tr>
<tr id="row_1_5_5_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1radix__heap__detail_1_1IntegerRank.html" target="_self">IntegerRank</a></td><td class="desc">Compute the rank of an integer x (i.e </td></tr>
<tr id="row_1_5_6_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1radix__heap__detail_1_1PairKeyExtract.html" target="_self">PairKeyExtract</a></td><td class="desc">Used as an adapter to implement RadixHeapPair on top of <a class="el" href="classtlx_1_1RadixHeap.html" title="This class implements a monotonic integer min priority queue, more specific a multi-level radix heap...">RadixHeap</a> </td></tr>
<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_6_" class="arrow" onclick="toggleFolder('1_6_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1sort__networks.html" target="_self">sort_networks</a></td><td class="desc">Implementations of sorting networks for up to sixteen elements </td></tr>
<tr id="row_1_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__networks_1_1CS__IfSwap.html" target="_self">CS_IfSwap</a></td><td class="desc">Conditional swap implementation used for sorting networks: trivial portable C++ implementation with custom comparison method and <a class="el" href="namespacetlx.html#ade1320658af9846df1831480a96e7a38" title="swap enclosed object with another counting pointer (no reference counts need change) ...">std::swap()</a> </td></tr>
<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_7_" class="arrow" onclick="toggleFolder('1_7_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacetlx_1_1sort__strings__detail.html" target="_self">sort_strings_detail</a></td><td class="desc"></td></tr>
<tr id="row_1_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1GenericCharStringSet.html" target="_self">GenericCharStringSet</a></td><td class="desc">Class implementing StringSet concept for char* and unsigned char* strings </td></tr>
<tr id="row_1_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1GenericCharStringSetTraits.html" target="_self">GenericCharStringSetTraits</a></td><td class="desc">Traits class implementing StringSet concept for char* and unsigned char* strings </td></tr>
<tr id="row_1_7_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1PerfectTreeCalculations.html" target="_self">PerfectTreeCalculations</a></td><td class="desc">Class to transform in-order to level-order indexes in a perfect binary tree </td></tr>
<tr id="row_1_7_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5BigSortStep.html" target="_self">PS5BigSortStep</a></td><td class="desc"><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5BigSortStep.html" title="PS5BigSortStep Out-of-Place Parallel Sample Sort with Separate Jobs. ">PS5BigSortStep</a> Out-of-Place Parallel Sample Sort with Separate Jobs </td></tr>
<tr id="row_1_7_4_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5Context.html" target="_self">PS5Context</a></td><td class="desc">Parallel Super Scalar String Sample Sort Context </td></tr>
<tr id="row_1_7_5_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5ParametersDefault.html" target="_self">PS5ParametersDefault</a></td><td class="desc">Parallel Super Scalar String Sample Sort Parameter Struct </td></tr>
<tr id="row_1_7_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_1_7_6_" class="arrow" onclick="toggleFolder('1_7_6_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5SmallsortJob.html" target="_self">PS5SmallsortJob</a></td><td class="desc">SampleSort: Non-Recursive In-Place Sequential Sample Sort for Small Sorts </td></tr>
<tr id="row_1_7_6_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5SmallsortJob_1_1MKQSStep.html" target="_self">MKQSStep</a></td><td class="desc"></td></tr>
<tr id="row_1_7_6_1_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5SmallsortJob_1_1SeqSampleSortStep.html" target="_self">SeqSampleSortStep</a></td><td class="desc">Stack of Recursive Sample Sort Steps </td></tr>
<tr id="row_1_7_7_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5SortStep.html" target="_self">PS5SortStep</a></td><td class="desc"><a class="el" href="classtlx_1_1sort__strings__detail_1_1PS5SortStep.html" title="PS5SortStep Top-Level Class to Keep Track of Substeps. ">PS5SortStep</a> Top-Level Class to Keep Track of Substeps </td></tr>
<tr id="row_1_7_8_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1RadixStep__CE0.html" target="_self">RadixStep_CE0</a></td><td class="desc"></td></tr>
<tr id="row_1_7_9_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1RadixStep__CE2.html" target="_self">RadixStep_CE2</a></td><td class="desc"></td></tr>
<tr id="row_1_7_10_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1RadixStep__CE3.html" target="_self">RadixStep_CE3</a></td><td class="desc"></td></tr>
<tr id="row_1_7_11_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1RadixStep__CI2.html" target="_self">RadixStep_CI2</a></td><td class="desc"></td></tr>
<tr id="row_1_7_12_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1sort__strings__detail_1_1RadixStep__CI3.html" target="_self">RadixStep_CI3</a></td><td class="desc"></td></tr>
<tr id="row_1_7_13_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1SSClassifyEqualUnroll.html" target="_self">SSClassifyEqualUnroll</a></td><td class="desc">Sample Sort Classification Tree Unrolled with Equal Comparisons </td></tr>
<tr id="row_1_7_14_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1SSClassifyTreeCalcUnrollInterleave.html" target="_self">SSClassifyTreeCalcUnrollInterleave</a></td><td class="desc">Sample Sort Classification Tree Unrolled, Interleaved, and with Perfect Tree Index Calculations </td></tr>
<tr id="row_1_7_15_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1SSClassifyTreeUnrollInterleave.html" target="_self">SSClassifyTreeUnrollInterleave</a></td><td class="desc">Sample Sort Classification Tree Unrolled and Interleaved </td></tr>
<tr id="row_1_7_16_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1SSTreeBuilderLevelOrder.html" target="_self">SSTreeBuilderLevelOrder</a></td><td class="desc">Recursive TreeBuilder for full-descent and unrolled variants, constructs only a level-order binary tree of splitters </td></tr>
<tr id="row_1_7_17_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1SSTreeBuilderPreAndLevelOrder.html" target="_self">SSTreeBuilderPreAndLevelOrder</a></td><td class="desc">Recursive TreeBuilder for full-descent and unrolled variants, constructs a both a pre-order and level-order array of splitters and the corresponding LCPs </td></tr>
<tr id="row_1_7_18_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StdStringSet.html" target="_self">StdStringSet</a></td><td class="desc">Class implementing StringSet concept for arrays of std::string objects </td></tr>
<tr id="row_1_7_19_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StdStringSetTraits.html" target="_self">StdStringSetTraits</a></td><td class="desc">Class implementing StringSet concept for a std::string objects </td></tr>
<tr id="row_1_7_20_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringLcpPtr.html" target="_self">StringLcpPtr</a></td><td class="desc">Objectified string and LCP array pointer arrays </td></tr>
<tr id="row_1_7_21_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringPtr.html" target="_self">StringPtr</a></td><td class="desc">Objectified string array pointer array </td></tr>
<tr id="row_1_7_22_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringSetBase.html" target="_self">StringSetBase</a></td><td class="desc">Base class for common string set functions, included via CRTP </td></tr>
<tr id="row_1_7_23_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringShadowLcpPtr.html" target="_self">StringShadowLcpPtr</a></td><td class="desc">Objectified string array pointer and shadow pointer array for out-of-place swapping of pointers </td></tr>
<tr id="row_1_7_24_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringShadowPtr.html" target="_self">StringShadowPtr</a></td><td class="desc">Objectified string array pointer and shadow pointer array for out-of-place swapping of pointers </td></tr>
<tr id="row_1_7_25_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringSuffixSet.html" target="_self">StringSuffixSet</a></td><td class="desc">Class implementing StringSet concept for suffix sorting indexes of a std::string text object </td></tr>
<tr id="row_1_7_26_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1StringSuffixSetTraits.html" target="_self">StringSuffixSetTraits</a></td><td class="desc">Class implementing StringSet concept for suffix sorting indexes of a std::string text object </td></tr>
<tr id="row_1_7_27_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1UPtrStdStringSet.html" target="_self">UPtrStdStringSet</a></td><td class="desc">Class implementing StringSet concept for a std::vector containing std::string objects </td></tr>
<tr id="row_1_7_28_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1sort__strings__detail_1_1UPtrStdStringSetTraits.html" target="_self">UPtrStdStringSetTraits</a></td><td class="desc">Class implementing StringSet concept for a std::unique_ptr<std::string objects, which are non-copyable </td></tr>
<tr id="row_1_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Aggregate.html" target="_self">Aggregate</a></td><td class="desc">Calculate running aggregate statistics: feed it with values, and it will keep the minimum, the maximum, the average, the value number, and the standard deviation is values </td></tr>
<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1AggregateMinMax.html" target="_self">AggregateMinMax</a></td><td class="desc">Calculate running aggregate statistics: feed it with values, and it will keep the minimum and the maximum values </td></tr>
<tr id="row_1_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1AllocatorBase.html" target="_self">AllocatorBase</a></td><td class="desc"></td></tr>
<tr id="row_1_11_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_11_" class="arrow" onclick="toggleFolder('1_11_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree.html" target="_self">BTree</a></td><td class="desc">Basic class implementing a B+ tree data structure in memory </td></tr>
<tr id="row_1_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree_1_1const__iterator.html" target="_self">const_iterator</a></td><td class="desc">STL-like read-only iterator object for B+ tree items </td></tr>
<tr id="row_1_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree_1_1const__reverse__iterator.html" target="_self">const_reverse_iterator</a></td><td class="desc">STL-like read-only reverse iterator object for B+ tree items </td></tr>
<tr id="row_1_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1BTree_1_1InnerNode.html" target="_self">InnerNode</a></td><td class="desc">Extended structure of a inner node in-memory </td></tr>
<tr id="row_1_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree_1_1iterator.html" target="_self">iterator</a></td><td class="desc">STL-like iterator object for B+ tree items </td></tr>
<tr id="row_1_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1BTree_1_1LeafNode.html" target="_self">LeafNode</a></td><td class="desc">Extended structure of a leaf node in memory </td></tr>
<tr id="row_1_11_5_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1BTree_1_1node.html" target="_self">node</a></td><td class="desc">The header structure of each node in-memory </td></tr>
<tr id="row_1_11_6_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1BTree_1_1result__t.html" target="_self">result_t</a></td><td class="desc">B+ tree recursive deletion has much information which is needs to be passed upward </td></tr>
<tr id="row_1_11_7_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree_1_1reverse__iterator.html" target="_self">reverse_iterator</a></td><td class="desc">STL-like mutable reverse iterator object for B+ tree items </td></tr>
<tr id="row_1_11_8_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1BTree_1_1tree__stats.html" target="_self">tree_stats</a></td><td class="desc">A small struct containing basic statistics about the B+ tree </td></tr>
<tr id="row_1_11_9_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1BTree_1_1value__compare.html" target="_self">value_compare</a></td><td class="desc">Function class to compare value_type objects. Required by the STL </td></tr>
<tr id="row_1_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1btree__default__traits.html" target="_self">btree_default_traits</a></td><td class="desc">Generates default traits for a B+ tree used as a set or map </td></tr>
<tr id="row_1_13_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_13_" class="arrow" onclick="toggleFolder('1_13_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1btree__map.html" target="_self">btree_map</a></td><td class="desc">Specialized B+ tree template class implementing STL's map container </td></tr>
<tr id="row_1_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1btree__map_1_1key__of__value.html" target="_self">key_of_value</a></td><td class="desc">Key Extractor Struct </td></tr>
<tr id="row_1_14_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_14_" class="arrow" onclick="toggleFolder('1_14_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1btree__multimap.html" target="_self">btree_multimap</a></td><td class="desc">Specialized B+ tree template class implementing STL's multimap container </td></tr>
<tr id="row_1_14_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1btree__multimap_1_1key__of__value.html" target="_self">key_of_value</a></td><td class="desc">Key Extractor Struct </td></tr>
<tr id="row_1_15_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_15_" class="arrow" onclick="toggleFolder('1_15_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1btree__multiset.html" target="_self">btree_multiset</a></td><td class="desc">Specialized B+ tree template class implementing STL's multiset container </td></tr>
<tr id="row_1_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1btree__multiset_1_1key__of__value.html" target="_self">key_of_value</a></td><td class="desc">Key Extractor Struct </td></tr>
<tr id="row_1_16_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_16_" class="arrow" onclick="toggleFolder('1_16_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1btree__set.html" target="_self">btree_set</a></td><td class="desc">Specialized B+ tree template class implementing STL's set container </td></tr>
<tr id="row_1_16_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1btree__set_1_1key__of__value.html" target="_self">key_of_value</a></td><td class="desc">Key Extractor Struct </td></tr>
<tr id="row_1_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1CmdlineParser.html" target="_self">CmdlineParser</a></td><td class="desc">Base class of all options and parameters </td></tr>
<tr id="row_1_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1CountingPtr.html" target="_self">CountingPtr</a></td><td class="desc">High-performance smart pointer used as a wrapping reference counting pointer </td></tr>
<tr id="row_1_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1CountingPtrDefaultDeleter.html" target="_self">CountingPtrDefaultDeleter</a></td><td class="desc">Default deleter for <a class="el" href="classtlx_1_1CountingPtr.html" title="High-performance smart pointer used as a wrapping reference counting pointer. ">CountingPtr</a> </td></tr>
<tr id="row_1_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1CountingPtrNoOperationDeleter.html" target="_self">CountingPtrNoOperationDeleter</a></td><td class="desc">Dummy deleter for <a class="el" href="classtlx_1_1CountingPtr.html" title="High-performance smart pointer used as a wrapping reference counting pointer. ">CountingPtr</a> </td></tr>
<tr id="row_1_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1DAryAddressableIntHeap.html" target="_self">DAryAddressableIntHeap</a></td><td class="desc">This class implements an addressable integer priority queue, precisely a d-ary heap </td></tr>
<tr id="row_1_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1DAryHeap.html" target="_self">DAryHeap</a></td><td class="desc">This class implements a d-ary comparison-based heap usable as a priority queue </td></tr>
<tr id="row_1_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1DefaultLoggerOutputCErr.html" target="_self">DefaultLoggerOutputCErr</a></td><td class="desc">Default output logger to cerr </td></tr>
<tr id="row_1_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1DefaultLoggerOutputCOut.html" target="_self">DefaultLoggerOutputCOut</a></td><td class="desc">Default output logger to cout </td></tr>
<tr id="row_1_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Delegate.html" target="_self">Delegate</a></td><td class="desc"></td></tr>
<tr id="row_1_26_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_26_" class="arrow" onclick="toggleFolder('1_26_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Delegate_3_01R_07A_8_8_8_08_00_01Allocator_01_4.html" target="_self">Delegate< R(A...), Allocator ></a></td><td class="desc">This is a faster replacement than std::function </td></tr>
<tr id="row_1_26_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1Delegate_3_01R_07A_8_8_8_08_00_01Allocator_01_4_1_1IsConstMemberPair.html" target="_self">IsConstMemberPair</a></td><td class="desc">Template for const class::function selector </td></tr>
<tr id="row_1_26_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1Delegate_3_01R_07A_8_8_8_08_00_01Allocator_01_4_1_1IsConstMemberPair_3_01ConstMemberPair_3_01C_01_4_01_4.html" target="_self">IsConstMemberPair< ConstMemberPair< C > ></a></td><td class="desc">Specialization for const class::function selector </td></tr>
<tr id="row_1_26_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1Delegate_3_01R_07A_8_8_8_08_00_01Allocator_01_4_1_1IsMemberPair.html" target="_self">IsMemberPair</a></td><td class="desc">Template for class::function selector </td></tr>
<tr id="row_1_26_3_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1Delegate_3_01R_07A_8_8_8_08_00_01Allocator_01_4_1_1IsMemberPair_3_01MemberPair_3_01C_01_4_01_4.html" target="_self">IsMemberPair< MemberPair< C > ></a></td><td class="desc">Specialization for class::function selector </td></tr>
<tr id="row_1_27_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1DieException.html" target="_self">DieException</a></td><td class="desc">Exception thrown by <a class="el" href="namespacetlx.html#a1a4f198a88970a7cb1f5d8d3a0555b79" title="die with message - either throw an exception or die via std::terminate() ">die_with_message()</a> if </td></tr>
<tr id="row_1_28_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1enable__if.html" target="_self">enable_if</a></td><td class="desc">SFINAE <a class="el" href="structtlx_1_1enable__if.html" title="SFINAE enable_if – copy of std::enable_if<> with less extra cruft. ">enable_if</a> – copy of std::enable_if<> with less extra cruft </td></tr>
<tr id="row_1_29_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1enable__if_3_01true_00_01T_01_4.html" target="_self">enable_if< true, T ></a></td><td class="desc"></td></tr>
<tr id="row_1_30_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1FunctionChain.html" target="_self">FunctionChain</a></td><td class="desc">A <a class="el" href="classtlx_1_1FunctionChain.html" title="A FunctionChain is a chain of functors that can be folded to a single functors. ">FunctionChain</a> is a chain of functors that can be folded to a single functors </td></tr>
<tr id="row_1_31_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1FunctionStack.html" target="_self">FunctionStack</a></td><td class="desc">A <a class="el" href="classtlx_1_1FunctionStack.html" title="A FunctionStack is a chain of functor that can be folded to a single functor (which is usually optimi...">FunctionStack</a> is a chain of functor that can be folded to a single functor (which is usually optimize by the compiler) </td></tr>
<tr id="row_1_32_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1has__ostream__operator.html" target="_self">has_ostream_operator</a></td><td class="desc">SFINAE magic helper for <a class="el" href="namespacetlx.html#a4685dbcbe251d930c560b5071ece8049" title="SFINAE magic to return "<unprintable>" instead if the value HAS NO ostream operator << available...">wrap_unprintable()</a> </td></tr>
<tr id="row_1_33_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1index__sequence.html" target="_self">index_sequence</a></td><td class="desc"></td></tr>
<tr id="row_1_34_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__array.html" target="_self">is_std_array</a></td><td class="desc">Test if is std::array<T, N> </td></tr>
<tr id="row_1_35_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__array_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html" target="_self">is_std_array< std::array< T, N > ></a></td><td class="desc"></td></tr>
<tr id="row_1_36_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__pair.html" target="_self">is_std_pair</a></td><td class="desc">Test if is a std::pair<...> </td></tr>
<tr id="row_1_37_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__pair_3_01std_1_1pair_3_01S_00_01T_01_4_01_4.html" target="_self">is_std_pair< std::pair< S, T > ></a></td><td class="desc"></td></tr>
<tr id="row_1_38_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__tuple.html" target="_self">is_std_tuple</a></td><td class="desc">Test if is a std::tuple<...> </td></tr>
<tr id="row_1_39_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__tuple_3_01std_1_1tuple_3_01Ts_8_8_8_01_4_01_4.html" target="_self">is_std_tuple< std::tuple< Ts... > ></a></td><td class="desc"></td></tr>
<tr id="row_1_40_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__vector.html" target="_self">is_std_vector</a></td><td class="desc">Test if is std::vector<T> </td></tr>
<tr id="row_1_41_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1is__std__vector_3_01std_1_1vector_3_01T_01_4_01_4.html" target="_self">is_std_vector< std::vector< T > ></a></td><td class="desc"></td></tr>
<tr id="row_1_42_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1less__icase__asc.html" target="_self">less_icase_asc</a></td><td class="desc">Case-insensitive less order relation functional class for std::map, etc </td></tr>
<tr id="row_1_43_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1less__icase__desc.html" target="_self">less_icase_desc</a></td><td class="desc">Descending case-insensitive less order relation functional class for std::map, etc </td></tr>
<tr id="row_1_44_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LevenshteinStandardICaseParameters.html" target="_self">LevenshteinStandardICaseParameters</a></td><td class="desc">Standard parameters to Levenshtein distance function </td></tr>
<tr id="row_1_45_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LevenshteinStandardParameters.html" target="_self">LevenshteinStandardParameters</a></td><td class="desc">Standard parameters to levenshtein distance function </td></tr>
<tr id="row_1_46_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2.html" target="_self">Log2</a></td><td class="desc"></td></tr>
<tr id="row_1_47_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2_3_010_01_4.html" target="_self">Log2< 0 ></a></td><td class="desc"></td></tr>
<tr id="row_1_48_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2_3_011_01_4.html" target="_self">Log2< 1 ></a></td><td class="desc"></td></tr>
<tr id="row_1_49_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2Floor.html" target="_self">Log2Floor</a></td><td class="desc"></td></tr>
<tr id="row_1_50_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2Floor_3_010_01_4.html" target="_self">Log2Floor< 0 ></a></td><td class="desc"></td></tr>
<tr id="row_1_51_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Log2Floor_3_011_01_4.html" target="_self">Log2Floor< 1 ></a></td><td class="desc"></td></tr>
<tr id="row_1_52_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Logger.html" target="_self">Logger</a></td><td class="desc">LOG and sLOG for development and debugging </td></tr>
<tr id="row_1_53_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerCollectOutput.html" target="_self">LoggerCollectOutput</a></td><td class="desc">Class to hook logger output in the local thread </td></tr>
<tr id="row_1_54_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter.html" target="_self">LoggerFormatter</a></td><td class="desc">Template class for formatting. contains a print() method </td></tr>
<tr id="row_1_55_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01AnyType_01_4.html" target="_self">LoggerFormatter< AnyType ></a></td><td class="desc"></td></tr>
<tr id="row_1_56_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html" target="_self">LoggerFormatter< std::array< T, N > ></a></td><td class="desc"></td></tr>
<tr id="row_1_57_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1deque_3_01T_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::deque< T, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_58_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1map_3_01K_00_01V_00_01C_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::map< K, V, C, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_59_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1multimap_3_01K_00_01V_00_01C_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::multimap< K, V, C, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_60_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1multiset_3_01T_00_01C_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::multiset< T, C, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_61_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1pair_3_01A_00_01B_01_4_01_4.html" target="_self">LoggerFormatter< std::pair< A, B > ></a></td><td class="desc"></td></tr>
<tr id="row_1_62_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1set_3_01T_00_01C_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::set< T, C, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_63_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html" target="_self">LoggerFormatter< std::tuple< Args... > ></a></td><td class="desc"></td></tr>
<tr id="row_1_64_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1tuple_3_4_01_4.html" target="_self">LoggerFormatter< std::tuple<> ></a></td><td class="desc"></td></tr>
<tr id="row_1_65_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1unordered__map_3_01K_00_01V_00_01H_00_01E_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::unordered_map< K, V, H, E, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_66_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1unordered__multimap_3_01K_00_01V_00_01H_00_01E_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::unordered_multimap< K, V, H, E, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_67_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1unordered__multiset_3_01T_00_01H_00_01E_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::unordered_multiset< T, H, E, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_68_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1unordered__set_3_01T_00_01H_00_01E_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::unordered_set< T, H, E, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_69_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerFormatter_3_01std_1_1vector_3_01T_00_01A_01_4_01_4.html" target="_self">LoggerFormatter< std::vector< T, A > ></a></td><td class="desc"></td></tr>
<tr id="row_1_70_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerOutputHook.html" target="_self">LoggerOutputHook</a></td><td class="desc">Abstract class to implement output hooks for logging </td></tr>
<tr id="row_1_71_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerPrefixHook.html" target="_self">LoggerPrefixHook</a></td><td class="desc">Abstract class to implement prefix output hooks for logging </td></tr>
<tr id="row_1_72_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerTupleFormatter.html" target="_self">LoggerTupleFormatter</a></td><td class="desc"></td></tr>
<tr id="row_1_73_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoggerVoidify.html" target="_self">LoggerVoidify</a></td><td class="desc"></td></tr>
<tr id="row_1_74_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopy.html" target="_self">LoserTreeCopy</a></td><td class="desc">Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index </td></tr>
<tr id="row_1_75_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopy_3_01true_00_01ValueType_00_01Comparator_01_4.html" target="_self">LoserTreeCopy< true, ValueType, Comparator ></a></td><td class="desc">Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index </td></tr>
<tr id="row_1_76_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_76_" class="arrow" onclick="toggleFolder('1_76_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopyBase.html" target="_self">LoserTreeCopyBase</a></td><td class="desc">Guarded loser tree/tournament tree, either copying the whole element into the tree structure, or looking up the element via the index </td></tr>
<tr id="row_1_76_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LoserTreeCopyBase_1_1Loser.html" target="_self">Loser</a></td><td class="desc">Internal representation of a loser tree player/node </td></tr>
<tr id="row_1_77_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopyUnguarded.html" target="_self">LoserTreeCopyUnguarded</a></td><td class="desc"></td></tr>
<tr id="row_1_78_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopyUnguarded_3_01true_00_01ValueType_00_01Comparator_01_4.html" target="_self">LoserTreeCopyUnguarded< true, ValueType, Comparator ></a></td><td class="desc"></td></tr>
<tr id="row_1_79_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_79_" class="arrow" onclick="toggleFolder('1_79_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeCopyUnguardedBase.html" target="_self">LoserTreeCopyUnguardedBase</a></td><td class="desc">Unguarded loser tree, copying the whole element into the tree structure </td></tr>
<tr id="row_1_79_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LoserTreeCopyUnguardedBase_1_1Loser.html" target="_self">Loser</a></td><td class="desc">Internal representation of a loser tree player/node </td></tr>
<tr id="row_1_80_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointer.html" target="_self">LoserTreePointer</a></td><td class="desc">Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes </td></tr>
<tr id="row_1_81_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointer_3_01true_00_01ValueType_00_01Comparator_01_4.html" target="_self">LoserTreePointer< true, ValueType, Comparator ></a></td><td class="desc">Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes </td></tr>
<tr id="row_1_82_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_82_" class="arrow" onclick="toggleFolder('1_82_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointerBase.html" target="_self">LoserTreePointerBase</a></td><td class="desc">Guarded loser tree, using pointers to the elements instead of copying them into the tree nodes </td></tr>
<tr id="row_1_82_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LoserTreePointerBase_1_1Loser.html" target="_self">Loser</a></td><td class="desc">Internal representation of a loser tree player/node </td></tr>
<tr id="row_1_83_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointerUnguarded.html" target="_self">LoserTreePointerUnguarded</a></td><td class="desc"></td></tr>
<tr id="row_1_84_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointerUnguarded_3_01true_00_01ValueType_00_01Comparator_01_4.html" target="_self">LoserTreePointerUnguarded< true, ValueType, Comparator ></a></td><td class="desc"></td></tr>
<tr id="row_1_85_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_85_" class="arrow" onclick="toggleFolder('1_85_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreePointerUnguardedBase.html" target="_self">LoserTreePointerUnguardedBase</a></td><td class="desc">Unguarded loser tree, keeping only pointers to the elements in the tree structure </td></tr>
<tr id="row_1_85_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1LoserTreePointerUnguardedBase_1_1Loser.html" target="_self">Loser</a></td><td class="desc">Internal representation of a loser tree player/node </td></tr>
<tr id="row_1_86_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LoserTreeSwitch.html" target="_self">LoserTreeSwitch</a></td><td class="desc"></td></tr>
<tr id="row_1_87_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LruCacheMap.html" target="_self">LruCacheMap</a></td><td class="desc">This is an expected O(1) LRU cache which contains a map of (key -> value) elements </td></tr>
<tr id="row_1_88_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1LruCacheSet.html" target="_self">LruCacheSet</a></td><td class="desc">This is an expected O(1) LRU cache which contains a set of key-only elements </td></tr>
<tr id="row_1_89_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1make__index__sequence.html" target="_self">make_index_sequence</a></td><td class="desc"></td></tr>
<tr id="row_1_90_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1MD5.html" target="_self">MD5</a></td><td class="desc">MD-5 processor without external dependencies </td></tr>
<tr id="row_1_91_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_91_" class="arrow" onclick="toggleFolder('1_91_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1MultiTimer.html" target="_self">MultiTimer</a></td><td class="desc"><a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a> can be used to measure time usage of different phases in a program or algorithm </td></tr>
<tr id="row_1_91_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1MultiTimer_1_1Entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_1_92_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1NoOperation.html" target="_self">NoOperation</a></td><td class="desc">The noop functor, which takes any arguments and does nothing </td></tr>
<tr id="row_1_93_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1NoOperation_3_01void_01_4.html" target="_self">NoOperation< void ></a></td><td class="desc">Specialized noop functor which returns a void </td></tr>
<tr id="row_1_94_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_94_" class="arrow" onclick="toggleFolder('1_94_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1PolynomialRegression.html" target="_self">PolynomialRegression</a></td><td class="desc">Calculate the regression polynomial \( a_0+a_1x^1+a_2x^2+\cdots+a_nx^n \) from a list of 2D points </td></tr>
<tr id="row_1_94_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1PolynomialRegression_1_1Coefficients.html" target="_self">Coefficients</a></td><td class="desc">Polynomial stored as the coefficients of \( a_0+a_1 x^1+a_2 x^2+\cdots+a_n x^n \) </td></tr>
<tr id="row_1_94_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1PolynomialRegression_1_1Point.html" target="_self">Point</a></td><td class="desc">2D point </td></tr>
<tr id="row_1_95_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1RadixHeap.html" target="_self">RadixHeap</a></td><td class="desc">This class implements a monotonic integer min priority queue, more specific a multi-level radix heap </td></tr>
<tr id="row_1_96_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ReferenceCounter.html" target="_self">ReferenceCounter</a></td><td class="desc">Provides reference counting abilities for use with <a class="el" href="classtlx_1_1CountingPtr.html" title="High-performance smart pointer used as a wrapping reference counting pointer. ">CountingPtr</a> </td></tr>
<tr id="row_1_97_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1RingBuffer.html" target="_self">RingBuffer</a></td><td class="desc">A ring (circular) buffer of static (non-growing) size </td></tr>
<tr id="row_1_98_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ScopedMultiTimer.html" target="_self">ScopedMultiTimer</a></td><td class="desc">Independent RAII Scoped <a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a>: contains a <a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a> which is started with the given timer, and added to the base <a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a> on destruction </td></tr>
<tr id="row_1_99_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ScopedMultiTimerSwitch.html" target="_self">ScopedMultiTimerSwitch</a></td><td class="desc">RAII Scoped <a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a> switcher: switches the timer of a <a class="el" href="classtlx_1_1MultiTimer.html" title="MultiTimer can be used to measure time usage of different phases in a program or algorithm. ">MultiTimer</a> on construction and back to old one on destruction </td></tr>
<tr id="row_1_100_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1Semaphore.html" target="_self">Semaphore</a></td><td class="desc">A simple semaphore implementation using C++11 synchronization methods </td></tr>
<tr id="row_1_101_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SHA1.html" target="_self">SHA1</a></td><td class="desc">SHA-1 processor without external dependencies </td></tr>
<tr id="row_1_102_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SHA256.html" target="_self">SHA256</a></td><td class="desc">SHA-256 processor without external dependencies </td></tr>
<tr id="row_1_103_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SHA512.html" target="_self">SHA512</a></td><td class="desc">SHA-512 processor without external dependencies </td></tr>
<tr id="row_1_104_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SimpleVector.html" target="_self">SimpleVector</a></td><td class="desc">Simpler non-growing vector without initialization </td></tr>
<tr id="row_1_105_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SpacingLogger.html" target="_self">SpacingLogger</a></td><td class="desc">A logging class which outputs spaces between elements pushed via operator<< </td></tr>
<tr id="row_1_106_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_106_" class="arrow" onclick="toggleFolder('1_106_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1SplayTree.html" target="_self">SplayTree</a></td><td class="desc"></td></tr>
<tr id="row_1_106_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1SplayTree_1_1Node.html" target="_self">Node</a></td><td class="desc">Splay tree node, also seen as public iterator </td></tr>
<tr id="row_1_107_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_107_" class="arrow" onclick="toggleFolder('1_107_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1StackAllocator.html" target="_self">StackAllocator</a></td><td class="desc"></td></tr>
<tr id="row_1_107_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1StackAllocator_1_1rebind.html" target="_self">rebind</a></td><td class="desc">Required rebind </td></tr>
<tr id="row_1_108_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_108_" class="arrow" onclick="toggleFolder('1_108_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1StackArena.html" target="_self">StackArena</a></td><td class="desc">Storage area allocated on the stack and usable by a <a class="el" href="classtlx_1_1StackAllocator.html">StackAllocator</a> </td></tr>
<tr id="row_1_108_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="uniontlx_1_1StackArena_1_1AlignmentHelper.html" target="_self">AlignmentHelper</a></td><td class="desc">Union to enforce alignment of buffer area </td></tr>
<tr id="row_1_109_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structtlx_1_1StaticIndex.html" target="_self">StaticIndex</a></td><td class="desc">Helper for <a class="el" href="group__tlx__meta.html#ga9a8854506459ec185c2bcbdd6fe6428b" title="Call a generic functor (like a generic lambda) for each variadic template argument together with its ...">call_foreach_with_index()</a> to save the index as a compile-time index </td></tr>
<tr id="row_1_110_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1StringView.html" target="_self">StringView</a></td><td class="desc"><a class="el" href="classtlx_1_1StringView.html" title="StringView is a reference to a part of a string, consisting of only a char pointer and a length...">StringView</a> is a reference to a part of a string, consisting of only a char pointer and a length </td></tr>
<tr id="row_1_111_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ThreadBarrierMutex.html" target="_self">ThreadBarrierMutex</a></td><td class="desc">Implements a thread barrier using mutex locking and condition variables that can be used to synchronize threads </td></tr>
<tr id="row_1_112_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ThreadBarrierSpin.html" target="_self">ThreadBarrierSpin</a></td><td class="desc">Implements a thread barrier using atomics and a spin lock that can be used to synchronize threads </td></tr>
<tr id="row_1_113_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classtlx_1_1ThreadPool.html" target="_self">ThreadPool</a></td><td class="desc"><a class="el" href="classtlx_1_1ThreadPool.html" title="ThreadPool starts a fixed number p of std::threads which process Jobs that are enqueued into a concur...">ThreadPool</a> starts a fixed number p of std::threads which process Jobs that are <a class="el" href="classtlx_1_1ThreadPool.html#ac0197b1301f4bec0f2421cfe41e9435a">enqueued</a> into a concurrent job queue </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated on Sat Oct 2 2021 20:29:01 for tlx by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.11 </li>
</ul>
</div>
</body>
</html>