-
Notifications
You must be signed in to change notification settings - Fork 119
/
Copy pathhtrie__hash_8h_source.html
115 lines (113 loc) · 291 KB
/
htrie__hash_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
<!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>Clause: src/hat-trie/include/tsl/htrie_hash.h 源文件</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>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</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">Clause
 <span id="projectnumber">1.0</span>
</div>
<div id="projectbrief">Chatopera Language Understanding Service.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- 制作者 Doxygen 1.8.11 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>首页</span></a></li>
<li><a href="pages.html"><span>相关页面</span></a></li>
<li><a href="modules.html"><span>模块</span></a></li>
<li><a href="namespaces.html"><span>命名空间</span></a></li>
<li><a href="annotated.html"><span>类</span></a></li>
<li class="current"><a href="files.html"><span>文件</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="搜索" 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><a href="files.html"><span>文件列表</span></a></li>
</ul>
</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_8de35a112afe11bbc1e373705286d1f4.html">hat-trie</a></li><li class="navelem"><a class="el" href="dir_bf40197352127bca97b32a70eddad7d5.html">include</a></li><li class="navelem"><a class="el" href="dir_d63c2e6fb2c19bee7e35bf7e1c5514f8.html">tsl</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="headertitle">
<div class="title">htrie_hash.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#ifndef TSL_HTRIE_HASH_H</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#define TSL_HTRIE_HASH_H</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> </div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include <array></span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include <cmath></span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include <cstddef></span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <cstring></span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <iterator></span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <stdexcept></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <type_traits></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <utility></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "array-hash/array_map.h"</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "array-hash/array_set.h"</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> </div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">/*</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * __has_include is a bit useless (https://gcc.gnu.org/bugzilla/show_bug.cgi?id=79433),</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * check also __cplusplus version.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> */</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#ifdef __has_include</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor"># if __has_include(<string_view>) && __cplusplus >= 201703L</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor"># define TSL_HT_HAS_STRING_VIEW</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor"># endif</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> </div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#ifdef TSL_HT_HAS_STRING_VIEW</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor"># include <string_view></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> </div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#ifdef TSL_DEBUG</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"># define tsl_ht_assert(expr) assert(expr)</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor"># define tsl_ht_assert(expr) (static_cast<void>(0))</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> </div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="keyword">namespace </span><a class="code" href="namespacetsl.html">tsl</a> { </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">namespace </span>detail_htrie_hash {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keywordtype">void</span>></div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1is__iterator.html"> 73</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1is__iterator.html">is_iterator</a>: std::false_type {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> };</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1is__iterator_3_01T_00_01typename_01std_1_1enable__if_3_9std_04ed40b83a61a20bf1aab116d00a963d.html"> 77</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1is__iterator.html">is_iterator</a><T, typename <a class="code" href="namespacestd.html">std</a>::enable_if<!std::is_same<typename std::iterator_traits<T>::iterator_category, void>::value>::type>: std::true_type {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> };</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">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span>... U></div><div class="line"><a name="l00081"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1is__related.html"> 81</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1is__related.html">is_related</a>: std::false_type {};</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">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> U></div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1is__related_3_01T_00_01U_01_4.html"> 84</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1is__related.html">is_related</a><T, U>: std::is_same<typename std::remove_cv<typename std::remove_reference<T>::type>::type, </div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  typename std::remove_cv<typename std::remove_reference<U>::type>::type> {};</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> U></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="keyword">static</span> T numeric_cast(U value, <span class="keyword">const</span> <span class="keywordtype">char</span>* error_message = <span class="stringliteral">"numeric_cast() failed."</span>) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  T ret = <span class="keyword">static_cast<</span>T<span class="keyword">></span>(value);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span>(static_cast<U>(ret) != value) {</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">throw</span> std::runtime_error(error_message);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_same_signedness = (std::is_unsigned<T>::value && std::is_unsigned<U>::value) ||</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  (std::is_signed<T>::value && std::is_signed<U>::value);</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span>(!is_same_signedness && (ret < T{}) != (value < U{})) {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">throw</span> std::runtime_error(error_message);</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> ret;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">template</span><<span class="keyword">class</span> T></div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1value__node.html"> 105</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1value__node.html">value_node</a> {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">/*</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"> * Avoid confict with copy constructor 'value_node(const value_node&)'. If we call the copy constructor</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> * with a mutable reference 'value_node(value_node&)', we don't want the forward constructor to be called.</span></div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> */</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">template</span><<span class="keyword">class</span>... Args, <span class="keyword">typename</span> std::enable_if<!<a class="code" href="structtsl_1_1detail__htrie__hash_1_1is__related.html">is_related</a><<a class="code" href="structtsl_1_1detail__htrie__hash_1_1value__node.html">value_node</a>, Args...>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  value_node(Args&&... args): m_value(std::forward<Args>(args)...) {</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</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>  T m_value;</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> };</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keyword">template</span><></div><div class="line"><a name="l00118"></a><span class="lineno"><a class="line" href="structtsl_1_1detail__htrie__hash_1_1value__node_3_01void_01_4.html"> 118</a></span> <span class="keyword">struct </span><a class="code" href="structtsl_1_1detail__htrie__hash_1_1value__node_3_01void_01_4.html">value_node<void></a> {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> };</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="keyword">template</span><<span class="keyword">class </span>CharT,</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">class </span>T, </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">class </span>Hash,</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">class </span>KeySizeT></div><div class="line"><a name="l00129"></a><span class="lineno"><a class="line" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html"> 129</a></span> <span class="keyword">class </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a> {</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="keyword">private</span>: </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">using</span> has_value = <span class="keyword">typename</span> std::integral_constant<bool, !std::is_same<U, void>::value>;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  static_assert(std::is_same<CharT, char>::value, <span class="stringliteral">"char is the only supported CharT type for now."</span>);</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::size_t ALPHABET_SIZE = </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  std::numeric_limits<typename std::make_unsigned<CharT>::type>::max() + 1;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> IsConst, <span class="keywordtype">bool</span> IsPrefixIterator></div><div class="line"><a name="l00142"></a><span class="lineno"><a class="line" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html"> 142</a></span>  <span class="keyword">class </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">using</span> char_type = CharT;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">using</span> key_size_type = KeySizeT;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">using</span> size_type = std::size_t;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">using</span> hasher = Hash;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">using</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<false, false></a>;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">using</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<true, false></a>;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">using</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a> = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<false, true></a>;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">using</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<true, true></a>;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">using</span> array_hash_type = </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">typename</span> std::conditional<</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  has_value<T>::value, </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="classtsl_1_1array__map.html">tsl::array_map<CharT, T, Hash, tsl::ah::str_equal<CharT></a>, <span class="keyword">false</span>, </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  KeySizeT, std::uint16_t, <a class="code" href="classtsl_1_1ah_1_1power__of__two__growth__policy.html">tsl::ah::power_of_two_growth_policy<4></a>>,</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="code" href="classtsl_1_1array__set.html">tsl::array_set<CharT, Hash, tsl::ah::str_equal<CharT></a>, <span class="keyword">false</span>, </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  KeySizeT, std::uint16_t, tsl::ah::power_of_two_growth_policy<4>>>::type;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">/*</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"> * The tree is mainly composed of two nodes types: trie_node and hash_node which both have anode as base class.</span></div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"> * Each child is either a hash_node or a trie_node.</span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> * </span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> * A hash_node is always a leaf node, it doesn't have any child. </span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> * </span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> * Example:</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> * | ... | a |.. ..................... | f | ... | trie_node_1</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> * \ \</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"> * hash_node_1 |array_hash = {"dd"}| |...| a | ... | trie_node_2 </span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="comment"> * /</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="comment"> * |array_hash = {"ble", "bric", "lse"}| hash_node_2</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"> * </span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> * </span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * Each trie_node may also have a value node, which contains a value T, if the trie_node marks </span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * the end of a string value.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> * </span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * A trie node should at least have one child or a value node. There can't be a trie node without </span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * any child and no value node.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> */</span></div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">using</span> <a class="code" href="structtsl_1_1detail__htrie__hash_1_1value__node.html">value_node</a> = <a class="code" href="structtsl_1_1detail__htrie__hash_1_1value__node.html">tsl::detail_htrie_hash::value_node<T></a>;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">class </span>trie_node;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keyword">class </span>hash_node;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// TODO better encapsulate operations modifying the tree.</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keyword">class </span>anode {</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keyword">friend</span> <span class="keyword">class </span>trie_node;</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">/*</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * TODO Avoid the virtual to economise 8 bytes. We could use a custom deleter in the std::unique_ptr<anode></span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * we use (as we know if an anode is a trie_node or hash_node).</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> */</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">virtual</span> ~anode() = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordtype">bool</span> is_trie_node() const noexcept {</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordflow">return</span> m_node_type == node_type::TRIE_NODE;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordtype">bool</span> is_hash_node() const noexcept {</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> m_node_type == node_type::HASH_NODE;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  trie_node& as_trie_node() noexcept {</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  tsl_ht_assert(is_trie_node());</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>trie_node&<span class="keyword">></span>(*this);</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  hash_node& as_hash_node() noexcept {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  tsl_ht_assert(is_hash_node());</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>hash_node&<span class="keyword">></span>(*this);</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">const</span> trie_node& as_trie_node() const noexcept {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  tsl_ht_assert(is_trie_node());</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><span class="keyword">const </span>trie_node&<span class="keyword">></span>(*this);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> hash_node& as_hash_node() const noexcept {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  tsl_ht_assert(is_hash_node());</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><span class="keyword">const </span>hash_node&<span class="keyword">></span>(*this);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  }</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  CharT child_of_char() const noexcept {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  tsl_ht_assert(parent() != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">return</span> m_child_of_char;</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  }</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  trie_node* parent() noexcept {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">return</span> m_parent_node;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> trie_node* parent() const noexcept {</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> m_parent_node;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">enum class</span> node_type: unsigned char {</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  HASH_NODE,</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  TRIE_NODE</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  };</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  anode(node_type node_type_): m_node_type(node_type_), m_child_of_char(0), </div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  m_parent_node(nullptr) </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  anode(node_type node_type_, CharT child_of_char): m_node_type(node_type_), </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  m_child_of_char(child_of_char), </div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  m_parent_node(nullptr) </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  {</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  }</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  node_type m_node_type;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  CharT m_child_of_char;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  trie_node* m_parent_node;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  };</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// Give the position in trie_node::m_children corresponding to the character c</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">static</span> std::size_t as_position(CharT c) noexcept {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>std::size_t<span class="keyword">></span>(<span class="keyword">static_cast<</span>typename std::make_unsigned<CharT>::type<span class="keyword">></span>(c));</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  </div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keyword">class </span>trie_node: <span class="keyword">public</span> anode {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  trie_node(): anode(anode::node_type::TRIE_NODE),</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  m_value_node(nullptr), m_children() </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  {</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  trie_node(<span class="keyword">const</span> trie_node& other): anode(anode::node_type::TRIE_NODE, other.m_child_of_char),</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  m_value_node(nullptr), m_children()</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span>(other.m_value_node != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  m_value_node = make_unique<value_node>(*other.m_value_node);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  </div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// TODO avoid recursion</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordflow">for</span>(std::size_t ichild = 0; ichild < other.m_children.size(); ichild++) {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span>(other.m_children[ichild] != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span>(other.m_children[ichild]->is_hash_node()) {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  m_children[ichild] = make_unique<hash_node>(other.m_children[ichild]->as_hash_node());</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  m_children[ichild] = make_unique<trie_node>(other.m_children[ichild]->as_trie_node());</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  m_children[ichild]->m_parent_node = <span class="keyword">this</span>;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  </div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  trie_node(trie_node&& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  trie_node& operator=(<span class="keyword">const</span> trie_node& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  trie_node& operator=(trie_node&& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  anode* first_child() noexcept {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> <span class="keyword">const_cast<</span>anode*<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keyword">const </span>trie_node*<span class="keyword">></span>(<span class="keyword">this</span>)->first_child());</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> anode* first_child() const noexcept {</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">for</span>(std::size_t ichild = 0; ichild < m_children.size(); ichild++) {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span>(m_children[ichild] != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">return</span> m_children[ichild].get();</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  anode* next_child(<span class="keyword">const</span> anode& current_child) noexcept {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">return</span> <span class="keyword">const_cast<</span>anode*<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keyword">const </span>trie_node*<span class="keyword">></span>(<span class="keyword">this</span>)->next_child(current_child)); </div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  }</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keyword">const</span> anode* next_child(<span class="keyword">const</span> anode& current_child) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  tsl_ht_assert(current_child.parent() == <span class="keyword">this</span>);</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">for</span>(std::size_t ichild = as_position(current_child.child_of_char()) + 1; </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  ichild < m_children.size(); </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  ichild++) </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  {</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span>(m_children[ichild] != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> m_children[ichild].get();</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  }</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  trie_node& most_left_descendant_value_trie_node() noexcept {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">return</span> <span class="keyword">const_cast<</span>trie_node&<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keyword">const </span>trie_node*<span class="keyword">></span>(<span class="keyword">this</span>)->most_left_descendant_value_trie_node());</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  }</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  </div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keyword">const</span> trie_node& most_left_descendant_value_trie_node() const noexcept {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keyword">const</span> trie_node* current_node = <span class="keyword">this</span>;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">while</span>(<span class="keyword">true</span>) {</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">if</span>(current_node->m_value_node != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> *current_node;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">const</span> anode* first_child = current_node->first_child();</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  tsl_ht_assert(first_child != <span class="keyword">nullptr</span>); <span class="comment">// a trie_node must either have a value_node or at least one child.</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">if</span>(first_child->is_hash_node()) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">return</span> *current_node;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  </div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  current_node = &first_child->as_trie_node();</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  </div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  size_type nb_children() const noexcept {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> std::count_if(m_children.cbegin(), m_children.cend(), </div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  [](<span class="keyword">const</span> std::unique_ptr<anode>& n) { <span class="keywordflow">return</span> n != <span class="keyword">nullptr</span>; });</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  }</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keywordtype">bool</span> empty() const noexcept {</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">return</span> std::all_of(m_children.cbegin(), m_children.cend(), </div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  [](<span class="keyword">const</span> std::unique_ptr<anode>& n) { <span class="keywordflow">return</span> n == <span class="keyword">nullptr</span>; });</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  std::unique_ptr<anode>& child(CharT for_char) noexcept {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">return</span> m_children[as_position(for_char)];</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  </div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keyword">const</span> std::unique_ptr<anode>& child(CharT for_char) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">return</span> m_children[as_position(for_char)];</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  </div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keyword">typename</span> std::array<std::unique_ptr<anode>, ALPHABET_SIZE><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">::iterator</a> begin() noexcept {</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> m_children.begin();</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">typename</span> std::array<std::unique_ptr<anode>, ALPHABET_SIZE><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">::iterator</a> end() noexcept {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> m_children.end();</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordtype">void</span> set_child(CharT for_char, std::unique_ptr<anode> child) noexcept {</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">if</span>(child != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  child->m_child_of_char = for_char;</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  child->m_parent_node = <span class="keyword">this</span>;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  m_children[as_position(for_char)] = std::move(child);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  std::unique_ptr<value_node>& val_node() noexcept {</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">return</span> m_value_node;</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">const</span> std::unique_ptr<value_node>& val_node() const noexcept {</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">return</span> m_value_node;</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  </div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// TODO Avoid storing a value_node when has_value<T>::value is false</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  std::unique_ptr<value_node> m_value_node;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  std::array<std::unique_ptr<anode>, ALPHABET_SIZE> m_children;</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  };</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  </div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> </div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keyword">class </span>hash_node: <span class="keyword">public</span> anode {</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  hash_node(<span class="keyword">const</span> Hash& hash, <span class="keywordtype">float</span> max_load_factor): </div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  hash_node(HASH_NODE_DEFAULT_INIT_BUCKETS_COUNT, hash, max_load_factor) </div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  }</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  hash_node(size_type bucket_count, <span class="keyword">const</span> Hash& hash, <span class="keywordtype">float</span> max_load_factor): </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  anode(anode::node_type::HASH_NODE), m_array_hash(bucket_count, hash) </div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  {</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  m_array_hash.max_load_factor(max_load_factor);</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  hash_node(array_hash_type&& array_hash) noexcept(std::is_nothrow_move_constructible<array_hash_type>::value): </div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  anode(anode::node_type::HASH_NODE), m_array_hash(std::move(array_hash)) </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  hash_node(<span class="keyword">const</span> hash_node& other) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  hash_node(hash_node&& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  hash_node& operator=(<span class="keyword">const</span> hash_node& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  hash_node& operator=(hash_node&& other) = <span class="keyword">delete</span>;</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  </div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  array_hash_type& array_hash() noexcept {</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">return</span> m_array_hash;</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="keyword">const</span> array_hash_type& array_hash() const noexcept {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">return</span> m_array_hash;</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  array_hash_type m_array_hash;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  };</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> IsConst, <span class="keywordtype">bool</span> IsPrefixIterator></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keyword">class </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a> {</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">using</span> anode_type = <span class="keyword">typename</span> std::conditional<IsConst, const anode, anode>::type;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">using</span> trie_node_type = <span class="keyword">typename</span> std::conditional<IsConst, const trie_node, trie_node>::type;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">using</span> hash_node_type = <span class="keyword">typename</span> std::conditional<IsConst, const hash_node, hash_node>::type;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keyword">using</span> array_hash_iterator_type = </div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keyword">typename</span> std::conditional<IsConst, </div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">typename</span> array_hash_type::const_iterator, </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keyword">typename</span> array_hash_type::iterator>::type;</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keyword">using</span> iterator_category = std::forward_iterator_tag;</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">using</span> value_type = <span class="keyword">typename</span> std::conditional<has_value<T>::value, T, <span class="keywordtype">void</span>>::type;</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">using</span> difference_type = std::ptrdiff_t;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keyword">using</span> reference = <span class="keyword">typename</span> std::conditional<</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  has_value<T>::value, </div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keyword">typename</span> std::conditional<IsConst, </div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">typename</span> std::add_lvalue_reference<const T>::type,</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">typename</span> std::add_lvalue_reference<T>::type>::type, </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordtype">void</span>>::type;</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">using</span> pointer = <span class="keyword">typename</span> std::conditional<</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  has_value<T>::value, </div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">typename</span> std::conditional<IsConst, const T*, T*>::type, </div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordtype">void</span>>::type;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(hash_node_type& start_hash_node) noexcept: </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(start_hash_node, start_hash_node.array_hash().begin())</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  {</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(hash_node_type& start_hash_node, array_hash_iterator_type begin) noexcept: </div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  m_current_trie_node(start_hash_node.parent()), m_current_hash_node(&start_hash_node),</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  m_array_hash_iterator(begin),</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  m_array_hash_end_iterator(start_hash_node.array_hash().end()),</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  m_read_trie_node_value(<span class="keyword">false</span>)</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  {</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  tsl_ht_assert(!m_current_hash_node->array_hash().empty());</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  </div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(trie_node_type& start_trie_node) noexcept:</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  m_current_trie_node(&start_trie_node), m_current_hash_node(<span class="keyword">nullptr</span>),</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  m_read_trie_node_value(<span class="keyword">true</span>)</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  {</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  tsl_ht_assert(m_current_trie_node->val_node() != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  template<bool P = IsPrefixIterator, typename std::enable_if<!P>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(trie_node_type* tnode, hash_node_type* hnode, </div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  array_hash_iterator_type begin, array_hash_iterator_type end, </div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordtype">bool</span> read_trie_node_value) noexcept:</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  m_current_trie_node(tnode), m_current_hash_node(hnode), </div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  m_array_hash_iterator(begin), m_array_hash_end_iterator(end),</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  m_read_trie_node_value(read_trie_node_value)</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  {</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  template<bool P = IsPrefixIterator, typename std::enable_if<P>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(trie_node_type* tnode, hash_node_type* hnode, </div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  array_hash_iterator_type begin, array_hash_iterator_type end, </div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordtype">bool</span> read_trie_node_value, std::basic_string<CharT> prefix_filter) noexcept:</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  m_current_trie_node(tnode), m_current_hash_node(hnode), </div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  m_array_hash_iterator(begin), m_array_hash_end_iterator(end),</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  m_read_trie_node_value(read_trie_node_value), m_prefix_filter(std::move(prefix_filter))</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  {</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  }</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>() noexcept {</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  }</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> </div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// Copy constructor from iterator to const_iterator.</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> TIsConst = IsConst, <span class="keywordtype">bool</span> TIsPrefixIterator = IsPrefixIterator, </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keyword">typename</span> std::enable_if<TIsConst && !TIsPrefixIterator>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<!TIsConst, TIsPrefixIterator></a>& other) noexcept: </div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  m_current_trie_node(other.m_current_trie_node), m_current_hash_node(other.m_current_hash_node), </div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  m_array_hash_iterator(other.m_array_hash_iterator), </div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  m_array_hash_end_iterator(other.m_array_hash_end_iterator), </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  m_read_trie_node_value(other.m_read_trie_node_value)</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  </div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// Copy constructor from iterator to const_iterator.</span></div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keyword">template</span><<span class="keywordtype">bool</span> TIsConst = IsConst, <span class="keywordtype">bool</span> TIsPrefixIterator = IsPrefixIterator, </div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="keyword">typename</span> std::enable_if<TIsConst && TIsPrefixIterator>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator<!TIsConst, TIsPrefixIterator></a>& other) noexcept: </div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  m_current_trie_node(other.m_current_trie_node), m_current_hash_node(other.m_current_hash_node), </div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  m_array_hash_iterator(other.m_array_hash_iterator), </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  m_array_hash_end_iterator(other.m_array_hash_end_iterator), </div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  m_read_trie_node_value(other.m_read_trie_node_value), m_prefix_filter(other.m_prefix_filter)</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  {</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> </div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& other) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>&& other) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& operator=(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& other) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& operator=(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>&& other) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  </div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">void</span> key(std::basic_string<CharT>& key_buffer_out)<span class="keyword"> const </span>{</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  key_buffer_out.clear();</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  </div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  trie_node_type* tnode = m_current_trie_node;</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">while</span>(tnode != <span class="keyword">nullptr</span> && tnode->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  key_buffer_out.push_back(tnode->child_of_char());</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  tnode = tnode->parent();</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  std::reverse(key_buffer_out.begin(), key_buffer_out.end());</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  </div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">if</span>(!m_read_trie_node_value) {</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  tsl_ht_assert(m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">if</span>(m_current_hash_node->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  key_buffer_out.push_back(m_current_hash_node->child_of_char());</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  </div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  key_buffer_out.append(m_array_hash_iterator.key(), m_array_hash_iterator.key_size());</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  }</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  std::basic_string<CharT> key()<span class="keyword"> const </span>{</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  std::basic_string<CharT> key_buffer;</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  key(key_buffer);</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  </div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">return</span> key_buffer;</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  </div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  reference value()<span class="keyword"> const </span>{</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">if</span>(this->m_read_trie_node_value) {</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  tsl_ht_assert(this->m_current_trie_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  tsl_ht_assert(this->m_current_trie_node->val_node() != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  </div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">return</span> this->m_current_trie_node->val_node()->m_value;</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">return</span> this->m_array_hash_iterator.value();</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  reference operator*()<span class="keyword"> const </span>{</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">return</span> value();</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  }</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  </div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  pointer operator->()<span class="keyword"> const </span>{</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> std::addressof(value());</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& operator++() {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">if</span>(m_read_trie_node_value) {</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  tsl_ht_assert(m_current_trie_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  m_read_trie_node_value = <span class="keyword">false</span>;</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  </div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  anode_type* child = m_current_trie_node->first_child();</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">if</span>(child != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  set_most_left_descendant_as_next_node(*child);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  }</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(m_current_trie_node->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  trie_node_type* current_node_child = m_current_trie_node;</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  m_current_trie_node = m_current_trie_node->parent();</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  </div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  set_next_node_ascending(*current_node_child);</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  }</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  set_as_end_iterator();</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  ++m_array_hash_iterator;</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span>(m_array_hash_iterator != m_array_hash_end_iterator) {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  filter_prefix();</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  }</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// End of the road, set the iterator as an end node.</span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(m_current_trie_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  set_as_end_iterator();</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  tsl_ht_assert(m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  set_next_node_ascending(*m_current_hash_node);</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  }</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  </div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  </div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  }</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  </div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a> operator++(<span class="keywordtype">int</span>) {</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a> tmp(*<span class="keyword">this</span>);</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  ++*<span class="keyword">this</span>;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  </div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keywordflow">return</span> tmp;</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  }</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  </div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& lhs, <span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& rhs) { </div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keywordflow">if</span>(lhs.m_current_trie_node != rhs.m_current_trie_node || </div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  lhs.m_read_trie_node_value != rhs.m_read_trie_node_value)</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  {</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(lhs.m_read_trie_node_value) {</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  }</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">if</span>(lhs.m_current_hash_node != rhs.m_current_hash_node) {</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  }</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(lhs.m_current_hash_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordflow">return</span> lhs.m_array_hash_iterator == rhs.m_array_hash_iterator &&</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  lhs.m_array_hash_end_iterator == rhs.m_array_hash_end_iterator;</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  }</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  }</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  </div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& lhs, <span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">htrie_hash_iterator</a>& rhs) { </div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">return</span> !(lhs == rhs); </div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  }</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordtype">void</span> hash_node_prefix(std::basic_string<CharT>& key_buffer_out)<span class="keyword"> const </span>{</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  tsl_ht_assert(!m_read_trie_node_value);</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  key_buffer_out.clear();</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  </div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  trie_node_type* tnode = m_current_trie_node;</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">while</span>(tnode != <span class="keyword">nullptr</span> && tnode->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  key_buffer_out.push_back(tnode->child_of_char());</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  tnode = tnode->parent();</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  </div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::reverse(key_buffer_out.begin(), key_buffer_out.end());</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  </div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  tsl_ht_assert(m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordflow">if</span>(m_current_hash_node->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  key_buffer_out.push_back(m_current_hash_node->child_of_char());</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  }</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  }</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  </div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  template<bool P = IsPrefixIterator, typename std::enable_if<!P>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keywordtype">void</span> filter_prefix() {</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  } </div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  </div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  template<bool P = IsPrefixIterator, typename std::enable_if<P>::type* = <span class="keyword">nullptr</span>> </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keywordtype">void</span> filter_prefix() {</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  tsl_ht_assert(m_array_hash_iterator != m_array_hash_end_iterator);</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  tsl_ht_assert(!m_read_trie_node_value && m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  </div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">if</span>(m_prefix_filter.empty()) {</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  }</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  </div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordflow">while</span>((m_prefix_filter.size() > m_array_hash_iterator.key_size() ||</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  m_prefix_filter.compare(0, m_prefix_filter.size(),</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  m_array_hash_iterator.key(), m_prefix_filter.size()) != 0)) </div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  {</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  ++m_array_hash_iterator;</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">if</span>(m_array_hash_iterator == m_array_hash_end_iterator) {</div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="keywordflow">if</span>(m_current_trie_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  set_as_end_iterator();</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  tsl_ht_assert(m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  set_next_node_ascending(*m_current_hash_node);</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  }</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  </div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  }</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  }</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  </div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordtype">void</span> set_next_node_ascending(anode_type& current_trie_node_child) {</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  tsl_ht_assert(m_current_trie_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  tsl_ht_assert(current_trie_node_child.parent() == m_current_trie_node);</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  </div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  anode_type* next_node = m_current_trie_node->next_child(current_trie_node_child);</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">while</span>(next_node == <span class="keyword">nullptr</span> && m_current_trie_node->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  anode_type* current_child = m_current_trie_node;</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  m_current_trie_node = m_current_trie_node->parent();</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  next_node = m_current_trie_node->next_child(*current_child);</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  }</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  </div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="comment">// End of the road, set the iterator as an end node.</span></div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">if</span>(next_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  set_as_end_iterator();</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  }</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  set_most_left_descendant_as_next_node(*next_node);</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  }</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  </div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordtype">void</span> set_most_left_descendant_as_next_node(anode_type& search_start) {</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">if</span>(search_start.is_hash_node()) {</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  set_current_hash_node(search_start.as_hash_node());</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  }</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  m_current_trie_node = &search_start.as_trie_node().most_left_descendant_value_trie_node();</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">if</span>(m_current_trie_node->val_node() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  m_read_trie_node_value = <span class="keyword">true</span>;</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  anode_type* first_child = m_current_trie_node->first_child();</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="comment">// a trie_node must either have a value_node or at least one child.</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  tsl_ht_assert(first_child != <span class="keyword">nullptr</span>); </div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  </div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  set_current_hash_node(first_child->as_hash_node());</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  }</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  </div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keywordtype">void</span> set_current_hash_node(hash_node_type& hnode) {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  tsl_ht_assert(!hnode.array_hash().empty());</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  </div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  m_current_hash_node = &hnode;</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  m_array_hash_iterator = m_current_hash_node->array_hash().begin();</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  m_array_hash_end_iterator = m_current_hash_node->array_hash().end();</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  </div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keywordtype">void</span> set_as_end_iterator() {</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  m_current_trie_node = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  m_current_hash_node = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  m_read_trie_node_value = <span class="keyword">false</span>;</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  </div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keywordtype">void</span> skip_hash_node() {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  tsl_ht_assert(!m_read_trie_node_value && m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keywordflow">if</span>(m_current_trie_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  set_as_end_iterator();</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  }</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  tsl_ht_assert(m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  set_next_node_ascending(*m_current_hash_node);</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  }</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  }</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  </div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  trie_node_type* m_current_trie_node;</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  hash_node_type* m_current_hash_node;</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  </div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  array_hash_iterator_type m_array_hash_iterator;</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  array_hash_iterator_type m_array_hash_end_iterator;</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  </div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordtype">bool</span> m_read_trie_node_value;</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="comment">// TODO can't have void if !IsPrefixIterator, use inheritance</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keyword">typename</span> std::conditional<IsPrefixIterator, std::basic_string<CharT>, <span class="keywordtype">bool</span>>::type m_prefix_filter;</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  }; </div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  </div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> </div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>(<span class="keyword">const</span> Hash& hash, <span class="keywordtype">float</span> max_load_factor, size_type burst_threshold): </div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  m_root(nullptr), m_nb_elements(0), </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  m_hash(hash), m_max_load_factor(max_load_factor)</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  {</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  this->burst_threshold(burst_threshold);</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  }</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  </div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>& other): m_root(nullptr), m_nb_elements(other.m_nb_elements), </div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  m_hash(other.m_hash), m_max_load_factor(other.m_max_load_factor),</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  m_burst_threshold(other.m_burst_threshold)</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  {</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">if</span>(other.m_root != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span>(other.m_root->is_hash_node()) {</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  m_root = make_unique<hash_node>(other.m_root->as_hash_node());</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  m_root = make_unique<trie_node>(other.m_root->as_trie_node());</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  }</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  }</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  </div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>&& other) noexcept(std::is_nothrow_move_constructible<Hash>::value)</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  : m_root(std::move(other.m_root)),</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  m_nb_elements(other.m_nb_elements),</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  m_hash(std::move(other.m_hash)),</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  m_max_load_factor(other.m_max_load_factor),</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  m_burst_threshold(other.m_burst_threshold)</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  {</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  other.clear();</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  }</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  </div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>& operator=(<span class="keyword">const</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>& other) {</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">if</span>(&other != <span class="keyword">this</span>) {</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  std::unique_ptr<anode> new_root = <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="keywordflow">if</span>(other.m_root != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">if</span>(other.m_root->is_hash_node()) {</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  new_root = make_unique<hash_node>(other.m_root->as_hash_node());</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  }</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  new_root = make_unique<trie_node>(other.m_root->as_trie_node());</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  }</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  }</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  </div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  m_hash = other.m_hash;</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  m_root = std::move(new_root);</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  m_nb_elements = other.m_nb_elements;</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  m_max_load_factor = other.m_max_load_factor;</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  m_burst_threshold = other.m_burst_threshold;</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  }</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  </div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  </div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>& operator=(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>&& other) {</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  other.swap(*<span class="keyword">this</span>);</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  other.clear();</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  </div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span> </div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">/*</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="comment"> * Iterators </span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="comment"> */</span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> begin() noexcept {</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">return</span> mutable_iterator(cbegin());</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  </div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> begin() const noexcept {</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keywordflow">return</span> cbegin();</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  </div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> cbegin() const noexcept {</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">if</span>(empty()) {</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  </div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keywordflow">return</span> cbegin<const_iterator>(*m_root);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  }</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  </div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> end() noexcept {</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> it;</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  it.set_as_end_iterator();</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  </div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  }</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  </div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> end() const noexcept {</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  </div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> cend() const noexcept {</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> it;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  it.set_as_end_iterator();</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  </div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  }</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  </div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  </div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="comment">/*</span></div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="comment"> * Capacity</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> <span class="comment"> */</span></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordtype">bool</span> empty() const noexcept {</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">return</span> m_nb_elements == 0;</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  }</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  </div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  size_type size() const noexcept {</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="keywordflow">return</span> m_nb_elements;</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  </div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  size_type max_size() const noexcept {</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keywordflow">return</span> std::numeric_limits<size_type>::max();</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  }</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  </div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  size_type max_key_size() const noexcept {</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">return</span> array_hash_type::MAX_KEY_SIZE;</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  }</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  </div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keywordtype">void</span> shrink_to_fit() {</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keyword">auto</span> first = begin();</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="keyword">auto</span> last = end();</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  </div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keywordflow">while</span>(first != last) {</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">if</span>(first.m_read_trie_node_value) {</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  ++first;</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="comment">/*</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment"> * skrink_to_fit on array_hash will invalidate the iterators of array_hash.</span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="comment"> * Save pointer to array_hash, skip the array_hash_node and then call </span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="comment"> * shrink_to_fit on the saved pointer.</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"> */</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  hash_node* hnode = first.m_current_hash_node;</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  first.skip_hash_node();</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  </div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  tsl_ht_assert(hnode != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  hnode->array_hash().shrink_to_fit();</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  </div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  </div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="comment">/*</span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"> * Modifiers</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="comment"> */</span></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordtype">void</span> clear() noexcept {</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  m_root.reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  m_nb_elements = 0;</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  }</div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  </div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keyword">template</span><<span class="keyword">class</span>... ValueArgs></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  std::pair<iterator, bool> insert(<span class="keyword">const</span> CharT* key, size_type key_size, ValueArgs&&... value_args) {</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">if</span>(key_size > max_key_size()) {</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keywordflow">throw</span> std::length_error(<span class="stringliteral">"Key is too long."</span>);</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  }</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  </div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  m_root = make_unique<hash_node>(m_hash, m_max_load_factor);</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  }</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  </div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">return</span> insert_impl(*m_root, key, key_size, std::forward<ValueArgs>(value_args)...); </div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  }</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  </div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> erase(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> pos) {</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> erase(mutable_iterator(pos));</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  }</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  </div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> erase(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> first, <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> last) {</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="comment">// TODO Optimize, could avoid the call to std::distance</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keyword">const</span> std::size_t nb_to_erase = std::size_t(std::distance(first, last));</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keyword">auto</span> to_delete = mutable_iterator(first);</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordflow">for</span>(std::size_t i = 0; i < nb_to_erase; i++) {</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  to_delete = erase(to_delete);</div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  }</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  </div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">return</span> to_delete;</div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  }</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  </div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  size_type erase(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keyword">auto</span> it = find(key, key_size);</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keywordflow">if</span>(it != end()) {</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  erase(it);</div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  }</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  </div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  }</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  </div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  size_type erase_prefix(<span class="keyword">const</span> CharT* prefix, size_type prefix_size) {</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  } </div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  </div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  anode* current_node = m_root.get();</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">for</span>(size_type iprefix = 0; iprefix < prefix_size; iprefix++) {</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  trie_node* tnode = &current_node->as_trie_node();</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  </div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">if</span>(tnode->child(prefix[iprefix]) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  }</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  current_node = tnode->child(prefix[iprefix]).get();</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  }</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  }</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  hash_node& hnode = current_node->as_hash_node();</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">return</span> erase_prefix_hash_node(hnode, prefix + iprefix, prefix_size - iprefix);</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  }</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  </div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  </div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  trie_node* parent = current_node->parent();</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  </div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">if</span>(parent != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="keyword">const</span> size_type nb_erased = size_descendants(current_node->as_trie_node());</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  </div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  parent->set_child(current_node->child_of_char(), <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  m_nb_elements -= nb_erased;</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  </div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keywordflow">if</span>(parent->empty()) {</div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  clear_empty_nodes(*parent);</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  }</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> </div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">return</span> nb_erased;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">const</span> size_type nb_erased = m_nb_elements;</div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  m_root.reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  m_nb_elements = 0;</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  </div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keywordflow">return</span> nb_erased;</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  }</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keyword">const</span> size_type nb_erased = current_node->as_hash_node().array_hash().size();</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  current_node->as_hash_node().array_hash().clear();</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  m_nb_elements -= nb_erased;</div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  </div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  clear_empty_nodes(current_node->as_hash_node());</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  </div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keywordflow">return</span> nb_erased;</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  }</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  }</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  </div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="keywordtype">void</span> swap(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>& other) {</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keyword">using</span> std::swap;</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  </div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  swap(m_hash, other.m_hash);</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  swap(m_root, other.m_root);</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  swap(m_nb_elements, other.m_nb_elements);</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  swap(m_max_load_factor, other.m_max_load_factor);</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  swap(m_burst_threshold, other.m_burst_threshold);</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  }</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  </div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="comment">/*</span></div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="comment"> * Lookup</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span> <span class="comment"> */</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  U& at(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">return</span> <span class="keyword">const_cast<</span>U&<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keyword">const </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->at(key, key_size));</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  </div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="keyword">const</span> U& at(<span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keyword">auto</span> it_find = find(key, key_size);</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">if</span>(it_find != cend()) {</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  <span class="keywordflow">return</span> it_find.value();</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  }</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">"Couldn't find key."</span>);</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  } </div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  }</div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  </div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="comment">//TODO optimize</span></div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  template<class U = T, typename std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  U& access_operator(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keyword">auto</span> it_find = find(key, key_size);</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keywordflow">if</span>(it_find != cend()) {</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">return</span> it_find.value();</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  }</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="keywordflow">return</span> insert(key, key_size, U{}).first.value();</div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  }</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  </div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  size_type count(<span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">if</span>(find(key, key_size) != cend()) {</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  }</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  }</div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  }</div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  </div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> find(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="keywordflow">return</span> end();</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  }</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  </div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="keywordflow">return</span> find_impl(*m_root, key, key_size);</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  }</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  </div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> find(<span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  }</div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  </div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">return</span> find_impl(*m_root, key, key_size);</div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  </div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  std::pair<iterator, iterator> equal_range(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> it = find(key, key_size);</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">return</span> std::make_pair(it, (it == end())?it:std::next(it));</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  }</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  </div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  std::pair<const_iterator, const_iterator> equal_range(<span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> it = find(key, key_size);</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordflow">return</span> std::make_pair(it, (it == cend())?it:std::next(it));</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  </div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  std::pair<prefix_iterator, prefix_iterator> equal_prefix_range(<span class="keyword">const</span> CharT* prefix, size_type prefix_size) {</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keywordflow">return</span> std::make_pair(prefix_end(), prefix_end());</div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  }</div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  </div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordflow">return</span> equal_prefix_range_impl(*m_root, prefix, prefix_size);</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  }</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span> </div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  std::pair<const_prefix_iterator, const_prefix_iterator> equal_prefix_range(<span class="keyword">const</span> CharT* prefix, </div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  size_type prefix_size)<span class="keyword"> const </span></div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <span class="keywordflow">return</span> std::make_pair(prefix_cend(), prefix_cend());</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  }</div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  </div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordflow">return</span> equal_prefix_range_impl(*m_root, prefix, prefix_size);</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  }</div><div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  </div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> longest_prefix(<span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <span class="keywordflow">return</span> end();</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  }</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  </div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <span class="keywordflow">return</span> longest_prefix_impl(*m_root, key, key_size);</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  }</div><div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  </div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> longest_prefix(<span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  }</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  </div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="keywordflow">return</span> longest_prefix_impl(*m_root, key, key_size);</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  }</div><div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  </div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  </div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="comment">/*</span></div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span> <span class="comment"> * Hash policy </span></div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span> <span class="comment"> */</span></div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="keywordtype">float</span> max_load_factor()<span class="keyword"> const </span>{ </div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">return</span> m_max_load_factor; </div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  }</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  </div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="keywordtype">void</span> max_load_factor(<span class="keywordtype">float</span> ml) {</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  m_max_load_factor = ml; </div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  }</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  </div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="comment">/*</span></div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> <span class="comment"> * Burst policy</span></div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span> <span class="comment"> */</span></div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  size_type burst_threshold()<span class="keyword"> const </span>{</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="keywordflow">return</span> m_burst_threshold;</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  }</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  </div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="keywordtype">void</span> burst_threshold(size_type threshold) {</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keyword">const</span> size_type min_burst_threshold = MIN_BURST_THRESHOLD;</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  m_burst_threshold = std::max(min_burst_threshold, threshold);</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  </div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="comment">/*</span></div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span> <span class="comment"> * Observers</span></div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span> <span class="comment"> */</span></div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  hasher hash_function()<span class="keyword"> const </span>{ </div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="keywordflow">return</span> m_hash; </div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  }</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  </div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <span class="comment">/*</span></div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span> <span class="comment"> * Other</span></div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span> <span class="comment"> */</span></div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="keyword">template</span><<span class="keyword">class</span> Serializer></div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="keywordtype">void</span> serialize(Serializer& serializer)<span class="keyword"> const </span>{</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  serialize_impl(serializer);</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  }</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span> </div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keyword">template</span><<span class="keyword">class</span> Deserializer></div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  <span class="keywordtype">void</span> deserialize(Deserializer& deserializer, <span class="keywordtype">bool</span> hash_compatible) {</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  deserialize_impl(deserializer, hash_compatible);</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  }</div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  </div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> <span class="keyword">private</span>:</div><div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Iterator></div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  Iterator cbegin(<span class="keyword">const</span> anode& search_start_node) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keywordflow">if</span>(search_start_node.is_hash_node()) {</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordflow">return</span> Iterator(search_start_node.as_hash_node());</div><div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  }</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  </div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keyword">const</span> trie_node& tnode = search_start_node.as_trie_node().most_left_descendant_value_trie_node();</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keywordflow">if</span>(tnode.val_node() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keywordflow">return</span> Iterator(tnode);</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  }</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  <span class="keyword">const</span> anode* first_child = tnode.first_child();</div><div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  tsl_ht_assert(first_child != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  </div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">return</span> Iterator(first_child->as_hash_node());</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  }</div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  }</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  </div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Iterator></div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  Iterator cend(<span class="keyword">const</span> anode& search_start_node) <span class="keyword">const</span> noexcept {</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keywordflow">if</span>(search_start_node.parent() == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  Iterator it;</div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  it.set_as_end_iterator();</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  </div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  }</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  </div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keyword">const</span> trie_node* current_trie_node = search_start_node.parent();</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keyword">const</span> anode* next_node = current_trie_node->next_child(search_start_node);</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  </div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">while</span>(next_node == <span class="keyword">nullptr</span> && current_trie_node->parent() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keyword">const</span> anode* current_child = current_trie_node;</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  current_trie_node = current_trie_node->parent();</div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  next_node = current_trie_node->next_child(*current_child);</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  }</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  </div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">if</span>(next_node == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  Iterator it;</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  it.set_as_end_iterator();</div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  </div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  }</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="keywordflow">return</span> cbegin<Iterator>(*next_node);</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  }</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  }</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  </div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a> prefix_end() noexcept {</div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a> it;</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  it.set_as_end_iterator();</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  </div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  }</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  </div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> prefix_cend() const noexcept {</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> it;</div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  it.set_as_end_iterator();</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  </div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">return</span> it;</div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  }</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  </div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  size_type size_descendants(<span class="keyword">const</span> anode& start_node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keyword">auto</span> first = cbegin<const_iterator>(start_node);</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keyword">auto</span> last = cend<const_iterator>(start_node);</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  size_type nb_elements = 0;</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordflow">while</span>(first != last) {</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="keywordflow">if</span>(first.m_read_trie_node_value) {</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  nb_elements++;</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  ++first;</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  }</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  nb_elements += first.m_current_hash_node->array_hash().size();</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  first.skip_hash_node();</div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  }</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  }</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  </div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="keywordflow">return</span> nb_elements;</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  }</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  </div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keyword">template</span><<span class="keyword">class</span>... ValueArgs></div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  std::pair<iterator, bool> insert_impl(anode& search_start_node, </div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  <span class="keyword">const</span> CharT* key, size_type key_size, ValueArgs&&... value_args) </div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  {</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  anode* current_node = &search_start_node;</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  </div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keywordflow">for</span>(size_type ikey = 0; ikey < key_size; ikey++) {</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  trie_node& tnode = current_node->as_trie_node();</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  </div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">if</span>(tnode.child(key[ikey]) != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  current_node = tnode.child(key[ikey]).get();</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  }</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keyword">auto</span> hnode = make_unique<hash_node>(m_hash, m_max_load_factor);</div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keyword">auto</span> insert_it = hnode->array_hash().emplace_ks(key + ikey + 1, key_size - ikey - 1, </div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  </div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  tnode.set_child(key[ikey], std::move(hnode));</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  m_nb_elements++;</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  </div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  </div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keywordflow">return</span> std::make_pair(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(tnode.child(key[ikey])->as_hash_node(), </div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  insert_it.first), <span class="keyword">true</span>);</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  }</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  }</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keywordflow">return</span> insert_in_hash_node(current_node->as_hash_node(),</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  key + ikey, key_size - ikey, std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  }</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  }</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  </div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  </div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  trie_node& tnode = current_node->as_trie_node();</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  <span class="keywordflow">if</span>(tnode.val_node() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keywordflow">return</span> std::make_pair(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(tnode), <span class="keyword">false</span>);</div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  }</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  tnode.val_node() = make_unique<value_node>(std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  m_nb_elements++;</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  </div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <span class="keywordflow">return</span> std::make_pair(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(tnode), <span class="keyword">true</span>);</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  }</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  }</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  <span class="keywordflow">return</span> insert_in_hash_node(current_node->as_hash_node(), </div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="stringliteral">""</span>, 0, std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  }</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  }</div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  </div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="keyword">template</span><<span class="keyword">class</span>... ValueArgs></div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  std::pair<iterator, bool> insert_in_hash_node(hash_node& hnode, </div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keyword">const</span> CharT* key, size_type key_size, ValueArgs&&... value_args)</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  {</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="keywordflow">if</span>(need_burst(hnode)) {</div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  std::unique_ptr<trie_node> new_node = burst(hnode);</div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="keywordflow">if</span>(hnode.parent() == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  tsl_ht_assert(m_root.get() == &hnode);</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  </div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  m_root = std::move(new_node);</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keywordflow">return</span> insert_impl(*m_root, key, key_size, std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  }</div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  trie_node* parent = hnode.parent();</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keyword">const</span> CharT child_of_char = hnode.child_of_char();</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  </div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  parent->set_child(child_of_char, std::move(new_node));</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  </div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  <span class="keywordflow">return</span> insert_impl(*parent->child(child_of_char), </div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  key, key_size, std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  }</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  }</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="keyword">auto</span> it_insert = hnode.array_hash().emplace_ks(key, key_size, </div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  std::forward<ValueArgs>(value_args)...);</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordflow">if</span>(it_insert.second) {</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  m_nb_elements++;</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  }</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  </div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">return</span> std::make_pair(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(hnode, it_insert.first), it_insert.second);</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  }</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  </div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  </div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> erase(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> pos) {</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> next_pos = std::next(pos);</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  </div><div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="keywordflow">if</span>(pos.m_read_trie_node_value) {</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  tsl_ht_assert(pos.m_current_trie_node != <span class="keyword">nullptr</span> && pos.m_current_trie_node->val_node() != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  </div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  pos.m_current_trie_node->val_node().reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  m_nb_elements--;</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  </div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="keywordflow">if</span>(pos.m_current_trie_node->empty()) {</div><div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  clear_empty_nodes(*pos.m_current_trie_node);</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  }</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  </div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="keywordflow">return</span> next_pos;</div><div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  }</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  tsl_ht_assert(pos.m_current_hash_node != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keyword">auto</span> next_array_hash_it = pos.m_current_hash_node->array_hash().erase(pos.m_array_hash_iterator);</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  m_nb_elements--;</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  </div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordflow">if</span>(next_array_hash_it != pos.m_current_hash_node->array_hash().end()) {</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  <span class="comment">// The erase on array_hash invalidated the next_pos iterator, return the right one.</span></div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(*pos.m_current_hash_node, next_array_hash_it);</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  }</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordflow">if</span>(pos.m_current_hash_node->array_hash().empty()) {</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  clear_empty_nodes(*pos.m_current_hash_node);</div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  }</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  </div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <span class="keywordflow">return</span> next_pos;</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  }</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  }</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  }</div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  </div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  <span class="keywordtype">void</span> clear_empty_nodes(anode& empty_node) noexcept {</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  tsl_ht_assert(!empty_node.is_trie_node() || </div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  (empty_node.as_trie_node().empty() && empty_node.as_trie_node().val_node() == <span class="keyword">nullptr</span>));</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  tsl_ht_assert(!empty_node.is_hash_node() || empty_node.as_hash_node().array_hash().empty());</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span> </div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  </div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  trie_node* parent = empty_node.parent();</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="keywordflow">if</span>(parent == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  tsl_ht_assert(m_root.get() == &empty_node);</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  tsl_ht_assert(m_nb_elements == 0);</div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  m_root.reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  }</div><div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(parent->val_node() != <span class="keyword">nullptr</span> || parent->nb_children() > 1) {</div><div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  parent->child(empty_node.child_of_char()).reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  }</div><div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(parent->parent() == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  tsl_ht_assert(m_root.get() == empty_node.parent());</div><div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  tsl_ht_assert(m_nb_elements == 0);</div><div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  m_root.reset(<span class="keyword">nullptr</span>);</div><div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  }</div><div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  trie_node* grand_parent = parent->parent();</div><div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  grand_parent->set_child(parent->child_of_char(), </div><div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  std::move(parent->child(empty_node.child_of_char())));</div><div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  </div><div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  </div><div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  clear_empty_nodes(empty_node);</div><div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  }</div><div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  } </div><div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  </div><div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  </div><div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  </div><div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  </div><div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> find_impl(<span class="keyword">const</span> anode& search_start_node, <span class="keyword">const</span> CharT* key, size_type key_size) {</div><div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keywordflow">return</span> mutable_iterator(static_cast<const htrie_hash*>(<span class="keyword">this</span>)->find_impl(search_start_node, key, key_size));</div><div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div><div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  </div><div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> find_impl(<span class="keyword">const</span> anode& search_start_node, <span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span>{</div><div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="keyword">const</span> anode* current_node = &search_start_node;</div><div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  </div><div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="keywordflow">for</span>(size_type ikey = 0; ikey < key_size; ikey++) {</div><div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keyword">const</span> trie_node* tnode = &current_node->as_trie_node();</div><div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  </div><div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keywordflow">if</span>(tnode->child(key[ikey]) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  }</div><div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  current_node = tnode->child(key[ikey]).get();</div><div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  }</div><div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  }</div><div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="keywordflow">return</span> find_in_hash_node(current_node->as_hash_node(), </div><div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  key + ikey, key_size - ikey);</div><div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  }</div><div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  }</div><div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  </div><div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  </div><div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="keyword">const</span> trie_node& tnode = current_node->as_trie_node();</div><div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keywordflow">return</span> (tnode.val_node() != <span class="keyword">nullptr</span>)?<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(tnode):cend();</div><div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  }</div><div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keywordflow">return</span> find_in_hash_node(current_node->as_hash_node(), <span class="stringliteral">""</span>, 0);</div><div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  }</div><div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  }</div><div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  </div><div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> find_in_hash_node(<span class="keyword">const</span> hash_node& hnode, </div><div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  <span class="keyword">const</span> CharT* key, size_type key_size)<span class="keyword"> const </span></div><div class="line"><a name="l01556"></a><span class="lineno"> 1556</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <span class="keyword">auto</span> it = hnode.array_hash().find_ks(key, key_size);</div><div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keywordflow">if</span>(it != hnode.array_hash().end()) {</div><div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(hnode, it);</div><div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  }</div><div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="keywordflow">return</span> cend();</div><div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  }</div><div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  }</div><div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  </div><div class="line"><a name="l01566"></a><span class="lineno"> 1566</span> </div><div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> longest_prefix_impl(<span class="keyword">const</span> anode& search_start_node,</div><div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keyword">const</span> CharT* value, size_type value_size)</div><div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  {</div><div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="keywordflow">return</span> mutable_iterator(static_cast<const htrie_hash*>(<span class="keyword">this</span>)->longest_prefix_impl(search_start_node, </div><div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  value, value_size));</div><div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  }</div><div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  </div><div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> longest_prefix_impl(<span class="keyword">const</span> anode& search_start_node,</div><div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="keyword">const</span> CharT* value, size_type value_size)<span class="keyword"> const </span></div><div class="line"><a name="l01576"></a><span class="lineno"> 1576</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  <span class="keyword">const</span> anode* current_node = &search_start_node;</div><div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> longest_found_prefix = cend();</div><div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  </div><div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  <span class="keywordflow">for</span>(size_type ivalue = 0; ivalue < value_size; ivalue++) {</div><div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="keyword">const</span> trie_node& tnode = current_node->as_trie_node();</div><div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  </div><div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keywordflow">if</span>(tnode.val_node() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  longest_found_prefix = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(tnode);</div><div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  }</div><div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  </div><div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="keywordflow">if</span>(tnode.child(value[ivalue]) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  <span class="keywordflow">return</span> longest_found_prefix;</div><div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  }</div><div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  current_node = tnode.child(value[ivalue]).get();</div><div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  }</div><div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  }</div><div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  <span class="keyword">const</span> hash_node& hnode = current_node->as_hash_node();</div><div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  </div><div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keywordflow">for</span>(std::size_t i = ivalue; i <= value_size; i++) {</div><div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="keyword">auto</span> it = hnode.array_hash().find_ks(value + ivalue, (value_size - i));</div><div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="keywordflow">if</span>(it != hnode.array_hash().end()) {</div><div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(hnode, it);</div><div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  }</div><div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  }</div><div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  </div><div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="keywordflow">return</span> longest_found_prefix;</div><div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  }</div><div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  }</div><div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  </div><div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keyword">const</span> trie_node& tnode = current_node->as_trie_node();</div><div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  </div><div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  <span class="keywordflow">if</span>(tnode.val_node() != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  longest_found_prefix = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(tnode);</div><div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  }</div><div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  }</div><div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  <span class="keyword">const</span> hash_node& hnode = current_node->as_hash_node();</div><div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  </div><div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keyword">auto</span> it = hnode.array_hash().find_ks(<span class="stringliteral">""</span>, 0);</div><div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="keywordflow">if</span>(it != hnode.array_hash().end()) {</div><div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  longest_found_prefix = <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a>(hnode, it);</div><div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  }</div><div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  }</div><div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  </div><div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  <span class="keywordflow">return</span> longest_found_prefix;</div><div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  }</div><div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  </div><div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  </div><div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  std::pair<prefix_iterator, prefix_iterator> equal_prefix_range_impl(</div><div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  anode& search_start_node,</div><div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="keyword">const</span> CharT* prefix, size_type prefix_size)</div><div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  {</div><div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  <span class="keyword">auto</span> range = <span class="keyword">static_cast<</span><span class="keyword">const </span><a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">htrie_hash</a>*<span class="keyword">></span>(<span class="keyword">this</span>)->equal_prefix_range_impl(search_start_node, </div><div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  prefix, prefix_size);</div><div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keywordflow">return</span> std::make_pair(mutable_iterator(range.first), mutable_iterator(range.second));</div><div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  }</div><div class="line"><a name="l01642"></a><span class="lineno"> 1642</span> </div><div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  std::pair<const_prefix_iterator, const_prefix_iterator> equal_prefix_range_impl(</div><div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  <span class="keyword">const</span> anode& search_start_node,</div><div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  <span class="keyword">const</span> CharT* prefix, size_type prefix_size)<span class="keyword"> const </span></div><div class="line"><a name="l01646"></a><span class="lineno"> 1646</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  <span class="keyword">const</span> anode* current_node = &search_start_node;</div><div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  </div><div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keywordflow">for</span>(size_type iprefix = 0; iprefix < prefix_size; iprefix++) {</div><div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="keywordflow">if</span>(current_node->is_trie_node()) {</div><div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="keyword">const</span> trie_node* tnode = &current_node->as_trie_node();</div><div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  </div><div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  <span class="keywordflow">if</span>(tnode->child(prefix[iprefix]) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="keywordflow">return</span> std::make_pair(prefix_cend(), prefix_cend());</div><div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  }</div><div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  current_node = tnode->child(prefix[iprefix]).get();</div><div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  }</div><div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  }</div><div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keyword">const</span> hash_node& hnode = current_node->as_hash_node();</div><div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> begin(hnode.parent(), &hnode, </div><div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  hnode.array_hash().begin(), hnode.array_hash().end(), </div><div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  <span class="keyword">false</span>, std::basic_string<CharT>(prefix + iprefix, prefix_size - iprefix));</div><div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  begin.filter_prefix();</div><div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  </div><div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> end = cend<const_prefix_iterator>(*current_node);</div><div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  </div><div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  <span class="keywordflow">return</span> std::make_pair(begin, end);</div><div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  }</div><div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  }</div><div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  </div><div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  </div><div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> begin = cbegin<const_prefix_iterator>(*current_node);</div><div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> end = cend<const_prefix_iterator>(*current_node);</div><div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  </div><div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  <span class="keywordflow">return</span> std::make_pair(begin, end);</div><div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>  }</div><div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>  </div><div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  size_type erase_prefix_hash_node(hash_node& hnode, <span class="keyword">const</span> CharT* prefix, size_type prefix_size) {</div><div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  size_type nb_erased = 0;</div><div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  </div><div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  <span class="keyword">auto</span> it = hnode.array_hash().begin();</div><div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  <span class="keywordflow">while</span>(it != hnode.array_hash().end()) {</div><div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  <span class="keywordflow">if</span>(it.key_size() >= prefix_size && </div><div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  std::memcmp(prefix, it.key(), prefix_size * <span class="keyword">sizeof</span>(CharT)) == 0)</div><div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  {</div><div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  it = hnode.array_hash().erase(it);</div><div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  ++nb_erased;</div><div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  --m_nb_elements;</div><div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  }</div><div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  ++it;</div><div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  }</div><div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  }</div><div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  </div><div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  <span class="keywordflow">return</span> nb_erased;</div><div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  }</div><div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  </div><div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>  </div><div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  <span class="comment">/*</span></div><div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <span class="comment"> * Burst</span></div><div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> <span class="comment"> */</span></div><div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  <span class="keywordtype">bool</span> need_burst(hash_node& node)<span class="keyword"> const </span>{</div><div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  <span class="keywordflow">return</span> node.array_hash().size() >= m_burst_threshold;</div><div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  }</div><div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  </div><div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  </div><div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  template<class U = T, typename std::enable_if<has_value<U>::value && </div><div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  std::is_copy_constructible<U>::value && </div><div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  (!std::is_nothrow_move_constructible<U>::value ||</div><div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  !std::is_nothrow_move_assignable<U>::value || </div><div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  std::is_arithmetic<U>::value || </div><div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  std::is_pointer<U>::value)>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  std::unique_ptr<trie_node> burst(hash_node& node) {</div><div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="keyword">const</span> std::array<size_type, ALPHABET_SIZE> first_char_count = </div><div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  get_first_char_count(node.array_hash().cbegin(), </div><div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  node.array_hash().cend());</div><div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  </div><div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  </div><div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="keyword">auto</span> new_node = make_unique<trie_node>();</div><div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it = node.array_hash().cbegin(); it != node.array_hash().cend(); ++it) {</div><div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="keywordflow">if</span>(it.key_size() == 0) {</div><div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  new_node->val_node() = make_unique<value_node>(it.value());</div><div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  }</div><div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  hash_node& hnode = get_hash_node_for_char(first_char_count, *new_node, it.key()[0]);</div><div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  hnode.array_hash().insert_ks(it.key() + 1, it.key_size() - 1, it.value());</div><div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  }</div><div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  }</div><div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  </div><div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  </div><div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  tsl_ht_assert(new_node->val_node() != <span class="keyword">nullptr</span> || !new_node->empty());</div><div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  <span class="keywordflow">return</span> new_node;</div><div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  } </div><div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  </div><div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  template<class U = T, typename std::enable_if<has_value<U>::value && </div><div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  std::is_nothrow_move_constructible<U>::value &&</div><div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  std::is_nothrow_move_assignable<U>::value && </div><div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  !std::is_arithmetic<U>::value && </div><div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  !std::is_pointer<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  std::unique_ptr<trie_node> burst(hash_node& node) {</div><div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  std::vector<T*> moved_values_rollback;</div><div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  moved_values_rollback.reserve(node.array_hash().size());</div><div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  </div><div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keywordflow">try</span> {</div><div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  <span class="keyword">const</span> std::array<size_type, ALPHABET_SIZE> first_char_count = </div><div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  get_first_char_count(node.array_hash().cbegin(), node.array_hash().cend());</div><div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  </div><div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  </div><div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keyword">auto</span> new_node = make_unique<trie_node>();</div><div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it = node.array_hash().begin(); it != node.array_hash().end(); ++it) {</div><div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  <span class="keywordflow">if</span>(it.key_size() == 0) {</div><div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  new_node->val_node() = make_unique<value_node>(std::move(it.value()));</div><div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  moved_values_rollback.push_back(std::addressof(new_node->val_node()->m_value));</div><div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  }</div><div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  hash_node& hnode = get_hash_node_for_char(first_char_count, *new_node, it.key()[0]);</div><div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  <span class="keyword">auto</span> it_insert = hnode.array_hash().insert_ks(it.key() + 1, it.key_size() - 1, </div><div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  std::move(it.value()));</div><div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  moved_values_rollback.push_back(std::addressof(it_insert.first.value()));</div><div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  }</div><div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  }</div><div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  </div><div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  </div><div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  tsl_ht_assert(new_node->val_node() != <span class="keyword">nullptr</span> || !new_node->empty());</div><div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keywordflow">return</span> new_node;</div><div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  }</div><div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  <span class="keywordflow">catch</span>(...) {</div><div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  <span class="comment">// Rollback the values</span></div><div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  <span class="keyword">auto</span> it = node.array_hash().begin();</div><div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  <span class="keywordflow">for</span>(std::size_t ivalue = 0; ivalue < moved_values_rollback.size(); ivalue++) {</div><div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  it.value() = std::move(*moved_values_rollback[ivalue]);</div><div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  </div><div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  ++it;</div><div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  }</div><div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  </div><div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <span class="keywordflow">throw</span>;</div><div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  }</div><div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  } </div><div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  </div><div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  template<class U = T, typename std::enable_if<!has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  std::unique_ptr<trie_node> burst(hash_node& node) {</div><div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <span class="keyword">const</span> std::array<size_type, ALPHABET_SIZE> first_char_count = </div><div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  get_first_char_count(node.array_hash().begin(), node.array_hash().end());</div><div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  </div><div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  </div><div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <span class="keyword">auto</span> new_node = make_unique<trie_node>();</div><div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it = node.array_hash().cbegin(); it != node.array_hash().cend(); ++it) {</div><div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="keywordflow">if</span>(it.key_size() == 0) {</div><div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  new_node->val_node() = make_unique<value_node>();</div><div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  }</div><div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  hash_node& hnode = get_hash_node_for_char(first_char_count, *new_node, it.key()[0]);</div><div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  hnode.array_hash().insert_ks(it.key() + 1, it.key_size() - 1);</div><div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  }</div><div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  }</div><div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  </div><div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  </div><div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  tsl_ht_assert(new_node->val_node() != <span class="keyword">nullptr</span> || !new_node->empty());</div><div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="keywordflow">return</span> new_node;</div><div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  }</div><div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  </div><div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  std::array<size_type, ALPHABET_SIZE> get_first_char_count(<span class="keyword">typename</span> array_hash_type::const_iterator begin, </div><div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="keyword">typename</span> array_hash_type::const_iterator end)<span class="keyword"> const</span></div><div class="line"><a name="l01819"></a><span class="lineno"> 1819</span> <span class="keyword"> </span>{</div><div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  std::array<size_type, ALPHABET_SIZE> count{{}};</div><div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> it = begin; it != end; ++it) {</div><div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <span class="keywordflow">if</span>(it.key_size() == 0) {</div><div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  }</div><div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  </div><div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  count[as_position(it.key()[0])]++;</div><div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  }</div><div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  </div><div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="keywordflow">return</span> count;</div><div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  }</div><div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  </div><div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  </div><div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  hash_node& get_hash_node_for_char(<span class="keyword">const</span> std::array<size_type, ALPHABET_SIZE>& first_char_count, </div><div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  trie_node& tnode, CharT for_char)</div><div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  {</div><div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="keywordflow">if</span>(tnode.child(for_char) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <span class="keyword">const</span> size_type nb_buckets = </div><div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  size_type(</div><div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  std::ceil(<span class="keywordtype">float</span>(first_char_count[as_position(for_char)] + </div><div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  HASH_NODE_DEFAULT_INIT_BUCKETS_COUNT/2) </div><div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  / m_max_load_factor</div><div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  ));</div><div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  </div><div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  tnode.set_child(for_char, </div><div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  make_unique<hash_node>(nb_buckets, m_hash, m_max_load_factor));</div><div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  }</div><div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  </div><div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  <span class="keywordflow">return</span> tnode.child(for_char)->as_hash_node();</div><div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  }</div><div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  </div><div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a> mutable_iterator(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> it) noexcept {</div><div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <span class="comment">// end iterator or reading from a trie node value</span></div><div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  <span class="keywordflow">if</span>(it.m_current_hash_node == <span class="keyword">nullptr</span> || it.m_read_trie_node_value) {</div><div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="keyword">typename</span> array_hash_type::iterator default_it;</div><div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  </div><div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(const_cast<trie_node*>(it.m_current_trie_node), <span class="keyword">nullptr</span>,</div><div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  default_it, default_it, it.m_read_trie_node_value);</div><div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  }</div><div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  hash_node* hnode = <span class="keyword">const_cast<</span>hash_node*<span class="keyword">></span>(it.m_current_hash_node);</div><div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">iterator</a>(const_cast<trie_node*>(it.m_current_trie_node), hnode,</div><div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  hnode->array_hash().mutable_iterator(it.m_array_hash_iterator),</div><div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  hnode->array_hash().mutable_iterator(it.m_array_hash_end_iterator),</div><div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  it.m_read_trie_node_value);</div><div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  }</div><div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  }</div><div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  </div><div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a> mutable_iterator(<a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_prefix_iterator</a> it) noexcept {</div><div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="comment">// end iterator or reading from a trie node value</span></div><div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  <span class="keywordflow">if</span>(it.m_current_hash_node == <span class="keyword">nullptr</span> || it.m_read_trie_node_value) {</div><div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  <span class="keyword">typename</span> array_hash_type::iterator default_it;</div><div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  </div><div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a>(const_cast<trie_node*>(it.m_current_trie_node), <span class="keyword">nullptr</span>,</div><div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  default_it, default_it, it.m_read_trie_node_value, <span class="stringliteral">""</span>);</div><div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  }</div><div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  hash_node* hnode = <span class="keyword">const_cast<</span>hash_node*<span class="keyword">></span>(it.m_current_hash_node);</div><div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  <span class="keywordflow">return</span> <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">prefix_iterator</a>(const_cast<trie_node*>(it.m_current_trie_node), hnode,</div><div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  hnode->array_hash().mutable_iterator(it.m_array_hash_iterator),</div><div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  hnode->array_hash().mutable_iterator(it.m_array_hash_end_iterator),</div><div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  it.m_read_trie_node_value, it.m_prefix_filter);</div><div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  }</div><div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  }</div><div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  </div><div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  <span class="keyword">template</span><<span class="keyword">class</span> Serializer></div><div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  <span class="keywordtype">void</span> serialize_impl(Serializer& serializer)<span class="keyword"> const </span>{</div><div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  <span class="keyword">const</span> slz_size_type <a class="code" href="group__crfsuite__hpp__api__doc.html#gaa8ef1fab26ec65f18b7e34e6edac5ef5">version</a> = SERIALIZATION_PROTOCOL_VERSION;</div><div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  serializer(version);</div><div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  </div><div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <span class="keyword">const</span> slz_size_type nb_elements = m_nb_elements;</div><div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  serializer(nb_elements);</div><div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  </div><div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> max_load_factor = m_max_load_factor;</div><div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  serializer(max_load_factor);</div><div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  </div><div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  <span class="keyword">const</span> slz_size_type burst_threshold = m_burst_threshold;</div><div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  serializer(burst_threshold);</div><div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  </div><div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  </div><div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  std::basic_string<CharT> str_buffer;</div><div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  </div><div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="keyword">auto</span> it = begin();</div><div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="keyword">auto</span> last = end();</div><div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  </div><div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  <span class="keywordflow">while</span>(it != last) {</div><div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  <span class="comment">// Serialize trie node value</span></div><div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <span class="keywordflow">if</span>(it.m_read_trie_node_value) {</div><div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <span class="keyword">const</span> CharT node_type = <span class="keyword">static_cast<</span>typename std::underlying_type<slz_node_type>::type<span class="keyword">></span>(slz_node_type::TRIE_NODE);</div><div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  serializer(&node_type, 1);</div><div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  </div><div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  it.key(str_buffer);</div><div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  </div><div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  <span class="keyword">const</span> slz_size_type str_size = str_buffer.size();</div><div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  serializer(str_size);</div><div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  serializer(str_buffer.data(), str_buffer.size());</div><div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  serialize_value(serializer, it);</div><div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  </div><div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  </div><div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  ++it;</div><div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  }</div><div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="comment">// Serialize hash node values</span></div><div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  <span class="keyword">const</span> CharT node_type = <span class="keyword">static_cast<</span>typename std::underlying_type<slz_node_type>::type<span class="keyword">></span>(slz_node_type::HASH_NODE);</div><div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  serializer(&node_type, 1);</div><div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  </div><div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  it.hash_node_prefix(str_buffer);</div><div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  </div><div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <span class="keyword">const</span> slz_size_type str_size = str_buffer.size();</div><div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  serializer(str_size);</div><div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  serializer(str_buffer.data(), str_buffer.size());</div><div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  </div><div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  <span class="keyword">const</span> hash_node* hnode = it.m_current_hash_node;</div><div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  tsl_ht_assert(hnode != <span class="keyword">nullptr</span>);</div><div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  hnode->array_hash().serialize(serializer);</div><div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  </div><div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  </div><div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  it.skip_hash_node();</div><div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  }</div><div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  }</div><div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  }</div><div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  </div><div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  <span class="keyword">template</span><<span class="keyword">class </span>Serializer, <span class="keyword">class </span>U = T,</div><div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  <span class="keyword">typename</span> std::enable_if<!has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  <span class="keywordtype">void</span> serialize_value(Serializer& <span class="comment">/*serializer*/</span>, <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> <span class="comment">/*it*/</span>)<span class="keyword"> const </span>{</div><div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  }</div><div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  </div><div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keyword">template</span><<span class="keyword">class </span>Serializer, <span class="keyword">class </span>U = T,</div><div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <span class="keyword">typename</span> std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  <span class="keywordtype">void</span> serialize_value(Serializer& serializer, <a class="code" href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">const_iterator</a> it)<span class="keyword"> const </span>{</div><div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  serializer(it.value());</div><div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  }</div><div class="line"><a name="l01952"></a><span class="lineno"> 1952</span> </div><div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keyword">template</span><<span class="keyword">class</span> Deserializer></div><div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="keywordtype">void</span> deserialize_impl(Deserializer& deserializer, <span class="keywordtype">bool</span> hash_compatible) {</div><div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  tsl_ht_assert(m_nb_elements == 0 && m_root == <span class="keyword">nullptr</span>); <span class="comment">// Current trie must be empty</span></div><div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  </div><div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  <span class="keyword">const</span> slz_size_type version = deserialize_value<slz_size_type>(deserializer);</div><div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="comment">// For now we only have one version of the serialization protocol. </span></div><div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="comment">// If it doesn't match there is a problem with the file.</span></div><div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <span class="keywordflow">if</span>(version != SERIALIZATION_PROTOCOL_VERSION) {</div><div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"Can't deserialize the htrie_map/set. The protocol version header is invalid."</span>);</div><div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  }</div><div class="line"><a name="l01963"></a><span class="lineno"> 1963</span> </div><div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  </div><div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  <span class="keyword">const</span> slz_size_type nb_elements = deserialize_value<slz_size_type>(deserializer);</div><div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keyword">const</span> <span class="keywordtype">float</span> max_load_factor = deserialize_value<float>(deserializer);</div><div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <span class="keyword">const</span> slz_size_type burst_threshold = deserialize_value<slz_size_type>(deserializer);</div><div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  </div><div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  this->burst_threshold(numeric_cast<std::size_t>(burst_threshold, <span class="stringliteral">"Deserialized burst_threshold is too big."</span>));</div><div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  this->max_load_factor(max_load_factor);</div><div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  </div><div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  </div><div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  std::vector<CharT> str_buffer;</div><div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">while</span>(m_nb_elements < nb_elements) {</div><div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  CharT node_type_marker;</div><div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  deserializer(&node_type_marker, 1);</div><div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  </div><div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  static_assert(std::is_same<CharT, <span class="keyword">typename</span> std::underlying_type<slz_node_type>::type>::value, <span class="stringliteral">""</span>);</div><div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  <span class="keyword">const</span> slz_node_type node_type = <span class="keyword">static_cast<</span>slz_node_type<span class="keyword">></span>(node_type_marker);</div><div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  <span class="keywordflow">if</span>(node_type == slz_node_type::TRIE_NODE) {</div><div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keyword">const</span> std::size_t str_size = numeric_cast<std::size_t>(deserialize_value<slz_size_type>(deserializer), </div><div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="stringliteral">"Deserialized str_size is too big."</span>);</div><div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  </div><div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  str_buffer.resize(str_size);</div><div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  deserializer(str_buffer.data(), str_size);</div><div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  </div><div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  </div><div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  trie_node* current_node = insert_prefix_trie_nodes(str_buffer.data(), str_size);</div><div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  deserialize_value_node(deserializer, current_node);</div><div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  m_nb_elements++;</div><div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  }</div><div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(node_type == slz_node_type::HASH_NODE) {</div><div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keyword">const</span> std::size_t str_size = numeric_cast<std::size_t>(deserialize_value<slz_size_type>(deserializer), </div><div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  <span class="stringliteral">"Deserialized str_size is too big."</span>);</div><div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  </div><div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  <span class="keywordflow">if</span>(str_size == 0) {</div><div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  tsl_ht_assert(m_nb_elements == 0 && !m_root);</div><div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  </div><div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  m_root = make_unique<hash_node>(array_hash_type::deserialize(deserializer, hash_compatible));</div><div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  m_nb_elements += m_root->as_hash_node().array_hash().size();</div><div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  </div><div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  tsl_ht_assert(m_nb_elements == nb_elements);</div><div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  }</div><div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  str_buffer.resize(str_size);</div><div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  deserializer(str_buffer.data(), str_size);</div><div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  </div><div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  </div><div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keyword">auto</span> hnode = make_unique<hash_node>(array_hash_type::deserialize(deserializer, hash_compatible));</div><div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  m_nb_elements += hnode->array_hash().size();</div><div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  </div><div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  trie_node* current_node = insert_prefix_trie_nodes(str_buffer.data(), str_size - 1);</div><div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  current_node->set_child(str_buffer[str_size - 1], std::move(hnode)); </div><div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  }</div><div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  }</div><div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">"Unknown deserialized node type."</span>);</div><div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  }</div><div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  }</div><div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  </div><div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  tsl_ht_assert(m_nb_elements == nb_elements);</div><div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  }</div><div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  </div><div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  trie_node* insert_prefix_trie_nodes(<span class="keyword">const</span> CharT* prefix, std::size_t prefix_size) {</div><div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  <span class="keywordflow">if</span>(m_root == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  m_root = make_unique<trie_node>();</div><div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  }</div><div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  </div><div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  trie_node* current_node = &m_root->as_trie_node();</div><div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  <span class="keywordflow">for</span>(std::size_t iprefix = 0; iprefix < prefix_size; iprefix++) {</div><div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="keywordflow">if</span>(current_node->child(prefix[iprefix]) == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  current_node->set_child(prefix[iprefix], make_unique<trie_node>());</div><div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  }</div><div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  </div><div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  current_node = &current_node->child(prefix[iprefix])->as_trie_node();</div><div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  }</div><div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  </div><div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="keywordflow">return</span> current_node;</div><div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  }</div><div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  </div><div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  <span class="keyword">template</span><<span class="keyword">class </span>Deserializer, <span class="keyword">class </span>U = T,</div><div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <span class="keyword">typename</span> std::enable_if<!has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="keywordtype">void</span> deserialize_value_node(Deserializer& <span class="comment">/*deserializer*/</span>, trie_node* current_node) {</div><div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  tsl_ht_assert(!current_node->val_node());</div><div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  current_node->val_node() = make_unique<value_node>();</div><div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  }</div><div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  </div><div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keyword">template</span><<span class="keyword">class </span>Deserializer, <span class="keyword">class </span>U = T,</div><div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  <span class="keyword">typename</span> std::enable_if<has_value<U>::value>::type* = <span class="keyword">nullptr</span>></div><div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="keywordtype">void</span> deserialize_value_node(Deserializer& deserializer, trie_node* current_node) {</div><div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  tsl_ht_assert(!current_node->val_node());</div><div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  current_node->val_node() = make_unique<value_node>(deserialize_value<T>(deserializer));</div><div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  }</div><div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  </div><div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <span class="keyword">template</span><<span class="keyword">class</span> U, <span class="keyword">class</span> Deserializer></div><div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  <span class="keyword">static</span> U deserialize_value(Deserializer& deserializer) {</div><div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <span class="comment">// MSVC < 2017 is not conformant, circumvent the problem by removing the template keyword</span></div><div class="line"><a name="l02058"></a><span class="lineno"> 2058</span> <span class="preprocessor"> #if defined (_MSC_VER) && _MSC_VER < 1910</span></div><div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="keywordflow">return</span> deserializer.Deserializer::operator()<U>();</div><div class="line"><a name="l02060"></a><span class="lineno"> 2060</span> <span class="preprocessor"> #else </span></div><div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keywordflow">return</span> deserializer.Deserializer::template operator()<U>();</div><div class="line"><a name="l02062"></a><span class="lineno"> 2062</span> <span class="preprocessor"> #endif </span></div><div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  }</div><div class="line"><a name="l02064"></a><span class="lineno"> 2064</span> </div><div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="comment">// Same as std::make_unique for non-array types which is only available in C++14 (we need to support C++11).</span></div><div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span>... Args></div><div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="keyword">static</span> std::unique_ptr<U> make_unique(Args&&... args) {</div><div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  <span class="keywordflow">return</span> std::unique_ptr<U>(<span class="keyword">new</span> U(std::forward<Args>(args)...));</div><div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  }</div><div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  </div><div class="line"><a name="l02071"></a><span class="lineno"> 2071</span> <span class="keyword">public</span>: </div><div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  <span class="keyword">static</span> constexpr <span class="keywordtype">float</span> HASH_NODE_DEFAULT_MAX_LOAD_FACTOR = 8.0f;</div><div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  <span class="keyword">static</span> <span class="keyword">const</span> size_type DEFAULT_BURST_THRESHOLD = 16384;</div><div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  </div><div class="line"><a name="l02075"></a><span class="lineno"> 2075</span> <span class="keyword">private</span>:</div><div class="line"><a name="l02076"></a><span class="lineno"> 2076</span> </div><div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  <span class="keyword">using</span> slz_size_type = std::uint64_t;</div><div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  <span class="keyword">enum class</span> slz_node_type: CharT { TRIE_NODE = 0, HASH_NODE = 1 };</div><div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  </div><div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <span class="keyword">static</span> <span class="keyword">const</span> slz_size_type SERIALIZATION_PROTOCOL_VERSION = 1;</div><div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  </div><div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  <span class="keyword">static</span> <span class="keyword">const</span> size_type HASH_NODE_DEFAULT_INIT_BUCKETS_COUNT = 32;</div><div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  <span class="keyword">static</span> <span class="keyword">const</span> size_type MIN_BURST_THRESHOLD = 4;</div><div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  </div><div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  std::unique_ptr<anode> m_root;</div><div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  size_type m_nb_elements;</div><div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  Hash m_hash;</div><div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="keywordtype">float</span> m_max_load_factor;</div><div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  size_type m_burst_threshold;</div><div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  </div><div class="line"><a name="l02098"></a><span class="lineno"> 2098</span> };</div><div class="line"><a name="l02099"></a><span class="lineno"> 2099</span> </div><div class="line"><a name="l02100"></a><span class="lineno"> 2100</span> } <span class="comment">// end namespace detail_htrie_hash</span></div><div class="line"><a name="l02101"></a><span class="lineno"> 2101</span> } <span class="comment">// end namespace tsl</span></div><div class="line"><a name="l02102"></a><span class="lineno"> 2102</span> </div><div class="line"><a name="l02103"></a><span class="lineno"> 2103</span> <span class="preprocessor">#endif</span></div><div class="ttc" id="structtsl_1_1detail__htrie__hash_1_1value__node_3_01void_01_4_html"><div class="ttname"><a href="structtsl_1_1detail__htrie__hash_1_1value__node_3_01void_01_4.html">tsl::detail_htrie_hash::value_node< void ></a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:118</div></div>
<div class="ttc" id="classtsl_1_1array__set_html"><div class="ttname"><a href="classtsl_1_1array__set.html">tsl::array_set</a></div><div class="ttdef"><b>Definition:</b> array_set.h:67</div></div>
<div class="ttc" id="namespacetsl_html"><div class="ttname"><a href="namespacetsl.html">tsl</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:39</div></div>
<div class="ttc" id="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator_html"><div class="ttname"><a href="classtsl_1_1detail__htrie__hash_1_1htrie__hash_1_1htrie__hash__iterator.html">tsl::detail_htrie_hash::htrie_hash::htrie_hash_iterator</a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:142</div></div>
<div class="ttc" id="namespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> StdExtension.hpp:18</div></div>
<div class="ttc" id="group__crfsuite__hpp__api__doc_html_gaa8ef1fab26ec65f18b7e34e6edac5ef5"><div class="ttname"><a href="group__crfsuite__hpp__api__doc.html#gaa8ef1fab26ec65f18b7e34e6edac5ef5">chatopera::bot::crfsuite::version</a></div><div class="ttdeci">std::string version()</div><div class="ttdef"><b>Definition:</b> crfsuite.hpp:672</div></div>
<div class="ttc" id="classtsl_1_1array__map_html"><div class="ttname"><a href="classtsl_1_1array__map.html">tsl::array_map</a></div><div class="ttdef"><b>Definition:</b> array_map.h:71</div></div>
<div class="ttc" id="structtsl_1_1detail__htrie__hash_1_1value__node_html"><div class="ttname"><a href="structtsl_1_1detail__htrie__hash_1_1value__node.html">tsl::detail_htrie_hash::value_node</a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:105</div></div>
<div class="ttc" id="structtsl_1_1detail__htrie__hash_1_1is__related_html"><div class="ttname"><a href="structtsl_1_1detail__htrie__hash_1_1is__related.html">tsl::detail_htrie_hash::is_related</a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:81</div></div>
<div class="ttc" id="classtsl_1_1ah_1_1power__of__two__growth__policy_html"><div class="ttname"><a href="classtsl_1_1ah_1_1power__of__two__growth__policy.html">tsl::ah::power_of_two_growth_policy</a></div><div class="ttdef"><b>Definition:</b> array_growth_policy.h:49</div></div>
<div class="ttc" id="structtsl_1_1detail__htrie__hash_1_1is__iterator_html"><div class="ttname"><a href="structtsl_1_1detail__htrie__hash_1_1is__iterator.html">tsl::detail_htrie_hash::is_iterator</a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:73</div></div>
<div class="ttc" id="classtsl_1_1detail__htrie__hash_1_1htrie__hash_html"><div class="ttname"><a href="classtsl_1_1detail__htrie__hash_1_1htrie__hash.html">tsl::detail_htrie_hash::htrie_hash</a></div><div class="ttdef"><b>Definition:</b> htrie_hash.h:129</div></div>
</div><!-- fragment --></div><!-- contents -->
<address class="footer">
<small>
Copyright (c) (2019-2020) <a href="https://www.chatopera.com">
北京华夏春松科技有限公司
</a>. All Rights Reserved
</small>
</address>