[libgee] Remove unused inherited interface declarations

[Didier 'Ptitjes' Villevalois <dvillevalois src gnome org>]

commit 644a544a18c1372a4f03780e7919dbac9437cb97
Author: Didier 'Ptitjes <ptitjes free fr>
Date:   Fri Jul 31 14:50:47 2009 +0200

    Remove unused inherited interface declarations

 gee/arraylist.vala  |    2 +-
 gee/hashmap.vala    |    4 ++--
 gee/hashset.vala    |    2 +-
 gee/linkedlist.vala |    2 +-
 gee/treemap.vala    |    4 ++--
 gee/treeset.vala    |    2 +-
 6 files changed, 8 insertions(+), 8 deletions(-)
---
diff --git a/gee/arraylist.vala b/gee/arraylist.vala
index 3fc2134..f898002 100644
--- a/gee/arraylist.vala
+++ b/gee/arraylist.vala
@@ -27,7 +27,7 @@ using GLib;
 /**
  * Arrays of arbitrary elements which grow automatically as elements are added.
  */
-public class Gee.ArrayList<G> : AbstractCollection<G>, Iterable<G>, Collection<G>, List<G> {
+public class Gee.ArrayList<G> : AbstractCollection<G>, List<G> {
 	public override int size {
 		get { return _size; }
 	}
diff --git a/gee/hashmap.vala b/gee/hashmap.vala
index d06677d..fe895da 100644
--- a/gee/hashmap.vala
+++ b/gee/hashmap.vala
@@ -177,7 +177,7 @@ public class Gee.HashMap<K,V> : Object, Map<K,V> {
 		}
 	}
 
-	private class KeySet<K,V> : AbstractCollection<K>, Iterable<K>, Collection<K>, Set<K> {
+	private class KeySet<K,V> : AbstractCollection<K>, Set<K> {
 		public HashMap<K,V> map { construct; get; }
 
 		public KeySet (HashMap map) {
@@ -246,7 +246,7 @@ public class Gee.HashMap<K,V> : Object, Map<K,V> {
 		}
 	}
 
-	private class ValueCollection<K,V> : AbstractCollection<K>, Iterable<V>, Collection<V> {
+	private class ValueCollection<K,V> : AbstractCollection<K> {
 		public HashMap<K,V> map { construct; get; }
 
 		public ValueCollection (HashMap map) {
diff --git a/gee/hashset.vala b/gee/hashset.vala
index f5e1597..b869b29 100644
--- a/gee/hashset.vala
+++ b/gee/hashset.vala
@@ -27,7 +27,7 @@ using GLib;
 /**
  * Hashtable implementation of the Set interface.
  */
-public class Gee.HashSet<G> : AbstractCollection<G>, Iterable<G>, Collection<G>, Set<G> {
+public class Gee.HashSet<G> : AbstractCollection<G>, Set<G> {
 	public override int size {
 		get { return _nnodes; }
 	}
diff --git a/gee/linkedlist.vala b/gee/linkedlist.vala
index 7961329..220510c 100644
--- a/gee/linkedlist.vala
+++ b/gee/linkedlist.vala
@@ -27,7 +27,7 @@
 /**
  * A Gee.List implementation, using a doubly-linked list.
  */
-public class Gee.LinkedList<G> : AbstractCollection<G>, Iterable<G>, Collection<G>, List<G> {
+public class Gee.LinkedList<G> : AbstractCollection<G>, List<G> {
 	private int _size = 0;
 	private int _stamp = 0;
 	private Node? _head = null;
diff --git a/gee/treemap.vala b/gee/treemap.vala
index cfe6e9d..1c9bb86 100644
--- a/gee/treemap.vala
+++ b/gee/treemap.vala
@@ -295,7 +295,7 @@ public class Gee.TreeMap<K,V> : Object, Map<K,V> {
 	private weak Node<K, V>? first;
 	private int stamp = 0;
 
-	private class KeySet<K,V> : AbstractCollection<K>, Iterable<K>, Collection<K>, Set<K> {
+	private class KeySet<K,V> : AbstractCollection<K>, Set<K> {
 		public TreeMap<K,V> map { construct; get; }
 
 		public KeySet (TreeMap<K,V> map) {
@@ -327,7 +327,7 @@ public class Gee.TreeMap<K,V> : Object, Map<K,V> {
 		}
 	}
 
-	private class ValueCollection<K,V> : AbstractCollection<V>, Iterable<V>, Collection<V> {
+	private class ValueCollection<K,V> : AbstractCollection<V> {
 		public TreeMap<K,V> map { construct; get; }
 
 		public ValueCollection (TreeMap map) {
diff --git a/gee/treeset.vala b/gee/treeset.vala
index cf982c0..31f9876 100644
--- a/gee/treeset.vala
+++ b/gee/treeset.vala
@@ -25,7 +25,7 @@ using GLib;
 /**
  * Left-leaning red-black tree implementation of the Set interface.
  */
-public class Gee.TreeSet<G> : AbstractCollection<G>, Iterable<G>, Collection<G>, Set<G> {
+public class Gee.TreeSet<G> : AbstractCollection<G>, Set<G> {
 	public override int size {
 		get {return _size;}
 	}