[libgee] Donât notify on changes to hash/equal functions

[Maciej Marcin Piechotka <mpiechotka src gnome org>]

commit d8ab9380b6ecb1af215d250f2f38d9b1dff4c6ab
Author: Philip Withnall <philip tecnocode co uk>
Date:   Mon Aug 27 08:07:18 2012 -0700

    Donât notify on changes to hash/equal functions

 gee/arraylist.vala      |    1 +
 gee/arrayqueue.vala     |    1 +
 gee/concurrentlist.vala |    1 +
 gee/hashmap.vala        |    3 +++
 gee/hashmultimap.vala   |    2 ++
 gee/hashset.vala        |    2 ++
 gee/linkedlist.vala     |    1 +
 gee/priorityqueue.vala  |    1 +
 gee/treemap.vala        |    8 ++++++++
 gee/treemultimap.vala   |    1 +
 gee/treeset.vala        |    1 +
 tests/testcase.vala     |    2 +-
 12 files changed, 23 insertions(+), 1 deletions(-)
---
diff --git a/gee/arraylist.vala b/gee/arraylist.vala
index 86e9380..23610f5 100644
--- a/gee/arraylist.vala
+++ b/gee/arraylist.vala
@@ -55,6 +55,7 @@ public class Gee.ArrayList<G> : AbstractBidirList<G> {
 	/**
 	 * The elements' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<G> equal_func { private set; get; }
 
 	internal G[] _items = new G[4];
diff --git a/gee/arrayqueue.vala b/gee/arrayqueue.vala
index 01b1d56..6ab67ce 100644
--- a/gee/arrayqueue.vala
+++ b/gee/arrayqueue.vala
@@ -48,6 +48,7 @@ public class Gee.ArrayQueue<G> : Gee.AbstractQueue<G>, Deque<G> {
 		this._items = new G[10];
 	}
 
+	[CCode (notify = false)]
 	public EqualDataFunc<G> equal_func { private set; get; }
 
 	/**
diff --git a/gee/concurrentlist.vala b/gee/concurrentlist.vala
index eb0068a..14ec37f 100644
--- a/gee/concurrentlist.vala
+++ b/gee/concurrentlist.vala
@@ -32,6 +32,7 @@ public class Gee.ConcurrentList<G> : AbstractList<G> {
 	/**
 	 * The elements' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public Gee.EqualDataFunc<G> equal_func { private set; get; }
 
 	/**
diff --git a/gee/hashmap.vala b/gee/hashmap.vala
index a538927..79f971a 100644
--- a/gee/hashmap.vala
+++ b/gee/hashmap.vala
@@ -96,16 +96,19 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	/**
 	 * The keys' hash function.
 	 */
+	[CCode (notify = false)]
 	public HashDataFunc<K> key_hash_func { private set; get; }
 
 	/**
 	 * The keys' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<K> key_equal_func { private set; get; }
 
 	/**
 	 * The values' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<V> value_equal_func { private set; get; }
 
 	private int _array_size;
diff --git a/gee/hashmultimap.vala b/gee/hashmultimap.vala
index 08fc5cd..7719d3a 100644
--- a/gee/hashmultimap.vala
+++ b/gee/hashmultimap.vala
@@ -32,8 +32,10 @@ public class Gee.HashMultiMap<K,V> : AbstractMultiMap<K,V> {
 		get { return ((HashMap<K, Set<V>>) _storage_map).key_equal_func; }
 	}
 
+	[CCode (notify = false)]
 	public HashDataFunc<V> value_hash_func { private set; get; }
 
+	[CCode (notify = false)]
 	public EqualDataFunc<V> value_equal_func { private set; get; }
 
 	/**
diff --git a/gee/hashset.vala b/gee/hashset.vala
index dcf7ad0..21fefdc 100644
--- a/gee/hashset.vala
+++ b/gee/hashset.vala
@@ -56,11 +56,13 @@ public class Gee.HashSet<G> : AbstractSet<G> {
 	/**
 	 * The elements' hash function.
 	 */
+	[CCode (notify = false)]
 	public HashDataFunc<G> hash_func { private set; get; }
 
 	/**
 	 * The elements' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<G> equal_func { private set; get; }
 
 	private int _array_size;
diff --git a/gee/linkedlist.vala b/gee/linkedlist.vala
index 74976b9..2877e32 100644
--- a/gee/linkedlist.vala
+++ b/gee/linkedlist.vala
@@ -41,6 +41,7 @@ public class Gee.LinkedList<G> : AbstractBidirList<G>, Queue<G>, Deque<G> {
 	/**
 	 * The elements' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<G> equal_func { private set; get; }
 
 	/**
diff --git a/gee/priorityqueue.vala b/gee/priorityqueue.vala
index a78d695..ba8b185 100644
--- a/gee/priorityqueue.vala
+++ b/gee/priorityqueue.vala
@@ -44,6 +44,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	/**
 	 * The elements' comparator function.
 	 */
+	[CCode (notify = false)]
 	public CompareDataFunc<G> compare_func { private set; get; }
 
 	private int _size = 0;
diff --git a/gee/treemap.vala b/gee/treemap.vala
index 7d03111..c2093d7 100644
--- a/gee/treemap.vala
+++ b/gee/treemap.vala
@@ -91,11 +91,13 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 	/**
 	 * The keys' comparator function.
 	 */
+	[CCode (notify = false)]
 	public CompareDataFunc<K> key_compare_func { private set; get; }
 
 	/**
 	 * The values' equality testing function.
 	 */
+	[CCode (notify = false)]
 	public EqualDataFunc<V> value_equal_func { private set; get; }
 
 	private int _size = 0;
@@ -962,7 +964,9 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 	}
 
 	private class SubKeySet<K,V> : AbstractBidirSortedSet<K> {
+		[CCode (notify = false)]
 		public TreeMap<K,V> map { private set; get; }
+		[CCode (notify = false)]
 		public Range<K,V> range { private set; get; }
 
 		public SubKeySet (TreeMap<K,V> map, Range<K,V> range) {
@@ -1121,7 +1125,9 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 	}
 
 	private class SubValueCollection<K,V> : AbstractCollection<V> {
+		[CCode (notify = false)]
 		public TreeMap<K,V> map { private set; get; }
+		[CCode (notify = false)]
 		public Range<K,V> range { private set; get; }
 
 		public SubValueCollection (TreeMap<K,V> map, Range<K,V> range) {
@@ -1264,7 +1270,9 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 	}
 
 	private class SubEntrySet<K,V> : AbstractBidirSortedSet<Map.Entry<K,V>> {
+		[CCode (notify = false)]
 		public TreeMap<K,V> map { private set; get; }
+		[CCode (notify = false)]
 		public Range<K,V> range { private set; get; }
 
 		public SubEntrySet (TreeMap<K,V> map, Range<K,V> range) {
diff --git a/gee/treemultimap.vala b/gee/treemultimap.vala
index 4f1e772..51f1f43 100644
--- a/gee/treemultimap.vala
+++ b/gee/treemultimap.vala
@@ -29,6 +29,7 @@ public class Gee.TreeMultiMap<K,V> : AbstractMultiMap<K,V> {
 		get { return ((TreeMap<K, Set<V>>) _storage_map).key_compare_func; }
 	}
 
+	[CCode (notify = false)]
 	public CompareDataFunc<V> value_compare_func { private set; get; }
 
 	/**
diff --git a/gee/treeset.vala b/gee/treeset.vala
index 08ed5b6..8773da1 100644
--- a/gee/treeset.vala
+++ b/gee/treeset.vala
@@ -50,6 +50,7 @@ public class Gee.TreeSet<G> : AbstractBidirSortedSet<G> {
 	/**
 	 * The elements' comparator function.
 	 */
+	[CCode (notify = false)]
 	public CompareDataFunc<G> compare_func { private set; get; }
 
 	private int _size = 0;
diff --git a/tests/testcase.vala b/tests/testcase.vala
index 10ad088..83a37ae 100644
--- a/tests/testcase.vala
+++ b/tests/testcase.vala
@@ -52,7 +52,7 @@ public abstract class Gee.TestCase : Object {
 	}
 
 	private class Adaptor {
-
+		[CCode (notify = false)]
 		public string name { get; private set; }
 		private TestMethod test;
 		private TestCase test_case;