diff options
Diffstat (limited to 'README.html')
| -rw-r--r-- | README.html | 28 |
1 files changed, 17 insertions, 11 deletions
diff --git a/README.html b/README.html index b2a3db3..59ed324 100644 --- a/README.html +++ b/README.html @@ -1109,7 +1109,9 @@ String const& value, String const& description)</span><br> </div>
<div class="sect2">
<h3 id="_meow_strong_implementinterface_registerinterface_strong_c_class">meow:: <strong>ImplementInterface/RegisterInterface</strong> (C++ Class)</h3>
-<div class="paragraph"><div class="title">Description</div><p>Assume there is a problem which can be solved by different algorithms.
+<div class="sect3">
+<h4 id="_description_3">Description</h4>
+<div class="paragraph"><p>Assume there is a problem which can be solved by different algorithms.
Then you can write multiple classes to approach this problem.<br>
Now if you want to decide which algorithm to use in runtime, you can just
approach this case by a simple way:</p></div>
@@ -1123,23 +1125,26 @@ Let all the problem-solving classes inherit from </li>
<li>
<p>
-Create an class inherit from <span class="monospaced">RegisterInterface<T></span> , and register all your
-implement class to it by call <span class="monospaced">regImplement(pointer to the class)</span>.
+Create an class inherit from <span class="monospaced">RegisterInterface<T></span> ,
+and register all your implement class to it by call
+<span class="monospaced">regImplement(pointer to the class)</span>.
</p>
</li>
<li>
<p>
-Select which implement class you want by call <span class="monospaced">getImplement(identify)</span> ,
-which will return the pointer to the corresponding class.
+Select which implement class you want by call
+<span class="monospaced">getImplement(identify)</span> , which will return the pointer
+to the corresponding class.
</p>
</li>
</ul></div>
<hr>
</div>
+</div>
<div class="sect2">
<h3 id="_meow_strong_disjointset_strong_c_class">meow:: <strong>DisjointSet</strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_3">Description</h4>
+<h4 id="_description_4">Description</h4>
<div class="paragraph"><p><span class="monospaced">DisjointSet</span> 是個<strong>輕量級Data Dtructure</strong>, 用來維護一堆互斥集的資訊.
相關資料可參考
<a href="http://www.csie.ntnu.edu.tw/~u91029/DisjointSets.html">演算法筆記</a></p></div>
@@ -1231,7 +1236,7 @@ size_t <span class="monospaced">number2</span>)</p></td> <div class="sect2">
<h3 id="_meow_strong_mergeableheap_lt_element_gt_strong_c_class">meow:: <strong>MergeableHeap<Element></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_4">Description</h4>
+<h4 id="_description_5">Description</h4>
<div class="paragraph"><p>一個用 <strong>左偏樹</strong> 實作的 <strong>Maximum-Heap</strong> , 除了原本heap有的功能外,
還支援 <span class="monospaced">merge</span>, <span class="monospaced">split</span> 等功能</p></div>
</div>
@@ -1401,7 +1406,7 @@ width:100%; <div class="sect2">
<h3 id="_meow_strong_kd_tree_lt_vector_scalar_gt_strong_c_class">meow:: <strong>KD_Tree<Vector, Scalar></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_5">Description</h4>
+<h4 id="_description_6">Description</h4>
<div class="paragraph"><p><span class="monospaced">KD_Tree</span> 全名k-dimension tree, 用來維護由 <strong>N個K維度向量所成的集合</strong>,
並可於該set中查找 <strong>前i個離給定向量最接近的向量</strong></p></div>
</div>
@@ -1610,7 +1615,7 @@ bool <span class="monospaced">cmp</span>)</p></td> <div class="sect2">
<h3 id="_meow_strong_splaytree_lt_key_value_gt_strong_c_class">meow:: <strong>SplayTree<Key, Value></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_6">Description</h4>
+<h4 id="_description_7">Description</h4>
<div class="paragraph"><p><span class="monospaced">SplayTree</span> 是一種神乎其技的資料結構, 維護一堆 Key→Value . 並且支援
一些 <span class="monospaced">std::map</span> 難以快速實踐的操作, 如 <span class="monospaced">split</span> , <span class="monospaced">merge</span> , <span class="monospaced">keyOffset</span></p></div>
</div>
@@ -1954,7 +1959,7 @@ SplayTree* <span class="monospaced">tree2</span>)</p></td> <div class="sect2">
<h3 id="_meow_strong_segmenttree_lt_value_gt_strong_c_class">meow:: <strong>SegmentTree<Value></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_7">Description</h4>
+<h4 id="_description_8">Description</h4>
<div class="paragraph"><p>維護一個陣列, 並且讓user可以有區間查詢, 區間修改的小東東</p></div>
</div>
<div class="sect3">
@@ -2124,6 +2129,7 @@ Value const& <span class="monospaced">delta</span>)</p></td> </tr>
</tbody>
</table>
+<hr>
</div>
</div>
</div>
@@ -2132,7 +2138,7 @@ Value const& <span class="monospaced">delta</span>)</p></td> <div id="footnotes"><hr></div>
<div id="footer">
<div id="footer-text">
-Last updated 2014-04-22 02:21:30 CST
+Last updated 2014-04-22 02:28:11 CST
</div>
</div>
</body>
|