update to be compatible with new pointer types

2007-12-15  Juerg Billeter  <j@bitron.ch>

	* gee/hashmap.vala, gee/hashset.vala: update to be compatible with new
	  pointer types

	* vala/parser.y, vala/vala.h, vala/valaclass.vala,
	  vala/valadatatype.vala, vala/valamemorymanager.vala,
	  vala/valanulltype.vala, vala/valapointertype.vala,
	  vala/valasemanticanalyzer.vala, vala/valasymbolresolver.vala,
	  vala/valavoidtype.vala, gobject/valaccodegenerator.vala,
	  gobject/valaccodegeneratormethod.vala: use PointerType

svn path=/trunk/; revision=774

2 files changed, 21 insertions, 21 deletions

diff --git a/gee/hashmap.vala b/gee/hashmap.vala
index 3557199a3..c6b337736 100644
--- a/gee/hashmap.vala
+++ b/gee/hashmap.vala
@@ -74,22 +74,22 @@ public class Gee.HashMap<K,V> : Object, Map<K,V> {
 		return new ValueCollection<K,V> (this);
 	}
 
-	private Node<K,V>* lookup_node (K key) {
+	private Node<K,V>** lookup_node (K key) {
 		uint hash_value = _key_hash_func (key);
-		Node<K,V>* node = &_nodes[hash_value % _array_size];
-		while ((*node) != null && (hash_value != (*node).key_hash || !_key_equal_func ((*node).key, key))) {
-			node = &((*node).next);
+		Node<K,V>** node = &_nodes[hash_value % _array_size];
+		while ((*node) != null && (hash_value != ((Node<K,V>) (*node)).key_hash || !_key_equal_func (((Node<K,V>) (*node)).key, key))) {
+			node = &(((Node<K,V>) (*node)).next);
 		}
 		return node;
 	}
 
 	public bool contains (K key) {
-		Node<K,V>* node = lookup_node (key);
+		Node<K,V>** node = lookup_node (key);
 		return (*node != null);
 	}
 
 	public V get (K key) {
-		weak Node<K,V> node = *lookup_node (key);
+		weak Node<K,V> node = (Node<K,V>) (*lookup_node (key));
 		if (node != null) {
 			return node.value;
 		} else {
@@ -98,9 +98,9 @@ public class Gee.HashMap<K,V> : Object, Map<K,V> {
 	}
 
 	public void set (K key, V value) {
-		Node<K,V>* node = lookup_node (key);
+		Node<K,V>** node = lookup_node (key);
 		if (*node != null) {
-			(*node).value = value;
+			((Node<K,V>) (*node)).value = value;
 		} else {
 			uint hash_value = _key_hash_func (key);
 			*node = new Node<K,V> (key, value, hash_value);
@@ -111,11 +111,11 @@ public class Gee.HashMap<K,V> : Object, Map<K,V> {
 	}
 
 	public bool remove (K key) {
-		Node<K,V>* node = lookup_node (key);
+		Node<K,V>** node = lookup_node (key);
 		if (*node != null) {
-			(*node).key = null;
-			(*node).value = null;
-			*node = (*node).next;
+			((Node<K,V>) (*node)).key = null;
+			((Node<K,V>) (*node)).value = null;
+			*node = ((Node<K,V>) (*node)).next;
 			_nnodes--;
 			resize ();
 			_stamp++;
diff --git a/gee/hashset.vala b/gee/hashset.vala
index b901c7f07..a01b81003 100644
--- a/gee/hashset.vala
+++ b/gee/hashset.vala
@@ -61,17 +61,17 @@ public class Gee.HashSet<G> : Object, Iterable<G>, Collection<G>, Set<G> {
 		_nodes = new Node<G>[_array_size];
 	}
 
-	private Node<G>* lookup_node (G key) {
+	private Node<G>** lookup_node (G key) {
 		uint hash_value = _hash_func (key);
-		Node<G>* node = &_nodes[hash_value % _array_size];
-		while ((*node) != null && (hash_value != (*node).key_hash || !_equal_func ((*node).key, key))) {
-			node = &((*node).next);
+		Node<G>** node = &_nodes[hash_value % _array_size];
+		while ((*node) != null && (hash_value != ((Node<G>) (*node)).key_hash || !_equal_func (((Node<G>) (*node)).key, key))) {
+			node = &(((Node<G>) (*node)).next);
 		}
 		return node;
 	}
 
 	public bool contains (G key) {
-		Node<G>* node = lookup_node (key);
+		Node<G>** node = lookup_node (key);
 		return (*node != null);
 	}
 
@@ -80,7 +80,7 @@ public class Gee.HashSet<G> : Object, Iterable<G>, Collection<G>, Set<G> {
 	}
 
 	public bool add (G key) {
-		Node<G>* node = lookup_node (key);
+		Node<G>** node = lookup_node (key);
 		if (*node != null) {
 			return false;
 		} else {
@@ -94,10 +94,10 @@ public class Gee.HashSet<G> : Object, Iterable<G>, Collection<G>, Set<G> {
 	}
 
 	public bool remove (G key) {
-		Node<G>* node = lookup_node (key);
+		Node<G>** node = lookup_node (key);
 		if (*node != null) {
-			(*node).key = null;
-			*node = (*node).next;
+			((Node<G>) (*node)).key = null;
+			*node = ((Node<G>) (*node)).next;
 			_nnodes--;
 			resize ();
 			_stamp++;