diff options
| author | cathook <b01902109@csie.ntu.edu.tw> | 2014-06-01 13:56:57 +0800 |
|---|---|---|
| committer | cathook <b01902109@csie.ntu.edu.tw> | 2014-06-01 13:56:57 +0800 |
| commit | d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0 (patch) | |
| tree | 16f7920c5079e0aefcf9509d2dbab59c464d42bd /doc/html/SplayTree_8h_source.html | |
| parent | bd58f63900410ec4764031f2e6de2d75e91434b3 (diff) | |
| download | meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar.gz meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar.bz2 meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar.lz meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar.xz meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.tar.zst meow-d5052f1c296dddf51b3e83d59bf3e3c1952cb2d0.zip | |
big chnage
Diffstat (limited to 'doc/html/SplayTree_8h_source.html')
| -rw-r--r-- | doc/html/SplayTree_8h_source.html | 941 |
1 files changed, 941 insertions, 0 deletions
diff --git a/doc/html/SplayTree_8h_source.html b/doc/html/SplayTree_8h_source.html new file mode 100644 index 0000000..6a5027e --- /dev/null +++ b/doc/html/SplayTree_8h_source.html @@ -0,0 +1,941 @@ +<!-- 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/SplayTree.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 +  <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('SplayTree_8h_source.html','');}); +</script> +<div id="doc-content"> +<div class="header"> + <div class="headertitle"> +<div class="title">SplayTree.h</div> </div> +</div><!--header--> +<div class="contents"> +<a href="SplayTree_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> <span class="preprocessor">#ifndef dsa_SplayTree_h__</span></div> +<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="preprocessor"></span><span class="preprocessor">#define dsa_SplayTree_h__</span></div> +<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="preprocessor"></span></div> +<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="preprocessor">#include <cstdlib></span></div> +<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="preprocessor">#include <utility></span></div> +<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> </div> +<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="preprocessor">#include "../math/utility.h"</span></div> +<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> </div> +<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="keyword">namespace </span>meow {</div> +<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div> +<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">template</span><<span class="keyword">class</span> Key, <span class="keyword">class</span> Value></div> +<div class="line"><a name="l00037"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html"> 37</a></span> <span class="keyword">class </span><a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a> {</div> +<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="keyword">private</span>:</div> +<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="keyword">struct </span>Node {</div> +<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  Key key_;</div> +<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  Key keyOffset_;</div> +<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  Value value_;</div> +<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordtype">size_t</span> size_;</div> +<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  Node* parent_;</div> +<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  Node* child_[2];</div> +<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div> +<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  Node(Key <span class="keyword">const</span>& key, Value <span class="keyword">const</span>& value):</div> +<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  key_(key), keyOffset_(0), value_(value) {</div> +<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  size_ = 1;</div> +<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  parent_ = NULL;</div> +<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  child_[0] = NULL;</div> +<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  child_[1] = NULL;</div> +<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  }</div> +<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#aead0d2eba7528aeff12f6c0f87c60917" title="將所有Element的Key同加上 delta ">keyOffset</a>(Key <span class="keyword">const</span>& delta) {</div> +<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  key_ = key_ + delta;</div> +<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  keyOffset_ = keyOffset_ + delta;</div> +<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div> +<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordtype">void</span> syncDown()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 2; i++) {</div> +<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (child_[i] == NULL) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  child_[i]->keyOffset(keyOffset_);</div> +<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div> +<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  ((Node*)<span class="keyword">this</span>)->keyOffset_ = Key(0);</div> +<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  }</div> +<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">void</span> syncUp()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  ((Node*)<span class="keyword">this</span>)->size_ = 1;</div> +<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 2; i++) {</div> +<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (child_[i] == NULL) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  ((Node*)<span class="keyword">this</span>)->size_ += child_[i]->size_;</div> +<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div> +<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div> +<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  };</div> +<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div> +<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  Node* root_;</div> +<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div> +<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordtype">void</span> connect(Node <span class="keyword">const</span>* parent, <span class="keywordtype">size_t</span> left_right, Node <span class="keyword">const</span>* child)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  Node* p = (Node*)parent;</div> +<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  Node* c = (Node*)child;</div> +<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (p != NULL) p->child_[left_right] = c;</div> +<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (c != NULL) c->parent_ = p;</div> +<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div> +<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> </div> +<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  Node <span class="keyword">const</span>* splay(Node <span class="keyword">const</span>* node)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">if</span> (node != NULL && node->parent_ != NULL) {</div> +<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Node *g_grand, *grand, *parent, *child = node; ; ) {</div> +<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  g_grand = (grand = parent = child->parent_)->parent_;</div> +<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">size_t</span> pc = (parent->child_[0] == child ? 0 : 1);</div> +<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  connect(parent, pc, child->child_[!pc]);</div> +<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  connect(child , !pc, parent);</div> +<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (g_grand != NULL) {</div> +<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  g_grand = (grand = g_grand)->parent_;</div> +<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordtype">size_t</span> gp = (grand->child_[0] == parent ? 0 : 1);</div> +<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  Node <span class="keyword">const</span>* who = (pc == gp ? parent : child);</div> +<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  connect(grand, gp, who->child_[!gp]);</div> +<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  connect(who , !gp, grand);</div> +<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  grand->syncUp();</div> +<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div> +<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  parent->syncUp();</div> +<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  child ->syncUp();</div> +<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (g_grand == NULL) {</div> +<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  connect(NULL, 0, child);</div> +<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div> +<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  connect(g_grand, (g_grand->child_[0] == grand ? 0 : 1), child);</div> +<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div> +<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div> +<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> (((<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>*)<span class="keyword">this</span>)->root_ = (Node*)node);</div> +<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div> +<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div> +<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(Node* node) {</div> +<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (node == NULL) return ;</div> +<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(node->child_[0]);</div> +<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(node->child_[1]);</div> +<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">delete</span> node;</div> +<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div> +<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div> +<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  Node* dup(Node* node2) {</div> +<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">if</span> (node2 == NULL) <span class="keywordflow">return</span> NULL;</div> +<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  node2->syncDown();</div> +<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  Node* node = <span class="keyword">new</span> Node(node2->key_, node2->value_);</div> +<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  connect(node, 0, dup(node2->child_[0]));</div> +<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  connect(node, 1, dup(node2->child_[1]));</div> +<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  node->syncUp();</div> +<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> node;</div> +<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div> +<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> </div> +<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  Node <span class="keyword">const</span>* findKey(Node <span class="keyword">const</span>* node, Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">while</span> (node != NULL) {</div> +<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  node->syncDown();</div> +<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  ret = node;</div> +<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (!(key < node->key_)) {</div> +<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (!(node->key_< key)) <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  node = node->child_[1];</div> +<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div> +<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  node = node->child_[0];</div> +<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div> +<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div> +<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div> +<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  Node <span class="keyword">const</span>* findMinMax(Node <span class="keyword">const</span>* node, <span class="keywordtype">bool</span> minimum)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = minimum ? 0 : 1; node != NULL; node = node->child_[i]) {</div> +<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  node->syncDown();</div> +<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  ret = node;</div> +<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div> +<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div> +<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  Node <span class="keyword">const</span>* findOrder(Node <span class="keyword">const</span>* node, <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1SplayTree.html#ad91ceed4303b4fc5b115b067d304debc" title="將Elements依照Key由小到大排序, 回傳第 ord 個Element (由0算起).">order</a>)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">while</span> (node != NULL) {</div> +<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  node->syncDown();</div> +<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  ret = node;</div> +<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordtype">size_t</span> ord = 1 + (node->child_[0] == NULL ? 0 : node->child_[0]->size_);</div> +<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (ord == order) <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ord < order){ node = node->child_[1]; order -= ord; }</div> +<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">else</span> { node = node->child_[0]; }</div> +<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div> +<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div> +<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div> +<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">void</span> split(Node* root, Node** left, Node** right) {</div> +<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (root == NULL) { *left = NULL; *right = NULL; return ; }</div> +<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  root->syncDown();</div> +<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  *left = root;</div> +<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  *right = root->child_[1];</div> +<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">if</span> (*right != NULL) {</div> +<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  (*left )->child_[1] = NULL;</div> +<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  (*right)->parent_ = NULL;</div> +<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  (*left )->syncUp();</div> +<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  }</div> +<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div> +<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  Node* merge(Node* left, Node* right) {</div> +<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">if</span> (left == NULL) <span class="keywordflow">return</span> right;</div> +<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordflow">if</span> (right == NULL) <span class="keywordflow">return</span> left ;</div> +<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  left->syncDown();</div> +<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  connect(left, 1, right);</div> +<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  left->syncUp();</div> +<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span> left;</div> +<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div> +<div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="keyword">public</span>:</div> +<div class="line"><a name="l00191"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html"> 191</a></span>  <span class="keyword">class </span><a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>{</div> +<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keyword">private</span>:</div> +<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">typedef</span> std::pair<Key const&, Value&> Entry;</div> +<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  Entry* entry_;</div> +<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  Node * node_;</div> +<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">void</span> reset(Node* node) {</div> +<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  node_ = node;</div> +<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">delete</span> entry_;</div> +<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  entry_ = (node == NULL ? NULL : <span class="keyword">new</span> Entry(node->key_, node->value_));</div> +<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div> +<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">public</span>:</div> +<div class="line"><a name="l00203"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#abab289dd578dd4879abebb58a6d86784"> 203</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#abab289dd578dd4879abebb58a6d86784">Element</a>(): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  }</div> +<div class="line"><a name="l00205"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a4f12f5c26525cbf3763a05f63ab33871"> 205</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a4f12f5c26525cbf3763a05f63ab33871">Element</a>(Node* node): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  reset(node);</div> +<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  }</div> +<div class="line"><a name="l00208"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a4cc99037c39c9d3856a06d9950678a85"> 208</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a4cc99037c39c9d3856a06d9950678a85">Element</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& element2): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  reset(element2.node_);</div> +<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div> +<div class="line"><a name="l00211"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ad522186691eead6d0a0a880e05e2a73b"> 211</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ad522186691eead6d0a0a880e05e2a73b">~Element</a>(){</div> +<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">delete</span> entry_;</div> +<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div> +<div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div> +<div class="line"><a name="l00216"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#aaea89fe0e873d4a2ceafad1519064d9a"> 216</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>& <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#aaea89fe0e873d4a2ceafad1519064d9a" title="複製資料">copyFrom</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e) {</div> +<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  reset(e.node_);</div> +<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> +<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  }</div> +<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> </div> +<div class="line"><a name="l00222"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a01f7474b5018d9505c0e8495d9d1d895"> 222</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a01f7474b5018d9505c0e8495d9d1d895" title="比對兩者是否為指向同一個Entry">same</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">return</span> (node_ == e2.node_);</div> +<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div> +<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> </div> +<div class="line"><a name="l00227"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a6af08a219ca313ddd086db6d3a8685d7"> 227</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>& <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a6af08a219ca313ddd086db6d3a8685d7" title="same as copyFrom">operator=</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2) {</div> +<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#aaea89fe0e873d4a2ceafad1519064d9a" title="複製資料">copyFrom</a>(e2);</div> +<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div> +<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div> +<div class="line"><a name="l00232"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a5e564545e78be2ad63e965c985997ab5"> 232</a></span>  Entry* <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a5e564545e78be2ad63e965c985997ab5" title="重導至std::pair<Key const&,Value&>* ">operator-></a>() {</div> +<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span> entry_;</div> +<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div> +<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div> +<div class="line"><a name="l00237"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ac947185148b8e81083172b843b129510"> 237</a></span>  Entry& <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ac947185148b8e81083172b843b129510" title="重導至std::pair<Key const&,Value&>& ">operator*</a>() {</div> +<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordflow">return</span> *entry_;</div> +<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div> +<div class="line"><a name="l00240"></a><span class="lineno"> 240</span> </div> +<div class="line"><a name="l00242"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#aeaf7740977e75749cd8656066d05808b"> 242</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#aeaf7740977e75749cd8656066d05808b" title="same as same(e2) ">operator==</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a01f7474b5018d9505c0e8495d9d1d895" title="比對兩者是否為指向同一個Entry">same</a>(e2);</div> +<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  }</div> +<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div> +<div class="line"><a name="l00247"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ae5c8fa3ed0fb90953de1b50e81a89480"> 247</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html#ae5c8fa3ed0fb90953de1b50e81a89480" title="same as !same(e2)">operator!=</a>(<a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> !<a class="code" href="classmeow_1_1SplayTree_1_1Element.html#a01f7474b5018d9505c0e8495d9d1d895" title="比對兩者是否為指向同一個Entry">same</a>(e2);</div> +<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  }</div> +<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  };</div> +<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> </div> +<div class="line"><a name="l00253"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a640cec3815f70c0a7eac811d7272c637"> 253</a></span>  <a class="code" href="classmeow_1_1SplayTree.html#a640cec3815f70c0a7eac811d7272c637" title="constructor">SplayTree</a>(): root_(NULL) {</div> +<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div> +<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div> +<div class="line"><a name="l00257"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#addfdea993d700469785b3e01631ec3c0"> 257</a></span>  <a class="code" href="classmeow_1_1SplayTree.html#a640cec3815f70c0a7eac811d7272c637" title="constructor">SplayTree</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a> <span class="keyword">const</span>& tree2):</div> +<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  root_(dup((Node*)(tree2.root_))) {</div> +<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div> +<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> </div> +<div class="line"><a name="l00262"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a8a3e10edd9aa04a5786ad6d8b7dd5490"> 262</a></span>  <a class="code" href="classmeow_1_1SplayTree.html#a8a3e10edd9aa04a5786ad6d8b7dd5490" title="destructor">~SplayTree</a>(){</div> +<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  }</div> +<div class="line"><a name="l00265"></a><span class="lineno"> 265</span> </div> +<div class="line"><a name="l00269"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#aafc78f8d6abc95d52ba1062c14946cd5"> 269</a></span>  <a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>& <a class="code" href="classmeow_1_1SplayTree.html#aafc78f8d6abc95d52ba1062c14946cd5" title="複製資料">copyFrom</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a> <span class="keyword">const</span>& tree2) {</div> +<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  root_ = dup((Node*)(tree2.root_));</div> +<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> +<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div> +<div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div> +<div class="line"><a name="l00278"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a169eca2b27a5ec844bd79bba2bb75412"> 278</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#a169eca2b27a5ec844bd79bba2bb75412" title="將資料都丟到 tree2 身上, 並且清空自己">moveTo</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>* tree2) {</div> +<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  tree2->clear();</div> +<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  tree2->root_ = root_;</div> +<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  root_ = NULL;</div> +<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div> +<div class="line"><a name="l00283"></a><span class="lineno"> 283</span> </div> +<div class="line"><a name="l00289"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a48d6f8f0af07a6620bd73a92db226ce6"> 289</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a48d6f8f0af07a6620bd73a92db226ce6" title="找出第一個(最小的) Element且 k <= 它的 Key, 並且回傳之.">lowerBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">if</span> (root_ == NULL || !(root_->key_ < key)) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">if</span> (root_->child_[1] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  splay(findMinMax(root_->child_[1], <span class="keyword">true</span>));</div> +<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  }</div> +<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> </div> +<div class="line"><a name="l00302"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a9cd532f990a5fe6ff0930fc297cf664e"> 302</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a9cd532f990a5fe6ff0930fc297cf664e" title="找出第一個(最小的) Element且 k < 它的 Key, 並且回傳之.">upperBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (root_ == NULL || key < root_->key_) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (root_->child_[1] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  splay(findMinMax(root_->child_[1], <span class="keyword">true</span>));</div> +<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div> +<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> </div> +<div class="line"><a name="l00315"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a06dd77ef9bd62d83a7571feca5324825"> 315</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a06dd77ef9bd62d83a7571feca5324825" title="找出第一個(最小的) Element且 k >= 它的 Key, 並且回傳之.">rLowerBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">if</span> (root_ == NULL || !(key < root_->key_)) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (root_->child_[0] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  splay(findMinMax(root_->child_[0], <span class="keyword">false</span>));</div> +<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  }</div> +<div class="line"><a name="l00322"></a><span class="lineno"> 322</span> </div> +<div class="line"><a name="l00328"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a7e4eb9104cd7a2c01cda7e0a19c55cbe"> 328</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a7e4eb9104cd7a2c01cda7e0a19c55cbe" title="找出第一個(最小的) Element且 k > 它的 Key, 並且回傳之.">rUpperBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">if</span> (root_ == NULL || root_->key_ < key) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (root_->child_[0] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  splay(findMinMax(root_->child_[0], <span class="keyword">false</span>));</div> +<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div> +<div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div> +<div class="line"><a name="l00339"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a67dc7214cf9a89053e4b719f4d60cb4c"> 339</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a67dc7214cf9a89053e4b719f4d60cb4c" title="找出 Key= k 的Elemenet 並回傳. 找不到的話回傳 this->end() ">find</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (root_ != NULL && !(key < root_->key_) && !(root_->key_ < key)) {</div> +<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  }</div> +<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div> +<div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div> +<div class="line"><a name="l00352"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#ad91ceed4303b4fc5b115b067d304debc"> 352</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#ad91ceed4303b4fc5b115b067d304debc" title="將Elements依照Key由小到大排序, 回傳第 ord 個Element (由0算起).">order</a>(<span class="keywordtype">size_t</span> order)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (root_ == NULL || order >= root_->size_) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  splay(findOrder(root_, order + 1));</div> +<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div> +<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div> +<div class="line"><a name="l00361"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b"> 361</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  splay(findMinMax(root_, <span class="keyword">true</span>));</div> +<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div> +<div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div> +<div class="line"><a name="l00369"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a805efe9b5f4bac68fd62908eb7cf3501"> 369</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#a805efe9b5f4bac68fd62908eb7cf3501" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  splay(findMinMax(root_, <span class="keyword">false</span>));</div> +<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  }</div> +<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> </div> +<div class="line"><a name="l00379"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#abcdab5caa27fecfd980595681381a4dc"> 379</a></span>  <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree.html#abcdab5caa27fecfd980595681381a4dc" title="回傳一個指向NULL的Element,">end</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div> +<div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div> +<div class="line"><a name="l00386"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a40b663d34933b258e667f9205f469fdc"> 386</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1SplayTree.html#a40b663d34933b258e667f9205f469fdc" title="回傳資料個數">size</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">return</span> (root_ == NULL ? 0 : root_->size_);</div> +<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  }</div> +<div class="line"><a name="l00389"></a><span class="lineno"> 389</span> </div> +<div class="line"><a name="l00393"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a8dac8bccc08f9c1c828b25b7fe9919c7"> 393</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree.html#a8dac8bccc08f9c1c828b25b7fe9919c7" title="回傳是否為空">empty</a>()<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">return</span> (<a class="code" href="classmeow_1_1SplayTree.html#a40b663d34933b258e667f9205f469fdc" title="回傳資料個數">size</a>() == 0);</div> +<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div> +<div class="line"><a name="l00396"></a><span class="lineno"> 396</span> </div> +<div class="line"><a name="l00400"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9"> 400</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>() {</div> +<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <a class="code" href="classmeow_1_1SplayTree.html#ae5a57883fd31a6288b958b42b94606a9" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  root_ = NULL;</div> +<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div> +<div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div> +<div class="line"><a name="l00411"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a0ae5e48da8d18ad8b2dc839d1c1b5582"> 411</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree.html#a0ae5e48da8d18ad8b2dc839d1c1b5582" title="插入一組(Key —> Value)">insert</a>(Key <span class="keyword">const</span>& key, Value <span class="keyword">const</span>& value) {</div> +<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (root_ == NULL) {</div> +<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  root_ = <span class="keyword">new</span> Node(key, value);</div> +<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  }</div> +<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  Node* parent = (Node*)findKey(root_, key);</div> +<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span> (!(parent->key_ < key) && !(key < parent->key_)) {</div> +<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  splay(parent);</div> +<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div> +<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  Node* new_node = <span class="keyword">new</span> Node(key, value);</div> +<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  connect(parent, (parent->key_ < key ? 1 : 0), new_node);</div> +<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  parent->syncUp();</div> +<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  splay(new_node);</div> +<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  }</div> +<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div> +<div class="line"><a name="l00428"></a><span class="lineno"> 428</span> </div> +<div class="line"><a name="l00435"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#aef1f4e901e3e17a67e45aa2b9f9b61db"> 435</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree.html#aef1f4e901e3e17a67e45aa2b9f9b61db" title="刪除一組資料">erase</a>(Key <span class="keyword">const</span>& key) {</div> +<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (root_ == NULL) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  Node* body = (Node*)findKey(root_, key);</div> +<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (body->key_ < key || key < body->key_) {</div> +<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  splay(body);</div> +<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  }</div> +<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  Node* ghost;</div> +<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">if</span> (body->child_[1] == NULL) {</div> +<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  ghost = body->child_[0];</div> +<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span> (ghost != NULL) ghost->syncDown();</div> +<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  }</div> +<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  ghost = (Node*)findMinMax(body->child_[1], <span class="keyword">true</span>);</div> +<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  connect(ghost, 0, body->child_[0]);</div> +<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">if</span> (ghost != body->child_[1]) {</div> +<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  connect(ghost->parent_, 0, ghost->child_[1]);</div> +<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  connect(ghost, 1, body->child_[1]);</div> +<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="keywordflow">for</span> (Node* a = ghost->parent_; a != ghost; a = a->parent_)</div> +<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  a->syncUp();</div> +<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div> +<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  ghost->syncUp();</div> +<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  }</div> +<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  Node* parent = body->parent_;</div> +<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  connect(parent, parent != NULL && parent->child_[0] == body ? 0 : 1, ghost);</div> +<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">delete</span> body;</div> +<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  splay(ghost != NULL ? ghost : parent);</div> +<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  }</div> +<div class="line"><a name="l00464"></a><span class="lineno"> 464</span> </div> +<div class="line"><a name="l00468"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#aead0d2eba7528aeff12f6c0f87c60917"> 468</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#aead0d2eba7528aeff12f6c0f87c60917" title="將所有Element的Key同加上 delta ">keyOffset</a>(Key <span class="keyword">const</span>& delta) {</div> +<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">if</span> (root_ != NULL) {</div> +<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  root_->keyOffset(delta);</div> +<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  }</div> +<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div> +<div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div> +<div class="line"><a name="l00477"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a36a55daf9150ae2d866075dedf1d583d"> 477</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree.html#a36a55daf9150ae2d866075dedf1d583d" title="將tree2 清空, 再將所有Key > upper_bound 的Element都丟過去">splitOut</a>(Key <span class="keyword">const</span>& upper_bound, <a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>* right) {</div> +<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  right->clear();</div> +<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">if</span> (<a class="code" href="classmeow_1_1SplayTree.html#a06dd77ef9bd62d83a7571feca5324825" title="找出第一個(最小的) Element且 k >= 它的 Key, 並且回傳之.">rLowerBound</a>(upper_bound) != <a class="code" href="classmeow_1_1SplayTree.html#abcdab5caa27fecfd980595681381a4dc" title="回傳一個指向NULL的Element,">end</a>()) {</div> +<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  split(root_, &root_, &(right->root_));</div> +<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div> +<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  right->root_ = root_;</div> +<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  root_ = NULL;</div> +<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  }</div> +<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  }</div> +<div class="line"><a name="l00487"></a><span class="lineno"> 487</span> </div> +<div class="line"><a name="l00494"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a17f0fea3a3f4c7a548743bee7e5a285c"> 494</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree.html#a17f0fea3a3f4c7a548743bee7e5a285c" title="合併">mergeAfter</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>* tree2) {</div> +<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">if</span> (root_ == NULL || tree2->root_ == NULL ||</div> +<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <a class="code" href="classmeow_1_1SplayTree.html#a805efe9b5f4bac68fd62908eb7cf3501" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < tree2-><a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()-><a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>) {</div> +<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  root_ = merge(root_, tree2->root_);</div> +<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  tree2->root_ = NULL;</div> +<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div> +<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  }</div> +<div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div> +<div class="line"><a name="l00511"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a9d370115877428e58b1595458dc345a3"> 511</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree.html#a9d370115877428e58b1595458dc345a3" title="合併">merge</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>* tree2) {</div> +<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keywordflow">if</span> (root_ == NULL || tree2->root_ == NULL ||</div> +<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <a class="code" href="classmeow_1_1SplayTree.html#a805efe9b5f4bac68fd62908eb7cf3501" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < tree2-><a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()-><a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>) {</div> +<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  root_ = merge(root_, tree2->root_);</div> +<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  }</div> +<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree2-><a class="code" href="classmeow_1_1SplayTree.html#a805efe9b5f4bac68fd62908eb7cf3501" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < <a class="code" href="classmeow_1_1SplayTree.html#ad8c3814cbfbcc9f754b62a74368ddc0b" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()->first) {</div> +<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  root_ = merge(tree2->root_, root_);</div> +<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  }</div> +<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  }</div> +<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  tree2->root_ = NULL;</div> +<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  }</div> +<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  </div> +<div class="line"><a name="l00532"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#a9f02a4ccc46616b7923c5834e02d53bc"> 532</a></span>  Value& <a class="code" href="classmeow_1_1SplayTree.html#a9f02a4ccc46616b7923c5834e02d53bc" title="就像stl::map::operator[]">operator[]</a>(Key <span class="keyword">const</span>& key) {</div> +<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span> (<a class="code" href="classmeow_1_1SplayTree.html#a67dc7214cf9a89053e4b719f4d60cb4c" title="找出 Key= k 的Elemenet 並回傳. 找不到的話回傳 this->end() ">find</a>(key) == <a class="code" href="classmeow_1_1SplayTree.html#abcdab5caa27fecfd980595681381a4dc" title="回傳一個指向NULL的Element,">end</a>()) <a class="code" href="classmeow_1_1SplayTree.html#a0ae5e48da8d18ad8b2dc839d1c1b5582" title="插入一組(Key —> Value)">insert</a>(key, Value());</div> +<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span> root_->value_;</div> +<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div> +<div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div> +<div class="line"><a name="l00538"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree.html#aef1da0d72d3a88851bd805d489fb6ea0"> 538</a></span>  <a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a>& <a class="code" href="classmeow_1_1SplayTree.html#aef1da0d72d3a88851bd805d489fb6ea0" title="same as copyFrom(tree2) ">operator=</a>(<a class="code" href="classmeow_1_1SplayTree.html" title="是一種神乎其技的資料結構, 維護一堆 Key->Value . 並且支援 一些 std::map 難以快速實踐的操作, 如 split , merge , keyOffset ...">SplayTree</a> <span class="keyword">const</span>& tree2) {</div> +<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree.html#aafc78f8d6abc95d52ba1062c14946cd5" title="複製資料">copyFrom</a>(tree2);</div> +<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div> +<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> };</div> +<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div> +<div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="keyword">template</span><<span class="keyword">class</span> Key, <span class="keyword">class</span> Value></div> +<div class="line"><a name="l00569"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html"> 569</a></span> <span class="keyword">class </span><a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a> {</div> +<div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="keyword">private</span>:</div> +<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keyword">struct </span>Node {</div> +<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  Value valueOffset_;</div> +<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  Value range_;</div> +<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  Key key_;</div> +<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  Key keyOffset_;</div> +<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  Value value_;</div> +<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keywordtype">bool</span> same_;</div> +<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordtype">size_t</span> size_;</div> +<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  Node* parent_;</div> +<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  Node* child_[2];</div> +<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div> +<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  Node(Key <span class="keyword">const</span>& key, Value <span class="keyword">const</span>& value):</div> +<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  valueOffset_(0), range_(value),</div> +<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  key_(key), keyOffset_(0), value_(value) {</div> +<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  same_ = <span class="keyword">false</span>;</div> +<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  size_ = 1;</div> +<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  parent_ = NULL;</div> +<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  child_[0] = NULL;</div> +<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  child_[1] = NULL;</div> +<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  }</div> +<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a4e05023009c1c82a5d464a43d6777843" title="將所有Element的Key同加上 delta ">keyOffset</a>(Key <span class="keyword">const</span>& delta) {</div> +<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  key_ = key_ + delta;</div> +<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  keyOffset_ = keyOffset_ + delta;</div> +<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div> +<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keywordtype">void</span> valueUpdate(Value <span class="keyword">const</span>& delta, <span class="keywordtype">bool</span> over) {</div> +<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">if</span>(over) {</div> +<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  value_ = delta * size_;</div> +<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  valueOffset_ = delta;</div> +<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  range_ = delta * size_;</div> +<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  same_ = <span class="keyword">true</span>;</div> +<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div> +<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  value_ = value_ + delta * size_;</div> +<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  valueOffset_ = valueOffset_ + delta;</div> +<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  range_ = range_ + delta * size_;</div> +<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  }</div> +<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div> +<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordtype">void</span> syncDown()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 2; i++) {</div> +<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">if</span> (child_[i] == NULL) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  child_[i]->keyOffset(keyOffset_);</div> +<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  child_[i]->valueUpdate(valueOffset_, same_);</div> +<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div> +<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  ((Node*)<span class="keyword">this</span>)->keyOffset_ = Key(0);</div> +<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  ((Node*)<span class="keyword">this</span>)->valueOffset_ = Value(0);</div> +<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  ((Node*)<span class="keyword">this</span>)->same_ = <span class="keyword">false</span>;</div> +<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div> +<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordtype">void</span> syncUp()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  ((Node*)<span class="keyword">this</span>)->size_ = 1;</div> +<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  Value* v[3] = {&(((Node*)<span class="keyword">this</span>)->value_), NULL, NULL};</div> +<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordtype">size_t</span> vct = 1;</div> +<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < 2; i++) {</div> +<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="keywordflow">if</span> (child_[i] == NULL) <span class="keywordflow">continue</span>;</div> +<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  ((Node*)<span class="keyword">this</span>)->size_ += child_[i]->size_;</div> +<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  v[vct++] = &(child_[i]->range_);</div> +<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  }</div> +<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">if</span> (vct == 1) ((Node*)<span class="keyword">this</span>)->range_ = (*v[0]);</div> +<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(vct == 2) ((Node*)<span class="keyword">this</span>)->range_ = (*v[0]) | (*v[1]);</div> +<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">else</span> ((Node*)<span class="keyword">this</span>)->range_ = (*v[0]) | (*v[1]) | (*v[2]);</div> +<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  }</div> +<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  };</div> +<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> </div> +<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  Node* root_;</div> +<div class="line"><a name="l00635"></a><span class="lineno"> 635</span> </div> +<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordtype">void</span> connect(Node <span class="keyword">const</span>* parent, <span class="keywordtype">size_t</span> left_right, Node <span class="keyword">const</span>* child)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  Node* p = (Node*)parent;</div> +<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  Node* c = (Node*)child;</div> +<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span> (p != NULL) p->child_[left_right] = c;</div> +<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">if</span> (c != NULL) c->parent_ = p;</div> +<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div> +<div class="line"><a name="l00643"></a><span class="lineno"> 643</span> </div> +<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  Node <span class="keyword">const</span>* splay(Node <span class="keyword">const</span>* node)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="keywordflow">if</span> (node != NULL && node->parent_ != NULL) {</div> +<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Node *g_grand, *grand, *parent, *child = node; ; ) {</div> +<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  g_grand = (grand = parent = child->parent_)->parent_;</div> +<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordtype">size_t</span> pc = (parent->child_[0] == child ? 0 : 1);</div> +<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  connect(parent, pc, child->child_[!pc]);</div> +<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  connect(child , !pc, parent);</div> +<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">if</span> (g_grand != NULL) {</div> +<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  g_grand = (grand = g_grand)->parent_;</div> +<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordtype">size_t</span> gp = (grand->child_[0] == parent ? 0 : 1);</div> +<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  Node <span class="keyword">const</span>* who = (pc == gp ? parent : child);</div> +<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  connect(grand, gp, who->child_[!gp]);</div> +<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  connect(who , !gp, grand);</div> +<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  grand->syncUp();</div> +<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  }</div> +<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  parent->syncUp();</div> +<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  child ->syncUp();</div> +<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (g_grand == NULL) {</div> +<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  connect(NULL, 0, child);</div> +<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div> +<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  connect(g_grand, (g_grand->child_[0] == grand ? 0 : 1), child);</div> +<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  }</div> +<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  }</div> +<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">return</span> (((<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>*)<span class="keyword">this</span>)->root_ = (Node*)node);</div> +<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  }</div> +<div class="line"><a name="l00671"></a><span class="lineno"> 671</span> </div> +<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(Node* node) {</div> +<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (node == NULL) return ;</div> +<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(node->child_[0]);</div> +<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(node->child_[1]);</div> +<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keyword">delete</span> node;</div> +<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div> +<div class="line"><a name="l00678"></a><span class="lineno"> 678</span> </div> +<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  Node* dup(Node* node2) {</div> +<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (node2 == NULL) <span class="keywordflow">return</span> NULL;</div> +<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  node2->syncDown();</div> +<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  Node* node = <span class="keyword">new</span> Node(node2->key_, node2->value_);</div> +<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  connect(node, 0, dup(node2->child_[0]));</div> +<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  connect(node, 1, dup(node2->child_[1]));</div> +<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  node->syncUp();</div> +<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">return</span> node;</div> +<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  }</div> +<div class="line"><a name="l00688"></a><span class="lineno"> 688</span> </div> +<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  Node <span class="keyword">const</span>* findKey(Node <span class="keyword">const</span>* node, Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">while</span> (node != NULL) {</div> +<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  node->syncDown();</div> +<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  ret = node;</div> +<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (!(key < node->key_)) {</div> +<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (!(node->key_< key)) <span class="keywordflow">break</span>;</div> +<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  node = node->child_[1];</div> +<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div> +<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  node = node->child_[0];</div> +<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div> +<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div> +<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div> +<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  Node <span class="keyword">const</span>* findMinMax(Node <span class="keyword">const</span>* node, <span class="keywordtype">bool</span> minimum)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = minimum ? 0 : 1; node != NULL; node = node->child_[i]) {</div> +<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  node->syncDown();</div> +<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  ret = node;</div> +<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div> +<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  }</div> +<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  Node <span class="keyword">const</span>* findOrder(Node <span class="keyword">const</span>* node, <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a6e33546a3cb07d56548a1f64aa1fc711" title="將Elements依照Key由小到大排序, 回傳第 ord 個Element (由0算起).">order</a>)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  Node <span class="keyword">const</span>* ret = node;</div> +<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">while</span> (node != NULL) {</div> +<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  node->syncDown();</div> +<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  ret = node;</div> +<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordtype">size_t</span> ord = 1 + (node->child_[0] == NULL ? 0 : node->child_[0]->size_);</div> +<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">if</span> (ord == order) <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(ord < order){ node = node->child_[1]; order -= ord; }</div> +<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">else</span> { node = node->child_[0]; }</div> +<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div> +<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</div> +<div class="line"><a name="l00724"></a><span class="lineno"> 724</span> </div> +<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordtype">void</span> split(Node* root, Node** left, Node** right) {</div> +<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keywordflow">if</span> (root == NULL) { *left = NULL; *right = NULL; return ; }</div> +<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  root->syncDown();</div> +<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  *left = root;</div> +<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  *right = root->child_[1];</div> +<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordflow">if</span> (*right != NULL) {</div> +<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  (*left )->child_[1] = NULL;</div> +<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  (*right)->parent_ = NULL;</div> +<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  (*left )->syncUp();</div> +<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  }</div> +<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div> +<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  Node* merge(Node* left, Node* right) {</div> +<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">if</span> (left == NULL) <span class="keywordflow">return</span> right;</div> +<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">if</span> (right == NULL) <span class="keywordflow">return</span> left ;</div> +<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  left->syncDown();</div> +<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  connect(left, 1, right);</div> +<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  left->syncUp();</div> +<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">return</span> left;</div> +<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  }</div> +<div class="line"><a name="l00744"></a><span class="lineno"> 744</span> <span class="keyword">public</span>:</div> +<div class="line"><a name="l00750"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html"> 750</a></span>  <span class="keyword">class </span><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>{</div> +<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">private</span>:</div> +<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keyword">typedef</span> std::pair<Key const&, Value&> Entry;</div> +<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  Entry* entry_;</div> +<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  Node * node_;</div> +<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="comment">//</span></div> +<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordtype">void</span> reset(Node* node) {</div> +<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  node_ = node;</div> +<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keyword">delete</span> entry_;</div> +<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  entry_ = (node == NULL ? NULL : <span class="keyword">new</span> Entry(node->key_, node->value_));</div> +<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  }</div> +<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">public</span>:</div> +<div class="line"><a name="l00762"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#acc3dcc61b0b363c10ab3cb572a37bffe"> 762</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#acc3dcc61b0b363c10ab3cb572a37bffe">Element</a>(): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  }</div> +<div class="line"><a name="l00764"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a18157d69d14dad8e2a9600a3052ef341"> 764</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a18157d69d14dad8e2a9600a3052ef341">Element</a>(Node* node): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  reset(node);</div> +<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  }</div> +<div class="line"><a name="l00767"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#aaf32bca541ab3b6212a135a77e7f7d91"> 767</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#aaf32bca541ab3b6212a135a77e7f7d91">Element</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& element2): entry_(NULL), node_(NULL) {</div> +<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  reset(element2.node_);</div> +<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div> +<div class="line"><a name="l00770"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a5441072951b572b2859f6f0f1b55d3cc"> 770</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a5441072951b572b2859f6f0f1b55d3cc">~Element</a>(){</div> +<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="keyword">delete</span> entry_;</div> +<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  }</div> +<div class="line"><a name="l00773"></a><span class="lineno"> 773</span> </div> +<div class="line"><a name="l00775"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#ace7c7fb2416ca7afd7df627a0fe57ed0"> 775</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>& <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#ace7c7fb2416ca7afd7df627a0fe57ed0" title="複製資料">copyFrom</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e) {</div> +<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  reset(e.node_);</div> +<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> +<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div> +<div class="line"><a name="l00779"></a><span class="lineno"> 779</span> </div> +<div class="line"><a name="l00781"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#aea48bcfd0ad50cbdcdc15128be5e8f15"> 781</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#aea48bcfd0ad50cbdcdc15128be5e8f15" title="比對兩者是否為指向同一個Entry">same</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">return</span> (node_ == e2.node_);</div> +<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  }</div> +<div class="line"><a name="l00784"></a><span class="lineno"> 784</span> </div> +<div class="line"><a name="l00786"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a126d57eee520aa17868ce74112249e12"> 786</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>& <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a126d57eee520aa17868ce74112249e12" title="same as copyFrom">operator=</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2) {</div> +<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#acb88cb76b50884221cbb58d2adcb4329" title="複製資料">copyFrom</a>(e2);</div> +<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div> +<div class="line"><a name="l00789"></a><span class="lineno"> 789</span> </div> +<div class="line"><a name="l00791"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a6344204522f3093165b1a100cc2bf6f2"> 791</a></span>  Entry* <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a6344204522f3093165b1a100cc2bf6f2" title="重導至std::pair<Key const&,Value&>* ">operator-></a>() {</div> +<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">return</span> entry_;</div> +<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  }</div> +<div class="line"><a name="l00794"></a><span class="lineno"> 794</span> </div> +<div class="line"><a name="l00796"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#ad860aa695abffe96716eed4a5e58d950"> 796</a></span>  Entry& <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#ad860aa695abffe96716eed4a5e58d950" title="重導至std::pair<Key const&,Value&>& ">operator*</a>() {</div> +<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keywordflow">return</span> *entry_;</div> +<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  }</div> +<div class="line"><a name="l00799"></a><span class="lineno"> 799</span> </div> +<div class="line"><a name="l00801"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a42f71bf3aa7e009582e628e87763482d"> 801</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a42f71bf3aa7e009582e628e87763482d" title="same as same(e2) ">operator==</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keywordflow">return</span> same(e2);</div> +<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div> +<div class="line"><a name="l00804"></a><span class="lineno"> 804</span> </div> +<div class="line"><a name="l00806"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a7e8d951ce66208a88ac8d8a177af48a5"> 806</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html#a7e8d951ce66208a88ac8d8a177af48a5" title="same as !same(e2)">operator!=</a>(<a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <span class="keyword">const</span>& e2)<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="keywordflow">return</span> !same(e2);</div> +<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div> +<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  };</div> +<div class="line"><a name="l00810"></a><span class="lineno"> 810</span> </div> +<div class="line"><a name="l00812"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#acf3c8d90ff38a210ed9d64dd365d5e93"> 812</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#acf3c8d90ff38a210ed9d64dd365d5e93" title="constructor">SplayTree_Range</a>(): root_(NULL) {</div> +<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  }</div> +<div class="line"><a name="l00814"></a><span class="lineno"> 814</span> </div> +<div class="line"><a name="l00816"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#aa5a5c774d04721cbe038ec883c01737a"> 816</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#acf3c8d90ff38a210ed9d64dd365d5e93" title="constructor">SplayTree_Range</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a> <span class="keyword">const</span>& tree2):</div> +<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  root_(dup((Node*)(tree2.root_))) {</div> +<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  }</div> +<div class="line"><a name="l00819"></a><span class="lineno"> 819</span> </div> +<div class="line"><a name="l00821"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#afa919ebbc8feedc4c2ed2185d6207261"> 821</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#afa919ebbc8feedc4c2ed2185d6207261" title="destructor">~SplayTree_Range</a>() {</div> +<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  }</div> +<div class="line"><a name="l00824"></a><span class="lineno"> 824</span> </div> +<div class="line"><a name="l00828"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#acb88cb76b50884221cbb58d2adcb4329"> 828</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>& <a class="code" href="classmeow_1_1SplayTree__Range.html#acb88cb76b50884221cbb58d2adcb4329" title="複製資料">copyFrom</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a> <span class="keyword">const</span>& tree2) {</div> +<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  root_ = dup((Node*)(tree2.root_));</div> +<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> +<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div> +<div class="line"><a name="l00833"></a><span class="lineno"> 833</span> </div> +<div class="line"><a name="l00837"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a17483e5f0028004cc4bf46699591fafe"> 837</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a17483e5f0028004cc4bf46699591fafe" title="將資料都丟到 tree2 身上, 並且清空自己">moveTo</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>* tree2) {</div> +<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  tree2->clear();</div> +<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  tree2->root_ = root_;</div> +<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  root_ = NULL;</div> +<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  }</div> +<div class="line"><a name="l00842"></a><span class="lineno"> 842</span> </div> +<div class="line"><a name="l00848"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a92ca3967d0f433a57b5057d61183f2aa"> 848</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a92ca3967d0f433a57b5057d61183f2aa" title="找出第一個(最小的) Element且 k <= 它的 Key, 並且回傳之.">lowerBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keywordflow">if</span> (root_ == NULL || !(root_->key_ < key)) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">if</span> (root_->child_[1] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  splay(findMinMax(root_->child_[1], <span class="keyword">true</span>));</div> +<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div> +<div class="line"><a name="l00855"></a><span class="lineno"> 855</span> </div> +<div class="line"><a name="l00861"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a492f68ede1f6423590ec2bfa3f839ab0"> 861</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a492f68ede1f6423590ec2bfa3f839ab0" title="找出第一個(最小的) Element且 k < 它的 Key, 並且回傳之.">upperBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keywordflow">if</span> (root_ == NULL || key < root_->key_) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">if</span> (root_->child_[1] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  splay(findMinMax(root_->child_[1], <span class="keyword">true</span>));</div> +<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  }</div> +<div class="line"><a name="l00868"></a><span class="lineno"> 868</span> </div> +<div class="line"><a name="l00874"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a05057d5df92737104b7431b4203cac11"> 874</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a05057d5df92737104b7431b4203cac11" title="找出第一個(最小的) Element且 k >= 它的 Key, 並且回傳之.">rLowerBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">if</span> (root_ == NULL || !(key < root_->key_)) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keywordflow">if</span> (root_->child_[0] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  splay(findMinMax(root_->child_[0], <span class="keyword">false</span>));</div> +<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  }</div> +<div class="line"><a name="l00881"></a><span class="lineno"> 881</span> </div> +<div class="line"><a name="l00887"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#ae0f6543101ce4864257b93786c21a5c8"> 887</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#ae0f6543101ce4864257b93786c21a5c8" title="找出第一個(最小的) Element且 k > 它的 Key, 並且回傳之.">rUpperBound</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keywordflow">if</span> (root_ == NULL || root_->key_ < key) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">if</span> (root_->child_[0] == NULL) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  splay(findMinMax(root_->child_[0], <span class="keyword">false</span>));</div> +<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  }</div> +<div class="line"><a name="l00894"></a><span class="lineno"> 894</span> </div> +<div class="line"><a name="l00898"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a13c3591050f556251a33c03ce142acb1"> 898</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a13c3591050f556251a33c03ce142acb1" title="找出 Key= k 的Elemenet 並回傳. 找不到的話回傳 this->end() ">find</a>(Key <span class="keyword">const</span>& key)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  splay(findKey(root_, key));</div> +<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keywordflow">if</span> (root_ != NULL && !(key < root_->key_) && !(root_->key_ < key)) {</div> +<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  }</div> +<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  }</div> +<div class="line"><a name="l00905"></a><span class="lineno"> 905</span> </div> +<div class="line"><a name="l00911"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a6e33546a3cb07d56548a1f64aa1fc711"> 911</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a6e33546a3cb07d56548a1f64aa1fc711" title="將Elements依照Key由小到大排序, 回傳第 ord 個Element (由0算起).">order</a>(<span class="keywordtype">size_t</span> order)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">if</span> (root_ == NULL || order >= root_->size_) <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  splay(findOrder(root_, order + 1));</div> +<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  }</div> +<div class="line"><a name="l00916"></a><span class="lineno"> 916</span> </div> +<div class="line"><a name="l00920"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77"> 920</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  splay(findMinMax(root_, <span class="keyword">true</span>));</div> +<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  }</div> +<div class="line"><a name="l00924"></a><span class="lineno"> 924</span> </div> +<div class="line"><a name="l00928"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264"> 928</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  splay(findMinMax(root_, <span class="keyword">false</span>));</div> +<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(root_);</div> +<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div> +<div class="line"><a name="l00932"></a><span class="lineno"> 932</span> </div> +<div class="line"><a name="l00938"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#ad3aaed040f619a3b14c3f9b598b7fecc"> 938</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a> <a class="code" href="classmeow_1_1SplayTree__Range.html#ad3aaed040f619a3b14c3f9b598b7fecc" title="回傳一個指向NULL的Element,">end</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range_1_1Element.html" title="類似 stl 的 iterator ,不過這邊叫做Element ">Element</a>(NULL);</div> +<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div> +<div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div> +<div class="line"><a name="l00945"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#afce0f36427e9105a3405176ed4eddf58"> 945</a></span>  <span class="keywordtype">size_t</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#afce0f36427e9105a3405176ed4eddf58" title="回傳資料個數">size</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">return</span> (root_ == NULL ? 0 : root_->size_);</div> +<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  }</div> +<div class="line"><a name="l00948"></a><span class="lineno"> 948</span> </div> +<div class="line"><a name="l00952"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a86abc6a3a19f874e86fb29b75c212fce"> 952</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a86abc6a3a19f874e86fb29b75c212fce" title="回傳是否為空">empty</a>()<span class="keyword"> const</span>{</div> +<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordflow">return</span> (<a class="code" href="classmeow_1_1SplayTree__Range.html#afce0f36427e9105a3405176ed4eddf58" title="回傳資料個數">size</a>() == 0);</div> +<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div> +<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  </div> +<div class="line"><a name="l00961"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a91272707629fcec7cc9fa60594334002"> 961</a></span>  Value <a class="code" href="classmeow_1_1SplayTree__Range.html#a91272707629fcec7cc9fa60594334002" title="查找">query</a>()<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keywordflow">if</span> (root_ == NULL) <span class="keywordflow">return</span> Value(0);</div> +<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keywordflow">return</span> root_->range_;</div> +<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  }</div> +<div class="line"><a name="l00965"></a><span class="lineno"> 965</span> </div> +<div class="line"><a name="l00971"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a9952f914eb9449ae17f5ea0ece422af9"> 971</a></span>  Value <a class="code" href="classmeow_1_1SplayTree__Range.html#a9952f914eb9449ae17f5ea0ece422af9" title="查找">query</a>(Key <span class="keyword">const</span>& <a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>, Key <span class="keyword">const</span>& <a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>)<span class="keyword"> const </span>{</div> +<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>* <span class="keyword">self</span> = (<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>*)<span class="keyword">this</span>;</div> +<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  Node* tmp;</div> +<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#ae0f6543101ce4864257b93786c21a5c8" title="找出第一個(最小的) Element且 k > 它的 Key, 並且回傳之.">rUpperBound</a>(first);</div> +<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="keyword">self</span>->split(self->root_, &tmp, &(self->root_));</div> +<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a492f68ede1f6423590ec2bfa3f839ab0" title="找出第一個(最小的) Element且 k < 它的 Key, 並且回傳之.">upperBound</a>(last);</div> +<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  Value ret(0);</div> +<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keywordflow">if</span> (root_ != NULL && root_->child_[0] != NULL) {</div> +<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  ret = root_->child_[0]->range_;</div> +<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  }</div> +<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keyword">self</span>->root_ = <span class="keyword">self</span>->merge(tmp, self->root_);</div> +<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keywordflow">return</span> ret;</div> +<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  }</div> +<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> </div> +<div class="line"><a name="l00988"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8"> 988</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>() {</div> +<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#a514b6eac0a39ac0d365a5ee72eea78e8" title="清空">clear</a>(root_);</div> +<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  root_ = NULL;</div> +<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  }</div> +<div class="line"><a name="l00992"></a><span class="lineno"> 992</span> </div> +<div class="line"><a name="l00999"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a5e80acef8cd1a6732f5cfec65ab69d54"> 999</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a5e80acef8cd1a6732f5cfec65ab69d54" title="插入一組(Key —> Value)">insert</a>(Key <span class="keyword">const</span>& key, Value <span class="keyword">const</span>& value) {</div> +<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">if</span> (root_ == NULL) {</div> +<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  root_ = <span class="keyword">new</span> Node(key, value);</div> +<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div> +<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  Node* parent = (Node*)findKey(root_, key);</div> +<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordflow">if</span> (!(parent->key_ < key) && !(key < parent->key_)) {</div> +<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  splay(parent);</div> +<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  }</div> +<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  Node* new_node = <span class="keyword">new</span> Node(key, value);</div> +<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  connect(parent, (parent->key_ < key ? 1 : 0), new_node);</div> +<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  parent->syncUp();</div> +<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  splay(new_node);</div> +<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  }</div> +<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  }</div> +<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span> </div> +<div class="line"><a name="l01023"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#ae3cffdbb135d3f2518092c2e4b993e1f"> 1023</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#ae3cffdbb135d3f2518092c2e4b993e1f" title="刪除一組資料">erase</a>(Key <span class="keyword">const</span>& key) {</div> +<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordflow">if</span> (root_ == NULL) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  Node* body = (Node*)findKey(root_, key);</div> +<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">if</span> (body->key_ < key || key < body->key_) {</div> +<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  splay(body);</div> +<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  }</div> +<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  Node* ghost;</div> +<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keywordflow">if</span> (body->child_[1] == NULL) {</div> +<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  ghost = body->child_[0];</div> +<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keywordflow">if</span> (ghost != NULL) ghost->syncDown();</div> +<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div> +<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  ghost = (Node*)findMinMax(body->child_[1], <span class="keyword">true</span>);</div> +<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  connect(ghost, 0, body->child_[0]);</div> +<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">if</span> (ghost != body->child_[1]) {</div> +<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  connect(ghost->parent_, 0, ghost->child_[1]);</div> +<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  connect(ghost, 1, body->child_[1]);</div> +<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">for</span> (Node* a = ghost->parent_; a != ghost; a = a->parent_)</div> +<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  a->syncUp();</div> +<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  }</div> +<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  ghost->syncUp();</div> +<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  }</div> +<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  Node* parent = body->parent_;</div> +<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  connect(parent, parent != NULL && parent->child_[0] == body ? 0 : 1, ghost);</div> +<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keyword">delete</span> body;</div> +<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  splay(ghost != NULL ? ghost : parent);</div> +<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div> +<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> </div> +<div class="line"><a name="l01056"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a4e05023009c1c82a5d464a43d6777843"> 1056</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a4e05023009c1c82a5d464a43d6777843" title="將所有Element的Key同加上 delta ">keyOffset</a>(Key <span class="keyword">const</span>& delta) {</div> +<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">if</span> (root_ != NULL) {</div> +<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  root_->keyOffset(delta);</div> +<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div> +<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  }</div> +<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> </div> +<div class="line"><a name="l01065"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a2974124d833383fc0b3f9fed6f18db2f"> 1065</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a2974124d833383fc0b3f9fed6f18db2f" title="將所有Element的Value同加上 delta ">valueOffset</a>(Value <span class="keyword">const</span>& delta){</div> +<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">if</span> (root_ != NULL) {</div> +<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  root_->valueUpdate(delta, <span class="keyword">false</span>);</div> +<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div> +<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  }</div> +<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> </div> +<div class="line"><a name="l01074"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#abe3366aac14529a4b044b519a53c5bb7"> 1074</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#abe3366aac14529a4b044b519a53c5bb7" title="將所有Element的Value全部設定成value ">valueOverride</a>(Value <span class="keyword">const</span>& value){</div> +<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">if</span>(root_ != NULL){</div> +<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  root_->valueUpdate(value, <span class="keyword">true</span>);</div> +<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  }</div> +<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div> +<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span> </div> +<div class="line"><a name="l01083"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a1594362228633d8b026bb0f8c343384f"> 1083</a></span>  <span class="keywordtype">void</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a1594362228633d8b026bb0f8c343384f" title="將tree2 清空, 再將所有Key > upper_bound 的Element都丟過去">splitOut</a>(Key <span class="keyword">const</span>& upper_bound, <a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>* right) {</div> +<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  right->clear();</div> +<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keywordflow">if</span> (<a class="code" href="classmeow_1_1SplayTree__Range.html#a05057d5df92737104b7431b4203cac11" title="找出第一個(最小的) Element且 k >= 它的 Key, 並且回傳之.">rLowerBound</a>(upper_bound) != <a class="code" href="classmeow_1_1SplayTree__Range.html#ad3aaed040f619a3b14c3f9b598b7fecc" title="回傳一個指向NULL的Element,">end</a>()) {</div> +<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  split(root_, &root_, &(right->root_));</div> +<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  }</div> +<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  right->root_ = root_;</div> +<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  root_ = NULL;</div> +<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  }</div> +<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div> +<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> </div> +<div class="line"><a name="l01100"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a53a6ba929a8500fa74e0991e120d3401"> 1100</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a53a6ba929a8500fa74e0991e120d3401" title="合併">mergeAfter</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>* tree2) {</div> +<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordflow">if</span> (root_ == NULL || tree2->root_ == NULL ||</div> +<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < tree2-><a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()-><a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>) {</div> +<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  root_ = merge(root_, tree2->root_);</div> +<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  tree2->root_ = NULL;</div> +<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</div> +<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  }</div> +<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span> </div> +<div class="line"><a name="l01117"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a42d874bda7b24108d0e861448eadce84"> 1117</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#a42d874bda7b24108d0e861448eadce84" title="合併">merge</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>* tree2) {</div> +<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordflow">if</span> (root_ == NULL || tree2->root_ == NULL ||</div> +<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < tree2-><a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()-><a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>) {</div> +<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  root_ = merge(root_, tree2->root_);</div> +<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  }</div> +<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(tree2-><a class="code" href="classmeow_1_1SplayTree__Range.html#afd72a714bb2b7bce0ceedad1dea9e264" title="回傳Key最大的Element, 如果SplayTree為空, 則回傳 this->end() ">last</a>()->first < <a class="code" href="classmeow_1_1SplayTree__Range.html#a74207c8c8023d62111171cd64abfbe77" title="回傳Key最小的Element, 如果SplayTree為空, 則回傳 this->end() ">first</a>()->first) {</div> +<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  root_ = merge(tree2->root_, root_);</div> +<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  }</div> +<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keywordflow">else</span> {</div> +<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> +<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  }</div> +<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  tree2->root_ = NULL;</div> +<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> +<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  }</div> +<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  </div> +<div class="line"><a name="l01138"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#a2a4e8bffccdf807bfe6feb9d838ab44d"> 1138</a></span>  Value& <a class="code" href="classmeow_1_1SplayTree__Range.html#a2a4e8bffccdf807bfe6feb9d838ab44d" title="就像stl::map::operator[]">operator[]</a>(Key <span class="keyword">const</span>& key) {</div> +<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <span class="keywordflow">if</span> (<a class="code" href="classmeow_1_1SplayTree__Range.html#a13c3591050f556251a33c03ce142acb1" title="找出 Key= k 的Elemenet 並回傳. 找不到的話回傳 this->end() ">find</a>(key) == <a class="code" href="classmeow_1_1SplayTree__Range.html#ad3aaed040f619a3b14c3f9b598b7fecc" title="回傳一個指向NULL的Element,">end</a>()) <a class="code" href="classmeow_1_1SplayTree__Range.html#a5e80acef8cd1a6732f5cfec65ab69d54" title="插入一組(Key —> Value)">insert</a>(key, Value());</div> +<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">return</span> root_->value_;</div> +<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  }</div> +<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span> </div> +<div class="line"><a name="l01144"></a><span class="lineno"><a class="code" href="classmeow_1_1SplayTree__Range.html#af93643b667895835f97e32e30959ca9e"> 1144</a></span>  <a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a>& <a class="code" href="classmeow_1_1SplayTree__Range.html#af93643b667895835f97e32e30959ca9e" title="same as copyFrom(tree2) ">operator=</a>(<a class="code" href="classmeow_1_1SplayTree__Range.html" title="基本上跟SplayTree一樣, 不過這邊結合線段樹, 多了區間操作 (線段樹相關operator定義請見 SegmentTree )">SplayTree_Range</a> <span class="keyword">const</span>& tree2){</div> +<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">return</span> <a class="code" href="classmeow_1_1SplayTree__Range.html#acb88cb76b50884221cbb58d2adcb4329" title="複製資料">copyFrom</a>(tree2);</div> +<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  }</div> +<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span> };</div> +<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span> </div> +<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span> }</div> +<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> </div> +<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span> <span class="preprocessor">#endif // dsa_SplayTree_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="SplayTree_8h.html">SplayTree.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> |