aboutsummaryrefslogtreecommitdiffstats
path: root/doc/html/HashTable_8h_source.html
diff options
context:
space:
mode:
Diffstat (limited to 'doc/html/HashTable_8h_source.html')
-rw-r--r--doc/html/HashTable_8h_source.html233
1 files changed, 233 insertions, 0 deletions
diff --git a/doc/html/HashTable_8h_source.html b/doc/html/HashTable_8h_source.html
new file mode 100644
index 0000000..c46e075
--- /dev/null
+++ b/doc/html/HashTable_8h_source.html
@@ -0,0 +1,233 @@
+<!-- HTML header for doxygen 1.8.3.1-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml">
+<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"/>
+<title>Templates -- Meow: meowpp/dsa/HashTable.h Source File</title>
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript">
+ $(document).ready(initResizable);
+ $(window).load(resizeHeight);
+</script>
+<link href="stylesheet.css" rel="stylesheet" type="text/css" />
+<link href="custom.css" rel="stylesheet" type="text/css"/>
+</head>
+<body>
+<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
+<div id="titlearea">
+<table cellspacing="0" cellpadding="0">
+ <tbody>
+ <tr style="height: 56px;">
+ <td id="projectlogo"><img alt="Logo" src="logo.png"/></td>
+ <td style="padding-left: 0.5em;">
+ <div id="projectname">Templates -- Meow
+ &#160;<span id="projectnumber">1.1.2</span>
+ </div>
+ <div id="projectbrief">不能,也不應該先編譯成obj-file的templates</div>
+ </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.8.3.1 -->
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+ <div id="nav-tree">
+ <div id="nav-tree-contents">
+ <div id="nav-sync" class="sync"></div>
+ </div>
+ </div>
+ <div id="splitbar" style="-moz-user-select:none;"
+ class="ui-resizable-handle">
+ </div>
+</div>
+<script type="text/javascript">
+$(document).ready(function(){initNavTree('HashTable_8h_source.html','');});
+</script>
+<div id="doc-content">
+<div class="header">
+ <div class="headertitle">
+<div class="title">HashTable.h</div> </div>
+</div><!--header-->
+<div class="contents">
+<a href="HashTable_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="preprocessor">#ifndef dsa_HashTable_H__</span></div>
+<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define dsa_HashTable_H__</span></div>
+<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="preprocessor"></span></div>
+<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160;<span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;</div>
+<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="keyword">namespace </span>meow {</div>
+<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;</div>
+<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">class</span> Data, <span class="keyword">class</span> HashFunc&gt;</div>
+<div class="line"><a name="l00015"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html"> 15</a></span>&#160;<span class="keyword">class </span><a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> {</div>
+<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="keyword">private</span>:</div>
+<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160; std::vector&lt;std::list&lt;Data&gt; &gt; table_;</div>
+<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160; HashFunc func_;</div>
+<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="keyword">public</span>:</div>
+<div class="line"><a name="l00023"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a327ccf67321d9b5061dbe01c287bd7e3"> 23</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html#a327ccf67321d9b5061dbe01c287bd7e3" title="constructor">HashTableList</a>() {</div>
+<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; }</div>
+<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160;</div>
+<div class="line"><a name="l00031"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a0ac878f202fd1aba101df32a481e177c"> 31</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html#a0ac878f202fd1aba101df32a481e177c" title="constructor">HashTableList</a>(<span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>, HashFunc <span class="keyword">const</span>&amp; <a class="code" href="classmeow_1_1HashTableList.html#aaf4154c2534c861455149261c0194f00" title="回傳hash function">func</a>): table_(size), func_(func) {</div>
+<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160; }</div>
+<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;</div>
+<div class="line"><a name="l00037"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#ad460ece4097203d379e95c835a10d79d"> 37</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html#ad460ece4097203d379e95c835a10d79d" title="destructor">~HashTableList</a>() {</div>
+<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; }</div>
+<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160;</div>
+<div class="line"><a name="l00043"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a3d769d64e448f0bdbe52514e06b73f54"> 43</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a>&amp; <a class="code" href="classmeow_1_1HashTableList.html#a3d769d64e448f0bdbe52514e06b73f54" title="copy">copyFrom</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; b) {</div>
+<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; table_ = b.table_;</div>
+<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; func_ = b.func_;</div>
+<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; }</div>
+<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160;</div>
+<div class="line"><a name="l00052"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a79da4ec6056713e2993e367aac2e6220"> 52</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1HashTableList.html#a79da4ec6056713e2993e367aac2e6220" title="清除資料">clear</a>() {</div>
+<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; table_[i].clear();</div>
+<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; }</div>
+<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; }</div>
+<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;</div>
+<div class="line"><a name="l00061"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#ac7417270658997ef1cb33221fba8d6e8"> 61</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1HashTableList.html#ac7417270658997ef1cb33221fba8d6e8" title="清除資料, 指定新的size與hash function">reset</a>(<span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>, HashFunc <span class="keyword">const</span>&amp; <a class="code" href="classmeow_1_1HashTableList.html#aaf4154c2534c861455149261c0194f00" title="回傳hash function">func</a>) {</div>
+<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; table_.clear();</div>
+<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; table_.resize(std::max(size, 1u));</div>
+<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; func_ = <a class="code" href="classmeow_1_1HashTableList.html#aaf4154c2534c861455149261c0194f00" title="回傳hash function">func</a>;</div>
+<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div>
+<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;</div>
+<div class="line"><a name="l00070"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a2f72023134f79ce5c7e889779a20762e"> 70</a></span>&#160; <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1HashTableList.html#a2f72023134f79ce5c7e889779a20762e" title="回傳table size">tableSize</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="keywordflow">return</span> table_.size();</div>
+<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
+<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;</div>
+<div class="line"><a name="l00077"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157"> 77</a></span>&#160; <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keywordtype">size_t</span> ret = 0;</div>
+<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; ret += table_[i].size();</div>
+<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; }</div>
+<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; }</div>
+<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160;</div>
+<div class="line"><a name="l00088"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#aaf4154c2534c861455149261c0194f00"> 88</a></span>&#160; HashFunc <span class="keyword">const</span>&amp; <a class="code" href="classmeow_1_1HashTableList.html#aaf4154c2534c861455149261c0194f00" title="回傳hash function">func</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keywordflow">return</span> func_;</div>
+<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; }</div>
+<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;</div>
+<div class="line"><a name="l00095"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a6d7a0c3ac05a355cc9e1c60856ebd781"> 95</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1HashTableList.html#a6d7a0c3ac05a355cc9e1c60856ebd781" title="加入新的element">add</a>(Data <span class="keyword">const</span>&amp; e) {</div>
+<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="keywordtype">size_t</span> index = func_(e) % <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>();</div>
+<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; table_[index].push_back(e);</div>
+<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; }</div>
+<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160;</div>
+<div class="line"><a name="l00104"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a490a3325017696441fdc4ab8db517871"> 104</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1HashTableList.html#a490a3325017696441fdc4ab8db517871" title="把給定的HashTableList中所有的element全加進來">add</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; h) {</div>
+<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = h.table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; it = h.table_[index].begin(); it != h.table_[index].end(); ++it) {</div>
+<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; insert(*it);</div>
+<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; }</div>
+<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; }</div>
+<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; }</div>
+<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160;</div>
+<div class="line"><a name="l00117"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a63cc363a99ee99024a32133cf0331325"> 117</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1HashTableList.html#a63cc363a99ee99024a32133cf0331325" title="刪除element">del</a>(Data <span class="keyword">const</span>&amp; e) {</div>
+<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="keywordtype">size_t</span> index = func_(e) % <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>();</div>
+<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; it = table_[index].begin(); it != table_[index].end(); ++it) {</div>
+<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <span class="keywordflow">if</span> ((*it) == e) {</div>
+<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; table_[index].erase(i);</div>
+<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; }</div>
+<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</div>
+<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; }</div>
+<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160;</div>
+<div class="line"><a name="l00132"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a25fa6ad234486128f2b0357bfabf5206"> 132</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1HashTableList.html#a25fa6ad234486128f2b0357bfabf5206" title="刪除有出現在給定的的HashTableList中的element">del</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; h) {</div>
+<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>() &gt; h.<a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>()) {</div>
+<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = h.table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; it = h.table_[index].begin(); it != h.table_[index].end(); ++it) {</div>
+<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; erase(*it);</div>
+<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; }</div>
+<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; }</div>
+<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; }</div>
+<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="keywordflow">else</span> {</div>
+<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; it = table_[index].begin(); it != table_[index].end(); ) {</div>
+<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; <span class="keywordflow">if</span> (h.<a class="code" href="classmeow_1_1HashTableList.html#a65227191dccd021a0802810ffe007040" title="查看某element是否已經擁有">exist</a>(*it)) {</div>
+<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; table_[index].erase(it);</div>
+<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; }</div>
+<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="keywordflow">else</span> {</div>
+<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; ++it;</div>
+<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160; }</div>
+<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160; }</div>
+<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; }</div>
+<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; }</div>
+<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; }</div>
+<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160;</div>
+<div class="line"><a name="l00160"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a65227191dccd021a0802810ffe007040"> 160</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1HashTableList.html#a65227191dccd021a0802810ffe007040" title="查看某element是否已經擁有">exist</a>(Data <span class="keyword">const</span>&amp; e)<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordtype">size_t</span> index = func_(e) % <a class="code" href="classmeow_1_1HashTableList.html#af8d49492c5f35bb18706e9fb72d18157" title="回傳目前有多少element在其中">size</a>();</div>
+<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; it = table_[index].begin(); it != table_[index].end(); ++it) {</div>
+<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keywordflow">if</span> ((*it) == e)</div>
+<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; }</div>
+<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; }</div>
+<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160;</div>
+<div class="line"><a name="l00173"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a2cdacf0bac46df21b852c3cb91cd44c3"> 173</a></span>&#160; std::vector&lt;Data&gt; <a class="code" href="classmeow_1_1HashTableList.html#a2cdacf0bac46df21b852c3cb91cd44c3" title="回傳所有存下來的資料">all</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; std::vector&lt;Data&gt; ret;</div>
+<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0, I = table_.size(); i &lt; I; i++) {</div>
+<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; it = table_[i].begin(); it != table_[i].end(); ++it) {</div>
+<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; ret.push_back(*it);</div>
+<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; }</div>
+<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div>
+<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; }</div>
+<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160;</div>
+<div class="line"><a name="l00187"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#af3ac22fd18ce14878e881331883397b8"> 187</a></span>&#160; std::vector&lt;Data&gt; <a class="code" href="classmeow_1_1HashTableList.html#af3ac22fd18ce14878e881331883397b8" title="回傳所有存下來且key為index的資料">all</a>(<span class="keywordtype">size_t</span> index)<span class="keyword"> const </span>{</div>
+<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; index %= table_.size();</div>
+<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; std::vector&lt;Data&gt; ret;</div>
+<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; <span class="keywordflow">for</span> (std::list&lt;Data&gt;::const_iterator</div>
+<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; it = table_[index].begin(); it != table_[index].end(); ++it) {</div>
+<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; ret.push_back(*it);</div>
+<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; }</div>
+<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; }</div>
+<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; </div>
+<div class="line"><a name="l00198"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a9f9493e2044df374ac9e650303fdf212"> 198</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a>&amp; <a class="code" href="classmeow_1_1HashTableList.html#a9f9493e2044df374ac9e650303fdf212" title="same as copyFrom(h) ">operator=</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; h) {</div>
+<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1HashTableList.html#a3d769d64e448f0bdbe52514e06b73f54" title="copy">copyFrom</a>(h);</div>
+<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; }</div>
+<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; </div>
+<div class="line"><a name="l00203"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a7bef8d0510d33a06507881a872c62156"> 203</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a>&amp; <a class="code" href="classmeow_1_1HashTableList.html#a7bef8d0510d33a06507881a872c62156" title="same as add(h) ">operator+=</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; h) {</div>
+<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <a class="code" href="classmeow_1_1HashTableList.html#a6d7a0c3ac05a355cc9e1c60856ebd781" title="加入新的element">add</a>(h);</div>
+<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; }</div>
+<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; </div>
+<div class="line"><a name="l00209"></a><span class="lineno"><a class="code" href="classmeow_1_1HashTableList.html#a3c3e1ad9bf9993ded4a6904f07abb920"> 209</a></span>&#160; <a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a>&amp; <a class="code" href="classmeow_1_1HashTableList.html#a3c3e1ad9bf9993ded4a6904f07abb920" title="same as del(h) ">operator-=</a>(<a class="code" href="classmeow_1_1HashTableList.html" title="一個當key相撞時會用list解決的hash_table">HashTableList</a> <span class="keyword">const</span>&amp; h) {</div>
+<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; <a class="code" href="classmeow_1_1HashTableList.html#a63cc363a99ee99024a32133cf0331325" title="刪除element">del</a>(h);</div>
+<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; }</div>
+<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160;};</div>
+<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160;</div>
+<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160;}</div>
+<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160;</div>
+<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160;<span class="preprocessor">#endif // dsa_HashTable_H__</span></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- HTML footer for doxygen 1.8.3.1-->
+<!-- start footer part -->
+<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="HashTable_8h.html">HashTable.h</a></li>
+ <li class="footer">Generated on Sun Jun 1 2014 13:54:33 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>
+ </ul>
+</div>
+</body>
+</html>