| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.9.1"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1"/> |
| <title>datasketches-cpp: theta/include/theta_intersection_base_impl.hpp Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </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">datasketches-cpp |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.9.1 --> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| var searchBox = new SearchBox("searchBox", "search",false,'Search','.html'); |
| /* @license-end */ |
| </script> |
| <script type="text/javascript" src="menudata.js"></script> |
| <script type="text/javascript" src="menu.js"></script> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| $(function() { |
| initMenu('',true,false,'search.php','Search'); |
| $(document).ready(function() { init_search(); }); |
| }); |
| /* @license-end */</script> |
| <div id="main-nav"></div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_e96b5dfe115c13cdeb36484e37aec42e.html">theta</a></li><li class="navelem"><a class="el" href="dir_3f8742d40c9573c3b90638004faf146b.html">include</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">theta_intersection_base_impl.hpp</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">/*</span></div> |
| <div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment"> * Licensed to the Apache Software Foundation (ASF) under one</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment"> * or more contributor license agreements. See the NOTICE file</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment"> * distributed with this work for additional information</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment"> * regarding copyright ownership. The ASF licenses this file</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment"> * to you under the Apache License, Version 2.0 (the</span></div> |
| <div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment"> * "License"); you may not use this file except in compliance</span></div> |
| <div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment"> * with the License. You may obtain a copy of the License at</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment"> * http://www.apache.org/licenses/LICENSE-2.0</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment"> *</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment"> * Unless required by applicable law or agreed to in writing,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment"> * software distributed under the License is distributed on an</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment"> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment"> * KIND, either express or implied. See the License for the</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment"> * specific language governing permissions and limitations</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment"> * under the License.</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment"> */</span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <iostream></span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <sstream></span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <stdexcept></span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "conditional_forward.hpp"</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="keyword">namespace </span><a class="code" href="namespacedatasketches.html">datasketches</a> {</div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">template</span><<span class="keyword">typename</span> EN, <span class="keyword">typename</span> EK, <span class="keyword">typename</span> P, <span class="keyword">typename</span> S, <span class="keyword">typename</span> CS, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> theta_intersection_base<EN, EK, P, S, CS, A>::theta_intersection_base(uint64_t seed, <span class="keyword">const</span> P& policy, <span class="keyword">const</span> A& allocator):</div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> policy_(policy),</div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> is_valid_(false),</div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span> table_(0, 0, resize_factor::X1, 1, theta_constants::<a class="code" href="namespacedatasketches_1_1theta__constants.html#ae3243c6bd90c8d8577c32b86100d97ad">MAX_THETA</a>, seed, allocator, false)</div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> {}</div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  </div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">template</span><<span class="keyword">typename</span> EN, <span class="keyword">typename</span> EK, <span class="keyword">typename</span> P, <span class="keyword">typename</span> S, <span class="keyword">typename</span> CS, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">template</span><<span class="keyword">typename</span> SS></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keywordtype">void</span> theta_intersection_base<EN, EK, P, S, CS, A>::update(SS&& sketch) {</div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keywordflow">if</span> (table_.is_empty_) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">if</span> (!sketch.is_empty() && sketch.get_seed_hash() != compute_seed_hash(table_.seed_)) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"seed hash mismatch"</span>);</div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  table_.is_empty_ |= sketch.is_empty();</div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  table_.theta_ = table_.is_empty_ ? theta_constants::MAX_THETA : std::min(table_.theta_, sketch.get_theta64());</div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">if</span> (is_valid_ && table_.num_entries_ == 0) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (sketch.get_num_retained() == 0) {</div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  is_valid_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  table_ = hash_table(0, 0, resize_factor::X1, 1, table_.theta_, table_.seed_, table_.allocator_, table_.is_empty_);</div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  }</div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (!is_valid_) { <span class="comment">// first update, copy or move incoming sketch</span></div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  is_valid_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">const</span> uint8_t lg_size = lg_size_from_count(sketch.get_num_retained(), theta_update_sketch_base<EN, EK, A>::REBUILD_THRESHOLD);</div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  table_ = hash_table(lg_size, lg_size - 1, resize_factor::X1, 1, table_.theta_, table_.seed_, table_.allocator_, table_.is_empty_);</div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>&& entry: sketch) {</div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">auto</span> result = table_.find(EK()(entry));</div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">if</span> (result.second) {</div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"duplicate key, possibly corrupted input sketch"</span>);</div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  }</div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  table_.insert(result.first, conditional_forward<SS>(entry));</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>  <span class="keywordflow">if</span> (table_.num_entries_ != sketch.get_num_retained()) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"num entries mismatch, possibly corrupted input sketch"</span>);</div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  } <span class="keywordflow">else</span> { <span class="comment">// intersection</span></div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> uint32_t max_matches = std::min(table_.num_entries_, sketch.get_num_retained());</div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  std::vector<EN, A> matched_entries(table_.allocator_);</div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  matched_entries.reserve(max_matches);</div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  uint32_t match_count = 0;</div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  uint32_t count = 0;</div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>&& entry: sketch) {</div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (EK()(entry) < table_.theta_) {</div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">auto</span> result = table_.find(EK()(entry));</div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">if</span> (result.second) {</div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (match_count == max_matches) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"max matches exceeded, possibly corrupted input sketch"</span>);</div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  policy_(*result.first, conditional_forward<SS>(entry));</div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  matched_entries.push_back(std::move(*result.first));</div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  ++match_count;</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="keywordflow">else</span> <span class="keywordflow">if</span> (sketch.is_ordered()) {</div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">break</span>; <span class="comment">// early stop</span></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>  ++count;</div> |
| <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (count > sketch.get_num_retained()) {</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">" more keys than expected, possibly corrupted input sketch"</span>);</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!sketch.is_ordered() && count < sketch.get_num_retained()) {</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">" fewer keys than expected, possibly corrupted input sketch"</span>);</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div> |
| <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (match_count == 0) {</div> |
| <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  table_ = hash_table(0, 0, resize_factor::X1, 1, table_.theta_, table_.seed_, table_.allocator_, table_.is_empty_);</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">if</span> (table_.theta_ == theta_constants::MAX_THETA) table_.is_empty_ = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">const</span> uint8_t lg_size = lg_size_from_count(match_count, theta_update_sketch_base<EN, EK, A>::REBUILD_THRESHOLD);</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  table_ = hash_table(lg_size, lg_size - 1, resize_factor::X1, 1, table_.theta_, table_.seed_, table_.allocator_, table_.is_empty_);</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (uint32_t i = 0; i < match_count; ++i) {</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">auto</span> result = table_.find(EK()(matched_entries[i]));</div> |
| <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  table_.insert(result.first, std::move(matched_entries[i]));</div> |
| <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  }</div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">template</span><<span class="keyword">typename</span> EN, <span class="keyword">typename</span> EK, <span class="keyword">typename</span> P, <span class="keyword">typename</span> S, <span class="keyword">typename</span> CS, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span> CS theta_intersection_base<EN, EK, P, S, CS, A>::get_result(<span class="keywordtype">bool</span> ordered)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">if</span> (!is_valid_) <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">"calling get_result() before calling update() is undefined"</span>);</div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  std::vector<EN, A> entries(table_.allocator_);</div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (table_.num_entries_ > 0) {</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  entries.reserve(table_.num_entries_);</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  std::copy_if(table_.begin(), table_.end(), std::back_inserter(entries), key_not_zero<EN, EK>());</div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (ordered) std::sort(entries.begin(), entries.end(), comparator());</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div> |
| <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> CS(table_.is_empty_, ordered, compute_seed_hash(table_.seed_), table_.theta_, std::move(entries));</div> |
| <div class="line"><a name="l00110"></a><span class="lineno"> 110</span> }</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div> |
| <div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">template</span><<span class="keyword">typename</span> EN, <span class="keyword">typename</span> EK, <span class="keyword">typename</span> P, <span class="keyword">typename</span> S, <span class="keyword">typename</span> CS, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">bool</span> theta_intersection_base<EN, EK, P, S, CS, A>::has_result()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> is_valid_;</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><<span class="keyword">typename</span> EN, <span class="keyword">typename</span> EK, <span class="keyword">typename</span> P, <span class="keyword">typename</span> S, <span class="keyword">typename</span> CS, <span class="keyword">typename</span> A></div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">const</span> P& theta_intersection_base<EN, EK, P, S, CS, A>::get_policy()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">return</span> policy_;</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="l00122"></a><span class="lineno"> 122</span> } <span class="comment">/* namespace datasketches */</span></div> |
| <div class="ttc" id="anamespacedatasketches_1_1theta__constants_html_ae3243c6bd90c8d8577c32b86100d97ad"><div class="ttname"><a href="namespacedatasketches_1_1theta__constants.html#ae3243c6bd90c8d8577c32b86100d97ad">datasketches::theta_constants::MAX_THETA</a></div><div class="ttdeci">const uint64_t MAX_THETA</div><div class="ttdoc">max theta - signed max for compatibility with Java</div><div class="ttdef"><b>Definition:</b> theta_constants.hpp:36</div></div> |
| <div class="ttc" id="anamespacedatasketches_html"><div class="ttname"><a href="namespacedatasketches.html">datasketches</a></div><div class="ttdoc">DataSketches namespace.</div><div class="ttdef"><b>Definition:</b> binomial_bounds.hpp:38</div></div> |
| </div><!-- fragment --></div><!-- contents --> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 |
| </small></address> |
| </body> |
| </html> |
