diff options
Diffstat (limited to 'doc/html/classmeow_1_1VP__Tree.html')
| -rw-r--r-- | doc/html/classmeow_1_1VP__Tree.html | 50 |
1 files changed, 40 insertions, 10 deletions
diff --git a/doc/html/classmeow_1_1VP__Tree.html b/doc/html/classmeow_1_1VP__Tree.html index b951082..bdb4de7 100644 --- a/doc/html/classmeow_1_1VP__Tree.html +++ b/doc/html/classmeow_1_1VP__Tree.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: meow::VP_Tree< Vector, Scalar > Class Template Reference</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"> @@ -121,16 +121,16 @@ Public Member Functions</h2></td></tr> class meow::VP_Tree< Vector, Scalar ></h3> <p>跟KD_Tree很像歐 </p> -<p><code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a></code> 用來維護由 <b>N個K維度向量所成的集合</b> , 並可於該set中查找 <b>前i個離給定向量最接近的向量*</b> . 不像 <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree">KD_Tree</a></code> 二分樹每次都選擇一個維度去分, 分成小的跟大的, <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a></code> 每次選一個點, 將資料分成 離這個點近的, 跟離這個點遠的. 至於怎麼選呢...., 嘛還沒研究, 先random</p> +<p><code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐 ">VP_Tree</a></code> 用來維護由 <b>N個K維度向量所成的集合</b> , 並可於該set中查找 <b>前i個離給定向量最接近的向量*</b> . 不像 <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree ">KD_Tree</a></code> 二分樹每次都選擇一個維度去分, 分成小的跟大的, <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐 ">VP_Tree</a></code> 每次選一個點, 將資料分成 離這個點近的, 跟離這個點遠的. 至於怎麼選呢...., 嘛還沒研究, 先random</p> <p>參考資料連結:</p> <ul> <li><a href="http://stevehanov.ca/blog/index.php?id=130">http://stevehanov.ca/blog/index.php?id=130</a></li> <li><a href="http://pnylab.com/pny/papers/vptree/vptree">http://pnylab.com/pny/papers/vptree/vptree</a></li> </ul> -<h2>Template Class Operators Request</h2> +<h2>Template Class Operators Request </h2> <table class="doxtable"> <tr> -<th align="right">const?</th><th align="center">Typename</th><th align="right">Operator </th><th align="left">Parameters </th><th align="center">Return Type </th><th align="left">Description </th></tr> +<th align="right">const?</th><th align="center">Typename</th><th align="right">Operator </th><th align="left">Parameters </th><th align="center">Return Type </th><th align="left">Description </th></tr> <tr> <td align="right">const </td><td align="center"><a class="el" href="classmeow_1_1Vector.html" title="vector ">Vector</a></td><td align="right">operator[] </td><td align="left">(size_t <code>n</code>) </td><td align="center">Scalar </td><td align="left">取得第<code>n</code> 維度量 </td></tr> <tr> @@ -141,7 +141,9 @@ class meow::VP_Tree< Vector, Scalar ></h3> <td align="right">const </td><td align="center">Scalar</td><td align="right">'Scalar' </td><td align="left">(int <code>n</code>) </td><td align="center">Scalar </td><td align="left">建構子, </td></tr> </table> <p>其中一定<code>n=0or4</code> | |const | Scalar|operator* |(Scalar <code>s</code>) | Scalar | 相乘 | |const | Scalar|operator+ |(Scalar <code>s</code>) | Scalar | 相加 | |const | Scalar|operator- |(Scalar <code>s</code>) | Scalar | 相差 | |const | Scalar|operator- |( ) | Scalar | 取負號 | |const | Scalar|operator< |(Scalar <code>s</code>) | bool | 大小比較 |</p> -<dl class="section note"><dt>Note</dt><dd>: -實測結果發覺, 維度小的時候, 比起中規中矩的 <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree">KD_Tree</a></code>, <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a></code> 有 <b>random</b> 於其中, 因此時間複雜度只是期望值 <code>O(logN)</code> 但是測資大到 一定程度, <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree">KD_Tree</a></code> 效率會一整個大幅掉下, 但 <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐">VP_Tree</a></code> 幾乎不受影響 -TODO <code><a class="el" href="classmeow_1_1VP__Tree.html#a2319a3995c4b6ad415a4997764e83b3f" title="將給定的Vector加到set中">insert()</a></code>, <code><a class="el" href="classmeow_1_1VP__Tree.html#aa53e215a7e6daa3edfba4201602c8894" title="將給定的Vector從set移除">erase()</a></code> 算是未完成功能 </dd></dl> +<dl class="section note"><dt>Note</dt><dd>: -實測結果發覺, 維度小的時候, 比起中規中矩的 <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree ">KD_Tree</a></code>, <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐 ">VP_Tree</a></code> 有 <b>random</b> 於其中, 因此時間複雜度只是期望值 <code>O(logN)</code> 但是測資大到 一定程度, <code><a class="el" href="classmeow_1_1KD__Tree.html" title="k-dimension tree ">KD_Tree</a></code> 效率會一整個大幅掉下, 但 <code><a class="el" href="classmeow_1_1VP__Tree.html" title="跟KD_Tree很像歐 ">VP_Tree</a></code> 幾乎不受影響 -TODO <code><a class="el" href="classmeow_1_1VP__Tree.html#a2319a3995c4b6ad415a4997764e83b3f" title="將給定的Vector加到set中 ">insert()</a></code>, <code><a class="el" href="classmeow_1_1VP__Tree.html#aa53e215a7e6daa3edfba4201602c8894" title="將給定的Vector從set移除 ">erase()</a></code> 算是未完成功能 </dd></dl> + +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00051">51</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> </div><h2 class="groupheader">Member Typedef Documentation</h2> <a class="anchor" id="a02c136810876c8713b9760aa8bb51aa4"></a> <div class="memitem"> @@ -155,6 +157,8 @@ template<class Vector, class Scalar> </div> </table> </div><div class="memdoc"> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00053">53</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <h2 class="groupheader">Constructor & Destructor Documentation</h2> @@ -183,6 +187,8 @@ template<class Vector, class Scalar> </div> <p>constructor, with dimension = 1 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00212">212</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a1f301f751afe7baf5eafe6964c6a7a15"></a> @@ -211,6 +217,8 @@ template<class Vector, class Scalar> </div> <p>constructor, 複製資料 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00217">217</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a5ce274e16a28c6ef5cac63c6e3258d8b"></a> @@ -239,6 +247,8 @@ template<class Vector, class Scalar> </div> <p>constructor, 給定dimension </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00225">225</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a599a1fba89e0e5a06fa1e71c81bc5216"></a> @@ -266,6 +276,8 @@ template<class Vector, class Scalar> </div> <p>destructor </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00234">234</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <h2 class="groupheader">Member Function Documentation</h2> @@ -294,6 +306,8 @@ template<class Vector, class Scalar> </div> <p>檢查至今是否有 insert/erase 被呼叫來決定是否 <code>rebuild()</code> </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00275">275</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="ac4d1a186226b2d27abce9eb71149c62c"></a> @@ -321,6 +335,8 @@ template<class Vector, class Scalar> </div> <p>清空所有資料 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00313">313</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="afcc9734a4e012d6dfdab408d5c698905"></a> @@ -349,6 +365,8 @@ template<class Vector, class Scalar> </div> <p>複製資料 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00241">241</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="aa53e215a7e6daa3edfba4201602c8894"></a> @@ -377,6 +395,8 @@ template<class Vector, class Scalar> </div> <p>將給定的Vector從set移除 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00260">260</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="aa4adfa52bd1cee8703b49a5ecf906733"></a> @@ -404,6 +424,8 @@ template<class Vector, class Scalar> </div> <p>重新建樹 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00284">284</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a2319a3995c4b6ad415a4997764e83b3f"></a> @@ -432,6 +454,8 @@ template<class Vector, class Scalar> </div> <p>將給定的Vector加到set中 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00252">252</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a7c73bb25b40f440b48267f94fa4561ad"></a> @@ -460,6 +484,8 @@ template<class Vector, class Scalar> </div> <p>same as <code>copyFrom(tree2)</code> </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00330">330</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="a22db303a6318b2ef58957b22063cb591"></a> @@ -505,6 +531,8 @@ template<class Vector, class Scalar> </div> <p>查找 </p> <p>於set中找尋距離指定向量前 <code>i</code> 近的向量, 並依照由近而遠的順序排序. 如果有兩個向量<code>v1</code>,v2 距離一樣, 且 <code>cmp</code> 為<code>true</code> , 則直接依照 <code>v1<v2</code> 來決定誰在前面. 最後回傳一陣列包含所有解. </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00296">296</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <a class="anchor" id="ad1bffde18bc2f0fc955e78fe77333558"></a> @@ -533,6 +561,8 @@ template<class Vector, class Scalar> </div> <p>清空所有資料並重新給定維度 </p> +<p>Definition at line <a class="el" href="VP__Tree_8h_source.html#l00323">323</a> of file <a class="el" href="VP__Tree_8h_source.html">VP_Tree.h</a>.</p> + </div> </div> <hr/>The documentation for this class was generated from the following file:<ul> @@ -545,9 +575,9 @@ template<class Vector, class Scalar> </div> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="namespacemeow.html">meow</a></li><li class="navelem"><a class="el" href="classmeow_1_1VP__Tree.html">VP_Tree</a></li> - <li class="footer">Generated on Fri Jun 6 2014 17:51:47 for Templates -- Meow by + <li class="footer">Generated on Mon Jun 23 2014 17:02:04 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> |