MPQC  3.0.0-alpha
avlset.h
1 //
2 // avlset.h --- definition for avl set class
3 //
4 // Copyright (C) 1998 Limit Point Systems, Inc.
5 //
6 // Author: Curtis Janssen <cljanss@limitpt.com>
7 // Maintainer: LPS
8 //
9 // This file is part of the SC Toolkit.
10 //
11 // The SC Toolkit is free software; you can redistribute it and/or modify
12 // it under the terms of the GNU Library General Public License as published by
13 // the Free Software Foundation; either version 2, or (at your option)
14 // any later version.
15 //
16 // The SC Toolkit is distributed in the hope that it will be useful,
17 // but WITHOUT ANY WARRANTY; without even the implied warranty of
18 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 // GNU Library General Public License for more details.
20 //
21 // You should have received a copy of the GNU Library General Public License
22 // along with the SC Toolkit; see the file COPYING.LIB. If not, write to
23 // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
24 //
25 // The U.S. Government is granted a limited license as per AL 91-7.
26 //
27 
28 #ifndef _util_container_avlset_h
29 #define _util_container_avlset_h
30 
31 #include <util/container/avlmap.h>
32 
33 namespace sc {
34 
35 template <class K>
36 class AVLSet {
37  private:
38  AVLMap<K,int> map_;
39  public:
40  class iterator {
41  private:
42  const EAVLMMap<K, AVLMapNode<K,int> > *map_;
43  const AVLMapNode<K, int> *node;
44  public:
45  iterator(): map_(0), node(0) {}
46  iterator(const EAVLMMap<K,AVLMapNode<K,int> > *m,
47  const AVLMapNode<K,int> *n)
48  :map_(m), node(n) {}
49  iterator(const eavl_typename AVLSet<K>::iterator &i):map_(i.map_),node(i.node) {}
50  void operator++() { map_->next(node); }
51  void operator++(int) { operator++(); }
52  int operator == (const eavl_typename AVLSet<K>::iterator &i) const
53  { return map_ == i.map_ && node == i.node; }
54  int operator != (const eavl_typename AVLSet<K>::iterator &i) const
55  { return !(map_ == i.map_ && node == i.node); }
56  void operator = (const eavl_typename AVLSet<K>::iterator &i)
57  { map_ = i.map_; node = i.node; }
58  const K &key() const { return node->node.key; }
59  const K &operator *() const { return node->node.key; }
60  //const K *operator ->() const { return &node->node.key; }
61  };
62  public:
63  AVLSet() {};
64  void clear() { map_.clear(); }
65  void insert(const K& key) { map_.insert(key,0); }
66  void remove(const K& key) { map_.remove(key); }
67  int contains(const K& key) const { return map_.contains(key); }
68  iterator find(const K& k) const;
69 
70  int height() { return map_.height(); }
71  void check() { map_.check(); }
72 
73  int length() const { return map_.length(); }
74 
75  iterator begin() const { return iterator(&map_.map_,map_.map_.start()); }
76  iterator end() const { return iterator(&map_.map_,0); }
77 
78  void operator -= (const AVLSet<K> &s);
79  void operator |= (const AVLSet<K> &s);
80 
81  void print() { map_.print(); }
82 };
83 
84 template <class K>
85 void
86 AVLSet<K>::operator -= (const AVLSet<K> &s)
87 {
88  for (typename AVLSet<K>::iterator i=s.begin(); i!=s.end(); i++) {
89  remove(*i);
90  }
91 }
92 
93 template <class K>
94 void
95 AVLSet<K>::operator |= (const AVLSet<K> &s)
96 {
97  for (typename AVLSet<K>::iterator i=s.begin(); i!=s.end(); i++) {
98  insert(*i);
99  }
100 }
101 
102 template <class K>
103 inline typename AVLSet<K>::iterator
104 AVLSet<K>::find(const K& k) const
105 {
106  return iterator(&map_.map_,map_.map_.find(k));
107 }
108 
109 }
110 
111 #endif
112 
113 // ///////////////////////////////////////////////////////////////////////////
114 
115 // Local Variables:
116 // mode: c++
117 // c-file-style: "CLJ"
118 // End:
sc::AVLSet::iterator
Definition: avlset.h:40
sc::EAVLMMap
Definition: eavlmmap.h:62
sc::AVLSet
Definition: avlset.h:36
sc::AVLMap< K, int >
sc::AVLMapNode< K, int >
sc
Contains all MPQC code up to version 3.
Definition: mpqcin.h:14

Generated at Sun Jan 26 2020 23:24:01 for MPQC 3.0.0-alpha using the documentation package Doxygen 1.8.16.