<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <html><head><meta name="robots" content="noindex"> <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"> <title>avlmap.h Source File</title> <link href="doxygen.css" rel="stylesheet" type="text/css"> </head><body bgcolor="#ffffff"> <!-- Generated by Doxygen 1.2.5 on Mon Oct 14 14:16:35 2002 --> <center> <a class="qindex" href="index.html">Main Page</a> <a class="qindex" href="hierarchy.html">Class Hierarchy</a> <a class="qindex" href="annotated.html">Compound List</a> <a class="qindex" href="files.html">File List</a> <a class="qindex" href="functions.html">Compound Members</a> <a class="qindex" href="pages.html">Related Pages</a> </center> <hr><h1>avlmap.h</h1><div class="fragment"><pre>00001 <font class="comment">//</font> 00002 <font class="comment">// avlmap.h --- definition for avl map class</font> 00003 <font class="comment">//</font> 00004 <font class="comment">// Copyright (C) 1998 Limit Point Systems, Inc.</font> 00005 <font class="comment">//</font> 00006 <font class="comment">// Author: Curtis Janssen <cljanss@limitpt.com></font> 00007 <font class="comment">// Maintainer: LPS</font> 00008 <font class="comment">//</font> 00009 <font class="comment">// This file is part of the SC Toolkit.</font> 00010 <font class="comment">//</font> 00011 <font class="comment">// The SC Toolkit is free software; you can redistribute it and/or modify</font> 00012 <font class="comment">// it under the terms of the GNU Library General Public License as published by</font> 00013 <font class="comment">// the Free Software Foundation; either version 2, or (at your option)</font> 00014 <font class="comment">// any later version.</font> 00015 <font class="comment">//</font> 00016 <font class="comment">// The SC Toolkit is distributed in the hope that it will be useful,</font> 00017 <font class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</font> 00018 <font class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</font> 00019 <font class="comment">// GNU Library General Public License for more details.</font> 00020 <font class="comment">//</font> 00021 <font class="comment">// You should have received a copy of the GNU Library General Public License</font> 00022 <font class="comment">// along with the SC Toolkit; see the file COPYING.LIB. If not, write to</font> 00023 <font class="comment">// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.</font> 00024 <font class="comment">//</font> 00025 <font class="comment">// The U.S. Government is granted a limited license as per AL 91-7.</font> 00026 <font class="comment">//</font> 00027 00028 <font class="preprocessor">#ifndef _util_container_avlmap_h</font> 00029 <font class="preprocessor"></font><font class="preprocessor">#define _util_container_avlmap_h</font> 00030 <font class="preprocessor"></font> 00031 <font class="preprocessor">#include <util/container/eavlmmap.h></font> 00032 00033 <font class="keyword">namespace </font>sc { 00034 00035 template <class K, class T> 00036 <font class="keyword">class </font>AVLMapNode { 00037 <font class="keyword">public</font>: 00038 T data; 00039 EAVLMMapNode<K,AVLMapNode<K, T> > node; 00040 <font class="keyword">public</font>: 00041 AVLMapNode(<font class="keyword">const</font> K& k, <font class="keyword">const</font> T& d): data(d), node(k) {}; 00042 }; 00043 00044 template <class K, class T> 00045 <font class="keyword">class </font>AVLMap { 00046 <font class="keyword">public</font>: 00047 EAVLMMap<K, AVLMapNode<K,T> > map_; 00048 <font class="keyword">public</font>: 00049 <font class="keyword">class </font>iterator { 00050 <font class="keyword">private</font>: 00051 <font class="keyword">const</font> EAVLMMap<K, AVLMapNode<K,T> > *map_; 00052 AVLMapNode<K, T> *node; 00053 <font class="keyword">public</font>: 00054 iterator(): map_(0), node(0) {} 00055 iterator(<font class="keyword">const</font> EAVLMMap<K,AVLMapNode<K,T> > *m, 00056 AVLMapNode<K,T> *n) 00057 :map_(m), node(n) {} 00058 iterator(<font class="keyword">const</font> eavl_typename AVLMap<K,T>::iterator &i)<font class="keyword"> </font>{ map_=i.map_; node=i.node; } 00059 <font class="keywordtype">void</font> operator++()<font class="keyword"> </font>{ map_->next(node); } 00060 <font class="keywordtype">void</font> operator++(<font class="keywordtype">int</font>)<font class="keyword"> </font>{ operator++(); } 00061 <font class="keywordtype">int</font> operator == (<font class="keyword">const</font> eavl_typename AVLMap<K,T>::iterator &i)<font class="keyword"> const</font> 00062 <font class="keyword"> </font>{ <font class="keywordflow">return</font> map_ == i.map_ && node == i.node; } 00063 <font class="keywordtype">int</font> operator != (<font class="keyword">const</font> eavl_typename AVLMap<K,T>::iterator &i)<font class="keyword"> const</font> 00064 <font class="keyword"> </font>{ <font class="keywordflow">return</font> !operator == (i); } 00065 <font class="keywordtype">void</font> operator = (<font class="keyword">const</font> eavl_typename AVLMap<K,T>::iterator &i)<font class="keyword"></font> 00066 <font class="keyword"> </font>{ map_ = i.map_; node = i.node; } 00067 <font class="keyword">const</font> K &key()<font class="keyword"> const </font>{ <font class="keywordflow">return</font> node->node.key; } 00068 T &data()<font class="keyword"> </font>{ <font class="keywordflow">return</font> node->data; } 00069 }; 00070 <font class="keyword">public</font>: 00071 AVLMap(): map_(&AVLMapNode<K,T>::node) {}; 00072 <font class="keywordtype">void</font> clear()<font class="keyword"> </font>{ map_.clear(); } 00073 <font class="keywordtype">void</font> insert(<font class="keyword">const</font> K& key, <font class="keyword">const</font> T& data); 00074 <font class="keywordtype">void</font> remove(<font class="keyword">const</font> K& key); 00075 <font class="keywordtype">int</font> contains(<font class="keyword">const</font> K& k)<font class="keyword"> const </font>{ <font class="keywordflow">return</font> map_.find(k) != 0; } 00076 iterator find(<font class="keyword">const</font> K&) <font class="keyword">const</font>; 00077 T &operator[](<font class="keyword">const</font> K &k); 00078 00079 <font class="keywordtype">int</font> height()<font class="keyword"> </font>{ <font class="keywordflow">return</font> map_.height(); } 00080 <font class="keywordtype">void</font> check()<font class="keyword"> </font>{ map_.check(); } 00081 00082 <font class="keywordtype">int</font> length()<font class="keyword"> const </font>{ <font class="keywordflow">return</font> map_.length(); } 00083 00084 iterator begin()<font class="keyword"> const </font>{ <font class="keywordflow">return</font> iterator(&map_,map_.start()); } 00085 iterator end()<font class="keyword"> const </font>{ <font class="keywordflow">return</font> iterator(&map_,0); } 00086 00087 <font class="keywordtype">void</font> print()<font class="keyword"> </font>{ map_.print(); } 00088 }; 00089 00090 template <class K, class T> 00091 <font class="keyword">inline</font> <font class="keywordtype">void</font> 00092 AVLMap<K,T>::insert(<font class="keyword">const</font> K& key, <font class="keyword">const</font> T& data)<font class="keyword"></font> 00093 <font class="keyword"></font>{ 00094 AVLMapNode<K,T> *node = map_.find(key); 00095 <font class="keywordflow">if</font> (node) node->data = data; 00096 <font class="keywordflow">else</font> map_.insert(<font class="keyword">new</font> AVLMapNode<K, T>(key,data)); 00097 } 00098 00099 template <class K, class T> 00100 <font class="keyword">inline</font> <font class="keywordtype">void</font> 00101 AVLMap<K,T>::remove(<font class="keyword">const</font> K& key)<font class="keyword"></font> 00102 <font class="keyword"></font>{ 00103 AVLMapNode<K, T> *node = map_.find(key); 00104 <font class="keywordflow">if</font> (node) { 00105 map_.remove(node); 00106 <font class="keyword">delete</font> node; 00107 } 00108 } 00109 00110 template <class K, class T> 00111 <font class="keyword">inline</font> <font class="keyword">typename</font> AVLMap<K,T>::iterator 00112 AVLMap<K,T>::find(<font class="keyword">const</font> K& k)<font class="keyword"> const</font> 00113 <font class="keyword"></font>{ 00114 <font class="keywordflow">return</font> iterator(&map_,map_.find(k)); 00115 } 00116 00117 template <class K, class T> 00118 <font class="keyword">inline</font> T& 00119 AVLMap<K,T>::operator [](<font class="keyword">const</font> K& k)<font class="keyword"></font> 00120 <font class="keyword"></font>{ 00121 AVLMapNode<K, T> *node = map_.find(k); 00122 <font class="keywordflow">if</font> (node) <font class="keywordflow">return</font> node->data; 00123 insert(k,T()); 00124 node = map_.find(k); 00125 <font class="keywordflow">return</font> node->data; 00126 } 00127 00128 } 00129 00130 <font class="preprocessor">#endif</font> 00131 <font class="preprocessor"></font> 00132 <font class="comment">// /////////////////////////////////////////////////////////////////////////</font> 00133 00134 <font class="comment">// Local Variables:</font> 00135 <font class="comment">// mode: c++</font> 00136 <font class="comment">// c-file-style: "CLJ"</font> 00137 <font class="comment">// End:</font> </div></pre><hr> <address> <small> Generated at Mon Oct 14 14:16:35 2002 for <a href="http://aros.ca.sandia.gov/~cljanss/mpqc">MPQC</a> 2.1.2 using the documentation package <a href="http://www.stack.nl/~dimitri/doxygen/index.html">Doxygen</a> 1.2.5. </small> </address> </body> </html>