diff options
Diffstat (limited to 'doc/html/VP__Tree_8h_source.html')
| -rw-r--r-- | doc/html/VP__Tree_8h_source.html | 343 |
1 files changed, 343 insertions, 0 deletions
diff --git a/doc/html/VP__Tree_8h_source.html b/doc/html/VP__Tree_8h_source.html new file mode 100644 index 0000000..7947eac --- /dev/null +++ b/doc/html/VP__Tree_8h_source.html @@ -0,0 +1,343 @@ +<!-- HTML header for doxygen 1.8.3.1--> +<!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.3.1"/> +<title>Templates -- Meow: meowpp/dsa/VP_Tree.h Source File</title> +<link href="tabs.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="jquery.js"></script> +<script type="text/javascript" src="dynsections.js"></script> +<link href="navtree.css" rel="stylesheet" type="text/css"/> +<script type="text/javascript" src="resize.js"></script> +<script type="text/javascript" src="navtree.js"></script> +<script type="text/javascript"> + $(document).ready(initResizable); + $(window).load(resizeHeight); +</script> +<link href="stylesheet.css" rel="stylesheet" type="text/css" /> +<link href="custom.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="projectlogo"><img alt="Logo" src="logo.png"/></td> + <td style="padding-left: 0.5em;"> + <div id="projectname">Templates -- Meow +  <span id="projectnumber">1.1.2</span> + </div> + <div id="projectbrief">不能,也不應該先編譯成obj-file的templates</div> + </td> + </tr> + </tbody> +</table> +</div> +<!-- end header part --> +<!-- Generated by Doxygen 1.8.3.1 --> +</div><!-- top --> +<div id="side-nav" class="ui-resizable side-nav-resizable"> + <div id="nav-tree"> + <div id="nav-tree-contents"> + <div id="nav-sync" class="sync"></div> + </div> + </div> + <div id="splitbar" style="-moz-user-select:none;" + class="ui-resizable-handle"> + </div> +</div> +<script type="text/javascript"> +$(document).ready(function(){initNavTree('VP__Tree_8h_source.html','');}); +</script> +<div id="doc-content"> +<div class="header"> + <div class="headertitle"> +<div class="title">VP_Tree.h</div> </div> +</div><!--header--> +<div class="contents"> +<a href="VP__Tree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="preprocessor">#ifndef dsa_VP_Tree_H__</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor"></span><span class="preprocessor">#define dsa_VP_Tree_H__</span></div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor"></span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include "../math/utility.h"</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> </div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="preprocessor">#include <cstdlib></span></div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#include <list></span></div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <stack></span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <queue></span></div> +<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div> +<div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="keyword">namespace </span>meow {</div> +<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> </div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">template</span><<span class="keyword">class</span> Vector, <span class="keyword">class</span> Scalar></div> +<div class="line"><a name="l00051"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html"> 51</a></span> <span class="keyword">class </span><a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a> {</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">public</span>:</div> +<div class="line"><a name="l00053"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4"> 53</a></span>  <span class="keyword">typedef</span> std::vector<Vector> <a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a>;</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">private</span>:</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">struct </span>Node {</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordtype">size_t</span> index_;</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  Scalar threshold_;</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  Node* nearChild_;</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  Node* farChild_;</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  Node(<span class="keywordtype">size_t</span> index): index_(index), nearChild_(NULL), farChild_(NULL){</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  };</div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">struct </span>Answer {</div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordtype">size_t</span> index_;</div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  Scalar dist2_;</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  Answer(<span class="keywordtype">size_t</span> index, Scalar <span class="keyword">const</span>& dist2): index_(index), dist2_(dist2){</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>  Answer(Answer <span class="keyword">const</span>& answer2):</div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  index_(answer2.index_), dist2_(answer2.dist2_){</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  };</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">class </span>AnswerCompare {</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">private</span>:</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a> <span class="keyword">const</span>* vectors_;</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordtype">bool</span> cmpValue_;</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">public</span>:</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  AnswerCompare(<a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a> <span class="keyword">const</span>* vectors, <span class="keywordtype">bool</span> cmpValue):</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  vectors_(vectors), cmpValue_(cmpValue){</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  }</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">bool</span> operator()(Answer <span class="keyword">const</span>& a, Answer <span class="keyword">const</span>& b)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">if</span> (a.dist2_ < b.dist2_) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">if</span> (b.dist2_ < a.dist2_) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">return</span> (cmpValue_ && ((*vectors_)[a.index_] < (*vectors_)[b.index_]));</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>  };</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">typedef</span> std::vector<Answer> AnswerV;</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keyword">typedef</span> std::priority_queue<Answer, AnswerV, AnswerCompare> Answers;</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a> vectors_;</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  Node* root_;</div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordtype">size_t</span> dimension_;</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordtype">bool</span> needRebuild_;</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>  Scalar distance2(Vector <span class="keyword">const</span>& v1, Vector <span class="keyword">const</span>& v2)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  Scalar ret(0);</div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < dimension_; i++) ret += <a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573" title="x*x ">squ</a>(v1[i] - v2[i]);</div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">int</span> distanceCompare(Scalar <span class="keyword">const</span>& a2, Scalar <span class="keyword">const</span>& b2,</div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  Scalar <span class="keyword">const</span>& c2)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (b2 < 0) {</div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">return</span> -distanceCompare(c2, -b2, a2);</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  Scalar cab(c2 - a2 - b2);</div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">if</span> (cab < Scalar(0)) <span class="keywordflow">return</span> 1;</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  Scalar ab2(Scalar(4) * a2 * b2), cab2(<a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573" title="x*x ">squ</a>(cab));</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> ( ab2 < cab2) <span class="keywordflow">return</span> -1;</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cab2 < ab2) <span class="keywordflow">return</span> 1;</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">else</span> <span class="keywordflow">return</span> 0;</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>  Scalar split(ssize_t first, ssize_t last, <span class="keywordtype">size_t</span> order,</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  Vector <span class="keyword">const</span>& center) {</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  ssize_t first0 = first;</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::vector<Scalar> dist2(last - first + 1);</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">for</span> (ssize_t i = first; i <= last; i++) {</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  dist2[i - first0] = distance2(vectors_[i], center);</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>  <span class="keywordflow">while</span> (first < last) {</div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordtype">size_t</span> thresholdindex_ = first + rand() % (last - first + 1);</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  Scalar threshold(dist2[thresholdindex_ - first0]);</div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordtype">size_t</span> large_first = last + 1;</div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">for</span>( ssize_t i=first; first<=(ssize_t)large_first-1; large_first--) {</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span> (threshold < dist2[large_first - 1 - first0]) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">while</span> (i < (ssize_t)large_first-1&&!(threshold < dist2[i-first0])) i++;</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (i < (ssize_t)large_first - 1){</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  std::swap(dist2 [large_first - 1 - first0], dist2 [i - first0]);</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::swap(vectors_[large_first - 1 ], vectors_[i ]);</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  i++;</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</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="keywordflow">if</span> (large_first == (<span class="keywordtype">size_t</span>)last + 1) {</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  std::swap(dist2 [thresholdindex_-first0], dist2 [last-first0]);</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  std::swap(vectors_[thresholdindex_ ], vectors_[last ]);</div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> ((ssize_t)order == last - first) {</div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  first = last;</div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  last--;</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="keywordflow">else</span> {</div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (order < large_first - first) {</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  last = large_first - 1;</div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  order -= large_first - first;</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  first = large_first;</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</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="keywordflow">return</span> dist2[first - first0];</div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  Node* <a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(ssize_t first, ssize_t last) {</div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (first > last) <span class="keywordflow">return</span> NULL;</div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  Node* ret = <span class="keyword">new</span> Node(first);</div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (first < last) {</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  std::swap(vectors_[first],</div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  vectors_[first + rand() % (last - first + 1)]);</div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  ssize_t mid = (first + 1 + last + 1) / 2;</div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  ret->threshold_ = split(first + 1, last, mid - (first + 1),</div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  vectors_[first]);</div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  ret->nearChild_ = <a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(first + 1, mid - 1 );</div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  ret->farChild_ = <a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>( mid , last);</div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordtype">void</span> query(Vector <span class="keyword">const</span>& vector,</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordtype">size_t</span> k,</div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  AnswerCompare <span class="keyword">const</span>& cmp,</div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  Node <span class="keyword">const</span>* node,</div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  Answers* out)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (node == NULL) return ;</div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  Scalar dist2 = distance2(vector, vectors_[node->index_]);</div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  Answer my_ans(node->index_, dist2);</div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">if</span> (out->size() < k || cmp(my_ans, out->top())) {</div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  out->push(my_ans);</div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">if</span> (out->size() > k) {</div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  out->pop();</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div> +<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (node->nearChild_ == NULL && node->farChild_ == NULL) return ;</div> +<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (out->size() < k || distanceCompare(dist2, -out->top().dist2_,</div> +<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  node->threshold_) <= 0) {</div> +<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  query(vector, k, cmp, node->nearChild_, out);</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div> +<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (out->size() < k || distanceCompare(dist2, out->top().dist2_,</div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  node->threshold_) >= 0) {</div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  query(vector, k, cmp, node->farChild_, out);</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  }</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>(Node* root) {</div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">if</span>(root == NULL) return ;</div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>(root->nearChild_);</div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>(root->farChild_);</div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">delete</span> root;</div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  Node* dup(Node* root) {</div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span>(root == NULL) return ;</div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  Node* ret = <span class="keyword">new</span> Node(root->index_);</div> +<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  ret->threshold_ = root->threshold_;</div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  ret->nearChild_ = dup(root->nearChild_);</div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  ret->farChild_ = dup(root->farChild_ );</div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="keyword">public</span>:</div> +<div class="line"><a name="l00212"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#ab611c988f5c567498d40866e9eab3851"> 212</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html#ab611c988f5c567498d40866e9eab3851" title="constructor, with dimension = 1">VP_Tree</a>(): root_(NULL), vectors_(0), dimension_(1), needRebuild_(false){</div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ad1bffde18bc2f0fc955e78fe77333558" title="清空所有資料並重新給定維度">reset</a>(0);</div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div> +<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div> +<div class="line"><a name="l00217"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a1f301f751afe7baf5eafe6964c6a7a15"> 217</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html#ab611c988f5c567498d40866e9eab3851" title="constructor, with dimension = 1">VP_Tree</a>(<a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a> <span class="keyword">const</span>& tree2):</div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  vectors_(tree2.vectors_),</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  root_(dup(tree2.root_)),</div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  dimension_(tree2.dimension_),</div> +<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  needRebuild_(tree2.needRebuild_) {</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div> +<div class="line"><a name="l00225"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a5ce274e16a28c6ef5cac63c6e3258d8b"> 225</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html#ab611c988f5c567498d40866e9eab3851" title="constructor, with dimension = 1">VP_Tree</a>(<span class="keywordtype">size_t</span> dimension):</div> +<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  vectors_(0),</div> +<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  root_(NULL),</div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  dimension_(0),</div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  needRebuild_(false) {</div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ad1bffde18bc2f0fc955e78fe77333558" title="清空所有資料並重新給定維度">reset</a>(dimension);</div> +<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div> +<div class="line"><a name="l00234"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a599a1fba89e0e5a06fa1e71c81bc5216"> 234</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html#a599a1fba89e0e5a06fa1e71c81bc5216" title="destructor">~VP_Tree</a>() {</div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>(root_);</div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div> +<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div> +<div class="line"><a name="l00241"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#afcc9734a4e012d6dfdab408d5c698905"> 241</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a>& <a class="code" href="classmeow_1_1VP__Tree.html#afcc9734a4e012d6dfdab408d5c698905" title="複製資料">copyFrom</a>(<a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a> <span class="keyword">const</span>& tree2) {</div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ad1bffde18bc2f0fc955e78fe77333558" title="清空所有資料並重新給定維度">reset</a>(tree2.dimension_);</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  vectors_ = tree2.vectors_;</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  root_ = dup(tree2.root_);</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  needRebuild_ = tree2.needRebuild_;</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div> +<div class="line"><a name="l00252"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a2319a3995c4b6ad415a4997764e83b3f"> 252</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1VP__Tree.html#a2319a3995c4b6ad415a4997764e83b3f" title="將給定的Vector加到set中">insert</a>(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& vector) {</div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  vectors_.push_back(vector);</div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  needRebuild_ = <span class="keyword">true</span>;</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="l00260"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#aa53e215a7e6daa3edfba4201602c8894"> 260</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1VP__Tree.html#aa53e215a7e6daa3edfba4201602c8894" title="將給定的Vector從set移除">erase</a> (<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& vector) {</div> +<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">for</span> (ssize_t i = 0, I = vectors_.size(); i < I; i++) {</div> +<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">if</span> (vectors_[i] == vector) {</div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (i != I - 1) std::swap(vectors_[i], vectors_[I - 1]);</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  needRebuild_ = <span class="keyword">true</span>;</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  vectors_.pop_back();</div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">return</span> <span class="keyword">true</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="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div> +<div class="line"><a name="l00275"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9"> 275</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>() {</div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (needRebuild_) {</div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="code" href="classmeow_1_1VP__Tree.html#aa4adfa52bd1cee8703b49a5ecf906733" title="重新建樹">forceBuild</a>();</div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  }</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span> </div> +<div class="line"><a name="l00284"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#aa4adfa52bd1cee8703b49a5ecf906733"> 284</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1VP__Tree.html#aa4adfa52bd1cee8703b49a5ecf906733" title="重新建樹">forceBuild</a>() {</div> +<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  root_ = <a class="code" href="classmeow_1_1VP__Tree.html#a4688e0675080bf406a086d176c5555b9" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(0, (<span class="keywordtype">size_t</span>)vectors_.size() - 1);</div> +<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  needRebuild_ = <span class="keyword">false</span>;</div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> </div> +<div class="line"><a name="l00296"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a22db303a6318b2ef58957b22063cb591"> 296</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a> query(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& vector,</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordtype">size_t</span> nearestNumber,</div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordtype">bool</span> compareWholeVector)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  ((<a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a>*)<span class="keyword">this</span>)->build();</div> +<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  AnswerCompare cmp(&vectors_, compareWholeVector);</div> +<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  Answers answers(cmp);</div> +<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  query(vector, nearestNumber, cmp, root_, &answers);</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  std::stack<Answer> rev;</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">for</span> ( ; !answers.empty(); answers.pop()) rev.push(answers.top());</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <a class="code" href="classmeow_1_1VP__Tree.html#a02c136810876c8713b9760aa8bb51aa4">Vectors</a> ret;</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">for</span> ( ; !rev.empty(); rev.pop()) ret.push_back(vectors_[rev.top().index_]);</div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> ret;</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="l00313"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c"> 313</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>() {</div> +<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>(root_);</div> +<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  vectors_.clear();</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  root_ = NULL;</div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  needRebuild_ = <span class="keyword">false</span>;</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="l00323"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#ad1bffde18bc2f0fc955e78fe77333558"> 323</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1VP__Tree.html#ad1bffde18bc2f0fc955e78fe77333558" title="清空所有資料並重新給定維度">reset</a>(<span class="keywordtype">size_t</span> dimension) {</div> +<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="classmeow_1_1VP__Tree.html#ac4d1a186226b2d27abce9eb71149c62c" title="清空所有資料">clear</a>();</div> +<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  dimension_ = std::max((<span class="keywordtype">size_t</span>)1, dimension);</div> +<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">return</span> dimension_;</div> +<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</div> +<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div> +<div class="line"><a name="l00330"></a><span class="lineno"><a class="code" href="classmeow_1_1VP__Tree.html#a7c73bb25b40f440b48267f94fa4561ad"> 330</a></span>  <a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a>& <a class="code" href="classmeow_1_1VP__Tree.html#a7c73bb25b40f440b48267f94fa4561ad" title="same as copyFrom(tree2) ">operator=</a>(<a class="code" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a> <span class="keyword">const</span>& tree2) {</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1VP__Tree.html#afcc9734a4e012d6dfdab408d5c698905" title="複製資料">copyFrom</a>(tree2);</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  }</div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span> };</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> </div> +<div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="preprocessor">#endif // dsa_VP_Tree_H__</span></div> +</div><!-- fragment --></div><!-- contents --> +</div><!-- doc-content --> +<!-- HTML footer for doxygen 1.8.3.1--> +<!-- start footer part --> +<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> + <ul> + <li class="navelem"><a class="el" href="dir_92fecd8d02dd5e7a67429447fdf0f60f.html">meowpp</a></li><li class="navelem"><a class="el" href="dir_a17ff8dcb3a1c1b842af541700214096.html">dsa</a></li><li class="navelem"><a class="el" href="VP__Tree_8h.html">VP_Tree.h</a></li> + <li class="footer">Generated on Sun Jun 1 2014 13:54:33 for Templates -- Meow by + <a href="http://www.doxygen.org/index.html"> + <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.3.1 </li> + </ul> +</div> +</body> +</html> |