diff options
Diffstat (limited to 'libraries/irrlicht-1.8.1/doc/html/irr_map_8h_source.html')
-rw-r--r-- | libraries/irrlicht-1.8.1/doc/html/irr_map_8h_source.html | 1188 |
1 files changed, 1188 insertions, 0 deletions
diff --git a/libraries/irrlicht-1.8.1/doc/html/irr_map_8h_source.html b/libraries/irrlicht-1.8.1/doc/html/irr_map_8h_source.html new file mode 100644 index 0000000..bf083f2 --- /dev/null +++ b/libraries/irrlicht-1.8.1/doc/html/irr_map_8h_source.html | |||
@@ -0,0 +1,1188 @@ | |||
1 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> | ||
2 | <html xmlns="http://www.w3.org/1999/xhtml"> | ||
3 | <head> | ||
4 | <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> | ||
5 | <title>Irrlicht 3D Engine: irrMap.h Source File</title> | ||
6 | |||
7 | <link href="tabs.css" rel="stylesheet" type="text/css"/> | ||
8 | <link href="doxygen.css" rel="stylesheet" type="text/css" /> | ||
9 | <link href="navtree.css" rel="stylesheet" type="text/css"/> | ||
10 | <script type="text/javascript" src="jquery.js"></script> | ||
11 | <script type="text/javascript" src="resize.js"></script> | ||
12 | <script type="text/javascript" src="navtree.js"></script> | ||
13 | <script type="text/javascript"> | ||
14 | $(document).ready(initResizable); | ||
15 | </script> | ||
16 | <link href="search/search.css" rel="stylesheet" type="text/css"/> | ||
17 | <script type="text/javascript" src="search/search.js"></script> | ||
18 | <script type="text/javascript"> | ||
19 | $(document).ready(function() { searchBox.OnSelectItem(0); }); | ||
20 | </script> | ||
21 | |||
22 | </head> | ||
23 | <body> | ||
24 | <div id="top"><!-- do not remove this div! --> | ||
25 | |||
26 | |||
27 | <div id="titlearea"> | ||
28 | <table cellspacing="0" cellpadding="0"> | ||
29 | <tbody> | ||
30 | <tr style="height: 56px;"> | ||
31 | |||
32 | <td id="projectlogo"><img alt="Logo" src="irrlichtlogo.png"/></td> | ||
33 | |||
34 | |||
35 | <td style="padding-left: 0.5em;"> | ||
36 | <div id="projectname">Irrlicht 3D Engine | ||
37 | |||
38 | </div> | ||
39 | |||
40 | </td> | ||
41 | |||
42 | |||
43 | |||
44 | |||
45 | <td> <div id="MSearchBox" class="MSearchBoxInactive"> | ||
46 | <span class="left"> | ||
47 | <img id="MSearchSelect" src="search/mag_sel.png" | ||
48 | onmouseover="return searchBox.OnSearchSelectShow()" | ||
49 | onmouseout="return searchBox.OnSearchSelectHide()" | ||
50 | alt=""/> | ||
51 | <input type="text" id="MSearchField" value="Search" accesskey="S" | ||
52 | onfocus="searchBox.OnSearchFieldFocus(true)" | ||
53 | onblur="searchBox.OnSearchFieldFocus(false)" | ||
54 | onkeyup="searchBox.OnSearchFieldChange(event)"/> | ||
55 | </span><span class="right"> | ||
56 | <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> | ||
57 | </span> | ||
58 | </div> | ||
59 | </td> | ||
60 | |||
61 | |||
62 | </tr> | ||
63 | </tbody> | ||
64 | </table> | ||
65 | </div> | ||
66 | |||
67 | <!-- Generated by Doxygen 1.7.5.1 --> | ||
68 | <script type="text/javascript"> | ||
69 | var searchBox = new SearchBox("searchBox", "search",false,'Search'); | ||
70 | </script> | ||
71 | <script type="text/javascript" src="dynsections.js"></script> | ||
72 | </div> | ||
73 | <div id="side-nav" class="ui-resizable side-nav-resizable"> | ||
74 | <div id="nav-tree"> | ||
75 | <div id="nav-tree-contents"> | ||
76 | </div> | ||
77 | </div> | ||
78 | <div id="splitbar" style="-moz-user-select:none;" | ||
79 | class="ui-resizable-handle"> | ||
80 | </div> | ||
81 | </div> | ||
82 | <script type="text/javascript"> | ||
83 | initNavTree('irr_map_8h.html',''); | ||
84 | </script> | ||
85 | <div id="doc-content"> | ||
86 | <div class="header"> | ||
87 | <div class="headertitle"> | ||
88 | <div class="title">irrMap.h</div> </div> | ||
89 | </div> | ||
90 | <div class="contents"> | ||
91 | <a href="irr_map_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Copyright (C) 2006-2012 by Kat'Oun</span> | ||
92 | <a name="l00002"></a>00002 <span class="comment">// This file is part of the "Irrlicht Engine".</span> | ||
93 | <a name="l00003"></a>00003 <span class="comment">// For conditions of distribution and use, see copyright notice in irrlicht.h</span> | ||
94 | <a name="l00004"></a>00004 | ||
95 | <a name="l00005"></a>00005 <span class="preprocessor">#ifndef __IRR_MAP_H_INCLUDED__</span> | ||
96 | <a name="l00006"></a>00006 <span class="preprocessor"></span><span class="preprocessor">#define __IRR_MAP_H_INCLUDED__</span> | ||
97 | <a name="l00007"></a>00007 <span class="preprocessor"></span> | ||
98 | <a name="l00008"></a>00008 <span class="preprocessor">#include "<a class="code" href="irr_types_8h.html">irrTypes.h</a>"</span> | ||
99 | <a name="l00009"></a>00009 <span class="preprocessor">#include "<a class="code" href="irr_math_8h.html">irrMath.h</a>"</span> | ||
100 | <a name="l00010"></a>00010 | ||
101 | <a name="l00011"></a>00011 <span class="keyword">namespace </span>irr | ||
102 | <a name="l00012"></a>00012 { | ||
103 | <a name="l00013"></a>00013 <span class="keyword">namespace </span>core | ||
104 | <a name="l00014"></a>00014 { | ||
105 | <a name="l00015"></a>00015 | ||
106 | <a name="l00017"></a>00017 <span class="keyword">template</span> <<span class="keyword">class</span> KeyType, <span class="keyword">class</span> ValueType> | ||
107 | <a name="l00018"></a><a class="code" href="classirr_1_1core_1_1map.html">00018</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a> | ||
108 | <a name="l00019"></a>00019 { | ||
109 | <a name="l00021"></a>00021 <span class="keyword">template</span> <<span class="keyword">class</span> KeyTypeRB, <span class="keyword">class</span> ValueTypeRB> | ||
110 | <a name="l00022"></a>00022 <span class="keyword">class </span>RBTree | ||
111 | <a name="l00023"></a>00023 { | ||
112 | <a name="l00024"></a>00024 <span class="keyword">public</span>: | ||
113 | <a name="l00025"></a>00025 | ||
114 | <a name="l00026"></a>00026 RBTree(<span class="keyword">const</span> KeyTypeRB& k, <span class="keyword">const</span> ValueTypeRB& v) | ||
115 | <a name="l00027"></a>00027 : LeftChild(0), RightChild(0), Parent(0), Key(k), | ||
116 | <a name="l00028"></a>00028 Value(v), IsRed(<span class="keyword">true</span>) {} | ||
117 | <a name="l00029"></a>00029 | ||
118 | <a name="l00030"></a>00030 <span class="keywordtype">void</span> setLeftChild(RBTree* p) | ||
119 | <a name="l00031"></a>00031 { | ||
120 | <a name="l00032"></a>00032 LeftChild=p; | ||
121 | <a name="l00033"></a>00033 <span class="keywordflow">if</span> (p) | ||
122 | <a name="l00034"></a>00034 p->setParent(<span class="keyword">this</span>); | ||
123 | <a name="l00035"></a>00035 } | ||
124 | <a name="l00036"></a>00036 | ||
125 | <a name="l00037"></a>00037 <span class="keywordtype">void</span> setRightChild(RBTree* p) | ||
126 | <a name="l00038"></a>00038 { | ||
127 | <a name="l00039"></a>00039 RightChild=p; | ||
128 | <a name="l00040"></a>00040 <span class="keywordflow">if</span> (p) | ||
129 | <a name="l00041"></a>00041 p->setParent(<span class="keyword">this</span>); | ||
130 | <a name="l00042"></a>00042 } | ||
131 | <a name="l00043"></a>00043 | ||
132 | <a name="l00044"></a>00044 <span class="keywordtype">void</span> setParent(RBTree* p) { Parent=p; } | ||
133 | <a name="l00045"></a>00045 | ||
134 | <a name="l00046"></a>00046 <span class="keywordtype">void</span> setValue(<span class="keyword">const</span> ValueTypeRB& v) { Value = v; } | ||
135 | <a name="l00047"></a>00047 | ||
136 | <a name="l00048"></a>00048 <span class="keywordtype">void</span> setRed() { IsRed = <span class="keyword">true</span>; } | ||
137 | <a name="l00049"></a>00049 <span class="keywordtype">void</span> setBlack() { IsRed = <span class="keyword">false</span>; } | ||
138 | <a name="l00050"></a>00050 | ||
139 | <a name="l00051"></a>00051 RBTree* getLeftChild()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> LeftChild; } | ||
140 | <a name="l00052"></a>00052 RBTree* getRightChild()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> RightChild; } | ||
141 | <a name="l00053"></a>00053 RBTree* getParent()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> Parent; } | ||
142 | <a name="l00054"></a>00054 | ||
143 | <a name="l00055"></a>00055 <span class="keyword">const</span> ValueTypeRB& getValue()<span class="keyword"> const</span> | ||
144 | <a name="l00056"></a>00056 <span class="keyword"> </span>{ | ||
145 | <a name="l00057"></a>00057 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
146 | <a name="l00058"></a>00058 <span class="keywordflow">return</span> Value; | ||
147 | <a name="l00059"></a>00059 } | ||
148 | <a name="l00060"></a>00060 | ||
149 | <a name="l00061"></a>00061 ValueTypeRB& getValue() | ||
150 | <a name="l00062"></a>00062 { | ||
151 | <a name="l00063"></a>00063 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
152 | <a name="l00064"></a>00064 <span class="keywordflow">return</span> Value; | ||
153 | <a name="l00065"></a>00065 } | ||
154 | <a name="l00066"></a>00066 | ||
155 | <a name="l00067"></a>00067 <span class="keyword">const</span> KeyTypeRB& getKey()<span class="keyword"> const</span> | ||
156 | <a name="l00068"></a>00068 <span class="keyword"> </span>{ | ||
157 | <a name="l00069"></a>00069 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
158 | <a name="l00070"></a>00070 <span class="keywordflow">return</span> Key; | ||
159 | <a name="l00071"></a>00071 } | ||
160 | <a name="l00072"></a>00072 | ||
161 | <a name="l00073"></a>00073 <span class="keywordtype">bool</span> isRoot()<span class="keyword"> const</span> | ||
162 | <a name="l00074"></a>00074 <span class="keyword"> </span>{ | ||
163 | <a name="l00075"></a>00075 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
164 | <a name="l00076"></a>00076 <span class="keywordflow">return</span> Parent==0; | ||
165 | <a name="l00077"></a>00077 } | ||
166 | <a name="l00078"></a>00078 | ||
167 | <a name="l00079"></a>00079 <span class="keywordtype">bool</span> isLeftChild()<span class="keyword"> const</span> | ||
168 | <a name="l00080"></a>00080 <span class="keyword"> </span>{ | ||
169 | <a name="l00081"></a>00081 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
170 | <a name="l00082"></a>00082 <span class="keywordflow">return</span> (Parent != 0) && (Parent->getLeftChild()==<span class="keyword">this</span>); | ||
171 | <a name="l00083"></a>00083 } | ||
172 | <a name="l00084"></a>00084 | ||
173 | <a name="l00085"></a>00085 <span class="keywordtype">bool</span> isRightChild()<span class="keyword"> const</span> | ||
174 | <a name="l00086"></a>00086 <span class="keyword"> </span>{ | ||
175 | <a name="l00087"></a>00087 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
176 | <a name="l00088"></a>00088 <span class="keywordflow">return</span> (Parent!=0) && (Parent->getRightChild()==<span class="keyword">this</span>); | ||
177 | <a name="l00089"></a>00089 } | ||
178 | <a name="l00090"></a>00090 | ||
179 | <a name="l00091"></a>00091 <span class="keywordtype">bool</span> isLeaf()<span class="keyword"> const</span> | ||
180 | <a name="l00092"></a>00092 <span class="keyword"> </span>{ | ||
181 | <a name="l00093"></a>00093 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
182 | <a name="l00094"></a>00094 <span class="keywordflow">return</span> (LeftChild==0) && (RightChild==0); | ||
183 | <a name="l00095"></a>00095 } | ||
184 | <a name="l00096"></a>00096 | ||
185 | <a name="l00097"></a>00097 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> getLevel()<span class="keyword"> const</span> | ||
186 | <a name="l00098"></a>00098 <span class="keyword"> </span>{ | ||
187 | <a name="l00099"></a>00099 <span class="keywordflow">if</span> (isRoot()) | ||
188 | <a name="l00100"></a>00100 <span class="keywordflow">return</span> 1; | ||
189 | <a name="l00101"></a>00101 <span class="keywordflow">else</span> | ||
190 | <a name="l00102"></a>00102 <span class="keywordflow">return</span> getParent()->getLevel() + 1; | ||
191 | <a name="l00103"></a>00103 } | ||
192 | <a name="l00104"></a>00104 | ||
193 | <a name="l00105"></a>00105 | ||
194 | <a name="l00106"></a>00106 <span class="keywordtype">bool</span> isRed()<span class="keyword"> const</span> | ||
195 | <a name="l00107"></a>00107 <span class="keyword"> </span>{ | ||
196 | <a name="l00108"></a>00108 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
197 | <a name="l00109"></a>00109 <span class="keywordflow">return</span> IsRed; | ||
198 | <a name="l00110"></a>00110 } | ||
199 | <a name="l00111"></a>00111 | ||
200 | <a name="l00112"></a>00112 <span class="keywordtype">bool</span> isBlack()<span class="keyword"> const</span> | ||
201 | <a name="l00113"></a>00113 <span class="keyword"> </span>{ | ||
202 | <a name="l00114"></a>00114 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
203 | <a name="l00115"></a>00115 <span class="keywordflow">return</span> !IsRed; | ||
204 | <a name="l00116"></a>00116 } | ||
205 | <a name="l00117"></a>00117 | ||
206 | <a name="l00118"></a>00118 <span class="keyword">private</span>: | ||
207 | <a name="l00119"></a>00119 RBTree(); | ||
208 | <a name="l00120"></a>00120 | ||
209 | <a name="l00121"></a>00121 RBTree* LeftChild; | ||
210 | <a name="l00122"></a>00122 RBTree* RightChild; | ||
211 | <a name="l00123"></a>00123 | ||
212 | <a name="l00124"></a>00124 RBTree* Parent; | ||
213 | <a name="l00125"></a>00125 | ||
214 | <a name="l00126"></a>00126 KeyTypeRB Key; | ||
215 | <a name="l00127"></a>00127 ValueTypeRB Value; | ||
216 | <a name="l00128"></a>00128 | ||
217 | <a name="l00129"></a>00129 <span class="keywordtype">bool</span> IsRed; | ||
218 | <a name="l00130"></a>00130 }; <span class="comment">// RBTree</span> | ||
219 | <a name="l00131"></a>00131 | ||
220 | <a name="l00132"></a>00132 <span class="keyword">public</span>: | ||
221 | <a name="l00133"></a>00133 | ||
222 | <a name="l00134"></a><a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">00134</a> <span class="keyword">typedef</span> RBTree<KeyType,ValueType> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>; | ||
223 | <a name="l00135"></a>00135 <span class="comment">// We need the forwad declaration for the friend declaration</span> | ||
224 | <a name="l00136"></a>00136 <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a>; | ||
225 | <a name="l00137"></a>00137 | ||
226 | <a name="l00139"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html">00139</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a> | ||
227 | <a name="l00140"></a>00140 { | ||
228 | <a name="l00141"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a5485970bb9da6b5d782fa28638b5658f">00141</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a>; | ||
229 | <a name="l00142"></a>00142 <span class="keyword">public</span>: | ||
230 | <a name="l00143"></a>00143 | ||
231 | <a name="l00144"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a80cc0822177952c5913c846cb62242cf">00144</a> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a80cc0822177952c5913c846cb62242cf">Iterator</a>() : Root(0), Cur(0) {} | ||
232 | <a name="l00145"></a>00145 | ||
233 | <a name="l00146"></a>00146 <span class="comment">// Constructor(Node*)</span> | ||
234 | <a name="l00147"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a5d05d4a846f3103d099e3e5308b63ff8">00147</a> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a80cc0822177952c5913c846cb62242cf">Iterator</a>(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* root) : Root(root) | ||
235 | <a name="l00148"></a>00148 { | ||
236 | <a name="l00149"></a>00149 <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad097d52b6e77514491e7dcb0f81fc898">reset</a>(); | ||
237 | <a name="l00150"></a>00150 } | ||
238 | <a name="l00151"></a>00151 | ||
239 | <a name="l00152"></a>00152 <span class="comment">// Copy constructor</span> | ||
240 | <a name="l00153"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a65505a0639a7d60523012915421ecbca">00153</a> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a65505a0639a7d60523012915421ecbca">Iterator</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a>& src) : Root(src.Root), Cur(src.Cur) {} | ||
241 | <a name="l00154"></a>00154 | ||
242 | <a name="l00155"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad097d52b6e77514491e7dcb0f81fc898">00155</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad097d52b6e77514491e7dcb0f81fc898">reset</a>(<span class="keywordtype">bool</span> atLowest=<span class="keyword">true</span>) | ||
243 | <a name="l00156"></a>00156 { | ||
244 | <a name="l00157"></a>00157 <span class="keywordflow">if</span> (atLowest) | ||
245 | <a name="l00158"></a>00158 Cur = getMin(Root); | ||
246 | <a name="l00159"></a>00159 <span class="keywordflow">else</span> | ||
247 | <a name="l00160"></a>00160 Cur = getMax(Root); | ||
248 | <a name="l00161"></a>00161 } | ||
249 | <a name="l00162"></a>00162 | ||
250 | <a name="l00163"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad3e095f3c74edbbba131d966cd2bd0bb">00163</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad3e095f3c74edbbba131d966cd2bd0bb">atEnd</a>()<span class="keyword"> const</span> | ||
251 | <a name="l00164"></a>00164 <span class="keyword"> </span>{ | ||
252 | <a name="l00165"></a>00165 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
253 | <a name="l00166"></a>00166 <span class="keywordflow">return</span> Cur==0; | ||
254 | <a name="l00167"></a>00167 } | ||
255 | <a name="l00168"></a>00168 | ||
256 | <a name="l00169"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a0bcf0d1df889b46f2876b20c4c356a8a">00169</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a0bcf0d1df889b46f2876b20c4c356a8a">getNode</a>()<span class="keyword"> const</span> | ||
257 | <a name="l00170"></a>00170 <span class="keyword"> </span>{ | ||
258 | <a name="l00171"></a>00171 <span class="keywordflow">return</span> Cur; | ||
259 | <a name="l00172"></a>00172 } | ||
260 | <a name="l00173"></a>00173 | ||
261 | <a name="l00174"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a5d0a93a6bf5996207e31964e1d3fba18">00174</a> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a5d0a93a6bf5996207e31964e1d3fba18">operator=</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a>& src) | ||
262 | <a name="l00175"></a>00175 { | ||
263 | <a name="l00176"></a>00176 Root = src.Root; | ||
264 | <a name="l00177"></a>00177 Cur = src.Cur; | ||
265 | <a name="l00178"></a>00178 <span class="keywordflow">return</span> (*<span class="keyword">this</span>); | ||
266 | <a name="l00179"></a>00179 } | ||
267 | <a name="l00180"></a>00180 | ||
268 | <a name="l00181"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#aab068627540dbbf9ed6503e6a27acf2d">00181</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#aab068627540dbbf9ed6503e6a27acf2d">operator++</a>(<span class="keywordtype">int</span>) | ||
269 | <a name="l00182"></a>00182 { | ||
270 | <a name="l00183"></a>00183 inc(); | ||
271 | <a name="l00184"></a>00184 } | ||
272 | <a name="l00185"></a>00185 | ||
273 | <a name="l00186"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a60f99a10a53cfdc741de06febe38744a">00186</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a60f99a10a53cfdc741de06febe38744a">operator--</a>(<span class="keywordtype">int</span>) | ||
274 | <a name="l00187"></a>00187 { | ||
275 | <a name="l00188"></a>00188 dec(); | ||
276 | <a name="l00189"></a>00189 } | ||
277 | <a name="l00190"></a>00190 | ||
278 | <a name="l00191"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a3c3028981cb2b4d4826b535f1c965021">00191</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a3c3028981cb2b4d4826b535f1c965021">operator-></a>() | ||
279 | <a name="l00192"></a>00192 { | ||
280 | <a name="l00193"></a>00193 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a0bcf0d1df889b46f2876b20c4c356a8a">getNode</a>(); | ||
281 | <a name="l00194"></a>00194 } | ||
282 | <a name="l00195"></a>00195 | ||
283 | <a name="l00196"></a><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a6f2de16c879c563046eb228ff50c4662">00196</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#a6f2de16c879c563046eb228ff50c4662">operator*</a>() | ||
284 | <a name="l00197"></a>00197 { | ||
285 | <a name="l00198"></a>00198 <a class="code" href="irr_types_8h.html#a12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(<a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html#ad3e095f3c74edbbba131d966cd2bd0bb">atEnd</a>()) <span class="comment">// access violation</span> | ||
286 | <a name="l00199"></a>00199 | ||
287 | <a name="l00200"></a>00200 <span class="keywordflow">return</span> *Cur; | ||
288 | <a name="l00201"></a>00201 } | ||
289 | <a name="l00202"></a>00202 | ||
290 | <a name="l00203"></a>00203 <span class="keyword">private</span>: | ||
291 | <a name="l00204"></a>00204 | ||
292 | <a name="l00205"></a>00205 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* getMin(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* n)<span class="keyword"> const</span> | ||
293 | <a name="l00206"></a>00206 <span class="keyword"> </span>{ | ||
294 | <a name="l00207"></a>00207 <span class="keywordflow">while</span>(n && n->getLeftChild()) | ||
295 | <a name="l00208"></a>00208 n = n->getLeftChild(); | ||
296 | <a name="l00209"></a>00209 <span class="keywordflow">return</span> n; | ||
297 | <a name="l00210"></a>00210 } | ||
298 | <a name="l00211"></a>00211 | ||
299 | <a name="l00212"></a>00212 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* getMax(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* n)<span class="keyword"> const</span> | ||
300 | <a name="l00213"></a>00213 <span class="keyword"> </span>{ | ||
301 | <a name="l00214"></a>00214 <span class="keywordflow">while</span>(n && n->getRightChild()) | ||
302 | <a name="l00215"></a>00215 n = n->getRightChild(); | ||
303 | <a name="l00216"></a>00216 <span class="keywordflow">return</span> n; | ||
304 | <a name="l00217"></a>00217 } | ||
305 | <a name="l00218"></a>00218 | ||
306 | <a name="l00219"></a>00219 <span class="keywordtype">void</span> inc() | ||
307 | <a name="l00220"></a>00220 { | ||
308 | <a name="l00221"></a>00221 <span class="comment">// Already at end?</span> | ||
309 | <a name="l00222"></a>00222 <span class="keywordflow">if</span> (Cur==0) | ||
310 | <a name="l00223"></a>00223 <span class="keywordflow">return</span>; | ||
311 | <a name="l00224"></a>00224 | ||
312 | <a name="l00225"></a>00225 <span class="keywordflow">if</span> (Cur->getRightChild()) | ||
313 | <a name="l00226"></a>00226 { | ||
314 | <a name="l00227"></a>00227 <span class="comment">// If current node has a right child, the next higher node is the</span> | ||
315 | <a name="l00228"></a>00228 <span class="comment">// node with lowest key beneath the right child.</span> | ||
316 | <a name="l00229"></a>00229 Cur = getMin(Cur->getRightChild()); | ||
317 | <a name="l00230"></a>00230 } | ||
318 | <a name="l00231"></a>00231 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Cur->isLeftChild()) | ||
319 | <a name="l00232"></a>00232 { | ||
320 | <a name="l00233"></a>00233 <span class="comment">// No right child? Well if current node is a left child then</span> | ||
321 | <a name="l00234"></a>00234 <span class="comment">// the next higher node is the parent</span> | ||
322 | <a name="l00235"></a>00235 Cur = Cur->getParent(); | ||
323 | <a name="l00236"></a>00236 } | ||
324 | <a name="l00237"></a>00237 <span class="keywordflow">else</span> | ||
325 | <a name="l00238"></a>00238 { | ||
326 | <a name="l00239"></a>00239 <span class="comment">// Current node neither is left child nor has a right child.</span> | ||
327 | <a name="l00240"></a>00240 <span class="comment">// Ie it is either right child or root</span> | ||
328 | <a name="l00241"></a>00241 <span class="comment">// The next higher node is the parent of the first non-right</span> | ||
329 | <a name="l00242"></a>00242 <span class="comment">// child (ie either a left child or the root) up in the</span> | ||
330 | <a name="l00243"></a>00243 <span class="comment">// hierarchy. Root's parent is 0.</span> | ||
331 | <a name="l00244"></a>00244 <span class="keywordflow">while</span>(Cur->isRightChild()) | ||
332 | <a name="l00245"></a>00245 Cur = Cur->getParent(); | ||
333 | <a name="l00246"></a>00246 Cur = Cur->getParent(); | ||
334 | <a name="l00247"></a>00247 } | ||
335 | <a name="l00248"></a>00248 } | ||
336 | <a name="l00249"></a>00249 | ||
337 | <a name="l00250"></a>00250 <span class="keywordtype">void</span> dec() | ||
338 | <a name="l00251"></a>00251 { | ||
339 | <a name="l00252"></a>00252 <span class="comment">// Already at end?</span> | ||
340 | <a name="l00253"></a>00253 <span class="keywordflow">if</span> (Cur==0) | ||
341 | <a name="l00254"></a>00254 <span class="keywordflow">return</span>; | ||
342 | <a name="l00255"></a>00255 | ||
343 | <a name="l00256"></a>00256 <span class="keywordflow">if</span> (Cur->getLeftChild()) | ||
344 | <a name="l00257"></a>00257 { | ||
345 | <a name="l00258"></a>00258 <span class="comment">// If current node has a left child, the next lower node is the</span> | ||
346 | <a name="l00259"></a>00259 <span class="comment">// node with highest key beneath the left child.</span> | ||
347 | <a name="l00260"></a>00260 Cur = getMax(Cur->getLeftChild()); | ||
348 | <a name="l00261"></a>00261 } | ||
349 | <a name="l00262"></a>00262 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Cur->isRightChild()) | ||
350 | <a name="l00263"></a>00263 { | ||
351 | <a name="l00264"></a>00264 <span class="comment">// No left child? Well if current node is a right child then</span> | ||
352 | <a name="l00265"></a>00265 <span class="comment">// the next lower node is the parent</span> | ||
353 | <a name="l00266"></a>00266 Cur = Cur->getParent(); | ||
354 | <a name="l00267"></a>00267 } | ||
355 | <a name="l00268"></a>00268 <span class="keywordflow">else</span> | ||
356 | <a name="l00269"></a>00269 { | ||
357 | <a name="l00270"></a>00270 <span class="comment">// Current node neither is right child nor has a left child.</span> | ||
358 | <a name="l00271"></a>00271 <span class="comment">// Ie it is either left child or root</span> | ||
359 | <a name="l00272"></a>00272 <span class="comment">// The next higher node is the parent of the first non-left</span> | ||
360 | <a name="l00273"></a>00273 <span class="comment">// child (ie either a right child or the root) up in the</span> | ||
361 | <a name="l00274"></a>00274 <span class="comment">// hierarchy. Root's parent is 0.</span> | ||
362 | <a name="l00275"></a>00275 | ||
363 | <a name="l00276"></a>00276 <span class="keywordflow">while</span>(Cur->isLeftChild()) | ||
364 | <a name="l00277"></a>00277 Cur = Cur->getParent(); | ||
365 | <a name="l00278"></a>00278 Cur = Cur->getParent(); | ||
366 | <a name="l00279"></a>00279 } | ||
367 | <a name="l00280"></a>00280 } | ||
368 | <a name="l00281"></a>00281 | ||
369 | <a name="l00282"></a>00282 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Root; | ||
370 | <a name="l00283"></a>00283 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Cur; | ||
371 | <a name="l00284"></a>00284 }; <span class="comment">// Iterator</span> | ||
372 | <a name="l00285"></a>00285 | ||
373 | <a name="l00287"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html">00287</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a> | ||
374 | <a name="l00288"></a>00288 { | ||
375 | <a name="l00289"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a9830fc407400559db7e7783cc10a9394">00289</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a>; | ||
376 | <a name="l00290"></a>00290 <span class="keyword">public</span>: | ||
377 | <a name="l00291"></a>00291 | ||
378 | <a name="l00292"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#acd4de616ba32f863478e43ac293b02dd">00292</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#acd4de616ba32f863478e43ac293b02dd">ConstIterator</a>() : Root(0), Cur(0) {} | ||
379 | <a name="l00293"></a>00293 | ||
380 | <a name="l00294"></a>00294 <span class="comment">// Constructor(Node*)</span> | ||
381 | <a name="l00295"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a7752531a2edbaf49b9f6ab369e6f7b6d">00295</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#acd4de616ba32f863478e43ac293b02dd">ConstIterator</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* root) : Root(root) | ||
382 | <a name="l00296"></a>00296 { | ||
383 | <a name="l00297"></a>00297 <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a73585cabdf369eff484831e7ec9e36cf">reset</a>(); | ||
384 | <a name="l00298"></a>00298 } | ||
385 | <a name="l00299"></a>00299 | ||
386 | <a name="l00300"></a>00300 <span class="comment">// Copy constructor</span> | ||
387 | <a name="l00301"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a64feda787ba6b41213c46b568835feab">00301</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a64feda787ba6b41213c46b568835feab">ConstIterator</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a>& src) : Root(src.Root), Cur(src.Cur) {} | ||
388 | <a name="l00302"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#abd8f733814d984b7b48aa50b777d1a53">00302</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#abd8f733814d984b7b48aa50b777d1a53">ConstIterator</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a>& src) : Root(src.Root), Cur(src.Cur) {} | ||
389 | <a name="l00303"></a>00303 | ||
390 | <a name="l00304"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a73585cabdf369eff484831e7ec9e36cf">00304</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a73585cabdf369eff484831e7ec9e36cf">reset</a>(<span class="keywordtype">bool</span> atLowest=<span class="keyword">true</span>) | ||
391 | <a name="l00305"></a>00305 { | ||
392 | <a name="l00306"></a>00306 <span class="keywordflow">if</span> (atLowest) | ||
393 | <a name="l00307"></a>00307 Cur = getMin(Root); | ||
394 | <a name="l00308"></a>00308 <span class="keywordflow">else</span> | ||
395 | <a name="l00309"></a>00309 Cur = getMax(Root); | ||
396 | <a name="l00310"></a>00310 } | ||
397 | <a name="l00311"></a>00311 | ||
398 | <a name="l00312"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#aa04731741ac3c5d43ab1bf3bf2f06ab8">00312</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#aa04731741ac3c5d43ab1bf3bf2f06ab8">atEnd</a>()<span class="keyword"> const</span> | ||
399 | <a name="l00313"></a>00313 <span class="keyword"> </span>{ | ||
400 | <a name="l00314"></a>00314 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
401 | <a name="l00315"></a>00315 <span class="keywordflow">return</span> Cur==0; | ||
402 | <a name="l00316"></a>00316 } | ||
403 | <a name="l00317"></a>00317 | ||
404 | <a name="l00318"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a0191331e73b7092aad9ae09756a5d73e">00318</a> <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a0191331e73b7092aad9ae09756a5d73e">getNode</a>()<span class="keyword"> const</span> | ||
405 | <a name="l00319"></a>00319 <span class="keyword"> </span>{ | ||
406 | <a name="l00320"></a>00320 <span class="keywordflow">return</span> Cur; | ||
407 | <a name="l00321"></a>00321 } | ||
408 | <a name="l00322"></a>00322 | ||
409 | <a name="l00323"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a97b011255d93acd9ebaac5e9c492e907">00323</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a97b011255d93acd9ebaac5e9c492e907">operator=</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a>& src) | ||
410 | <a name="l00324"></a>00324 { | ||
411 | <a name="l00325"></a>00325 Root = src.Root; | ||
412 | <a name="l00326"></a>00326 Cur = src.Cur; | ||
413 | <a name="l00327"></a>00327 <span class="keywordflow">return</span> (*<span class="keyword">this</span>); | ||
414 | <a name="l00328"></a>00328 } | ||
415 | <a name="l00329"></a>00329 | ||
416 | <a name="l00330"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a98d71ff60938b7632f8ca947322d91e6">00330</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a98d71ff60938b7632f8ca947322d91e6">operator++</a>(<span class="keywordtype">int</span>) | ||
417 | <a name="l00331"></a>00331 { | ||
418 | <a name="l00332"></a>00332 inc(); | ||
419 | <a name="l00333"></a>00333 } | ||
420 | <a name="l00334"></a>00334 | ||
421 | <a name="l00335"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a780455ee04a273292a7d13c8f7658898">00335</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a780455ee04a273292a7d13c8f7658898">operator--</a>(<span class="keywordtype">int</span>) | ||
422 | <a name="l00336"></a>00336 { | ||
423 | <a name="l00337"></a>00337 dec(); | ||
424 | <a name="l00338"></a>00338 } | ||
425 | <a name="l00339"></a>00339 | ||
426 | <a name="l00340"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a699be8abf3a2514d1f12bae54cb12d43">00340</a> <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a699be8abf3a2514d1f12bae54cb12d43">operator-></a>() | ||
427 | <a name="l00341"></a>00341 { | ||
428 | <a name="l00342"></a>00342 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a0191331e73b7092aad9ae09756a5d73e">getNode</a>(); | ||
429 | <a name="l00343"></a>00343 } | ||
430 | <a name="l00344"></a>00344 | ||
431 | <a name="l00345"></a><a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a57444336eeed447575db54fcb8027dfe">00345</a> <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#a57444336eeed447575db54fcb8027dfe">operator*</a>() | ||
432 | <a name="l00346"></a>00346 { | ||
433 | <a name="l00347"></a>00347 <a class="code" href="irr_types_8h.html#a12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(<a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html#aa04731741ac3c5d43ab1bf3bf2f06ab8">atEnd</a>()) <span class="comment">// access violation</span> | ||
434 | <a name="l00348"></a>00348 | ||
435 | <a name="l00349"></a>00349 <span class="keywordflow">return</span> *Cur; | ||
436 | <a name="l00350"></a>00350 } | ||
437 | <a name="l00351"></a>00351 | ||
438 | <a name="l00352"></a>00352 <span class="keyword">private</span>: | ||
439 | <a name="l00353"></a>00353 | ||
440 | <a name="l00354"></a>00354 <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* getMin(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* n)<span class="keyword"> const</span> | ||
441 | <a name="l00355"></a>00355 <span class="keyword"> </span>{ | ||
442 | <a name="l00356"></a>00356 <span class="keywordflow">while</span>(n && n->getLeftChild()) | ||
443 | <a name="l00357"></a>00357 n = n->getLeftChild(); | ||
444 | <a name="l00358"></a>00358 <span class="keywordflow">return</span> n; | ||
445 | <a name="l00359"></a>00359 } | ||
446 | <a name="l00360"></a>00360 | ||
447 | <a name="l00361"></a>00361 <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* getMax(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* n)<span class="keyword"> const</span> | ||
448 | <a name="l00362"></a>00362 <span class="keyword"> </span>{ | ||
449 | <a name="l00363"></a>00363 <span class="keywordflow">while</span>(n && n->getRightChild()) | ||
450 | <a name="l00364"></a>00364 n = n->getRightChild(); | ||
451 | <a name="l00365"></a>00365 <span class="keywordflow">return</span> n; | ||
452 | <a name="l00366"></a>00366 } | ||
453 | <a name="l00367"></a>00367 | ||
454 | <a name="l00368"></a>00368 <span class="keywordtype">void</span> inc() | ||
455 | <a name="l00369"></a>00369 { | ||
456 | <a name="l00370"></a>00370 <span class="comment">// Already at end?</span> | ||
457 | <a name="l00371"></a>00371 <span class="keywordflow">if</span> (Cur==0) | ||
458 | <a name="l00372"></a>00372 <span class="keywordflow">return</span>; | ||
459 | <a name="l00373"></a>00373 | ||
460 | <a name="l00374"></a>00374 <span class="keywordflow">if</span> (Cur->getRightChild()) | ||
461 | <a name="l00375"></a>00375 { | ||
462 | <a name="l00376"></a>00376 <span class="comment">// If current node has a right child, the next higher node is the</span> | ||
463 | <a name="l00377"></a>00377 <span class="comment">// node with lowest key beneath the right child.</span> | ||
464 | <a name="l00378"></a>00378 Cur = getMin(Cur->getRightChild()); | ||
465 | <a name="l00379"></a>00379 } | ||
466 | <a name="l00380"></a>00380 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Cur->isLeftChild()) | ||
467 | <a name="l00381"></a>00381 { | ||
468 | <a name="l00382"></a>00382 <span class="comment">// No right child? Well if current node is a left child then</span> | ||
469 | <a name="l00383"></a>00383 <span class="comment">// the next higher node is the parent</span> | ||
470 | <a name="l00384"></a>00384 Cur = Cur->getParent(); | ||
471 | <a name="l00385"></a>00385 } | ||
472 | <a name="l00386"></a>00386 <span class="keywordflow">else</span> | ||
473 | <a name="l00387"></a>00387 { | ||
474 | <a name="l00388"></a>00388 <span class="comment">// Current node neither is left child nor has a right child.</span> | ||
475 | <a name="l00389"></a>00389 <span class="comment">// Ie it is either right child or root</span> | ||
476 | <a name="l00390"></a>00390 <span class="comment">// The next higher node is the parent of the first non-right</span> | ||
477 | <a name="l00391"></a>00391 <span class="comment">// child (ie either a left child or the root) up in the</span> | ||
478 | <a name="l00392"></a>00392 <span class="comment">// hierarchy. Root's parent is 0.</span> | ||
479 | <a name="l00393"></a>00393 <span class="keywordflow">while</span>(Cur->isRightChild()) | ||
480 | <a name="l00394"></a>00394 Cur = Cur->getParent(); | ||
481 | <a name="l00395"></a>00395 Cur = Cur->getParent(); | ||
482 | <a name="l00396"></a>00396 } | ||
483 | <a name="l00397"></a>00397 } | ||
484 | <a name="l00398"></a>00398 | ||
485 | <a name="l00399"></a>00399 <span class="keywordtype">void</span> dec() | ||
486 | <a name="l00400"></a>00400 { | ||
487 | <a name="l00401"></a>00401 <span class="comment">// Already at end?</span> | ||
488 | <a name="l00402"></a>00402 <span class="keywordflow">if</span> (Cur==0) | ||
489 | <a name="l00403"></a>00403 <span class="keywordflow">return</span>; | ||
490 | <a name="l00404"></a>00404 | ||
491 | <a name="l00405"></a>00405 <span class="keywordflow">if</span> (Cur->getLeftChild()) | ||
492 | <a name="l00406"></a>00406 { | ||
493 | <a name="l00407"></a>00407 <span class="comment">// If current node has a left child, the next lower node is the</span> | ||
494 | <a name="l00408"></a>00408 <span class="comment">// node with highest key beneath the left child.</span> | ||
495 | <a name="l00409"></a>00409 Cur = getMax(Cur->getLeftChild()); | ||
496 | <a name="l00410"></a>00410 } | ||
497 | <a name="l00411"></a>00411 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Cur->isRightChild()) | ||
498 | <a name="l00412"></a>00412 { | ||
499 | <a name="l00413"></a>00413 <span class="comment">// No left child? Well if current node is a right child then</span> | ||
500 | <a name="l00414"></a>00414 <span class="comment">// the next lower node is the parent</span> | ||
501 | <a name="l00415"></a>00415 Cur = Cur->getParent(); | ||
502 | <a name="l00416"></a>00416 } | ||
503 | <a name="l00417"></a>00417 <span class="keywordflow">else</span> | ||
504 | <a name="l00418"></a>00418 { | ||
505 | <a name="l00419"></a>00419 <span class="comment">// Current node neither is right child nor has a left child.</span> | ||
506 | <a name="l00420"></a>00420 <span class="comment">// Ie it is either left child or root</span> | ||
507 | <a name="l00421"></a>00421 <span class="comment">// The next higher node is the parent of the first non-left</span> | ||
508 | <a name="l00422"></a>00422 <span class="comment">// child (ie either a right child or the root) up in the</span> | ||
509 | <a name="l00423"></a>00423 <span class="comment">// hierarchy. Root's parent is 0.</span> | ||
510 | <a name="l00424"></a>00424 | ||
511 | <a name="l00425"></a>00425 <span class="keywordflow">while</span>(Cur->isLeftChild()) | ||
512 | <a name="l00426"></a>00426 Cur = Cur->getParent(); | ||
513 | <a name="l00427"></a>00427 Cur = Cur->getParent(); | ||
514 | <a name="l00428"></a>00428 } | ||
515 | <a name="l00429"></a>00429 } | ||
516 | <a name="l00430"></a>00430 | ||
517 | <a name="l00431"></a>00431 <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Root; | ||
518 | <a name="l00432"></a>00432 <span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Cur; | ||
519 | <a name="l00433"></a>00433 }; <span class="comment">// ConstIterator</span> | ||
520 | <a name="l00434"></a>00434 | ||
521 | <a name="l00435"></a>00435 | ||
522 | <a name="l00437"></a>00437 | ||
523 | <a name="l00441"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html">00441</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html" title="Parent First Iterator.">ParentFirstIterator</a> | ||
524 | <a name="l00442"></a>00442 { | ||
525 | <a name="l00443"></a>00443 <span class="keyword">public</span>: | ||
526 | <a name="l00444"></a>00444 | ||
527 | <a name="l00445"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a02c2710f6ec85e4b9f387c9f62f1a8a2">00445</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a02c2710f6ec85e4b9f387c9f62f1a8a2">ParentFirstIterator</a>() : Root(0), Cur(0) {} | ||
528 | <a name="l00446"></a>00446 | ||
529 | <a name="l00447"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a357ac1c340fd19bb14e28a7d168371e1">00447</a> <span class="keyword">explicit</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a02c2710f6ec85e4b9f387c9f62f1a8a2">ParentFirstIterator</a>(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* root) : Root(root), Cur(0) | ||
530 | <a name="l00448"></a>00448 { | ||
531 | <a name="l00449"></a>00449 <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#af31332a1d7256060bcb8dbb82ca6496a">reset</a>(); | ||
532 | <a name="l00450"></a>00450 } | ||
533 | <a name="l00451"></a>00451 | ||
534 | <a name="l00452"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#af31332a1d7256060bcb8dbb82ca6496a">00452</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#af31332a1d7256060bcb8dbb82ca6496a">reset</a>() | ||
535 | <a name="l00453"></a>00453 { | ||
536 | <a name="l00454"></a>00454 Cur = Root; | ||
537 | <a name="l00455"></a>00455 } | ||
538 | <a name="l00456"></a>00456 | ||
539 | <a name="l00457"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#ae3ffab18920aed9315081c324a350818">00457</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#ae3ffab18920aed9315081c324a350818">atEnd</a>()<span class="keyword"> const</span> | ||
540 | <a name="l00458"></a>00458 <span class="keyword"> </span>{ | ||
541 | <a name="l00459"></a>00459 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
542 | <a name="l00460"></a>00460 <span class="keywordflow">return</span> Cur==0; | ||
543 | <a name="l00461"></a>00461 } | ||
544 | <a name="l00462"></a>00462 | ||
545 | <a name="l00463"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51055e1698217a8a718066505a05ecbf">00463</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51055e1698217a8a718066505a05ecbf">getNode</a>() | ||
546 | <a name="l00464"></a>00464 { | ||
547 | <a name="l00465"></a>00465 <span class="keywordflow">return</span> Cur; | ||
548 | <a name="l00466"></a>00466 } | ||
549 | <a name="l00467"></a>00467 | ||
550 | <a name="l00468"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51a80976e2b3df0f1ac950c4b8d59426">00468</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html" title="Parent First Iterator.">ParentFirstIterator</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51a80976e2b3df0f1ac950c4b8d59426">operator=</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html" title="Parent First Iterator.">ParentFirstIterator</a>& src) | ||
551 | <a name="l00469"></a>00469 { | ||
552 | <a name="l00470"></a>00470 Root = src.Root; | ||
553 | <a name="l00471"></a>00471 Cur = src.Cur; | ||
554 | <a name="l00472"></a>00472 <span class="keywordflow">return</span> (*<span class="keyword">this</span>); | ||
555 | <a name="l00473"></a>00473 } | ||
556 | <a name="l00474"></a>00474 | ||
557 | <a name="l00475"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a43bf9ef9131d11a110112c55bf9b2503">00475</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a43bf9ef9131d11a110112c55bf9b2503">operator++</a>(<span class="keywordtype">int</span>) | ||
558 | <a name="l00476"></a>00476 { | ||
559 | <a name="l00477"></a>00477 inc(); | ||
560 | <a name="l00478"></a>00478 } | ||
561 | <a name="l00479"></a>00479 | ||
562 | <a name="l00480"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a18dd8259483e19753969987a979040f6">00480</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a18dd8259483e19753969987a979040f6">operator -> </a>() | ||
563 | <a name="l00481"></a>00481 { | ||
564 | <a name="l00482"></a>00482 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51055e1698217a8a718066505a05ecbf">getNode</a>(); | ||
565 | <a name="l00483"></a>00483 } | ||
566 | <a name="l00484"></a>00484 | ||
567 | <a name="l00485"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#af1aa7b281ef68cf163e286e14a198126">00485</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#af1aa7b281ef68cf163e286e14a198126">operator* </a>() | ||
568 | <a name="l00486"></a>00486 { | ||
569 | <a name="l00487"></a>00487 <a class="code" href="irr_types_8h.html#a12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(<a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#ae3ffab18920aed9315081c324a350818">atEnd</a>()) <span class="comment">// access violation</span> | ||
570 | <a name="l00488"></a>00488 | ||
571 | <a name="l00489"></a>00489 <span class="keywordflow">return</span> *<a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html#a51055e1698217a8a718066505a05ecbf">getNode</a>(); | ||
572 | <a name="l00490"></a>00490 } | ||
573 | <a name="l00491"></a>00491 | ||
574 | <a name="l00492"></a>00492 <span class="keyword">private</span>: | ||
575 | <a name="l00493"></a>00493 | ||
576 | <a name="l00494"></a>00494 <span class="keywordtype">void</span> inc() | ||
577 | <a name="l00495"></a>00495 { | ||
578 | <a name="l00496"></a>00496 <span class="comment">// Already at end?</span> | ||
579 | <a name="l00497"></a>00497 <span class="keywordflow">if</span> (Cur==0) | ||
580 | <a name="l00498"></a>00498 <span class="keywordflow">return</span>; | ||
581 | <a name="l00499"></a>00499 | ||
582 | <a name="l00500"></a>00500 <span class="comment">// First we try down to the left</span> | ||
583 | <a name="l00501"></a>00501 <span class="keywordflow">if</span> (Cur->getLeftChild()) | ||
584 | <a name="l00502"></a>00502 { | ||
585 | <a name="l00503"></a>00503 Cur = Cur->getLeftChild(); | ||
586 | <a name="l00504"></a>00504 } | ||
587 | <a name="l00505"></a>00505 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (Cur->getRightChild()) | ||
588 | <a name="l00506"></a>00506 { | ||
589 | <a name="l00507"></a>00507 <span class="comment">// No left child? The we go down to the right.</span> | ||
590 | <a name="l00508"></a>00508 Cur = Cur->getRightChild(); | ||
591 | <a name="l00509"></a>00509 } | ||
592 | <a name="l00510"></a>00510 <span class="keywordflow">else</span> | ||
593 | <a name="l00511"></a>00511 { | ||
594 | <a name="l00512"></a>00512 <span class="comment">// No children? Move up in the hierarcy until</span> | ||
595 | <a name="l00513"></a>00513 <span class="comment">// we either reach 0 (and are finished) or</span> | ||
596 | <a name="l00514"></a>00514 <span class="comment">// find a right uncle.</span> | ||
597 | <a name="l00515"></a>00515 <span class="keywordflow">while</span> (Cur!=0) | ||
598 | <a name="l00516"></a>00516 { | ||
599 | <a name="l00517"></a>00517 <span class="comment">// But if parent is left child and has a right "uncle" the parent</span> | ||
600 | <a name="l00518"></a>00518 <span class="comment">// has already been processed but the uncle hasn't. Move to</span> | ||
601 | <a name="l00519"></a>00519 <span class="comment">// the uncle.</span> | ||
602 | <a name="l00520"></a>00520 <span class="keywordflow">if</span> (Cur->isLeftChild() && Cur->getParent()->getRightChild()) | ||
603 | <a name="l00521"></a>00521 { | ||
604 | <a name="l00522"></a>00522 Cur = Cur->getParent()->getRightChild(); | ||
605 | <a name="l00523"></a>00523 <span class="keywordflow">return</span>; | ||
606 | <a name="l00524"></a>00524 } | ||
607 | <a name="l00525"></a>00525 Cur = Cur->getParent(); | ||
608 | <a name="l00526"></a>00526 } | ||
609 | <a name="l00527"></a>00527 } | ||
610 | <a name="l00528"></a>00528 } | ||
611 | <a name="l00529"></a>00529 | ||
612 | <a name="l00530"></a>00530 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Root; | ||
613 | <a name="l00531"></a>00531 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Cur; | ||
614 | <a name="l00532"></a>00532 | ||
615 | <a name="l00533"></a>00533 }; <span class="comment">// ParentFirstIterator</span> | ||
616 | <a name="l00534"></a>00534 | ||
617 | <a name="l00535"></a>00535 | ||
618 | <a name="l00537"></a>00537 | ||
619 | <a name="l00541"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html">00541</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a> | ||
620 | <a name="l00542"></a>00542 { | ||
621 | <a name="l00543"></a>00543 <span class="keyword">public</span>: | ||
622 | <a name="l00544"></a>00544 | ||
623 | <a name="l00545"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#ade90e591167cb3b9e54de7bbab42f111">00545</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#ade90e591167cb3b9e54de7bbab42f111">ParentLastIterator</a>() : Root(0), Cur(0) {} | ||
624 | <a name="l00546"></a>00546 | ||
625 | <a name="l00547"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a90bee57feae21230e63cd1db5aef0474">00547</a> <span class="keyword">explicit</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#ade90e591167cb3b9e54de7bbab42f111">ParentLastIterator</a>(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* root) : Root(root), Cur(0) | ||
626 | <a name="l00548"></a>00548 { | ||
627 | <a name="l00549"></a>00549 <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#af044bc095a91a28888e747cea4a88d14">reset</a>(); | ||
628 | <a name="l00550"></a>00550 } | ||
629 | <a name="l00551"></a>00551 | ||
630 | <a name="l00552"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#af044bc095a91a28888e747cea4a88d14">00552</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#af044bc095a91a28888e747cea4a88d14">reset</a>() | ||
631 | <a name="l00553"></a>00553 { | ||
632 | <a name="l00554"></a>00554 Cur = getMin(Root); | ||
633 | <a name="l00555"></a>00555 } | ||
634 | <a name="l00556"></a>00556 | ||
635 | <a name="l00557"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#aac8bdae26b1c4f2f9fd7c335eda6d559">00557</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#aac8bdae26b1c4f2f9fd7c335eda6d559">atEnd</a>()<span class="keyword"> const</span> | ||
636 | <a name="l00558"></a>00558 <span class="keyword"> </span>{ | ||
637 | <a name="l00559"></a>00559 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
638 | <a name="l00560"></a>00560 <span class="keywordflow">return</span> Cur==0; | ||
639 | <a name="l00561"></a>00561 } | ||
640 | <a name="l00562"></a>00562 | ||
641 | <a name="l00563"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a796c59daef23201b69c9ebec455e646a">00563</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a796c59daef23201b69c9ebec455e646a">getNode</a>() | ||
642 | <a name="l00564"></a>00564 { | ||
643 | <a name="l00565"></a>00565 <span class="keywordflow">return</span> Cur; | ||
644 | <a name="l00566"></a>00566 } | ||
645 | <a name="l00567"></a>00567 | ||
646 | <a name="l00568"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a23a2c49c36ad6913ceb2b4398f7d66b7">00568</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a23a2c49c36ad6913ceb2b4398f7d66b7">operator=</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a>& src) | ||
647 | <a name="l00569"></a>00569 { | ||
648 | <a name="l00570"></a>00570 Root = src.Root; | ||
649 | <a name="l00571"></a>00571 Cur = src.Cur; | ||
650 | <a name="l00572"></a>00572 <span class="keywordflow">return</span> (*<span class="keyword">this</span>); | ||
651 | <a name="l00573"></a>00573 } | ||
652 | <a name="l00574"></a>00574 | ||
653 | <a name="l00575"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#ac853023c517549bb3f7eb6d87224948e">00575</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#ac853023c517549bb3f7eb6d87224948e">operator++</a>(<span class="keywordtype">int</span>) | ||
654 | <a name="l00576"></a>00576 { | ||
655 | <a name="l00577"></a>00577 inc(); | ||
656 | <a name="l00578"></a>00578 } | ||
657 | <a name="l00579"></a>00579 | ||
658 | <a name="l00580"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#af9cda22394f295d90d47cb3714e9e1b2">00580</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#af9cda22394f295d90d47cb3714e9e1b2">operator -> </a>() | ||
659 | <a name="l00581"></a>00581 { | ||
660 | <a name="l00582"></a>00582 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a796c59daef23201b69c9ebec455e646a">getNode</a>(); | ||
661 | <a name="l00583"></a>00583 } | ||
662 | <a name="l00584"></a>00584 | ||
663 | <a name="l00585"></a><a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#acb7a240c0adbf19fbd90ee1736e6fc62">00585</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>& <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#acb7a240c0adbf19fbd90ee1736e6fc62">operator* </a>() | ||
664 | <a name="l00586"></a>00586 { | ||
665 | <a name="l00587"></a>00587 <a class="code" href="irr_types_8h.html#a12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(<a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#aac8bdae26b1c4f2f9fd7c335eda6d559">atEnd</a>()) <span class="comment">// access violation</span> | ||
666 | <a name="l00588"></a>00588 | ||
667 | <a name="l00589"></a>00589 <span class="keywordflow">return</span> *<a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a796c59daef23201b69c9ebec455e646a">getNode</a>(); | ||
668 | <a name="l00590"></a>00590 } | ||
669 | <a name="l00591"></a>00591 <span class="keyword">private</span>: | ||
670 | <a name="l00592"></a>00592 | ||
671 | <a name="l00593"></a>00593 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* getMin(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* n) | ||
672 | <a name="l00594"></a>00594 { | ||
673 | <a name="l00595"></a>00595 <span class="keywordflow">while</span>(n!=0 && (n->getLeftChild()!=0 || n->getRightChild()!=0)) | ||
674 | <a name="l00596"></a>00596 { | ||
675 | <a name="l00597"></a>00597 <span class="keywordflow">if</span> (n->getLeftChild()) | ||
676 | <a name="l00598"></a>00598 n = n->getLeftChild(); | ||
677 | <a name="l00599"></a>00599 <span class="keywordflow">else</span> | ||
678 | <a name="l00600"></a>00600 n = n->getRightChild(); | ||
679 | <a name="l00601"></a>00601 } | ||
680 | <a name="l00602"></a>00602 <span class="keywordflow">return</span> n; | ||
681 | <a name="l00603"></a>00603 } | ||
682 | <a name="l00604"></a>00604 | ||
683 | <a name="l00605"></a>00605 <span class="keywordtype">void</span> inc() | ||
684 | <a name="l00606"></a>00606 { | ||
685 | <a name="l00607"></a>00607 <span class="comment">// Already at end?</span> | ||
686 | <a name="l00608"></a>00608 <span class="keywordflow">if</span> (Cur==0) | ||
687 | <a name="l00609"></a>00609 <span class="keywordflow">return</span>; | ||
688 | <a name="l00610"></a>00610 | ||
689 | <a name="l00611"></a>00611 <span class="comment">// Note: Starting point is the node as far down to the left as possible.</span> | ||
690 | <a name="l00612"></a>00612 | ||
691 | <a name="l00613"></a>00613 <span class="comment">// If current node has an uncle to the right, go to the</span> | ||
692 | <a name="l00614"></a>00614 <span class="comment">// node as far down to the left from the uncle as possible</span> | ||
693 | <a name="l00615"></a>00615 <span class="comment">// else just go up a level to the parent.</span> | ||
694 | <a name="l00616"></a>00616 <span class="keywordflow">if</span> (Cur->isLeftChild() && Cur->getParent()->getRightChild()) | ||
695 | <a name="l00617"></a>00617 { | ||
696 | <a name="l00618"></a>00618 Cur = getMin(Cur->getParent()->getRightChild()); | ||
697 | <a name="l00619"></a>00619 } | ||
698 | <a name="l00620"></a>00620 <span class="keywordflow">else</span> | ||
699 | <a name="l00621"></a>00621 Cur = Cur->getParent(); | ||
700 | <a name="l00622"></a>00622 } | ||
701 | <a name="l00623"></a>00623 | ||
702 | <a name="l00624"></a>00624 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Root; | ||
703 | <a name="l00625"></a>00625 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Cur; | ||
704 | <a name="l00626"></a>00626 }; <span class="comment">// ParentLastIterator</span> | ||
705 | <a name="l00627"></a>00627 | ||
706 | <a name="l00628"></a>00628 | ||
707 | <a name="l00629"></a>00629 <span class="comment">// AccessClass is a temporary class used with the [] operator.</span> | ||
708 | <a name="l00630"></a>00630 <span class="comment">// It makes it possible to have different behavior in situations like:</span> | ||
709 | <a name="l00631"></a>00631 <span class="comment">// myTree["Foo"] = 32;</span> | ||
710 | <a name="l00632"></a>00632 <span class="comment">// If "Foo" already exists update its value else insert a new element.</span> | ||
711 | <a name="l00633"></a>00633 <span class="comment">// int i = myTree["Foo"]</span> | ||
712 | <a name="l00634"></a>00634 <span class="comment">// If "Foo" exists return its value.</span> | ||
713 | <a name="l00635"></a><a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html">00635</a> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html">AccessClass</a> | ||
714 | <a name="l00636"></a>00636 { | ||
715 | <a name="l00637"></a>00637 <span class="comment">// Let map be the only one who can instantiate this class.</span> | ||
716 | <a name="l00638"></a><a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html#a685d19b6671d09fc9f155f68aca75d6f">00638</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a><KeyType, ValueType>; | ||
717 | <a name="l00639"></a>00639 | ||
718 | <a name="l00640"></a>00640 <span class="keyword">public</span>: | ||
719 | <a name="l00641"></a>00641 | ||
720 | <a name="l00642"></a>00642 <span class="comment">// Assignment operator. Handles the myTree["Foo"] = 32; situation</span> | ||
721 | <a name="l00643"></a><a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html#a52dab87607d16e8189936113da5ee0e8">00643</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html#a52dab87607d16e8189936113da5ee0e8">operator=</a>(<span class="keyword">const</span> ValueType& value) | ||
722 | <a name="l00644"></a>00644 { | ||
723 | <a name="l00645"></a>00645 <span class="comment">// Just use the Set method, it handles already exist/not exist situation</span> | ||
724 | <a name="l00646"></a>00646 Tree.<a class="code" href="classirr_1_1core_1_1map.html#ae31213e9478dd259bdd79c7fd3249584" title="Replaces the value if the key already exists, otherwise inserts a new element.">set</a>(Key,value); | ||
725 | <a name="l00647"></a>00647 } | ||
726 | <a name="l00648"></a>00648 | ||
727 | <a name="l00649"></a>00649 <span class="comment">// ValueType operator</span> | ||
728 | <a name="l00650"></a><a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html#aeb2c9c9e3e957ad1b5393f13f5c6a80d">00650</a> <a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html#aeb2c9c9e3e957ad1b5393f13f5c6a80d">operator ValueType</a>() | ||
729 | <a name="l00651"></a>00651 { | ||
730 | <a name="l00652"></a>00652 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* node = Tree.<a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">find</a>(Key); | ||
731 | <a name="l00653"></a>00653 | ||
732 | <a name="l00654"></a>00654 <span class="comment">// Not found</span> | ||
733 | <a name="l00655"></a>00655 <a class="code" href="irr_types_8h.html#a12f3b5fd18ca108f90c5c74db602267e" title="define a break macro for debugging.">_IRR_DEBUG_BREAK_IF</a>(node==0) <span class="comment">// access violation</span> | ||
734 | <a name="l00656"></a>00656 | ||
735 | <a name="l00657"></a>00657 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
736 | <a name="l00658"></a>00658 <span class="keywordflow">return</span> node->getValue(); | ||
737 | <a name="l00659"></a>00659 } | ||
738 | <a name="l00660"></a>00660 | ||
739 | <a name="l00661"></a>00661 <span class="keyword">private</span>: | ||
740 | <a name="l00662"></a>00662 | ||
741 | <a name="l00663"></a>00663 <a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html">AccessClass</a>(<a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a>& tree, <span class="keyword">const</span> KeyType& key) : Tree(tree), Key(key) {} | ||
742 | <a name="l00664"></a>00664 | ||
743 | <a name="l00665"></a>00665 AccessClass(); | ||
744 | <a name="l00666"></a>00666 | ||
745 | <a name="l00667"></a>00667 <a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a>& Tree; | ||
746 | <a name="l00668"></a>00668 <span class="keyword">const</span> KeyType& Key; | ||
747 | <a name="l00669"></a>00669 }; <span class="comment">// AccessClass</span> | ||
748 | <a name="l00670"></a>00670 | ||
749 | <a name="l00671"></a>00671 | ||
750 | <a name="l00672"></a>00672 <span class="comment">// Constructor.</span> | ||
751 | <a name="l00673"></a><a class="code" href="classirr_1_1core_1_1map.html#aeed38ee45d6d57954985b446596d07cc">00673</a> <a class="code" href="classirr_1_1core_1_1map.html#aeed38ee45d6d57954985b446596d07cc">map</a>() : Root(0), Size(0) {} | ||
752 | <a name="l00674"></a>00674 | ||
753 | <a name="l00675"></a>00675 <span class="comment">// Destructor</span> | ||
754 | <a name="l00676"></a><a class="code" href="classirr_1_1core_1_1map.html#abea23eb926238eb0a3b971a1a8ba6da3">00676</a> <a class="code" href="classirr_1_1core_1_1map.html#abea23eb926238eb0a3b971a1a8ba6da3">~map</a>() | ||
755 | <a name="l00677"></a>00677 { | ||
756 | <a name="l00678"></a>00678 <a class="code" href="classirr_1_1core_1_1map.html#a0f7e7fdbb5ec7794851e32c9716dace0" title="Clear the entire tree.">clear</a>(); | ||
757 | <a name="l00679"></a>00679 } | ||
758 | <a name="l00680"></a>00680 | ||
759 | <a name="l00681"></a>00681 <span class="comment">//------------------------------</span> | ||
760 | <a name="l00682"></a>00682 <span class="comment">// Public Commands</span> | ||
761 | <a name="l00683"></a>00683 <span class="comment">//------------------------------</span> | ||
762 | <a name="l00684"></a>00684 | ||
763 | <a name="l00686"></a>00686 | ||
764 | <a name="l00689"></a><a class="code" href="classirr_1_1core_1_1map.html#af9f8f34cab620e3bdc1ae72715ab9d15">00689</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map.html#af9f8f34cab620e3bdc1ae72715ab9d15" title="Inserts a new node into the tree.">insert</a>(<span class="keyword">const</span> KeyType& keyNew, <span class="keyword">const</span> ValueType& v) | ||
765 | <a name="l00690"></a>00690 { | ||
766 | <a name="l00691"></a>00691 <span class="comment">// First insert node the "usual" way (no fancy balance logic yet)</span> | ||
767 | <a name="l00692"></a>00692 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* newNode = <span class="keyword">new</span> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>(keyNew,v); | ||
768 | <a name="l00693"></a>00693 <span class="keywordflow">if</span> (!<a class="code" href="classirr_1_1core_1_1map.html#af9f8f34cab620e3bdc1ae72715ab9d15" title="Inserts a new node into the tree.">insert</a>(newNode)) | ||
769 | <a name="l00694"></a>00694 { | ||
770 | <a name="l00695"></a>00695 <span class="keyword">delete</span> newNode; | ||
771 | <a name="l00696"></a>00696 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
772 | <a name="l00697"></a>00697 <span class="keywordflow">return</span> <span class="keyword">false</span>; | ||
773 | <a name="l00698"></a>00698 } | ||
774 | <a name="l00699"></a>00699 | ||
775 | <a name="l00700"></a>00700 <span class="comment">// Then attend a balancing party</span> | ||
776 | <a name="l00701"></a>00701 <span class="keywordflow">while</span> (!newNode->isRoot() && (newNode->getParent()->isRed())) | ||
777 | <a name="l00702"></a>00702 { | ||
778 | <a name="l00703"></a>00703 <span class="keywordflow">if</span> (newNode->getParent()->isLeftChild()) | ||
779 | <a name="l00704"></a>00704 { | ||
780 | <a name="l00705"></a>00705 <span class="comment">// If newNode is a left child, get its right 'uncle'</span> | ||
781 | <a name="l00706"></a>00706 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* newNodesUncle = newNode->getParent()->getParent()->getRightChild(); | ||
782 | <a name="l00707"></a>00707 <span class="keywordflow">if</span> ( newNodesUncle!=0 && newNodesUncle->isRed()) | ||
783 | <a name="l00708"></a>00708 { | ||
784 | <a name="l00709"></a>00709 <span class="comment">// case 1 - change the colors</span> | ||
785 | <a name="l00710"></a>00710 newNode->getParent()->setBlack(); | ||
786 | <a name="l00711"></a>00711 newNodesUncle->setBlack(); | ||
787 | <a name="l00712"></a>00712 newNode->getParent()->getParent()->setRed(); | ||
788 | <a name="l00713"></a>00713 <span class="comment">// Move newNode up the tree</span> | ||
789 | <a name="l00714"></a>00714 newNode = newNode->getParent()->getParent(); | ||
790 | <a name="l00715"></a>00715 } | ||
791 | <a name="l00716"></a>00716 <span class="keywordflow">else</span> | ||
792 | <a name="l00717"></a>00717 { | ||
793 | <a name="l00718"></a>00718 <span class="comment">// newNodesUncle is a black node</span> | ||
794 | <a name="l00719"></a>00719 <span class="keywordflow">if</span> ( newNode->isRightChild()) | ||
795 | <a name="l00720"></a>00720 { | ||
796 | <a name="l00721"></a>00721 <span class="comment">// and newNode is to the right</span> | ||
797 | <a name="l00722"></a>00722 <span class="comment">// case 2 - move newNode up and rotate</span> | ||
798 | <a name="l00723"></a>00723 newNode = newNode->getParent(); | ||
799 | <a name="l00724"></a>00724 rotateLeft(newNode); | ||
800 | <a name="l00725"></a>00725 } | ||
801 | <a name="l00726"></a>00726 <span class="comment">// case 3</span> | ||
802 | <a name="l00727"></a>00727 newNode->getParent()->setBlack(); | ||
803 | <a name="l00728"></a>00728 newNode->getParent()->getParent()->setRed(); | ||
804 | <a name="l00729"></a>00729 rotateRight(newNode->getParent()->getParent()); | ||
805 | <a name="l00730"></a>00730 } | ||
806 | <a name="l00731"></a>00731 } | ||
807 | <a name="l00732"></a>00732 <span class="keywordflow">else</span> | ||
808 | <a name="l00733"></a>00733 { | ||
809 | <a name="l00734"></a>00734 <span class="comment">// If newNode is a right child, get its left 'uncle'</span> | ||
810 | <a name="l00735"></a>00735 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* newNodesUncle = newNode->getParent()->getParent()->getLeftChild(); | ||
811 | <a name="l00736"></a>00736 <span class="keywordflow">if</span> ( newNodesUncle!=0 && newNodesUncle->isRed()) | ||
812 | <a name="l00737"></a>00737 { | ||
813 | <a name="l00738"></a>00738 <span class="comment">// case 1 - change the colors</span> | ||
814 | <a name="l00739"></a>00739 newNode->getParent()->setBlack(); | ||
815 | <a name="l00740"></a>00740 newNodesUncle->setBlack(); | ||
816 | <a name="l00741"></a>00741 newNode->getParent()->getParent()->setRed(); | ||
817 | <a name="l00742"></a>00742 <span class="comment">// Move newNode up the tree</span> | ||
818 | <a name="l00743"></a>00743 newNode = newNode->getParent()->getParent(); | ||
819 | <a name="l00744"></a>00744 } | ||
820 | <a name="l00745"></a>00745 <span class="keywordflow">else</span> | ||
821 | <a name="l00746"></a>00746 { | ||
822 | <a name="l00747"></a>00747 <span class="comment">// newNodesUncle is a black node</span> | ||
823 | <a name="l00748"></a>00748 <span class="keywordflow">if</span> (newNode->isLeftChild()) | ||
824 | <a name="l00749"></a>00749 { | ||
825 | <a name="l00750"></a>00750 <span class="comment">// and newNode is to the left</span> | ||
826 | <a name="l00751"></a>00751 <span class="comment">// case 2 - move newNode up and rotate</span> | ||
827 | <a name="l00752"></a>00752 newNode = newNode->getParent(); | ||
828 | <a name="l00753"></a>00753 rotateRight(newNode); | ||
829 | <a name="l00754"></a>00754 } | ||
830 | <a name="l00755"></a>00755 <span class="comment">// case 3</span> | ||
831 | <a name="l00756"></a>00756 newNode->getParent()->setBlack(); | ||
832 | <a name="l00757"></a>00757 newNode->getParent()->getParent()->setRed(); | ||
833 | <a name="l00758"></a>00758 rotateLeft(newNode->getParent()->getParent()); | ||
834 | <a name="l00759"></a>00759 } | ||
835 | <a name="l00760"></a>00760 | ||
836 | <a name="l00761"></a>00761 } | ||
837 | <a name="l00762"></a>00762 } | ||
838 | <a name="l00763"></a>00763 <span class="comment">// Color the root black</span> | ||
839 | <a name="l00764"></a>00764 Root->setBlack(); | ||
840 | <a name="l00765"></a>00765 <span class="keywordflow">return</span> <span class="keyword">true</span>; | ||
841 | <a name="l00766"></a>00766 } | ||
842 | <a name="l00767"></a>00767 | ||
843 | <a name="l00769"></a>00769 | ||
844 | <a name="l00771"></a><a class="code" href="classirr_1_1core_1_1map.html#ae31213e9478dd259bdd79c7fd3249584">00771</a> <span class="keywordtype">void</span> <span class="keyword">set</span>(<span class="keyword">const</span> KeyType& k, <span class="keyword">const</span> ValueType& v) | ||
845 | <a name="l00772"></a>00772 { | ||
846 | <a name="l00773"></a>00773 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p = <a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">find</a>(k); | ||
847 | <a name="l00774"></a>00774 <span class="keywordflow">if</span> (p) | ||
848 | <a name="l00775"></a>00775 p->setValue(v); | ||
849 | <a name="l00776"></a>00776 <span class="keywordflow">else</span> | ||
850 | <a name="l00777"></a>00777 <a class="code" href="classirr_1_1core_1_1map.html#af9f8f34cab620e3bdc1ae72715ab9d15" title="Inserts a new node into the tree.">insert</a>(k,v); | ||
851 | <a name="l00778"></a>00778 } | ||
852 | <a name="l00779"></a>00779 | ||
853 | <a name="l00781"></a>00781 | ||
854 | <a name="l00784"></a><a class="code" href="classirr_1_1core_1_1map.html#a6f95533c709ef2dbe17148442aa26984">00784</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map.html#a6f95533c709ef2dbe17148442aa26984" title="Removes a node from the tree and returns it.">delink</a>(<span class="keyword">const</span> KeyType& k) | ||
855 | <a name="l00785"></a>00785 { | ||
856 | <a name="l00786"></a>00786 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p = <a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">find</a>(k); | ||
857 | <a name="l00787"></a>00787 <span class="keywordflow">if</span> (p == 0) | ||
858 | <a name="l00788"></a>00788 <span class="keywordflow">return</span> 0; | ||
859 | <a name="l00789"></a>00789 | ||
860 | <a name="l00790"></a>00790 <span class="comment">// Rotate p down to the left until it has no right child, will get there</span> | ||
861 | <a name="l00791"></a>00791 <span class="comment">// sooner or later.</span> | ||
862 | <a name="l00792"></a>00792 <span class="keywordflow">while</span>(p->getRightChild()) | ||
863 | <a name="l00793"></a>00793 { | ||
864 | <a name="l00794"></a>00794 <span class="comment">// "Pull up my right child and let it knock me down to the left"</span> | ||
865 | <a name="l00795"></a>00795 rotateLeft(p); | ||
866 | <a name="l00796"></a>00796 } | ||
867 | <a name="l00797"></a>00797 <span class="comment">// p now has no right child but might have a left child</span> | ||
868 | <a name="l00798"></a>00798 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* left = p->getLeftChild(); | ||
869 | <a name="l00799"></a>00799 | ||
870 | <a name="l00800"></a>00800 <span class="comment">// Let p's parent point to p's child instead of point to p</span> | ||
871 | <a name="l00801"></a>00801 <span class="keywordflow">if</span> (p->isLeftChild()) | ||
872 | <a name="l00802"></a>00802 p->getParent()->setLeftChild(left); | ||
873 | <a name="l00803"></a>00803 | ||
874 | <a name="l00804"></a>00804 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p->isRightChild()) | ||
875 | <a name="l00805"></a>00805 p->getParent()->setRightChild(left); | ||
876 | <a name="l00806"></a>00806 | ||
877 | <a name="l00807"></a>00807 <span class="keywordflow">else</span> | ||
878 | <a name="l00808"></a>00808 { | ||
879 | <a name="l00809"></a>00809 <span class="comment">// p has no parent => p is the root.</span> | ||
880 | <a name="l00810"></a>00810 <span class="comment">// Let the left child be the new root.</span> | ||
881 | <a name="l00811"></a>00811 setRoot(left); | ||
882 | <a name="l00812"></a>00812 } | ||
883 | <a name="l00813"></a>00813 | ||
884 | <a name="l00814"></a>00814 <span class="comment">// p is now gone from the tree in the sense that</span> | ||
885 | <a name="l00815"></a>00815 <span class="comment">// no one is pointing at it, so return it.</span> | ||
886 | <a name="l00816"></a>00816 | ||
887 | <a name="l00817"></a>00817 --Size; | ||
888 | <a name="l00818"></a>00818 <span class="keywordflow">return</span> p; | ||
889 | <a name="l00819"></a>00819 } | ||
890 | <a name="l00820"></a>00820 | ||
891 | <a name="l00822"></a>00822 | ||
892 | <a name="l00823"></a><a class="code" href="classirr_1_1core_1_1map.html#a83d8a6261249668ae6a0f2bbd6e84c26">00823</a> <span class="keywordtype">bool</span> <span class="keyword">remove</span>(<span class="keyword">const</span> KeyType& k) | ||
893 | <a name="l00824"></a>00824 { | ||
894 | <a name="l00825"></a>00825 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p = <a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">find</a>(k); | ||
895 | <a name="l00826"></a>00826 <span class="keywordflow">return</span> <span class="keyword">remove</span>(p); | ||
896 | <a name="l00827"></a>00827 } | ||
897 | <a name="l00828"></a>00828 | ||
898 | <a name="l00830"></a>00830 | ||
899 | <a name="l00831"></a><a class="code" href="classirr_1_1core_1_1map.html#a8f8ee85b87b3764be03d78ba696e75f2">00831</a> <span class="keywordtype">bool</span> <span class="keyword">remove</span>(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p) | ||
900 | <a name="l00832"></a>00832 { | ||
901 | <a name="l00833"></a>00833 <span class="keywordflow">if</span> (p == 0) | ||
902 | <a name="l00834"></a>00834 { | ||
903 | <a name="l00835"></a>00835 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
904 | <a name="l00836"></a>00836 <span class="keywordflow">return</span> <span class="keyword">false</span>; | ||
905 | <a name="l00837"></a>00837 } | ||
906 | <a name="l00838"></a>00838 | ||
907 | <a name="l00839"></a>00839 <span class="comment">// Rotate p down to the left until it has no right child, will get there</span> | ||
908 | <a name="l00840"></a>00840 <span class="comment">// sooner or later.</span> | ||
909 | <a name="l00841"></a>00841 <span class="keywordflow">while</span>(p->getRightChild()) | ||
910 | <a name="l00842"></a>00842 { | ||
911 | <a name="l00843"></a>00843 <span class="comment">// "Pull up my right child and let it knock me down to the left"</span> | ||
912 | <a name="l00844"></a>00844 rotateLeft(p); | ||
913 | <a name="l00845"></a>00845 } | ||
914 | <a name="l00846"></a>00846 <span class="comment">// p now has no right child but might have a left child</span> | ||
915 | <a name="l00847"></a>00847 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* left = p->getLeftChild(); | ||
916 | <a name="l00848"></a>00848 | ||
917 | <a name="l00849"></a>00849 <span class="comment">// Let p's parent point to p's child instead of point to p</span> | ||
918 | <a name="l00850"></a>00850 <span class="keywordflow">if</span> (p->isLeftChild()) | ||
919 | <a name="l00851"></a>00851 p->getParent()->setLeftChild(left); | ||
920 | <a name="l00852"></a>00852 | ||
921 | <a name="l00853"></a>00853 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p->isRightChild()) | ||
922 | <a name="l00854"></a>00854 p->getParent()->setRightChild(left); | ||
923 | <a name="l00855"></a>00855 | ||
924 | <a name="l00856"></a>00856 <span class="keywordflow">else</span> | ||
925 | <a name="l00857"></a>00857 { | ||
926 | <a name="l00858"></a>00858 <span class="comment">// p has no parent => p is the root.</span> | ||
927 | <a name="l00859"></a>00859 <span class="comment">// Let the left child be the new root.</span> | ||
928 | <a name="l00860"></a>00860 setRoot(left); | ||
929 | <a name="l00861"></a>00861 } | ||
930 | <a name="l00862"></a>00862 | ||
931 | <a name="l00863"></a>00863 <span class="comment">// p is now gone from the tree in the sense that</span> | ||
932 | <a name="l00864"></a>00864 <span class="comment">// no one is pointing at it. Let's get rid of it.</span> | ||
933 | <a name="l00865"></a>00865 <span class="keyword">delete</span> p; | ||
934 | <a name="l00866"></a>00866 | ||
935 | <a name="l00867"></a>00867 --Size; | ||
936 | <a name="l00868"></a>00868 <span class="keywordflow">return</span> <span class="keyword">true</span>; | ||
937 | <a name="l00869"></a>00869 } | ||
938 | <a name="l00870"></a>00870 | ||
939 | <a name="l00872"></a><a class="code" href="classirr_1_1core_1_1map.html#a0f7e7fdbb5ec7794851e32c9716dace0">00872</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map.html#a0f7e7fdbb5ec7794851e32c9716dace0" title="Clear the entire tree.">clear</a>() | ||
940 | <a name="l00873"></a>00873 { | ||
941 | <a name="l00874"></a>00874 <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a> i(<a class="code" href="classirr_1_1core_1_1map.html#a8a1f6a2997b05126d80ef103a4f4b1ec">getParentLastIterator</a>()); | ||
942 | <a name="l00875"></a>00875 | ||
943 | <a name="l00876"></a>00876 <span class="keywordflow">while</span>(!i.<a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#aac8bdae26b1c4f2f9fd7c335eda6d559">atEnd</a>()) | ||
944 | <a name="l00877"></a>00877 { | ||
945 | <a name="l00878"></a>00878 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p = i.<a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html#a796c59daef23201b69c9ebec455e646a">getNode</a>(); | ||
946 | <a name="l00879"></a>00879 i++; <span class="comment">// Increment it before it is deleted</span> | ||
947 | <a name="l00880"></a>00880 <span class="comment">// else iterator will get quite confused.</span> | ||
948 | <a name="l00881"></a>00881 <span class="keyword">delete</span> p; | ||
949 | <a name="l00882"></a>00882 } | ||
950 | <a name="l00883"></a>00883 Root = 0; | ||
951 | <a name="l00884"></a>00884 Size= 0; | ||
952 | <a name="l00885"></a>00885 } | ||
953 | <a name="l00886"></a>00886 | ||
954 | <a name="l00889"></a><a class="code" href="classirr_1_1core_1_1map.html#a910309524c697daa29877863b49ed3b9">00889</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map.html#a910309524c697daa29877863b49ed3b9">empty</a>()<span class="keyword"> const</span> | ||
955 | <a name="l00890"></a>00890 <span class="keyword"> </span>{ | ||
956 | <a name="l00891"></a>00891 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
957 | <a name="l00892"></a>00892 <span class="keywordflow">return</span> Root == 0; | ||
958 | <a name="l00893"></a>00893 } | ||
959 | <a name="l00894"></a>00894 | ||
960 | <a name="l00896"></a><a class="code" href="classirr_1_1core_1_1map.html#abe50aefff40a6d71aa9f8b616acaa464">00896</a> <a class="code" href="irr_types_8h.html#ab68eafeefba066eff1f12c7d78f14814" title="Defines a deprecated macro which generates a warning at compile time.">_IRR_DEPRECATED_</a> <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map.html#abe50aefff40a6d71aa9f8b616acaa464">isEmpty</a>()<span class="keyword"> const</span> | ||
961 | <a name="l00897"></a>00897 <span class="keyword"> </span>{ | ||
962 | <a name="l00898"></a>00898 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map.html#a910309524c697daa29877863b49ed3b9">empty</a>(); | ||
963 | <a name="l00899"></a>00899 } | ||
964 | <a name="l00900"></a>00900 | ||
965 | <a name="l00904"></a><a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">00904</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map.html#ab8336f5210a2a5fcfd722e5050bd86e0">find</a>(<span class="keyword">const</span> KeyType& keyToFind)<span class="keyword"> const</span> | ||
966 | <a name="l00905"></a>00905 <span class="keyword"> </span>{ | ||
967 | <a name="l00906"></a>00906 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* pNode = Root; | ||
968 | <a name="l00907"></a>00907 | ||
969 | <a name="l00908"></a>00908 <span class="keywordflow">while</span>(pNode!=0) | ||
970 | <a name="l00909"></a>00909 { | ||
971 | <a name="l00910"></a>00910 <span class="keyword">const</span> KeyType& key=pNode->getKey(); | ||
972 | <a name="l00911"></a>00911 | ||
973 | <a name="l00912"></a>00912 <span class="keywordflow">if</span> (keyToFind == key) | ||
974 | <a name="l00913"></a>00913 <span class="keywordflow">return</span> pNode; | ||
975 | <a name="l00914"></a>00914 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (keyToFind < key) | ||
976 | <a name="l00915"></a>00915 pNode = pNode->getLeftChild(); | ||
977 | <a name="l00916"></a>00916 <span class="keywordflow">else</span> <span class="comment">//keyToFind > key</span> | ||
978 | <a name="l00917"></a>00917 pNode = pNode->getRightChild(); | ||
979 | <a name="l00918"></a>00918 } | ||
980 | <a name="l00919"></a>00919 | ||
981 | <a name="l00920"></a>00920 <span class="keywordflow">return</span> 0; | ||
982 | <a name="l00921"></a>00921 } | ||
983 | <a name="l00922"></a>00922 | ||
984 | <a name="l00926"></a><a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">00926</a> <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* <a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">getRoot</a>()<span class="keyword"> const</span> | ||
985 | <a name="l00927"></a>00927 <span class="keyword"> </span>{ | ||
986 | <a name="l00928"></a>00928 <span class="keywordflow">return</span> Root; | ||
987 | <a name="l00929"></a>00929 } | ||
988 | <a name="l00930"></a>00930 | ||
989 | <a name="l00932"></a><a class="code" href="classirr_1_1core_1_1map.html#aaf4cb9eaca145cd25030d99121ec4ed6">00932</a> <a class="code" href="namespaceirr.html#a0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> <a class="code" href="classirr_1_1core_1_1map.html#aaf4cb9eaca145cd25030d99121ec4ed6" title="Returns the number of nodes in the tree.">size</a>()<span class="keyword"> const</span> | ||
990 | <a name="l00933"></a>00933 <span class="keyword"> </span>{ | ||
991 | <a name="l00934"></a>00934 <span class="keywordflow">return</span> Size; | ||
992 | <a name="l00935"></a>00935 } | ||
993 | <a name="l00936"></a>00936 | ||
994 | <a name="l00938"></a>00938 | ||
995 | <a name="l00942"></a><a class="code" href="classirr_1_1core_1_1map.html#a411cde5df191c16616e20eb7027b9a20">00942</a> <span class="keywordtype">void</span> <a class="code" href="classirr_1_1core_1_1map.html#a411cde5df191c16616e20eb7027b9a20" title="Swap the content of this map container with the content of another map.">swap</a>(<a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map<KeyType, ValueType></a>& other) | ||
996 | <a name="l00943"></a>00943 { | ||
997 | <a name="l00944"></a>00944 <a class="code" href="classirr_1_1core_1_1map.html#a411cde5df191c16616e20eb7027b9a20" title="Swap the content of this map container with the content of another map.">core::swap</a>(Root, other.Root); | ||
998 | <a name="l00945"></a>00945 <a class="code" href="classirr_1_1core_1_1map.html#a411cde5df191c16616e20eb7027b9a20" title="Swap the content of this map container with the content of another map.">core::swap</a>(Size, other.Size); | ||
999 | <a name="l00946"></a>00946 } | ||
1000 | <a name="l00947"></a>00947 | ||
1001 | <a name="l00948"></a>00948 <span class="comment">//------------------------------</span> | ||
1002 | <a name="l00949"></a>00949 <span class="comment">// Public Iterators</span> | ||
1003 | <a name="l00950"></a>00950 <span class="comment">//------------------------------</span> | ||
1004 | <a name="l00951"></a>00951 | ||
1005 | <a name="l00953"></a><a class="code" href="classirr_1_1core_1_1map.html#aabacc5723088035c10c28b6642a6a921">00953</a> <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a> <a class="code" href="classirr_1_1core_1_1map.html#aabacc5723088035c10c28b6642a6a921" title="Returns an iterator.">getIterator</a>()<span class="keyword"> const</span> | ||
1006 | <a name="l00954"></a>00954 <span class="keyword"> </span>{ | ||
1007 | <a name="l00955"></a>00955 <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a> it(<a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">getRoot</a>()); | ||
1008 | <a name="l00956"></a>00956 <span class="keywordflow">return</span> it; | ||
1009 | <a name="l00957"></a>00957 } | ||
1010 | <a name="l00958"></a>00958 | ||
1011 | <a name="l00960"></a><a class="code" href="classirr_1_1core_1_1map.html#a997bb3bf46f66a4b42b23ec65e111b65">00960</a> <a class="code" href="classirr_1_1core_1_1map_1_1_const_iterator.html" title="Const Iterator.">ConstIterator</a> <a class="code" href="classirr_1_1core_1_1map.html#a997bb3bf46f66a4b42b23ec65e111b65" title="Returns a Constiterator.">getConstIterator</a>()<span class="keyword"> const</span> | ||
1012 | <a name="l00961"></a>00961 <span class="keyword"> </span>{ | ||
1013 | <a name="l00962"></a>00962 <a class="code" href="classirr_1_1core_1_1map_1_1_iterator.html" title="Normal Iterator.">Iterator</a> it(<a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">getRoot</a>()); | ||
1014 | <a name="l00963"></a>00963 <span class="keywordflow">return</span> it; | ||
1015 | <a name="l00964"></a>00964 } | ||
1016 | <a name="l00965"></a>00965 | ||
1017 | <a name="l00971"></a><a class="code" href="classirr_1_1core_1_1map.html#a8a9f9a68e17eadb6a401c0fb78202d4a">00971</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html" title="Parent First Iterator.">ParentFirstIterator</a> <a class="code" href="classirr_1_1core_1_1map.html#a8a9f9a68e17eadb6a401c0fb78202d4a">getParentFirstIterator</a>()<span class="keyword"> const</span> | ||
1018 | <a name="l00972"></a>00972 <span class="keyword"> </span>{ | ||
1019 | <a name="l00973"></a>00973 <a class="code" href="classirr_1_1core_1_1map_1_1_parent_first_iterator.html" title="Parent First Iterator.">ParentFirstIterator</a> it(<a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">getRoot</a>()); | ||
1020 | <a name="l00974"></a>00974 <span class="keywordflow">return</span> it; | ||
1021 | <a name="l00975"></a>00975 } | ||
1022 | <a name="l00976"></a>00976 | ||
1023 | <a name="l00982"></a><a class="code" href="classirr_1_1core_1_1map.html#a8a1f6a2997b05126d80ef103a4f4b1ec">00982</a> <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a> <a class="code" href="classirr_1_1core_1_1map.html#a8a1f6a2997b05126d80ef103a4f4b1ec">getParentLastIterator</a>()<span class="keyword"> const</span> | ||
1024 | <a name="l00983"></a>00983 <span class="keyword"> </span>{ | ||
1025 | <a name="l00984"></a>00984 <a class="code" href="classirr_1_1core_1_1map_1_1_parent_last_iterator.html" title="Parent Last Iterator.">ParentLastIterator</a> it(<a class="code" href="classirr_1_1core_1_1map.html#ab8823db164a055ec17a68a4ad24f5d4c">getRoot</a>()); | ||
1026 | <a name="l00985"></a>00985 <span class="keywordflow">return</span> it; | ||
1027 | <a name="l00986"></a>00986 } | ||
1028 | <a name="l00987"></a>00987 | ||
1029 | <a name="l00988"></a>00988 <span class="comment">//------------------------------</span> | ||
1030 | <a name="l00989"></a>00989 <span class="comment">// Public Operators</span> | ||
1031 | <a name="l00990"></a>00990 <span class="comment">//------------------------------</span> | ||
1032 | <a name="l00991"></a>00991 | ||
1033 | <a name="l00993"></a>00993 | ||
1034 | <a name="l00994"></a><a class="code" href="classirr_1_1core_1_1map.html#a396b601a40d70eb34aa6571e29f55992">00994</a> <a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html">AccessClass</a> <a class="code" href="classirr_1_1core_1_1map.html#a396b601a40d70eb34aa6571e29f55992" title="operator [] for access to elements">operator[]</a>(<span class="keyword">const</span> KeyType& k) | ||
1035 | <a name="l00995"></a>00995 { | ||
1036 | <a name="l00996"></a>00996 <span class="keywordflow">return</span> <a class="code" href="classirr_1_1core_1_1map_1_1_access_class.html">AccessClass</a>(*<span class="keyword">this</span>, k); | ||
1037 | <a name="l00997"></a>00997 } | ||
1038 | <a name="l00998"></a>00998 <span class="keyword">private</span>: | ||
1039 | <a name="l00999"></a>00999 | ||
1040 | <a name="l01000"></a>01000 <span class="comment">//------------------------------</span> | ||
1041 | <a name="l01001"></a>01001 <span class="comment">// Disabled methods</span> | ||
1042 | <a name="l01002"></a>01002 <span class="comment">//------------------------------</span> | ||
1043 | <a name="l01003"></a>01003 <span class="comment">// Copy constructor and assignment operator deliberately</span> | ||
1044 | <a name="l01004"></a>01004 <span class="comment">// defined but not implemented. The tree should never be</span> | ||
1045 | <a name="l01005"></a>01005 <span class="comment">// copied, pass along references to it instead.</span> | ||
1046 | <a name="l01006"></a>01006 <span class="keyword">explicit</span> <a class="code" href="classirr_1_1core_1_1map.html#aeed38ee45d6d57954985b446596d07cc">map</a>(<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a>& src); | ||
1047 | <a name="l01007"></a>01007 <a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a>& operator = (<span class="keyword">const</span> <a class="code" href="classirr_1_1core_1_1map.html" title="map template for associative arrays using a red-black tree">map</a>& src); | ||
1048 | <a name="l01008"></a>01008 | ||
1049 | <a name="l01010"></a>01010 | ||
1050 | <a name="l01014"></a>01014 <span class="keywordtype">void</span> setRoot(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* newRoot) | ||
1051 | <a name="l01015"></a>01015 { | ||
1052 | <a name="l01016"></a>01016 Root = newRoot; | ||
1053 | <a name="l01017"></a>01017 <span class="keywordflow">if</span> (Root != 0) | ||
1054 | <a name="l01018"></a>01018 { | ||
1055 | <a name="l01019"></a>01019 Root->setParent(0); | ||
1056 | <a name="l01020"></a>01020 Root->setBlack(); | ||
1057 | <a name="l01021"></a>01021 } | ||
1058 | <a name="l01022"></a>01022 } | ||
1059 | <a name="l01023"></a>01023 | ||
1060 | <a name="l01025"></a>01025 | ||
1061 | <a name="l01026"></a>01026 <span class="keywordtype">bool</span> <a class="code" href="classirr_1_1core_1_1map.html#af9f8f34cab620e3bdc1ae72715ab9d15" title="Inserts a new node into the tree.">insert</a>(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* newNode) | ||
1062 | <a name="l01027"></a>01027 { | ||
1063 | <a name="l01028"></a>01028 <span class="keywordtype">bool</span> result=<span class="keyword">true</span>; <span class="comment">// Assume success</span> | ||
1064 | <a name="l01029"></a>01029 | ||
1065 | <a name="l01030"></a>01030 <span class="keywordflow">if</span> (Root==0) | ||
1066 | <a name="l01031"></a>01031 { | ||
1067 | <a name="l01032"></a>01032 setRoot(newNode); | ||
1068 | <a name="l01033"></a>01033 Size = 1; | ||
1069 | <a name="l01034"></a>01034 } | ||
1070 | <a name="l01035"></a>01035 <span class="keywordflow">else</span> | ||
1071 | <a name="l01036"></a>01036 { | ||
1072 | <a name="l01037"></a>01037 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* pNode = Root; | ||
1073 | <a name="l01038"></a>01038 <span class="keyword">const</span> KeyType& keyNew = newNode->getKey(); | ||
1074 | <a name="l01039"></a>01039 <span class="keywordflow">while</span> (pNode) | ||
1075 | <a name="l01040"></a>01040 { | ||
1076 | <a name="l01041"></a>01041 <span class="keyword">const</span> KeyType& key=pNode->getKey(); | ||
1077 | <a name="l01042"></a>01042 | ||
1078 | <a name="l01043"></a>01043 <span class="keywordflow">if</span> (keyNew == key) | ||
1079 | <a name="l01044"></a>01044 { | ||
1080 | <a name="l01045"></a>01045 result = <span class="keyword">false</span>; | ||
1081 | <a name="l01046"></a>01046 pNode = 0; | ||
1082 | <a name="l01047"></a>01047 } | ||
1083 | <a name="l01048"></a>01048 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (keyNew < key) | ||
1084 | <a name="l01049"></a>01049 { | ||
1085 | <a name="l01050"></a>01050 <span class="keywordflow">if</span> (pNode->getLeftChild() == 0) | ||
1086 | <a name="l01051"></a>01051 { | ||
1087 | <a name="l01052"></a>01052 pNode->setLeftChild(newNode); | ||
1088 | <a name="l01053"></a>01053 pNode = 0; | ||
1089 | <a name="l01054"></a>01054 } | ||
1090 | <a name="l01055"></a>01055 <span class="keywordflow">else</span> | ||
1091 | <a name="l01056"></a>01056 pNode = pNode->getLeftChild(); | ||
1092 | <a name="l01057"></a>01057 } | ||
1093 | <a name="l01058"></a>01058 <span class="keywordflow">else</span> <span class="comment">// keyNew > key</span> | ||
1094 | <a name="l01059"></a>01059 { | ||
1095 | <a name="l01060"></a>01060 <span class="keywordflow">if</span> (pNode->getRightChild()==0) | ||
1096 | <a name="l01061"></a>01061 { | ||
1097 | <a name="l01062"></a>01062 pNode->setRightChild(newNode); | ||
1098 | <a name="l01063"></a>01063 pNode = 0; | ||
1099 | <a name="l01064"></a>01064 } | ||
1100 | <a name="l01065"></a>01065 <span class="keywordflow">else</span> | ||
1101 | <a name="l01066"></a>01066 { | ||
1102 | <a name="l01067"></a>01067 pNode = pNode->getRightChild(); | ||
1103 | <a name="l01068"></a>01068 } | ||
1104 | <a name="l01069"></a>01069 } | ||
1105 | <a name="l01070"></a>01070 } | ||
1106 | <a name="l01071"></a>01071 | ||
1107 | <a name="l01072"></a>01072 <span class="keywordflow">if</span> (result) | ||
1108 | <a name="l01073"></a>01073 ++Size; | ||
1109 | <a name="l01074"></a>01074 } | ||
1110 | <a name="l01075"></a>01075 | ||
1111 | <a name="l01076"></a>01076 <a class="code" href="irr_types_8h.html#ad19cf45bdc142ef8e4a011cabbc4a4af" title="Defines a small statement to work around a microsoft compiler bug.">_IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX</a>; | ||
1112 | <a name="l01077"></a>01077 <span class="keywordflow">return</span> result; | ||
1113 | <a name="l01078"></a>01078 } | ||
1114 | <a name="l01079"></a>01079 | ||
1115 | <a name="l01082"></a>01082 <span class="keywordtype">void</span> rotateLeft(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p) | ||
1116 | <a name="l01083"></a>01083 { | ||
1117 | <a name="l01084"></a>01084 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* right = p->getRightChild(); | ||
1118 | <a name="l01085"></a>01085 | ||
1119 | <a name="l01086"></a>01086 p->setRightChild(right->getLeftChild()); | ||
1120 | <a name="l01087"></a>01087 | ||
1121 | <a name="l01088"></a>01088 <span class="keywordflow">if</span> (p->isLeftChild()) | ||
1122 | <a name="l01089"></a>01089 p->getParent()->setLeftChild(right); | ||
1123 | <a name="l01090"></a>01090 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p->isRightChild()) | ||
1124 | <a name="l01091"></a>01091 p->getParent()->setRightChild(right); | ||
1125 | <a name="l01092"></a>01092 <span class="keywordflow">else</span> | ||
1126 | <a name="l01093"></a>01093 setRoot(right); | ||
1127 | <a name="l01094"></a>01094 | ||
1128 | <a name="l01095"></a>01095 right->setLeftChild(p); | ||
1129 | <a name="l01096"></a>01096 } | ||
1130 | <a name="l01097"></a>01097 | ||
1131 | <a name="l01100"></a>01100 <span class="keywordtype">void</span> rotateRight(<a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* p) | ||
1132 | <a name="l01101"></a>01101 { | ||
1133 | <a name="l01102"></a>01102 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* left = p->getLeftChild(); | ||
1134 | <a name="l01103"></a>01103 | ||
1135 | <a name="l01104"></a>01104 p->setLeftChild(left->getRightChild()); | ||
1136 | <a name="l01105"></a>01105 | ||
1137 | <a name="l01106"></a>01106 <span class="keywordflow">if</span> (p->isLeftChild()) | ||
1138 | <a name="l01107"></a>01107 p->getParent()->setLeftChild(left); | ||
1139 | <a name="l01108"></a>01108 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p->isRightChild()) | ||
1140 | <a name="l01109"></a>01109 p->getParent()->setRightChild(left); | ||
1141 | <a name="l01110"></a>01110 <span class="keywordflow">else</span> | ||
1142 | <a name="l01111"></a>01111 setRoot(left); | ||
1143 | <a name="l01112"></a>01112 | ||
1144 | <a name="l01113"></a>01113 left->setRightChild(p); | ||
1145 | <a name="l01114"></a>01114 } | ||
1146 | <a name="l01115"></a>01115 | ||
1147 | <a name="l01116"></a>01116 <span class="comment">//------------------------------</span> | ||
1148 | <a name="l01117"></a>01117 <span class="comment">// Private Members</span> | ||
1149 | <a name="l01118"></a>01118 <span class="comment">//------------------------------</span> | ||
1150 | <a name="l01119"></a>01119 <a class="code" href="classirr_1_1core_1_1map.html#ab5900de54f7cce26c95de541dff483ff">Node</a>* Root; <span class="comment">// The top node. 0 if empty.</span> | ||
1151 | <a name="l01120"></a>01120 <a class="code" href="namespaceirr.html#a0416a53257075833e7002efd0a18e804" title="32 bit unsigned variable.">u32</a> Size; <span class="comment">// Number of nodes in the tree</span> | ||
1152 | <a name="l01121"></a>01121 }; | ||
1153 | <a name="l01122"></a>01122 | ||
1154 | <a name="l01123"></a>01123 } <span class="comment">// end namespace core</span> | ||
1155 | <a name="l01124"></a>01124 } <span class="comment">// end namespace irr</span> | ||
1156 | <a name="l01125"></a>01125 | ||
1157 | <a name="l01126"></a>01126 <span class="preprocessor">#endif // __IRR_MAP_H_INCLUDED__</span> | ||
1158 | <a name="l01127"></a>01127 <span class="preprocessor"></span> | ||
1159 | </pre></div></div> | ||
1160 | </div> | ||
1161 | <div id="nav-path" class="navpath"> | ||
1162 | <ul> | ||
1163 | <li class="navelem"><a class="el" href="irr_map_8h.html">irrMap.h</a> </li> | ||
1164 | <!-- window showing the filter options --> | ||
1165 | <div id="MSearchSelectWindow" | ||
1166 | onmouseover="return searchBox.OnSearchSelectShow()" | ||
1167 | onmouseout="return searchBox.OnSearchSelectHide()" | ||
1168 | onkeydown="return searchBox.OnSearchSelectKey(event)"> | ||
1169 | <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark"> </span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark"> </span>Defines</a></div> | ||
1170 | |||
1171 | <!-- iframe showing the search results (closed by default) --> | ||
1172 | <div id="MSearchResultsWindow"> | ||
1173 | <iframe src="javascript:void(0)" frameborder="0" | ||
1174 | name="MSearchResults" id="MSearchResults"> | ||
1175 | </iframe> | ||
1176 | </div> | ||
1177 | |||
1178 | |||
1179 | <li class="footer"> | ||
1180 | <a href="http://irrlicht.sourceforge.net" target="_blank">Irrlicht | ||
1181 | Engine</a> Documentation © 2003-2012 by Nikolaus Gebhardt. Generated on Sun Nov 17 2013 20:18:40 for Irrlicht 3D Engine by | ||
1182 | <a href="http://www.doxygen.org/index.html" target="_blank">Doxygen</a> 1.7.5.1 </li> | ||
1183 | </ul> | ||
1184 | </div> | ||
1185 | |||
1186 | |||
1187 | </body> | ||
1188 | </html> | ||