diff options
author | cathook <b01902109@csie.ntu.edu.tw> | 2014-05-02 01:29:33 +0800 |
---|---|---|
committer | cathook <b01902109@csie.ntu.edu.tw> | 2014-05-02 01:29:33 +0800 |
commit | d2d7a49563a8f04bd07264a4a989d5656313d375 (patch) | |
tree | 45812ca8bcc20b59e9f4f4e54bf052eb39a6c0be /README.html | |
parent | 395a4bceaac30588963dacb8e006e9ebbe2ca6dd (diff) | |
download | meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar.gz meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar.bz2 meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar.lz meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar.xz meow-d2d7a49563a8f04bd07264a4a989d5656313d375.tar.zst meow-d2d7a49563a8f04bd07264a4a989d5656313d375.zip |
update test
Diffstat (limited to 'README.html')
-rw-r--r-- | README.html | 77 |
1 files changed, 29 insertions, 48 deletions
diff --git a/README.html b/README.html index aca9db5..f2f5c5c 100644 --- a/README.html +++ b/README.html @@ -715,9 +715,7 @@ asciidoc.install(2); <p>
<strong>utility.h</strong> some useful functions,
<span class="monospaced">stringPringf()</span> , <span class="monospaced">stringReplace()</span> , <span class="monospaced">cstringEndWith()</span> ,
- <span class="monospaced">debugPrintf()</span> , <span class="monospaced">messagePrintf()</span> , <span class="monospaced">constant PI</span> ,
- <span class="monospaced">noEPS()</span> , <span class="monospaced">normalize()</span> , <span class="monospaced">denormalize()</span> ,
- <span class="monospaced">ratioMapping()</span> , <span class="monospaced">inRange()</span> , <span class="monospaced">squ()</span> , <span class="monospaced">average()</span>
+ <span class="monospaced">debugPrintf()</span> , <span class="monospaced">messagePrintf()</span> , <span class="monospaced">filenameCompare()</span>
</p>
</li>
<li>
@@ -826,6 +824,14 @@ asciidoc.install(2); <div class="ulist"><ul>
<li>
<p>
+<strong>utility.h</strong> some useful functions,
+ <span class="monospaced">constant PI</span> ,
+ <span class="monospaced">noEPS()</span> , <span class="monospaced">normalize()</span> , <span class="monospaced">denormalize()</span> ,
+ <span class="monospaced">ratioMapping()</span> , <span class="monospaced">inRange()</span> , <span class="monospaced">squ()</span> , <span class="monospaced">average()</span>
+</p>
+</li>
+<li>
+<p>
<strong>LinearTransformation.h</strong> <span class="monospaced">LinearTransformation<Scalar></span>
</p>
</li>
@@ -858,8 +864,17 @@ asciidoc.install(2); <div class="ulist"><ul>
<li>
<p>
-<strong>Register_Implement.h</strong> <span class="monospaced">class RegisterInterface</span> ,
- <span class="monospaced">class ImplementInterface</span>
+<strong>ObjBase.h</strong> <span class="monospaced">class ObjBase</span>
+</p>
+</li>
+<li>
+<p>
+<strong>ObjSelector.h</strong> <span class="monospaced">class ObjBase<size_t id></span>
+</p>
+</li>
+<li>
+<p>
+<strong>Properties.h</strong> <span class="monospaced">class Properties</span>
</p>
</li>
</ul></div>
@@ -1121,43 +1136,9 @@ String const& value, String const& description)</span><br> </div>
</div>
<div class="sect2">
-<h3 id="_meow_strong_implementinterface_registerinterface_strong_c_class">meow:: <strong>ImplementInterface/RegisterInterface</strong> (C++ Class)</h3>
-<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>
-<div class="ulist"><ul>
-<li>
-<p>
-Let all the problem-solving classes inherit from
-<span class="monospaced">class ImplementInterface<T></span> , and call the constructure with giving
-<span class="monospaced">identify</span> (type <span class="monospaced">T</span> ) .
-</p>
-</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>.
-</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.
-</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_4">Description</h4>
+<h4 id="_description_3">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>
@@ -1249,7 +1230,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_5">Description</h4>
+<h4 id="_description_4">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>
@@ -1419,7 +1400,7 @@ width:100%; <div class="sect2">
<h3 id="_meow_strong_vp_tree_lt_vector_scalar_gt_strong_c_class">meow:: <strong>VP_Tree<Vector, Scalar></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_6">Description</h4>
+<h4 id="_description_5">Description</h4>
<div class="paragraph"><p><span class="monospaced">VP_Tree</span> 用來維護由 <strong>N個K維度向量所成的集合</strong>,
並可於該set中查找 <strong>前i個離給定向量最接近的向量</strong>.<br>
不像 <span class="monospaced">KD_Tree</span> 二分樹每次都選擇一個維度去分, 分成小的跟大的,
@@ -1674,7 +1655,7 @@ bool <span class="monospaced">cmp</span>)</p></td> <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_7">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>
@@ -1883,7 +1864,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_8">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>
@@ -2227,7 +2208,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_9">Description</h4>
+<h4 id="_description_8">Description</h4>
<div class="paragraph"><p>維護一個陣列, 並且讓user可以有區間查詢, 區間修改的小東東</p></div>
</div>
<div class="sect3">
@@ -2403,7 +2384,7 @@ Value const& <span class="monospaced">delta</span>)</p></td> <div class="sect2">
<h3 id="_meow_strong_splaytree_range_lt_key_value_gt_strong_c_class">meow:: <strong>SplayTree_Range<Key, Value></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_10">Description</h4>
+<h4 id="_description_9">Description</h4>
<div class="paragraph"><p><span class="monospaced">SplayTree_Range</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>
@@ -2781,7 +2762,7 @@ SplayTree_Range* <span class="monospaced">tree2</span>)</p></td> <div class="sect2">
<h3 id="_meow_strong_binaryindextree_lt_value_gt_strong_c_class">meow:: <strong>BinaryIndexTree<Value></strong> (C++ class)</h3>
<div class="sect3">
-<h4 id="_description_11">Description</h4>
+<h4 id="_description_10">Description</h4>
<div class="paragraph"><p>極度簡化版的 <span class="monospaced">SegmentTree</span> 已無法區間操作, 區間詢問的區間開頭也一定要
在 <span class="monospaced">index=0</span> 的地方</p></div>
</div>
@@ -3090,7 +3071,7 @@ E-Mail: cat.hook31894 ~在~ gmail.com <div id="footnotes"><hr></div>
<div id="footer">
<div id="footer-text">
-Last updated 2014-05-01 21:55:51 CST
+Last updated 2014-05-02 01:28:05 CST
</div>
</div>
</body>
|