<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>MPQC: eavlmmap.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<h1>eavlmmap.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//</span>
<a name="l00002"></a>00002 <span class="comment">// eavlmmap.h --- definition for embedded avl multimap class</span>
<a name="l00003"></a>00003 <span class="comment">//</span>
<a name="l00004"></a>00004 <span class="comment">// Copyright (C) 1996 Limit Point Systems, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// Author: Curtis Janssen <cljanss@limitpt.com></span>
<a name="l00007"></a>00007 <span class="comment">// Maintainer: LPS</span>
<a name="l00008"></a>00008 <span class="comment">//</span>
<a name="l00009"></a>00009 <span class="comment">// This file is part of the SC Toolkit.</span>
<a name="l00010"></a>00010 <span class="comment">//</span>
<a name="l00011"></a>00011 <span class="comment">// The SC Toolkit is free software; you can redistribute it and/or modify</span>
<a name="l00012"></a>00012 <span class="comment">// it under the terms of the GNU Library General Public License as published by</span>
<a name="l00013"></a>00013 <span class="comment">// the Free Software Foundation; either version 2, or (at your option)</span>
<a name="l00014"></a>00014 <span class="comment">// any later version.</span>
<a name="l00015"></a>00015 <span class="comment">//</span>
<a name="l00016"></a>00016 <span class="comment">// The SC Toolkit is distributed in the hope that it will be useful,</span>
<a name="l00017"></a>00017 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00018"></a>00018 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00019"></a>00019 <span class="comment">// GNU Library General Public License for more details.</span>
<a name="l00020"></a>00020 <span class="comment">//</span>
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU Library General Public License</span>
<a name="l00022"></a>00022 <span class="comment">// along with the SC Toolkit; see the file COPYING.LIB. If not, write to</span>
<a name="l00023"></a>00023 <span class="comment">// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00024"></a>00024 <span class="comment">//</span>
<a name="l00025"></a>00025 <span class="comment">// The U.S. Government is granted a limited license as per AL 91-7.</span>
<a name="l00026"></a>00026 <span class="comment">//</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="preprocessor">#ifndef _util_container_eavlmmap_h</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#define _util_container_eavlmmap_h</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span>
<a name="l00031"></a>00031 <span class="preprocessor">#ifdef HAVE_CONFIG_H</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor"># include <scconfig.h></span>
<a name="l00033"></a>00033 <span class="preprocessor">#endif</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span><span class="preprocessor">#include <iostream></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include <util/misc/exenv.h></span>
<a name="l00036"></a>00036 <span class="preprocessor">#include <util/container/compare.h></span>
<a name="l00037"></a>00037 <span class="preprocessor">#include <unistd.h></span> <span class="comment">// for size_t on solaris</span>
<a name="l00038"></a>00038 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span><span class="comment">// gcc typename seems to be broken in some cases</span>
<a name="l00042"></a>00042 <span class="preprocessor"># define eavl_typename</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00044"></a>00044 <span class="preprocessor"></span><span class="preprocessor"># define eavl_typename typename</span>
<a name="l00045"></a>00045 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span>
<a name="l00047"></a>00047 <span class="keyword">namespace </span>sc {
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00050"></a>00050 <span class="keyword">class </span>EAVLMMapNode {
<a name="l00051"></a>00051 <span class="keyword">public</span>:
<a name="l00052"></a>00052 K key;
<a name="l00053"></a>00053 T* lt;
<a name="l00054"></a>00054 T* rt;
<a name="l00055"></a>00055 T* up;
<a name="l00056"></a>00056 <span class="keywordtype">int</span> balance;
<a name="l00057"></a>00057 <span class="keyword">public</span>:
<a name="l00058"></a>00058 EAVLMMapNode(<span class="keyword">const</span> K& k): key(k) {}
<a name="l00059"></a>00059 };
<a name="l00060"></a>00060
<a name="l00061"></a>00061 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00062"></a>00062 <span class="keyword">class </span>EAVLMMap {
<a name="l00063"></a>00063 <span class="keyword">private</span>:
<a name="l00064"></a>00064 <span class="keywordtype">size_t</span> length_;
<a name="l00065"></a>00065 T *root_;
<a name="l00066"></a>00066 T *start_;
<a name="l00067"></a>00067 EAVLMMapNode<K,T> T::* node_;
<a name="l00068"></a>00068 <span class="keyword">public</span>:
<a name="l00069"></a>00069 T*& rlink(T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).rt; }
<a name="l00070"></a>00070 T* rlink(<span class="keyword">const</span> T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).rt; }
<a name="l00071"></a>00071 T*& llink(T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).lt; }
<a name="l00072"></a>00072 T* llink(<span class="keyword">const</span> T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).lt; }
<a name="l00073"></a>00073 T*& uplink(T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).up; }
<a name="l00074"></a>00074 T* uplink(<span class="keyword">const</span> T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).up; }
<a name="l00075"></a>00075 <span class="keywordtype">int</span>& balance(T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).balance; }
<a name="l00076"></a>00076 <span class="keywordtype">int</span> balance(<span class="keyword">const</span> T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).balance; }
<a name="l00077"></a>00077 K& key(T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).key; }
<a name="l00078"></a>00078 <span class="keyword">const</span> K& key(<span class="keyword">const</span> T* n)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (n->*node_).key; }
<a name="l00079"></a>00079 <span class="keywordtype">int</span> compare(T*n,T*m)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sc::compare(key(n), key(m)); }
<a name="l00080"></a>00080 <span class="keywordtype">int</span> compare(T*n,<span class="keyword">const</span> K&m)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sc::compare(key(n), m); }
<a name="l00081"></a>00081 <span class="keyword">private</span>:
<a name="l00082"></a>00082 <span class="keywordtype">void</span> adjust_balance_insert(T* A, T* child);
<a name="l00083"></a>00083 <span class="keywordtype">void</span> adjust_balance_remove(T* A, T* child);
<a name="l00084"></a>00084 <span class="keywordtype">void</span> clear(T*);
<a name="l00085"></a>00085 <span class="keyword">public</span>:
<a name="l00086"></a>00086 <span class="keyword">class </span>iterator {
<a name="l00087"></a>00087 <span class="keyword">private</span>:
<a name="l00088"></a>00088 EAVLMMap<K,T> *map_;
<a name="l00089"></a>00089 T *node;
<a name="l00090"></a>00090 <span class="keyword">public</span>:
<a name="l00091"></a>00091 iterator(EAVLMMap<K,T> *m, T *n):map_(m),node(n){}
<a name="l00092"></a>00092 iterator(<span class="keyword">const</span> eavl_typename EAVLMMap<K,T>::iterator &i) { map_=i.map_; node=i.node; }
<a name="l00093"></a>00093 <span class="keywordtype">void</span> operator++() { map_->next(node); }
<a name="l00094"></a>00094 <span class="keywordtype">void</span> operator++(<span class="keywordtype">int</span>) { operator++(); }
<a name="l00095"></a>00095 <span class="keywordtype">int</span> operator == (<span class="keyword">const</span> eavl_typename EAVLMMap<K,T>::iterator &i)<span class="keyword"> const</span>
<a name="l00096"></a>00096 <span class="keyword"> </span>{ <span class="keywordflow">return</span> map_ == i.map_ && node == i.node; }
<a name="l00097"></a>00097 <span class="keywordtype">int</span> operator != (<span class="keyword">const</span> eavl_typename EAVLMMap<K,T>::iterator &i)<span class="keyword"> const</span>
<a name="l00098"></a>00098 <span class="keyword"> </span>{ <span class="keywordflow">return</span> !operator == (i); }
<a name="l00099"></a>00099 <span class="keywordtype">void</span> operator = (<span class="keyword">const</span> eavl_typename EAVLMMap<K,T>::iterator &i)
<a name="l00100"></a>00100 { map_ = i.map_; node = i.node; }
<a name="l00101"></a>00101 <span class="keyword">const</span> K &key()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> map_->key(node); }
<a name="l00102"></a>00102 T & operator *() { <span class="keywordflow">return</span> *node; }
<a name="l00103"></a>00103 T * operator->() { <span class="keywordflow">return</span> node; }
<a name="l00104"></a>00104 };
<a name="l00105"></a>00105 <span class="keyword">public</span>:
<a name="l00106"></a>00106 EAVLMMap();
<a name="l00107"></a>00107 EAVLMMap(EAVLMMapNode<K,T> T::* node);
<a name="l00108"></a>00108 ~EAVLMMap() { clear(root_); }
<a name="l00109"></a>00109 <span class="keywordtype">void</span> initialize(EAVLMMapNode<K,T> T::* node);
<a name="l00110"></a>00110 <span class="keywordtype">void</span> clear_without_delete() { initialize(node_); }
<a name="l00111"></a>00111 <span class="keywordtype">void</span> clear() { clear(root_); initialize(node_); }
<a name="l00112"></a>00112 <span class="keywordtype">void</span> insert(T*);
<a name="l00113"></a>00113 <span class="keywordtype">void</span> <span class="keyword">remove</span>(T*);
<a name="l00114"></a>00114 T* find(<span class="keyword">const</span> K&) <span class="keyword">const</span>;
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="keywordtype">int</span> height(T* node);
<a name="l00117"></a>00117 <span class="keywordtype">int</span> height() { <span class="keywordflow">return</span> height(root_); }
<a name="l00118"></a>00118 <span class="keywordtype">void</span> check();
<a name="l00119"></a>00119 <span class="keywordtype">void</span> check_node(T*) <span class="keyword">const</span>;
<a name="l00120"></a>00120
<a name="l00121"></a>00121 T* start()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> start_; }
<a name="l00122"></a>00122 <span class="keywordtype">void</span> next(<span class="keyword">const</span> T*&) <span class="keyword">const</span>;
<a name="l00123"></a>00123 <span class="keywordtype">void</span> next(T*&) <span class="keyword">const</span>;
<a name="l00124"></a>00124
<a name="l00125"></a>00125 iterator begin() { <span class="keywordflow">return</span> iterator(<span class="keyword">this</span>,start()); }
<a name="l00126"></a>00126 iterator end() { <span class="keywordflow">return</span> iterator(<span class="keyword">this</span>,0); }
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keywordtype">void</span> print();
<a name="l00129"></a>00129 <span class="keywordtype">int</span> length()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> length_; }
<a name="l00130"></a>00130 <span class="keywordtype">int</span> depth(T*);
<a name="l00131"></a>00131 };
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00134"></a>00134 T*
<a name="l00135"></a>00135 EAVLMMap<K,T>::find(<span class="keyword">const</span> K& key)<span class="keyword"> const</span>
<a name="l00136"></a>00136 <span class="keyword"></span>{
<a name="l00137"></a>00137 T* n = root_;
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="keywordflow">while</span> (n) {
<a name="l00140"></a>00140 <span class="keywordtype">int</span> cmp = compare(n, key);
<a name="l00141"></a>00141 <span class="keywordflow">if</span> (cmp < 0) n = rlink(n);
<a name="l00142"></a>00142 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (cmp > 0) n = llink(n);
<a name="l00143"></a>00143 <span class="keywordflow">else</span> <span class="keywordflow">return</span> n;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="keywordflow">return</span> 0;
<a name="l00147"></a>00147 }
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00150"></a>00150 <span class="keywordtype">void</span>
<a name="l00151"></a>00151 EAVLMMap<K,T>::remove(T* node)
<a name="l00152"></a>00152 {
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (!node) <span class="keywordflow">return</span>;
<a name="l00154"></a>00154
<a name="l00155"></a>00155 length_--;
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="keywordflow">if</span> (node == start_) {
<a name="l00158"></a>00158 next(start_);
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160
<a name="l00161"></a>00161 T *rebalance_point;
<a name="l00162"></a>00162 T *q;
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keywordflow">if</span> (llink(node) == 0) {
<a name="l00165"></a>00165 q = rlink(node);
<a name="l00166"></a>00166 rebalance_point = uplink(node);
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <span class="keywordflow">if</span> (q) uplink(q) = rebalance_point;
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keywordflow">if</span> (rebalance_point) {
<a name="l00171"></a>00171 <span class="keywordflow">if</span> (rlink(rebalance_point) == node) rlink(rebalance_point) = q;
<a name="l00172"></a>00172 <span class="keywordflow">else</span> llink(rebalance_point) = q;
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174 <span class="keywordflow">else</span> root_ = q;
<a name="l00175"></a>00175 }
<a name="l00176"></a>00176 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rlink(node) == 0) {
<a name="l00177"></a>00177 q = llink(node);
<a name="l00178"></a>00178 rebalance_point = uplink(node);
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keywordflow">if</span> (q) uplink(q) = rebalance_point;
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (rebalance_point) {
<a name="l00183"></a>00183 <span class="keywordflow">if</span> (rlink(rebalance_point) == node) rlink(rebalance_point) = q;
<a name="l00184"></a>00184 <span class="keywordflow">else</span> llink(rebalance_point) = q;
<a name="l00185"></a>00185 }
<a name="l00186"></a>00186 <span class="keywordflow">else</span> root_ = q;
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 <span class="keywordflow">else</span> {
<a name="l00189"></a>00189 T *r = node;
<a name="l00190"></a>00190 next(r);
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keywordflow">if</span> (r == 0 || llink(r) != 0) {
<a name="l00193"></a>00193 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"EAVLMMap::remove: inconsistency"</span> << std::endl;
<a name="l00194"></a>00194 abort();
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="keywordflow">if</span> (r == rlink(node)) {
<a name="l00198"></a>00198 llink(r) = llink(node);
<a name="l00199"></a>00199 <span class="keywordflow">if</span> (llink(r)) uplink(llink(r)) = r;
<a name="l00200"></a>00200 balance(r) = balance(node);
<a name="l00201"></a>00201 rebalance_point = r;
<a name="l00202"></a>00202 q = rlink(r);
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204 <span class="keywordflow">else</span> {
<a name="l00205"></a>00205 q = rlink(r);
<a name="l00206"></a>00206
<a name="l00207"></a>00207 rebalance_point = uplink(r);
<a name="l00208"></a>00208
<a name="l00209"></a>00209 <span class="keywordflow">if</span> (llink(rebalance_point) == r) llink(rebalance_point) = q;
<a name="l00210"></a>00210 <span class="keywordflow">else</span> rlink(rebalance_point) = q;
<a name="l00211"></a>00211
<a name="l00212"></a>00212 <span class="keywordflow">if</span> (q) uplink(q) = rebalance_point;
<a name="l00213"></a>00213
<a name="l00214"></a>00214 balance(r) = balance(node);
<a name="l00215"></a>00215 rlink(r) = rlink(node);
<a name="l00216"></a>00216 llink(r) = llink(node);
<a name="l00217"></a>00217 <span class="keywordflow">if</span> (rlink(r)) uplink(rlink(r)) = r;
<a name="l00218"></a>00218 <span class="keywordflow">if</span> (llink(r)) uplink(llink(r)) = r;
<a name="l00219"></a>00219 }
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (r) {
<a name="l00221"></a>00221 T* up = uplink(node);
<a name="l00222"></a>00222 uplink(r) = up;
<a name="l00223"></a>00223 <span class="keywordflow">if</span> (up) {
<a name="l00224"></a>00224 <span class="keywordflow">if</span> (rlink(up) == node) rlink(up) = r;
<a name="l00225"></a>00225 <span class="keywordflow">else</span> llink(up) = r;
<a name="l00226"></a>00226 }
<a name="l00227"></a>00227 <span class="keywordflow">if</span> (up == 0) root_ = r;
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230
<a name="l00231"></a>00231 <span class="comment">// adjust balance won't work if both children are null,</span>
<a name="l00232"></a>00232 <span class="comment">// so handle this special case here</span>
<a name="l00233"></a>00233 <span class="keywordflow">if</span> (rebalance_point &&
<a name="l00234"></a>00234 llink(rebalance_point) == 0 && rlink(rebalance_point) == 0) {
<a name="l00235"></a>00235 balance(rebalance_point) = 0;
<a name="l00236"></a>00236 q = rebalance_point;
<a name="l00237"></a>00237 rebalance_point = uplink(rebalance_point);
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 adjust_balance_remove(rebalance_point, q);
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241
<a name="l00242"></a>00242 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00243"></a>00243 <span class="keywordtype">void</span>
<a name="l00244"></a>00244 EAVLMMap<K,T>::print()
<a name="l00245"></a>00245 {
<a name="l00246"></a>00246 <span class="keywordflow">for</span> (T*n=start(); n; next(n)) {
<a name="l00247"></a>00247 <span class="keywordtype">int</span> d = depth(n) + 1;
<a name="l00248"></a>00248 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=0; i<d; i++) <a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>() << <span class="stringliteral">" "</span>;
<a name="l00249"></a>00249 <span class="keywordflow">if</span> (balance(n) == 1) <a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>() << <span class="stringliteral">" (+)"</span> << std::endl;
<a name="l00250"></a>00250 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(n) == -1) <a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>() << <span class="stringliteral">" (-)"</span> << std::endl;
<a name="l00251"></a>00251 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(n) == 0) <a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>() << <span class="stringliteral">" (.)"</span> << std::endl;
<a name="l00252"></a>00252 <span class="keywordflow">else</span> <a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>() << <span class="stringliteral">" ("</span> << balance(n) << <span class="stringliteral">")"</span> << std::endl;
<a name="l00253"></a>00253 }
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00257"></a>00257 <span class="keywordtype">int</span>
<a name="l00258"></a>00258 EAVLMMap<K,T>::depth(T*node)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keywordtype">int</span> d = 0;
<a name="l00261"></a>00261 <span class="keywordflow">while</span> (node) {
<a name="l00262"></a>00262 node = uplink(node);
<a name="l00263"></a>00263 d++;
<a name="l00264"></a>00264 }
<a name="l00265"></a>00265 <span class="keywordflow">return</span> d;
<a name="l00266"></a>00266 }
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00269"></a>00269 <span class="keywordtype">void</span>
<a name="l00270"></a>00270 EAVLMMap<K,T>::check_node(T*n)<span class="keyword"> const</span>
<a name="l00271"></a>00271 <span class="keyword"></span>{
<a name="l00272"></a>00272 <span class="keywordflow">if</span> (uplink(n) && uplink(n) == n) abort();
<a name="l00273"></a>00273 <span class="keywordflow">if</span> (llink(n) && llink(n) == n) abort();
<a name="l00274"></a>00274 <span class="keywordflow">if</span> (rlink(n) && rlink(n) == n) abort();
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (rlink(n) && rlink(n) == llink(n)) abort();
<a name="l00276"></a>00276 <span class="keywordflow">if</span> (uplink(n) && uplink(n) == llink(n)) abort();
<a name="l00277"></a>00277 <span class="keywordflow">if</span> (uplink(n) && uplink(n) == rlink(n)) abort();
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (uplink(n) && !(llink(uplink(n)) == n
<a name="l00279"></a>00279 || rlink(uplink(n)) == n)) abort();
<a name="l00280"></a>00280 }
<a name="l00281"></a>00281
<a name="l00282"></a>00282 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00283"></a>00283 <span class="keywordtype">void</span>
<a name="l00284"></a>00284 EAVLMMap<K,T>::clear(T*n)
<a name="l00285"></a>00285 {
<a name="l00286"></a>00286 <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span>;
<a name="l00287"></a>00287 clear(llink(n));
<a name="l00288"></a>00288 clear(rlink(n));
<a name="l00289"></a>00289 <span class="keyword">delete</span> n;
<a name="l00290"></a>00290 }
<a name="l00291"></a>00291
<a name="l00292"></a>00292 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00293"></a>00293 <span class="keywordtype">int</span>
<a name="l00294"></a>00294 EAVLMMap<K,T>::height(T* node)
<a name="l00295"></a>00295 {
<a name="l00296"></a>00296 <span class="keywordflow">if</span> (!node) <span class="keywordflow">return</span> 0;
<a name="l00297"></a>00297 <span class="keywordtype">int</span> rh = height(rlink(node)) + 1;
<a name="l00298"></a>00298 <span class="keywordtype">int</span> lh = height(llink(node)) + 1;
<a name="l00299"></a>00299 <span class="keywordflow">return</span> rh>lh?rh:lh;
<a name="l00300"></a>00300 }
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00303"></a>00303 <span class="keywordtype">void</span>
<a name="l00304"></a>00304 EAVLMMap<K,T>::check()
<a name="l00305"></a>00305 {
<a name="l00306"></a>00306 T* node;
<a name="l00307"></a>00307 T* prev=0;
<a name="l00308"></a>00308 <span class="keywordtype">size_t</span> computed_length = 0;
<a name="l00309"></a>00309 <span class="keywordflow">for</span> (node = start(); node; next(node)) {
<a name="l00310"></a>00310 check_node(node);
<a name="l00311"></a>00311 <span class="keywordflow">if</span> (prev && compare(prev,node) > 0) {
<a name="l00312"></a>00312 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"nodes out of order"</span> << std::endl;
<a name="l00313"></a>00313 abort();
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315 prev = node;
<a name="l00316"></a>00316 computed_length++;
<a name="l00317"></a>00317 }
<a name="l00318"></a>00318 <span class="keywordflow">for</span> (node = start(); node; next(node)) {
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (balance(node) != height(rlink(node)) - height(llink(node))) {
<a name="l00320"></a>00320 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"balance inconsistency"</span> << std::endl;
<a name="l00321"></a>00321 abort();
<a name="l00322"></a>00322 }
<a name="l00323"></a>00323 <span class="keywordflow">if</span> (balance(node) < -1 || balance(node) > 1) {
<a name="l00324"></a>00324 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"balance out of range"</span> << std::endl;
<a name="l00325"></a>00325 abort();
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328 <span class="keywordflow">if</span> (length_ != computed_length) {
<a name="l00329"></a>00329 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"length error"</span> << std::endl;
<a name="l00330"></a>00330 abort();
<a name="l00331"></a>00331 }
<a name="l00332"></a>00332 }
<a name="l00333"></a>00333
<a name="l00334"></a>00334 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00335"></a>00335 <span class="keywordtype">void</span>
<a name="l00336"></a>00336 EAVLMMap<K,T>::next(<span class="keyword">const</span> T*& node)<span class="keyword"> const</span>
<a name="l00337"></a>00337 <span class="keyword"></span>{
<a name="l00338"></a>00338 <span class="keyword">const</span> T* r;
<a name="l00339"></a>00339 <span class="keywordflow">if</span> (r = rlink(node)) {
<a name="l00340"></a>00340 node = r;
<a name="l00341"></a>00341 <span class="keywordflow">while</span> (r = llink(node)) node = r;
<a name="l00342"></a>00342 <span class="keywordflow">return</span>;
<a name="l00343"></a>00343 }
<a name="l00344"></a>00344 <span class="keywordflow">while</span> (r = uplink(node)) {
<a name="l00345"></a>00345 <span class="keywordflow">if</span> (node == llink(r)) {
<a name="l00346"></a>00346 node = r;
<a name="l00347"></a>00347 <span class="keywordflow">return</span>;
<a name="l00348"></a>00348 }
<a name="l00349"></a>00349 node = r;
<a name="l00350"></a>00350 }
<a name="l00351"></a>00351 node = 0;
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353
<a name="l00354"></a>00354 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00355"></a>00355 <span class="keywordtype">void</span>
<a name="l00356"></a>00356 EAVLMMap<K,T>::next(T*& node)<span class="keyword"> const</span>
<a name="l00357"></a>00357 <span class="keyword"></span>{
<a name="l00358"></a>00358 T* r;
<a name="l00359"></a>00359 <span class="keywordflow">if</span> (r = rlink(node)) {
<a name="l00360"></a>00360 node = r;
<a name="l00361"></a>00361 <span class="keywordflow">while</span> (r = llink(node)) node = r;
<a name="l00362"></a>00362 <span class="keywordflow">return</span>;
<a name="l00363"></a>00363 }
<a name="l00364"></a>00364 <span class="keywordflow">while</span> (r = uplink(node)) {
<a name="l00365"></a>00365 <span class="keywordflow">if</span> (node == llink(r)) {
<a name="l00366"></a>00366 node = r;
<a name="l00367"></a>00367 <span class="keywordflow">return</span>;
<a name="l00368"></a>00368 }
<a name="l00369"></a>00369 node = r;
<a name="l00370"></a>00370 }
<a name="l00371"></a>00371 node = 0;
<a name="l00372"></a>00372 }
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00375"></a>00375 <span class="keywordtype">void</span>
<a name="l00376"></a>00376 EAVLMMap<K,T>::insert(T* n)
<a name="l00377"></a>00377 {
<a name="l00378"></a>00378 <span class="keywordflow">if</span> (!n) {
<a name="l00379"></a>00379 <span class="keywordflow">return</span>;
<a name="l00380"></a>00380 }
<a name="l00381"></a>00381
<a name="l00382"></a>00382 length_++;
<a name="l00383"></a>00383
<a name="l00384"></a>00384 rlink(n) = 0;
<a name="l00385"></a>00385 llink(n) = 0;
<a name="l00386"></a>00386 balance(n) = 0;
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="keywordflow">if</span> (!root_) {
<a name="l00389"></a>00389 uplink(n) = 0;
<a name="l00390"></a>00390 root_ = n;
<a name="l00391"></a>00391 start_ = n;
<a name="l00392"></a>00392 <span class="keywordflow">return</span>;
<a name="l00393"></a>00393 }
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="comment">// find an insertion point</span>
<a name="l00396"></a>00396 T* p = root_;
<a name="l00397"></a>00397 T* prev_p = 0;
<a name="l00398"></a>00398 <span class="keywordtype">int</span> cmp;
<a name="l00399"></a>00399 <span class="keywordtype">int</span> have_start = 1;
<a name="l00400"></a>00400 <span class="keywordflow">while</span> (p) {
<a name="l00401"></a>00401 <span class="keywordflow">if</span> (p == n) {
<a name="l00402"></a>00402 abort();
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 prev_p = p;
<a name="l00405"></a>00405 cmp = compare(n,p);
<a name="l00406"></a>00406 <span class="keywordflow">if</span> (cmp < 0) p = llink(p);
<a name="l00407"></a>00407 <span class="keywordflow">else</span> {
<a name="l00408"></a>00408 p = rlink(p);
<a name="l00409"></a>00409 have_start = 0;
<a name="l00410"></a>00410 }
<a name="l00411"></a>00411 }
<a name="l00412"></a>00412
<a name="l00413"></a>00413 <span class="comment">// insert the node</span>
<a name="l00414"></a>00414 uplink(n) = prev_p;
<a name="l00415"></a>00415 <span class="keywordflow">if</span> (prev_p) {
<a name="l00416"></a>00416 <span class="keywordflow">if</span> (cmp < 0) llink(prev_p) = n;
<a name="l00417"></a>00417 <span class="keywordflow">else</span> rlink(prev_p) = n;
<a name="l00418"></a>00418 }
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="comment">// maybe update the first node in the map</span>
<a name="l00421"></a>00421 <span class="keywordflow">if</span> (have_start) start_ = n;
<a name="l00422"></a>00422
<a name="l00423"></a>00423 <span class="comment">// adjust the balance factors</span>
<a name="l00424"></a>00424 <span class="keywordflow">if</span> (prev_p) {
<a name="l00425"></a>00425 adjust_balance_insert(prev_p, n);
<a name="l00426"></a>00426 }
<a name="l00427"></a>00427 }
<a name="l00428"></a>00428
<a name="l00429"></a>00429 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00430"></a>00430 <span class="keywordtype">void</span>
<a name="l00431"></a>00431 EAVLMMap<K,T>::adjust_balance_insert(T* A, T* child)
<a name="l00432"></a>00432 {
<a name="l00433"></a>00433 <span class="keywordflow">if</span> (!A) <span class="keywordflow">return</span>;
<a name="l00434"></a>00434 <span class="keywordtype">int</span> adjustment;
<a name="l00435"></a>00435 <span class="keywordflow">if</span> (llink(A) == child) adjustment = -1;
<a name="l00436"></a>00436 <span class="keywordflow">else</span> adjustment = 1;
<a name="l00437"></a>00437 <span class="keywordtype">int</span> bal = balance(A) + adjustment;
<a name="l00438"></a>00438 <span class="keywordflow">if</span> (bal == 0) {
<a name="l00439"></a>00439 balance(A) = 0;
<a name="l00440"></a>00440 }
<a name="l00441"></a>00441 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == -1 || bal == 1) {
<a name="l00442"></a>00442 balance(A) = bal;
<a name="l00443"></a>00443 adjust_balance_insert(uplink(A), A);
<a name="l00444"></a>00444 }
<a name="l00445"></a>00445 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == 2) {
<a name="l00446"></a>00446 T* B = rlink(A);
<a name="l00447"></a>00447 <span class="keywordflow">if</span> (balance(B) == 1) {
<a name="l00448"></a>00448 balance(B) = 0;
<a name="l00449"></a>00449 balance(A) = 0;
<a name="l00450"></a>00450 rlink(A) = llink(B);
<a name="l00451"></a>00451 llink(B) = A;
<a name="l00452"></a>00452 uplink(B) = uplink(A);
<a name="l00453"></a>00453 uplink(A) = B;
<a name="l00454"></a>00454 <span class="keywordflow">if</span> (rlink(A)) uplink(rlink(A)) = A;
<a name="l00455"></a>00455 <span class="keywordflow">if</span> (llink(B)) uplink(llink(B)) = B;
<a name="l00456"></a>00456 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00457"></a>00457 <span class="keywordflow">else</span> {
<a name="l00458"></a>00458 <span class="keywordflow">if</span> (rlink(uplink(B)) == A) rlink(uplink(B)) = B;
<a name="l00459"></a>00459 <span class="keywordflow">else</span> llink(uplink(B)) = B;
<a name="l00460"></a>00460 }
<a name="l00461"></a>00461 }
<a name="l00462"></a>00462 <span class="keywordflow">else</span> {
<a name="l00463"></a>00463 T* X = llink(B);
<a name="l00464"></a>00464 rlink(A) = llink(X);
<a name="l00465"></a>00465 llink(B) = rlink(X);
<a name="l00466"></a>00466 llink(X) = A;
<a name="l00467"></a>00467 rlink(X) = B;
<a name="l00468"></a>00468 <span class="keywordflow">if</span> (balance(X) == 1) {
<a name="l00469"></a>00469 balance(A) = -1;
<a name="l00470"></a>00470 balance(B) = 0;
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(X) == -1) {
<a name="l00473"></a>00473 balance(A) = 0;
<a name="l00474"></a>00474 balance(B) = 1;
<a name="l00475"></a>00475 }
<a name="l00476"></a>00476 <span class="keywordflow">else</span> {
<a name="l00477"></a>00477 balance(A) = 0;
<a name="l00478"></a>00478 balance(B) = 0;
<a name="l00479"></a>00479 }
<a name="l00480"></a>00480 balance(X) = 0;
<a name="l00481"></a>00481 uplink(X) = uplink(A);
<a name="l00482"></a>00482 uplink(A) = X;
<a name="l00483"></a>00483 uplink(B) = X;
<a name="l00484"></a>00484 <span class="keywordflow">if</span> (rlink(A)) uplink(rlink(A)) = A;
<a name="l00485"></a>00485 <span class="keywordflow">if</span> (llink(B)) uplink(llink(B)) = B;
<a name="l00486"></a>00486 <span class="keywordflow">if</span> (uplink(X) == 0) root_ = X;
<a name="l00487"></a>00487 <span class="keywordflow">else</span> {
<a name="l00488"></a>00488 <span class="keywordflow">if</span> (rlink(uplink(X)) == A) rlink(uplink(X)) = X;
<a name="l00489"></a>00489 <span class="keywordflow">else</span> llink(uplink(X)) = X;
<a name="l00490"></a>00490 }
<a name="l00491"></a>00491 }
<a name="l00492"></a>00492 }
<a name="l00493"></a>00493 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == -2) {
<a name="l00494"></a>00494 T* B = llink(A);
<a name="l00495"></a>00495 <span class="keywordflow">if</span> (balance(B) == -1) {
<a name="l00496"></a>00496 balance(B) = 0;
<a name="l00497"></a>00497 balance(A) = 0;
<a name="l00498"></a>00498 llink(A) = rlink(B);
<a name="l00499"></a>00499 rlink(B) = A;
<a name="l00500"></a>00500 uplink(B) = uplink(A);
<a name="l00501"></a>00501 uplink(A) = B;
<a name="l00502"></a>00502 <span class="keywordflow">if</span> (llink(A)) uplink(llink(A)) = A;
<a name="l00503"></a>00503 <span class="keywordflow">if</span> (rlink(B)) uplink(rlink(B)) = B;
<a name="l00504"></a>00504 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00505"></a>00505 <span class="keywordflow">else</span> {
<a name="l00506"></a>00506 <span class="keywordflow">if</span> (llink(uplink(B)) == A) llink(uplink(B)) = B;
<a name="l00507"></a>00507 <span class="keywordflow">else</span> rlink(uplink(B)) = B;
<a name="l00508"></a>00508 }
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510 <span class="keywordflow">else</span> {
<a name="l00511"></a>00511 T* X = rlink(B);
<a name="l00512"></a>00512 llink(A) = rlink(X);
<a name="l00513"></a>00513 rlink(B) = llink(X);
<a name="l00514"></a>00514 rlink(X) = A;
<a name="l00515"></a>00515 llink(X) = B;
<a name="l00516"></a>00516 <span class="keywordflow">if</span> (balance(X) == -1) {
<a name="l00517"></a>00517 balance(A) = 1;
<a name="l00518"></a>00518 balance(B) = 0;
<a name="l00519"></a>00519 }
<a name="l00520"></a>00520 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(X) == 1) {
<a name="l00521"></a>00521 balance(A) = 0;
<a name="l00522"></a>00522 balance(B) = -1;
<a name="l00523"></a>00523 }
<a name="l00524"></a>00524 <span class="keywordflow">else</span> {
<a name="l00525"></a>00525 balance(A) = 0;
<a name="l00526"></a>00526 balance(B) = 0;
<a name="l00527"></a>00527 }
<a name="l00528"></a>00528 balance(X) = 0;
<a name="l00529"></a>00529 uplink(X) = uplink(A);
<a name="l00530"></a>00530 uplink(A) = X;
<a name="l00531"></a>00531 uplink(B) = X;
<a name="l00532"></a>00532 <span class="keywordflow">if</span> (llink(A)) uplink(llink(A)) = A;
<a name="l00533"></a>00533 <span class="keywordflow">if</span> (rlink(B)) uplink(rlink(B)) = B;
<a name="l00534"></a>00534 <span class="keywordflow">if</span> (uplink(X) == 0) root_ = X;
<a name="l00535"></a>00535 <span class="keywordflow">else</span> {
<a name="l00536"></a>00536 <span class="keywordflow">if</span> (llink(uplink(X)) == A) llink(uplink(X)) = X;
<a name="l00537"></a>00537 <span class="keywordflow">else</span> rlink(uplink(X)) = X;
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540 }
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542
<a name="l00543"></a>00543 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00544"></a>00544 <span class="keywordtype">void</span>
<a name="l00545"></a>00545 EAVLMMap<K,T>::adjust_balance_remove(T* A, T* child)
<a name="l00546"></a>00546 {
<a name="l00547"></a>00547 <span class="keywordflow">if</span> (!A) <span class="keywordflow">return</span>;
<a name="l00548"></a>00548 <span class="keywordtype">int</span> adjustment;
<a name="l00549"></a>00549 <span class="keywordflow">if</span> (llink(A) == child) adjustment = 1;
<a name="l00550"></a>00550 <span class="keywordflow">else</span> adjustment = -1;
<a name="l00551"></a>00551 <span class="keywordtype">int</span> bal = balance(A) + adjustment;
<a name="l00552"></a>00552 <span class="keywordflow">if</span> (bal == 0) {
<a name="l00553"></a>00553 balance(A) = 0;
<a name="l00554"></a>00554 adjust_balance_remove(uplink(A), A);
<a name="l00555"></a>00555 }
<a name="l00556"></a>00556 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == -1 || bal == 1) {
<a name="l00557"></a>00557 balance(A) = bal;
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == 2) {
<a name="l00560"></a>00560 T* B = rlink(A);
<a name="l00561"></a>00561 <span class="keywordflow">if</span> (balance(B) == 0) {
<a name="l00562"></a>00562 balance(B) = -1;
<a name="l00563"></a>00563 balance(A) = 1;
<a name="l00564"></a>00564 rlink(A) = llink(B);
<a name="l00565"></a>00565 llink(B) = A;
<a name="l00566"></a>00566 uplink(B) = uplink(A);
<a name="l00567"></a>00567 uplink(A) = B;
<a name="l00568"></a>00568 <span class="keywordflow">if</span> (rlink(A)) uplink(rlink(A)) = A;
<a name="l00569"></a>00569 <span class="keywordflow">if</span> (llink(B)) uplink(llink(B)) = B;
<a name="l00570"></a>00570 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00571"></a>00571 <span class="keywordflow">else</span> {
<a name="l00572"></a>00572 <span class="keywordflow">if</span> (rlink(uplink(B)) == A) rlink(uplink(B)) = B;
<a name="l00573"></a>00573 <span class="keywordflow">else</span> llink(uplink(B)) = B;
<a name="l00574"></a>00574 }
<a name="l00575"></a>00575 }
<a name="l00576"></a>00576 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(B) == 1) {
<a name="l00577"></a>00577 balance(B) = 0;
<a name="l00578"></a>00578 balance(A) = 0;
<a name="l00579"></a>00579 rlink(A) = llink(B);
<a name="l00580"></a>00580 llink(B) = A;
<a name="l00581"></a>00581 uplink(B) = uplink(A);
<a name="l00582"></a>00582 uplink(A) = B;
<a name="l00583"></a>00583 <span class="keywordflow">if</span> (rlink(A)) uplink(rlink(A)) = A;
<a name="l00584"></a>00584 <span class="keywordflow">if</span> (llink(B)) uplink(llink(B)) = B;
<a name="l00585"></a>00585 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00586"></a>00586 <span class="keywordflow">else</span> {
<a name="l00587"></a>00587 <span class="keywordflow">if</span> (rlink(uplink(B)) == A) rlink(uplink(B)) = B;
<a name="l00588"></a>00588 <span class="keywordflow">else</span> llink(uplink(B)) = B;
<a name="l00589"></a>00589 }
<a name="l00590"></a>00590 adjust_balance_remove(uplink(B), B);
<a name="l00591"></a>00591 }
<a name="l00592"></a>00592 <span class="keywordflow">else</span> {
<a name="l00593"></a>00593 T* X = llink(B);
<a name="l00594"></a>00594 rlink(A) = llink(X);
<a name="l00595"></a>00595 llink(B) = rlink(X);
<a name="l00596"></a>00596 llink(X) = A;
<a name="l00597"></a>00597 rlink(X) = B;
<a name="l00598"></a>00598 <span class="keywordflow">if</span> (balance(X) == 0) {
<a name="l00599"></a>00599 balance(A) = 0;
<a name="l00600"></a>00600 balance(B) = 0;
<a name="l00601"></a>00601 }
<a name="l00602"></a>00602 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(X) == 1) {
<a name="l00603"></a>00603 balance(A) = -1;
<a name="l00604"></a>00604 balance(B) = 0;
<a name="l00605"></a>00605 }
<a name="l00606"></a>00606 <span class="keywordflow">else</span> {
<a name="l00607"></a>00607 balance(A) = 0;
<a name="l00608"></a>00608 balance(B) = 1;
<a name="l00609"></a>00609 }
<a name="l00610"></a>00610 balance(X) = 0;
<a name="l00611"></a>00611 uplink(X) = uplink(A);
<a name="l00612"></a>00612 uplink(A) = X;
<a name="l00613"></a>00613 uplink(B) = X;
<a name="l00614"></a>00614 <span class="keywordflow">if</span> (rlink(A)) uplink(rlink(A)) = A;
<a name="l00615"></a>00615 <span class="keywordflow">if</span> (llink(B)) uplink(llink(B)) = B;
<a name="l00616"></a>00616 <span class="keywordflow">if</span> (uplink(X) == 0) root_ = X;
<a name="l00617"></a>00617 <span class="keywordflow">else</span> {
<a name="l00618"></a>00618 <span class="keywordflow">if</span> (rlink(uplink(X)) == A) rlink(uplink(X)) = X;
<a name="l00619"></a>00619 <span class="keywordflow">else</span> llink(uplink(X)) = X;
<a name="l00620"></a>00620 }
<a name="l00621"></a>00621 adjust_balance_remove(uplink(X), X);
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (bal == -2) {
<a name="l00625"></a>00625 T* B = llink(A);
<a name="l00626"></a>00626 <span class="keywordflow">if</span> (balance(B) == 0) {
<a name="l00627"></a>00627 balance(B) = 1;
<a name="l00628"></a>00628 balance(A) = -1;
<a name="l00629"></a>00629 llink(A) = rlink(B);
<a name="l00630"></a>00630 rlink(B) = A;
<a name="l00631"></a>00631 uplink(B) = uplink(A);
<a name="l00632"></a>00632 uplink(A) = B;
<a name="l00633"></a>00633 <span class="keywordflow">if</span> (llink(A)) uplink(llink(A)) = A;
<a name="l00634"></a>00634 <span class="keywordflow">if</span> (rlink(B)) uplink(rlink(B)) = B;
<a name="l00635"></a>00635 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00636"></a>00636 <span class="keywordflow">else</span> {
<a name="l00637"></a>00637 <span class="keywordflow">if</span> (llink(uplink(B)) == A) llink(uplink(B)) = B;
<a name="l00638"></a>00638 <span class="keywordflow">else</span> rlink(uplink(B)) = B;
<a name="l00639"></a>00639 }
<a name="l00640"></a>00640 }
<a name="l00641"></a>00641 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(B) == -1) {
<a name="l00642"></a>00642 balance(B) = 0;
<a name="l00643"></a>00643 balance(A) = 0;
<a name="l00644"></a>00644 llink(A) = rlink(B);
<a name="l00645"></a>00645 rlink(B) = A;
<a name="l00646"></a>00646 uplink(B) = uplink(A);
<a name="l00647"></a>00647 uplink(A) = B;
<a name="l00648"></a>00648 <span class="keywordflow">if</span> (llink(A)) uplink(llink(A)) = A;
<a name="l00649"></a>00649 <span class="keywordflow">if</span> (rlink(B)) uplink(rlink(B)) = B;
<a name="l00650"></a>00650 <span class="keywordflow">if</span> (uplink(B) == 0) root_ = B;
<a name="l00651"></a>00651 <span class="keywordflow">else</span> {
<a name="l00652"></a>00652 <span class="keywordflow">if</span> (llink(uplink(B)) == A) llink(uplink(B)) = B;
<a name="l00653"></a>00653 <span class="keywordflow">else</span> rlink(uplink(B)) = B;
<a name="l00654"></a>00654 }
<a name="l00655"></a>00655 adjust_balance_remove(uplink(B), B);
<a name="l00656"></a>00656 }
<a name="l00657"></a>00657 <span class="keywordflow">else</span> {
<a name="l00658"></a>00658 T* X = rlink(B);
<a name="l00659"></a>00659 llink(A) = rlink(X);
<a name="l00660"></a>00660 rlink(B) = llink(X);
<a name="l00661"></a>00661 rlink(X) = A;
<a name="l00662"></a>00662 llink(X) = B;
<a name="l00663"></a>00663 <span class="keywordflow">if</span> (balance(X) == 0) {
<a name="l00664"></a>00664 balance(A) = 0;
<a name="l00665"></a>00665 balance(B) = 0;
<a name="l00666"></a>00666 }
<a name="l00667"></a>00667 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (balance(X) == -1) {
<a name="l00668"></a>00668 balance(A) = 1;
<a name="l00669"></a>00669 balance(B) = 0;
<a name="l00670"></a>00670 }
<a name="l00671"></a>00671 <span class="keywordflow">else</span> {
<a name="l00672"></a>00672 balance(A) = 0;
<a name="l00673"></a>00673 balance(B) = -1;
<a name="l00674"></a>00674 }
<a name="l00675"></a>00675 balance(X) = 0;
<a name="l00676"></a>00676 uplink(X) = uplink(A);
<a name="l00677"></a>00677 uplink(A) = X;
<a name="l00678"></a>00678 uplink(B) = X;
<a name="l00679"></a>00679 <span class="keywordflow">if</span> (llink(A)) uplink(llink(A)) = A;
<a name="l00680"></a>00680 <span class="keywordflow">if</span> (rlink(B)) uplink(rlink(B)) = B;
<a name="l00681"></a>00681 <span class="keywordflow">if</span> (uplink(X) == 0) root_ = X;
<a name="l00682"></a>00682 <span class="keywordflow">else</span> {
<a name="l00683"></a>00683 <span class="keywordflow">if</span> (llink(uplink(X)) == A) llink(uplink(X)) = X;
<a name="l00684"></a>00684 <span class="keywordflow">else</span> rlink(uplink(X)) = X;
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686 adjust_balance_remove(uplink(X), X);
<a name="l00687"></a>00687 }
<a name="l00688"></a>00688 }
<a name="l00689"></a>00689 }
<a name="l00690"></a>00690
<a name="l00691"></a>00691 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00692"></a>00692 <span class="keyword">inline</span>
<a name="l00693"></a>00693 EAVLMMap<K,T>::EAVLMMap()
<a name="l00694"></a>00694 {
<a name="l00695"></a>00695 initialize(0);
<a name="l00696"></a>00696 }
<a name="l00697"></a>00697
<a name="l00698"></a>00698 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00699"></a>00699 <span class="keyword">inline</span>
<a name="l00700"></a>00700 EAVLMMap<K,T>::EAVLMMap(EAVLMMapNode<K,T> T::* node)
<a name="l00701"></a>00701 {
<a name="l00702"></a>00702 initialize(node);
<a name="l00703"></a>00703 }
<a name="l00704"></a>00704
<a name="l00705"></a>00705 <span class="keyword">template</span> <<span class="keyword">class</span> K, <span class="keyword">class</span> T>
<a name="l00706"></a>00706 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00707"></a>00707 EAVLMMap<K,T>::initialize(EAVLMMapNode<K,T> T::* node)
<a name="l00708"></a>00708 {
<a name="l00709"></a>00709 node_ = node;
<a name="l00710"></a>00710 root_ = 0;
<a name="l00711"></a>00711 start_ = 0;
<a name="l00712"></a>00712 length_ = 0;
<a name="l00713"></a>00713 }
<a name="l00714"></a>00714
<a name="l00715"></a>00715 }
<a name="l00716"></a>00716
<a name="l00717"></a>00717 <span class="preprocessor">#endif</span>
<a name="l00718"></a>00718 <span class="preprocessor"></span>
<a name="l00719"></a>00719 <span class="comment">// ///////////////////////////////////////////////////////////////////////////</span>
<a name="l00720"></a>00720
<a name="l00721"></a>00721 <span class="comment">// Local Variables:</span>
<a name="l00722"></a>00722 <span class="comment">// mode: c++</span>
<a name="l00723"></a>00723 <span class="comment">// c-file-style: "CLJ"</span>
<a name="l00724"></a>00724 <span class="comment">// End:</span>
</pre></div></div>
<hr>
<address>
<small>
Generated at Wed Oct 14 14:12:09 2009 for <a
href="http://www.mpqc.org">MPQC</a>
2.3.1 using the documentation package <a
href="http://www.doxygen.org">Doxygen</a>
1.5.9.
</small>
</address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
247b28499c443e092731ffba814075f2
>
files
>
1046
