diff options
Diffstat (limited to 'doc/html/KD__Tree_8h_source.html')
| -rw-r--r-- | doc/html/KD__Tree_8h_source.html | 324 |
1 files changed, 324 insertions, 0 deletions
diff --git a/doc/html/KD__Tree_8h_source.html b/doc/html/KD__Tree_8h_source.html new file mode 100644 index 0000000..9c80126 --- /dev/null +++ b/doc/html/KD__Tree_8h_source.html @@ -0,0 +1,324 @@ +<!-- 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/KD_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('KD__Tree_8h_source.html','');}); +</script> +<div id="doc-content"> +<div class="header"> + <div class="headertitle"> +<div class="title">KD_Tree.h</div> </div> +</div><!--header--> +<div class="contents"> +<a href="KD__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_KD_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_KD_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 "../utility.h"</span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include "../math/utility.h"</span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include <cstdlib></span></div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#include <vector></span></div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="preprocessor">#include <algorithm></span></div> +<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#include <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="l00039"></a><span class="lineno"> 39</span> <span class="keyword">template</span><<span class="keyword">class</span> Vector, <span class="keyword">class</span> Scalar></div> +<div class="line"><a name="l00040"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html"> 40</a></span> <span class="keyword">class </span><a class="code" href="classmeow_1_1KD__Tree.html" title="k-dimension tree">KD_Tree</a> {</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="keyword">private</span>:</div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keyword">struct </span>Node {</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> vector_;</div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  ssize_t lChild_;</div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  ssize_t rChild_;</div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  Node(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> v, ssize_t l, ssize_t r): vector_(v), lChild_(l), rChild_(r){</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>  };</div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">typedef</span> std::vector<Node> Nodes;</div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">class </span>Sorter {</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keyword">private</span>:</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  Nodes <span class="keyword">const</span>* nodes_;</div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">size_t</span> cmp_;</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">public</span>:</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  Sorter(Nodes <span class="keyword">const</span>* nodes, <span class="keywordtype">size_t</span> cmp):</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  nodes_(nodes), cmp_(cmp){</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="keywordtype">bool</span> operator()(<span class="keywordtype">size_t</span> <span class="keyword">const</span>& a, <span class="keywordtype">size_t</span> <span class="keyword">const</span>& b)<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> ((*nodes_)[a].vector_[cmp_] != (*nodes_)[b].vector_[cmp_]) {</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> ((*nodes_)[a].vector_[cmp_] < (*nodes_)[b].vector_[cmp_]);</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="keywordflow">return</span> ((*nodes_)[a].vector_ < (*nodes_)[b].vector_);</div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</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>  <span class="keyword">struct </span>Answer {</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  ssize_t index_;</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  Scalar dist2_;</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  Answer(ssize_t index, Scalar dist2):</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  index_(index), dist2_(dist2) {</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>  Answer(Answer <span class="keyword">const</span>& answer2):</div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  index_(answer2.index_), dist2_(answer2.dist2_) {</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div> +<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  };</div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">class </span>AnswerCompare {</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">private</span>:</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  Nodes <span class="keyword">const</span>* nodes_;</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordtype">bool</span> cmpValue_;</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">public</span>:</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  AnswerCompare(Nodes <span class="keyword">const</span>* nodes, <span class="keywordtype">bool</span> cmpValue):</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  nodes_(nodes), cmpValue_(cmpValue) {</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="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="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (cmpValue_ == <span class="keyword">true</span> && a.dist2_ == b.dist2_) {</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> ((*nodes_)[a.index_].vector_ < (*nodes_)[b.index_].vector_);</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> (a.dist2_ < b.dist2_);</div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</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>  <span class="keyword">typedef</span> std::vector<Answer> AnswerV;</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> std::priority_queue<Answer, AnswerV, AnswerCompare> Answers;</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">const</span> ssize_t kNIL_;</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  Nodes nodes_;</div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">size_t</span> root_;</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordtype">bool</span> needRebuild_;</div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordtype">size_t</span> dimension_;</div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  Scalar distance2(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v1, <a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v2)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  Scalar ret(0);</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0; i < dimension_; i++){</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  ret += <a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573" title="x*x ">squ</a>(v1[i] - v2[i]);</div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordtype">void</span> query(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v,</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">size_t</span> nearestNumber,</div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  AnswerCompare <span class="keyword">const</span>& answerCompare,</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  ssize_t index,</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordtype">int</span> depth,</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  std::vector<Scalar>& dist2Vector,</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  Scalar dist2Minimum,</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  Answers *out)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (index == kNIL_) return ;</div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordtype">size_t</span> cmp = depth % dimension_;</div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  ssize_t this_side, that_side;</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keywordflow">if</span> (!(nodes_[index].vector_[cmp] < v[cmp])) {</div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  this_side = nodes_[index].lChild_;</div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  that_side = nodes_[index].rChild_;</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }<span class="keywordflow">else</span>{</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  this_side = nodes_[index].rChild_;</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  that_side = nodes_[index].lChild_;</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  query(v, nearestNumber, answerCompare,</div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  this_side, depth + 1,</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  dist2Vector, dist2Minimum,</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  out);</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  Answer my_ans(index, distance2(nodes_[index].vector_, v));</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (out->size() < nearestNumber || answerCompare(my_ans, out->top())) {</div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  out->push(my_ans);</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (out->size() > nearestNumber) out->pop();</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  Scalar dist2_old(dist2Vector[cmp]);</div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  dist2Vector[cmp] = <a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573" title="x*x ">squ</a>(nodes_[index].vector_[cmp] - v[cmp]);</div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  Scalar dist2Minimum2(dist2Minimum + dist2Vector[cmp] - dist2_old);</div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (out->size() < nearestNumber || !(out->top().dist2_ < dist2Minimum)) {</div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  query(v, nearestNumber, answerCompare,</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  that_side, depth + 1,</div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  dist2Vector, dist2Minimum2,</div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  out);</div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  dist2Vector[cmp] = dist2_old;</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>  ssize_t <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(ssize_t beg,</div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  ssize_t end,</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  std::vector<size_t>* orders,</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordtype">int</span> depth) {</div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (beg > end) <span class="keywordflow">return</span> kNIL_;</div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordtype">size_t</span> tmp_order = dimension_;</div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordtype">size_t</span> which_side = dimension_ + 1;</div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  ssize_t mid = (beg + end) / 2;</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordtype">size_t</span> cmp = depth % dimension_;</div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (ssize_t i = beg; i <= mid; i++) {</div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  orders[which_side][orders[cmp][i]] = 0;</div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">for</span> (ssize_t i = mid + 1; i <= end; i++) {</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  orders[which_side][orders[cmp][i]] = 1;</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>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < dimension_; i++) {</div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (i == cmp) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">size_t</span> left = beg, right = mid + 1;</div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = beg; j <= end; j++) {</div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">size_t</span> ask = orders[i][j];</div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">if</span>(ask == orders[cmp][mid]) {</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  orders[tmp_order][mid] = ask;</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="keywordflow">else</span> <span class="keywordflow">if</span>(orders[which_side][ask] == 1) {</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  orders[tmp_order][right++] = ask;</div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  orders[tmp_order][left++] = ask;</div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = beg; j <= end; j++) {</div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  orders[i][j] = orders[tmp_order][j];</div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  nodes_[orders[cmp][mid]].lChild_ = <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(beg, mid - 1, orders, depth + 1);</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  nodes_[orders[cmp][mid]].rChild_ = <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(mid + 1, end, orders, depth + 1);</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> orders[cmp][mid];</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">public</span>:</div> +<div class="line"><a name="l00189"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8"> 189</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::vector<Vector> <a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8" title="Custom Type: Vectors is std::vector<Vector> ">Vectors</a>;</div> +<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div> +<div class="line"><a name="l00192"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9"> 192</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9" title="constructor, with dimension = 1">KD_Tree</a>(): kNIL_(-1), root_(kNIL_), needRebuild_(false), dimension_(1) {</div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div> +<div class="line"><a name="l00196"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#aafecfa34e96615249e11e9ba1b85fdc7"> 196</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9" title="constructor, with dimension = 1">KD_Tree</a>(<span class="keywordtype">size_t</span> dimension):</div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  kNIL_(-1), root_(kNIL_), needRebuild_(false), dimension_(dimension) {</div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  </div> +<div class="line"><a name="l00201"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a6ffacb6d4020cfb1c127b68f3f427ee4"> 201</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#a6ffacb6d4020cfb1c127b68f3f427ee4" title="destructor">~KD_Tree</a>() {</div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  }</div> +<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div> +<div class="line"><a name="l00207"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#ad1af6def42b23b9b4acef03d32774b9e"> 207</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1KD__Tree.html#ad1af6def42b23b9b4acef03d32774b9e" title="將給定的Vector加到set中">insert</a>(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v) {</div> +<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  nodes_.push_back(Node(v, kNIL_, kNIL_));</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  needRebuild_ = <span class="keyword">true</span>;</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="l00215"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#adb0aaa5a70a7255935d8a4326c454434"> 215</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1KD__Tree.html#adb0aaa5a70a7255935d8a4326c454434" title="將給定的Vector從set移除">erase</a>(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v) {</div> +<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = nodes_.size(); i < I; i++) {</div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (nodes_[i] == v) {</div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">if</span> (i != I - 1) {</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  std::swap(nodes_[i], nodes_[I - 1]);</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>  needRebuild_ = <span class="keyword">true</span>;</div> +<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  }</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> <span class="keyword">false</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> </div> +<div class="line"><a name="l00231"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022"> 231</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(){</div> +<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (needRebuild_) {</div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="classmeow_1_1KD__Tree.html#a09bf16356618fde6d256a843b87f44b6" title="重新建樹">forceBuild</a>();</div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div> +<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div> +<div class="line"><a name="l00240"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a09bf16356618fde6d256a843b87f44b6"> 240</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1KD__Tree.html#a09bf16356618fde6d256a843b87f44b6" title="重新建樹">forceBuild</a>() {</div> +<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  std::vector<size_t> *orders = <span class="keyword">new</span> std::vector<size_t>[dimension_ + 2];</div> +<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < dimension_ + 2; j++) {</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  orders[j].resize(nodes_.size());</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < dimension_; j++) {</div> +<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = nodes_.size(); i < I; i++) {</div> +<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  orders[j][i] = i;</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  std::sort(orders[j].begin(), orders[j].end(), Sorter(&nodes_, j));</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>  root_ = <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022" title="檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() ">build</a>(0, (ssize_t)nodes_.size() - 1, orders, 0);</div> +<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keyword">delete</span> [] orders;</div> +<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  needRebuild_ = <span class="keyword">false</span>;</div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div> +<div class="line"><a name="l00263"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a10e1cac9c14e047d77fb95eaf0b49bd8"> 263</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8" title="Custom Type: Vectors is std::vector<Vector> ">Vectors</a> query(<a class="code" href="classmeow_1_1Vector.html" title="vector ">Vector</a> <span class="keyword">const</span>& v,</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordtype">size_t</span> nearestNumber,</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordtype">bool</span> compareWholeVector)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  ((<a class="code" href="classmeow_1_1KD__Tree.html" title="k-dimension tree">KD_Tree</a>*)<span class="keyword">this</span>)->build();</div> +<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  AnswerCompare answer_compare(&nodes_, compareWholeVector);</div> +<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  Answers answer_set(answer_compare);</div> +<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  std::vector<Scalar> tmp(dimension_, 0);</div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  query(v, nearestNumber,</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  answer_compare,</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  root_, 0,</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  tmp, Scalar(0),</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  &answer_set);</div> +<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8" title="Custom Type: Vectors is std::vector<Vector> ">Vectors</a> ret(answer_set.size());</div> +<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = (ssize_t)answer_set.size() - 1; i >= 0; i--) {</div> +<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  ret[i] = nodes_[answer_set.top().index_].vector_;</div> +<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  answer_set.pop();</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>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div> +<div class="line"><a name="l00286"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a586afb8e59665a951ab0a9deae2fde40"> 286</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1KD__Tree.html#a586afb8e59665a951ab0a9deae2fde40" title="清空所有資料">clear</a>() {</div> +<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  root_ = kNIL_;</div> +<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  nodes_.clear();</div> +<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  needRebuild_ = <span class="keyword">false</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> </div> +<div class="line"><a name="l00295"></a><span class="lineno"><a class="code" href="classmeow_1_1KD__Tree.html#a45be7cf06442b1a75902faa266950121"> 295</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1KD__Tree.html#a45be7cf06442b1a75902faa266950121" title="清空所有資料並重新給定維度">reset</a>(<span class="keywordtype">size_t</span> dimension) {</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="classmeow_1_1KD__Tree.html#a586afb8e59665a951ab0a9deae2fde40" title="清空所有資料">clear</a>();</div> +<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  dimension_ = dimension;</div> +<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div> +<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> };</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> <span class="preprocessor">#endif // dsa_KD_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="KD__Tree_8h.html">KD_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> |