壓力測試完成~~~~~~~~~~

1 files changed, 35 insertions, 29 deletions

diff --git a/README.html b/README.html
index 4e6b65d..e629055 100644
--- a/README.html
+++ b/README.html
@@ -1075,7 +1075,7 @@ Let all the problem-solving classes inherit from
 </li>

 <li>

 <p>

-Create an object, type <span class="monospaced">RegisterInterface&lt;T&gt;</span> , and register all your

+Create an class inherit from <span class="monospaced">RegisterInterface&lt;T&gt;</span> , and register all your

 implement class to it by call <span class="monospaced">regImplement(pointer to the class)</span>.

 </p>

 </li>

@@ -1291,18 +1291,20 @@ you call <span class="monospaced">A.moveTo(&amp;B)</span></td>
 <hr>

 </div>

 <div class="sect2">

-<h3 id="_meow_strong_kd_tree_lt_keys_key_value_gt_strong_c_class">meow:: <strong>KD_Tree&lt;Keys, Key, Value&gt;</strong> (C++ class)</h3>

-<div class="paragraph"><div class="title">Description</div><p><span class="monospaced">KD_Tree</span> is <strong>K-dimension tree</strong>, which is a dictionary(key&#8594;value).

-Where the type if key is a <strong>K-dimension vector</strong> .</p></div>

+<h3 id="_meow_strong_kd_tree_lt_vector_scalar_gt_strong_c_class">meow:: <strong>KD_Tree&lt;Vector, Scalar&gt;</strong> (C++ class)</h3>

+<div class="paragraph"><div class="title">Description</div><p><span class="monospaced">KD_Tree</span> is <strong>K-dimension tree</strong>, which is a multiple set contain lots of

+vector with K dimension.</p></div>

 <div class="ulist"><div class="title">Template Request</div><ul>

 <li>

 <p>

-<span class="monospaced">Keys</span> should has <span class="monospaced">operator[]</span> to allow the KD_Tree access the k-dimensions

+<span class="monospaced">Vector</span> should has <span class="monospaced">operator[]</span> to allow the KD_Tree, <span class="monospaced">operator&lt;</span> to

+compare when two vector are point to the same place, <span class="monospaced">operator==</span>

+access the k-dimensions

 </p>

 </li>

 <li>

 <p>

-<span class="monospaced">Key</span> should has <span class="monospaced">operator*</span>, <span class="monospaced">operator+</span>

+<span class="monospaced">Scalar</span> should has <span class="monospaced">operator*</span>, <span class="monospaced">operator+</span>, <span class="monospaced">operator&lt;</span>

 </p>

 </li>

 </ul></div>

@@ -1319,17 +1321,12 @@ K &#8592; dimensions
 </li>

 <li>

 <p>

-<span class="monospaced">Keys</span> is the tyepname of the vector

+<span class="monospaced">Vector</span> is the tyepname of the vector

 </p>

 </li>

 <li>

 <p>

-<span class="monospaced">Key</span> is the typename of the element in the vector

-</p>

-</li>

-<li>

-<p>

-<span class="monospaced">Value</span> is the typename of value

+<span class="monospaced">Vectors</span> is the typename of the std::vector&lt;Vector&gt;

 </p>

 </li>

 </ul></div>

@@ -1365,16 +1362,34 @@ width:100%;
 <tr>

 <td class="tableblock halign-right valign-top" ><p class="tableblock"></p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>insert</strong></p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">(Key const&amp; k, Value v)</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">(Vector const&amp; v)</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">void</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">O(1)</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">Insert a pair (k&#8594;v)</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">Insert a vector</p></td>

+</tr>

+<tr>

+<td class="tableblock halign-right valign-top" ><p class="tableblock"></p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>erase</strong></p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">(Vector const&amp; v)</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">bool</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">O(N*x)</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">Find a vector which is the same

+as <span class="monospaced">v</span> and remove it from the KD_Tree, <span class="monospaced">x</span> in the Big-O time complex

+is cost by <span class="monospaced">Vector::operator==</span>.</p></td>

 </tr>

 <tr>

 <td class="tableblock halign-right valign-top" ><p class="tableblock"></p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>build</strong></p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">()</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">void</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">O(KN logN) if need</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">Build the data structure if need.</p></td>

+</tr>

+<tr>

+<td class="tableblock halign-right valign-top" ><p class="tableblock"></p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>forceBuild</strong></p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">()</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">void</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">O(KN logN)</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">Build the data structure(the <span class="monospaced">insert()</span>

 method will not build the data structure immediately)</p></td>

@@ -1382,20 +1397,11 @@ method will not build the data structure immediately)</p></td>
 <tr>

 <td class="tableblock halign-right valign-top" ><p class="tableblock">const</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>query</strong></p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">(Keys const&amp; point, int k)</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">Value</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">O(kN <sup>1-1/k</sup> )</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">Using Euclidean-Distance to find the k-nearest neighbor from <span class="monospaced">point</span> .

-And return the corrosponding value</p></td>

-</tr>

-<tr>

-<td class="tableblock halign-right valign-top" ><p class="tableblock">const</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock"><strong>query</strong></p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">(Keys const&amp; point, int k)</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">std::vector&lt;Value&gt;</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">(Vector const&amp; v, int k)</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">Vectors</p></td>

 <td class="tableblock halign-left valign-top" ><p class="tableblock">O(kN <sup>1-1/k</sup> )</p></td>

-<td class="tableblock halign-left valign-top" ><p class="tableblock">Using Euclidean-Distance to find all the x-nearest neighbor from <span class="monospaced">point</span> ,

-where x &#8656; k. And return an array of all the corrosponding value.</p></td>

+<td class="tableblock halign-left valign-top" ><p class="tableblock">Using Euclidean-Distance to find the 1st to k-th nearest neighbor from <span class="monospaced">v</span> .

+And return;</p></td>

 </tr>

 <tr>

 <td class="tableblock halign-right valign-top" ><p class="tableblock"></p></td>

@@ -1838,7 +1844,7 @@ plus <span class="monospaced">__value</span></p></td>
 <div id="footnotes"><hr></div>

 <div id="footer">

 <div id="footer-text">

-Last updated 2014-04-19 23:38:26 CST

+Last updated 2014-04-21 14:11:29 CST

 </div>

 </div>

 </body>