diff options
Diffstat (limited to 'doc/html/KD__Tree_8h_source.html')
| -rw-r--r-- | doc/html/KD__Tree_8h_source.html | 78 |
1 files changed, 46 insertions, 32 deletions
diff --git a/doc/html/KD__Tree_8h_source.html b/doc/html/KD__Tree_8h_source.html index bc4754a..5838f2a 100644 --- a/doc/html/KD__Tree_8h_source.html +++ b/doc/html/KD__Tree_8h_source.html @@ -4,7 +4,7 @@ <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"/> +<meta name="generator" content="Doxygen 1.8.6"/> <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> @@ -28,16 +28,16 @@ <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> +  <span id="projectnumber">1.1.4</span> </div> - <div id="projectbrief">不能,也不應該先編譯成obj-file的templates</div> + <div id="projectbrief">A C++ template which is unable and also not allowed to compile to obj-file first.</div> </td> </tr> </tbody> </table> </div> <!-- end header part --> -<!-- Generated by Doxygen 1.8.3.1 --> +<!-- Generated by Doxygen 1.8.6 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> @@ -73,14 +73,14 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00040"></a><span class="lineno"><a class="line" href="classmeow_1_1KD__Tree.html"> 40</a></span> <span class="keyword">class </span><a class="code" href="classmeow_1_1KD__Tree.html">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="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="classmeow_1_1Vector.html">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="l00047"></a><span class="lineno"> 47</span>  Node(<a class="code" href="classmeow_1_1Vector.html">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> @@ -136,15 +136,15 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00103"></a><span class="lineno"> 103</span>  Scalar distance2(<a class="code" href="classmeow_1_1Vector.html">Vector</a> <span class="keyword">const</span>& v1, <a class="code" href="classmeow_1_1Vector.html">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="l00106"></a><span class="lineno"> 106</span>  ret += <a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573">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="l00111"></a><span class="lineno"> 111</span>  <span class="keywordtype">void</span> query(<a class="code" href="classmeow_1_1Vector.html">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> @@ -172,7 +172,7 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00139"></a><span class="lineno"> 139</span>  dist2Vector[cmp] = <a class="code" href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573">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> @@ -182,7 +182,7 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00149"></a><span class="lineno"> 149</span>  ssize_t <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022">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> @@ -216,29 +216,29 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00183"></a><span class="lineno"> 183</span>  nodes_[orders[cmp][mid]].lChild_ = <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022">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">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="l00189"></a><span class="lineno"><a class="line" 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">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="l00192"></a><span class="lineno"><a class="line" href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9"> 192</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9">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="l00196"></a><span class="lineno"><a class="line" href="classmeow_1_1KD__Tree.html#aafecfa34e96615249e11e9ba1b85fdc7"> 196</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#aafecfa34e96615249e11e9ba1b85fdc7">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="l00201"></a><span class="lineno"><a class="line" href="classmeow_1_1KD__Tree.html#a6ffacb6d4020cfb1c127b68f3f427ee4"> 201</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#a6ffacb6d4020cfb1c127b68f3f427ee4">~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="l00207"></a><span class="lineno"><a class="line" 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">insert</a>(<a class="code" href="classmeow_1_1Vector.html">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="l00215"></a><span class="lineno"><a class="line" 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">erase</a>(<a class="code" href="classmeow_1_1Vector.html">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> @@ -251,13 +251,13 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00231"></a><span class="lineno"><a class="line" 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">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="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="classmeow_1_1KD__Tree.html#a09bf16356618fde6d256a843b87f44b6">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="l00240"></a><span class="lineno"><a class="line" 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">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> @@ -268,15 +268,15 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00251"></a><span class="lineno"> 251</span>  root_ = <a class="code" href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022">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="l00263"></a><span class="lineno"><a class="line" href="classmeow_1_1KD__Tree.html#a10e1cac9c14e047d77fb95eaf0b49bd8"> 263</a></span>  <a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8">Vectors</a> <a class="code" href="classmeow_1_1KD__Tree.html#a10e1cac9c14e047d77fb95eaf0b49bd8">query</a>(<a class="code" href="classmeow_1_1Vector.html">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="l00266"></a><span class="lineno"> 266</span>  ((<a class="code" href="classmeow_1_1KD__Tree.html">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> @@ -285,7 +285,7 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8">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> @@ -293,14 +293,14 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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="l00286"></a><span class="lineno"><a class="line" 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">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="l00295"></a><span class="lineno"><a class="line" 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">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">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> @@ -308,6 +308,20 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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 class="ttc" id="classmeow_1_1KD__Tree_html_adb0aaa5a70a7255935d8a4326c454434"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#adb0aaa5a70a7255935d8a4326c454434">meow::KD_Tree::erase</a></div><div class="ttdeci">bool erase(Vector const &v)</div><div class="ttdoc">將給定的Vector從set移除 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00215">KD_Tree.h:215</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a586afb8e59665a951ab0a9deae2fde40"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a586afb8e59665a951ab0a9deae2fde40">meow::KD_Tree::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">清空所有資料 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00286">KD_Tree.h:286</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html"><div class="ttname"><a href="classmeow_1_1KD__Tree.html">meow::KD_Tree</a></div><div class="ttdoc">k-dimension tree </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00040">KD_Tree.h:40</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a09bf16356618fde6d256a843b87f44b6"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a09bf16356618fde6d256a843b87f44b6">meow::KD_Tree::forceBuild</a></div><div class="ttdeci">void forceBuild()</div><div class="ttdoc">重新建樹 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00240">KD_Tree.h:240</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a782840070cd90370c37d72e8a39765f9"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a782840070cd90370c37d72e8a39765f9">meow::KD_Tree::KD_Tree</a></div><div class="ttdeci">KD_Tree()</div><div class="ttdoc">constructor, with dimension = 1 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00192">KD_Tree.h:192</a></div></div> +<div class="ttc" id="classmeow_1_1Vector_html"><div class="ttname"><a href="classmeow_1_1Vector.html">meow::Vector</a></div><div class="ttdoc">vector </div><div class="ttdef"><b>Definition:</b> <a href="Vector_8h_source.html#l00019">Vector.h:19</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a10e1cac9c14e047d77fb95eaf0b49bd8"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a10e1cac9c14e047d77fb95eaf0b49bd8">meow::KD_Tree::query</a></div><div class="ttdeci">Vectors query(Vector const &v, size_t nearestNumber, bool compareWholeVector) const </div><div class="ttdoc">查找 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00263">KD_Tree.h:263</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_ad1af6def42b23b9b4acef03d32774b9e"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#ad1af6def42b23b9b4acef03d32774b9e">meow::KD_Tree::insert</a></div><div class="ttdeci">void insert(Vector const &v)</div><div class="ttdoc">將給定的Vector加到set中 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00207">KD_Tree.h:207</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_afc143e90dba569c51b6eb146ba9df7f8"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#afc143e90dba569c51b6eb146ba9df7f8">meow::KD_Tree::Vectors</a></div><div class="ttdeci">std::vector< Vector > Vectors</div><div class="ttdoc">Custom Type: Vectors is std::vector<Vector> </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00189">KD_Tree.h:189</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_aafecfa34e96615249e11e9ba1b85fdc7"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#aafecfa34e96615249e11e9ba1b85fdc7">meow::KD_Tree::KD_Tree</a></div><div class="ttdeci">KD_Tree(size_t dimension)</div><div class="ttdoc">constructor, given dimension </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00196">KD_Tree.h:196</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a45be7cf06442b1a75902faa266950121"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a45be7cf06442b1a75902faa266950121">meow::KD_Tree::reset</a></div><div class="ttdeci">void reset(size_t dimension)</div><div class="ttdoc">清空所有資料並重新給定維度 </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00295">KD_Tree.h:295</a></div></div> +<div class="ttc" id="namespacemeow_html_a1954e235973a2ac79a7a72a4b7d25573"><div class="ttname"><a href="namespacemeow.html#a1954e235973a2ac79a7a72a4b7d25573">meow::squ</a></div><div class="ttdeci">T squ(T const &x)</div><div class="ttdoc">x*x </div><div class="ttdef"><b>Definition:</b> <a href="math_2utility_8h_source.html#l00067">utility.h:67</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_abdeb11a064dc06f80437126d6744b022"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#abdeb11a064dc06f80437126d6744b022">meow::KD_Tree::build</a></div><div class="ttdeci">void build()</div><div class="ttdoc">檢查至今是否有 insert/erase 被呼叫來決定是否 rebuild() </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00231">KD_Tree.h:231</a></div></div> +<div class="ttc" id="classmeow_1_1KD__Tree_html_a6ffacb6d4020cfb1c127b68f3f427ee4"><div class="ttname"><a href="classmeow_1_1KD__Tree.html#a6ffacb6d4020cfb1c127b68f3f427ee4">meow::KD_Tree::~KD_Tree</a></div><div class="ttdeci">~KD_Tree()</div><div class="ttdoc">destructor </div><div class="ttdef"><b>Definition:</b> <a href="KD__Tree_8h_source.html#l00201">KD_Tree.h:201</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- HTML footer for doxygen 1.8.3.1--> @@ -315,9 +329,9 @@ $(document).ready(function(){initNavTree('KD__Tree_8h_source.html','');}); <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 Fri Jun 6 2014 17:51:46 for Templates -- Meow by + <li class="footer">Generated on Mon Jun 23 2014 17:02:02 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> + <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li> </ul> </div> </body> |