<!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: avlset.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>avlset.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">// avlset.h --- definition for avl set class</span> <a name="l00003"></a>00003 <span class="comment">//</span> <a name="l00004"></a>00004 <span class="comment">// Copyright (C) 1998 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_avlset_h</span> <a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#define _util_container_avlset_h</span> <a name="l00030"></a>00030 <span class="preprocessor"></span> <a name="l00031"></a>00031 <span class="preprocessor">#include <util/container/avlmap.h></span> <a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="keyword">namespace </span>sc { <a name="l00034"></a>00034 <a name="l00035"></a>00035 <span class="keyword">template</span> <<span class="keyword">class</span> K> <a name="l00036"></a>00036 <span class="keyword">class </span>AVLSet { <a name="l00037"></a>00037 <span class="keyword">private</span>: <a name="l00038"></a>00038 AVLMap<K,int> map_; <a name="l00039"></a>00039 <span class="keyword">public</span>: <a name="l00040"></a>00040 <span class="keyword">class </span>iterator { <a name="l00041"></a>00041 <span class="keyword">private</span>: <a name="l00042"></a>00042 <span class="keyword">const</span> EAVLMMap<K, AVLMapNode<K,int> > *map_; <a name="l00043"></a>00043 <span class="keyword">const</span> AVLMapNode<K, int> *node; <a name="l00044"></a>00044 <span class="keyword">public</span>: <a name="l00045"></a>00045 iterator(): map_(0), node(0) {} <a name="l00046"></a>00046 iterator(<span class="keyword">const</span> EAVLMMap<K,AVLMapNode<K,int> > *m, <a name="l00047"></a>00047 <span class="keyword">const</span> AVLMapNode<K,int> *n) <a name="l00048"></a>00048 :map_(m), node(n) {} <a name="l00049"></a>00049 iterator(<span class="keyword">const</span> eavl_typename AVLSet<K>::iterator &i):map_(i.map_),node(i.node) {} <a name="l00050"></a>00050 <span class="keywordtype">void</span> operator++() { map_->next(node); } <a name="l00051"></a>00051 <span class="keywordtype">void</span> operator++(<span class="keywordtype">int</span>) { operator++(); } <a name="l00052"></a>00052 <span class="keywordtype">int</span> operator == (<span class="keyword">const</span> eavl_typename AVLSet<K>::iterator &i)<span class="keyword"> const</span> <a name="l00053"></a>00053 <span class="keyword"> </span>{ <span class="keywordflow">return</span> map_ == i.map_ && node == i.node; } <a name="l00054"></a>00054 <span class="keywordtype">int</span> operator != (<span class="keyword">const</span> eavl_typename AVLSet<K>::iterator &i)<span class="keyword"> const</span> <a name="l00055"></a>00055 <span class="keyword"> </span>{ <span class="keywordflow">return</span> !(map_ == i.map_ && node == i.node); } <a name="l00056"></a>00056 <span class="keywordtype">void</span> operator = (<span class="keyword">const</span> eavl_typename AVLSet<K>::iterator &i) <a name="l00057"></a>00057 { map_ = i.map_; node = i.node; } <a name="l00058"></a>00058 <span class="keyword">const</span> K &key()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node->node.key; } <a name="l00059"></a>00059 <span class="keyword">const</span> K &operator *()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> node->node.key; } <a name="l00060"></a>00060 <span class="comment">//const K *operator ->() const { return &node->node.key; }</span> <a name="l00061"></a>00061 }; <a name="l00062"></a>00062 <span class="keyword">public</span>: <a name="l00063"></a>00063 AVLSet() {}; <a name="l00064"></a>00064 <span class="keywordtype">void</span> clear() { map_.clear(); } <a name="l00065"></a>00065 <span class="keywordtype">void</span> insert(<span class="keyword">const</span> K& key) { map_.insert(key,0); } <a name="l00066"></a>00066 <span class="keywordtype">void</span> <span class="keyword">remove</span>(<span class="keyword">const</span> K& key) { map_.remove(key); } <a name="l00067"></a>00067 <span class="keywordtype">int</span> contains(<span class="keyword">const</span> K& key)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> map_.contains(key); } <a name="l00068"></a>00068 iterator find(<span class="keyword">const</span> K& k) <span class="keyword">const</span>; <a name="l00069"></a>00069 <a name="l00070"></a>00070 <span class="keywordtype">int</span> height() { <span class="keywordflow">return</span> map_.height(); } <a name="l00071"></a>00071 <span class="keywordtype">void</span> check() { map_.check(); } <a name="l00072"></a>00072 <a name="l00073"></a>00073 <span class="keywordtype">int</span> length()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> map_.length(); } <a name="l00074"></a>00074 <a name="l00075"></a>00075 iterator begin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> iterator(&map_.map_,map_.map_.start()); } <a name="l00076"></a>00076 iterator end()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> iterator(&map_.map_,0); } <a name="l00077"></a>00077 <a name="l00078"></a>00078 <span class="keywordtype">void</span> operator -= (<span class="keyword">const</span> AVLSet<K> &s); <a name="l00079"></a>00079 <span class="keywordtype">void</span> operator |= (<span class="keyword">const</span> AVLSet<K> &s); <a name="l00080"></a>00080 <a name="l00081"></a>00081 <span class="keywordtype">void</span> print() { map_.print(); } <a name="l00082"></a>00082 }; <a name="l00083"></a>00083 <a name="l00084"></a>00084 <span class="keyword">template</span> <<span class="keyword">class</span> K> <a name="l00085"></a>00085 <span class="keywordtype">void</span> <a name="l00086"></a>00086 AVLSet<K>::operator -= (<span class="keyword">const</span> AVLSet<K> &s) <a name="l00087"></a>00087 { <a name="l00088"></a>00088 <span class="keywordflow">for</span> (<span class="keyword">typename</span> AVLSet<K>::iterator i=s.begin(); i!=s.end(); i++) { <a name="l00089"></a>00089 <span class="keyword">remove</span>(*i); <a name="l00090"></a>00090 } <a name="l00091"></a>00091 } <a name="l00092"></a>00092 <a name="l00093"></a>00093 <span class="keyword">template</span> <<span class="keyword">class</span> K> <a name="l00094"></a>00094 <span class="keywordtype">void</span> <a name="l00095"></a>00095 AVLSet<K>::operator |= (<span class="keyword">const</span> AVLSet<K> &s) <a name="l00096"></a>00096 { <a name="l00097"></a>00097 <span class="keywordflow">for</span> (<span class="keyword">typename</span> AVLSet<K>::iterator i=s.begin(); i!=s.end(); i++) { <a name="l00098"></a>00098 insert(*i); <a name="l00099"></a>00099 } <a name="l00100"></a>00100 } <a name="l00101"></a>00101 <a name="l00102"></a>00102 <span class="keyword">template</span> <<span class="keyword">class</span> K> <a name="l00103"></a>00103 <span class="keyword">inline</span> <span class="keyword">typename</span> AVLSet<K>::iterator <a name="l00104"></a>00104 AVLSet<K>::find(<span class="keyword">const</span> K& k)<span class="keyword"> const</span> <a name="l00105"></a>00105 <span class="keyword"></span>{ <a name="l00106"></a>00106 <span class="keywordflow">return</span> iterator(&map_.map_,map_.map_.find(k)); <a name="l00107"></a>00107 } <a name="l00108"></a>00108 <a name="l00109"></a>00109 } <a name="l00110"></a>00110 <a name="l00111"></a>00111 <span class="preprocessor">#endif</span> <a name="l00112"></a>00112 <span class="preprocessor"></span> <a name="l00113"></a>00113 <span class="comment">// ///////////////////////////////////////////////////////////////////////////</span> <a name="l00114"></a>00114 <a name="l00115"></a>00115 <span class="comment">// Local Variables:</span> <a name="l00116"></a>00116 <span class="comment">// mode: c++</span> <a name="l00117"></a>00117 <span class="comment">// c-file-style: "CLJ"</span> <a name="l00118"></a>00118 <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>