1 files changed, 6 insertions, 6 deletions

diff --git a/gee/treemap.vala b/gee/treemap.vala
index c8db122..d151d27 100644
--- a/gee/treemap.vala
+++ b/gee/treemap.vala
@@ -887,7 +887,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 			}
 		}
 
-		public override SortedSet<K> ascending_entries {
+		public override SortedSet<Map.Entry<K, V>> ascending_entries {
 			owned get {
 				var entries = _entries;
 				if (_entries == null) {
@@ -1262,7 +1262,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 			return new SubEntrySet<K,V> (_map, new Range<K,V>.tail (_map, after.key));
 		}
 
-		public override SortedSet<K> sub_set (Map.Entry<K, V> after, Map.Entry<K, V> before) {
+		public override SortedSet<Map.Entry<K, V>> sub_set (Map.Entry<K, V> after, Map.Entry<K, V> before) {
 			return new SubEntrySet<K,V> (_map, new Range<K,V> (_map, after.key, before.key));
 		}
 
@@ -1343,7 +1343,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 			return range.in_range(entry.key) && map.has (entry.key, entry.value);
 		}
 
-		public override BidirIterator<K> bidir_iterator () {
+		public override BidirIterator<Map.Entry<K, V>> bidir_iterator () {
 			return new SubEntryIterator<K,V> (map, range);
 		}
 
@@ -1359,15 +1359,15 @@ public class Gee.TreeMap<K,V> : Gee.AbstractBidirSortedMap<K,V> {
 			return Entry.entry_for<K,V> (_last);
 		}
 
-		public override SortedSet<K> head_set (Map.Entry<K,V> before) {
+		public override SortedSet<Map.Entry<K, V>> head_set (Map.Entry<K,V> before) {
 			return new SubEntrySet<K,V> (map, range.cut_tail (before.key));
 		}
 
-		public override SortedSet<K> tail_set (Map.Entry<K,V> after) {
+		public override SortedSet<Map.Entry<K, V>> tail_set (Map.Entry<K,V> after) {
 			return new SubEntrySet<K,V> (map, range.cut_head (after.key));
 		}
 
-		public override SortedSet<K> sub_set (Map.Entry<K,V> after, Map.Entry<K,V> before) {
+		public override SortedSet<Map.Entry<K, V>> sub_set (Map.Entry<K,V> after, Map.Entry<K,V> before) {
 			return new SubEntrySet<K,V> (map, range.cut (after.key, before.key));
 		}