gee/hashset.vala

   1 /* hashset.vala
   2  *
   3  * Copyright (C) 1995-1997  Peter Mattis, Spencer Kimball and Josh MacDonald
   4  * Copyright (C) 1997-2000  GLib Team and others
   5  * Copyright (C) 2007-2008  Jürg Billeter
   6  *
   7  * This library is free software; you can redistribute it and/or
   8  * modify it under the terms of the GNU Lesser General Public
   9  * License as published by the Free Software Foundation; either
  10  * version 2.1 of the License, or (at your option) any later version.
  11
  12  * This library is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15  * Lesser General Public License for more details.
  16
  17  * You should have received a copy of the GNU Lesser General Public
  18  * License along with this library; if not, write to the Free Software
  19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA
  20  *
  21  * Author:
  22  *      Jürg Billeter <j@bitron.ch>
  23  */
  24
  25 using GLib;
  26
  27 /**
  28  * Hashtable implementation of the Set interface.
  29  */
  30 public class Gee.HashSet<G> : CollectionObject, Iterable<G>, Collection<G>, Set<G> {
  31         public int size {
  32                 get { return _nnodes; }
  33         }
  34
  35         public HashFunc hash_func {
  36                 set { _hash_func = value; }
  37         }
  38
  39         public EqualFunc equal_func {
  40                 set { _equal_func = value; }
  41         }
  42
  43         private int _array_size;
  44         private int _nnodes;
  45         private Node<G>[] _nodes;
  46
  47         // concurrent modification protection
  48         private int _stamp = 0;
  49
  50         private HashFunc _hash_func;
  51         private EqualFunc _equal_func;
  52
  53         private const int MIN_SIZE = 11;
  54         private const int MAX_SIZE = 13845163;
  55
  56         public HashSet (HashFunc hash_func = GLib.direct_hash, EqualFunc equal_func = GLib.direct_equal) {
  57                 this.hash_func = hash_func;
  58                 this.equal_func = equal_func;
  59                 _array_size = MIN_SIZE;
  60                 _nodes = new Node<G>[_array_size];
  61         }
  62
  63         private Node<G>** lookup_node (G key) {
  64                 uint hash_value = _hash_func (key);
  65                 Node<G>** node = &_nodes[hash_value % _array_size];
  66                 while ((*node) != null && (hash_value != (*node)->key_hash || !_equal_func ((*node)->key, key))) {
  67                         node = &((*node)->next);
  68                 }
  69                 return node;
  70         }
  71
  72         public bool contains (G key) {
  73                 Node<G>** node = lookup_node (key);
  74                 return (*node != null);
  75         }
  76
  77         public Type get_element_type () {
  78                 return typeof (G);
  79         }
  80
  81         public Gee.Iterator<G> iterator () {
  82                 return new Iterator<G> (this);
  83         }
  84
  85         public bool add (G key) {
  86                 Node<G>** node = lookup_node (key);
  87                 if (*node != null) {
  88                         return false;
  89                 } else {
  90                         uint hash_value = _hash_func (key);
  91                         *node = new Node<G> (key, hash_value);
  92                         _nnodes++;
  93                         resize ();
  94                         _stamp++;
  95                         return true;
  96                 }
  97         }
  98
  99         public bool remove (G key) {
 100                 Node<G>** node = lookup_node (key);
 101                 if (*node != null) {
 102                         (*node)->key = null;
 103                         *node = (*node)->next;
 104                         _nnodes--;
 105                         resize ();
 106                         _stamp++;
 107                         return true;
 108                 }
 109                 return false;
 110         }
 111
 112         public void clear () {
 113                 for (int i = 0; i < _array_size; i++) {
 114                         Node<G> node = #_nodes[i];
 115                         while (node != null) {
 116                                 Node next = #node.next;
 117                                 node.key = null;
 118                                 node = #next;
 119                         }
 120                 }
 121                 _nnodes = 0;
 122                 resize ();
 123         }
 124
 125         private void resize () {
 126                 if ((_array_size >= 3 * _nnodes && _array_size >= MIN_SIZE) ||
 127                     (3 * _array_size <= _nnodes && _array_size < MAX_SIZE)) {
 128                         int new_array_size = (int) SpacedPrimes.closest (_nnodes);
 129                         new_array_size = new_array_size.clamp (MIN_SIZE, MAX_SIZE);
 130
 131                         Node<G>[] new_nodes = new Node<G>[new_array_size];
 132
 133                         for (int i = 0; i < _array_size; i++) {
 134                                 Node<G> node;
 135                                 Node<G> next;
 136                                 for (node = #_nodes[i]; node != null; node = #next) {
 137                                         next = #node.next;
 138                                         uint hash_val = node.key_hash % new_array_size;
 139                                         node.next = #new_nodes[hash_val];
 140                                         new_nodes[hash_val] = #node;
 141                                 }
 142                         }
 143                         _nodes = #new_nodes;
 144                         _array_size = new_array_size;
 145                 }
 146         }
 147
 148         ~HashSet () {
 149                 clear ();
 150         }
 151
 152         [Compact]
 153         private class Node<G> {
 154                 public G key;
 155                 public Node<G> next;
 156                 public uint key_hash;
 157
 158                 public Node (G# k, uint hash) {
 159                         key = #k;
 160                         key_hash = hash;
 161                 }
 162         }
 163
 164         private class Iterator<G> : CollectionObject, Gee.Iterator<G> {
 165                 public HashSet<G> set {
 166                         set {
 167                                 _set = value;
 168                                 _stamp = _set._stamp;
 169                         }
 170                 }
 171
 172                 private HashSet<G> _set;
 173                 private int _index = -1;
 174                 private weak Node<G> _node;
 175
 176                 // concurrent modification protection
 177                 private int _stamp = 0;
 178
 179                 public Iterator (HashSet set) {
 180                         this.set = set;
 181                 }
 182
 183                 public bool next () {
 184                         if (_node != null) {
 185                                 _node = _node.next;
 186                         }
 187                         while (_node == null && _index + 1 < _set._array_size) {
 188                                 _index++;
 189                                 _node = _set._nodes[_index];
 190                         }
 191                         return (_node != null);
 192                 }
 193
 194                 public G? get () {
 195                         assert (_stamp == _set._stamp);
 196                         assert (_node != null);
 197                         return _node.key;
 198                 }
 199         }
 200 }
 201