[libgee] Fix { inheritDoc} tags

[Didier Villevalois <dvillevalois src gnome org>]

commit c6f9a1be0dd678b8eea5d2936b08f886aed77d94
Author: Didier 'Ptitjes <ptitjes free fr>
Date:   Sat Sep 26 18:11:43 2009 +0200

    Fix { inheritDoc} tags

 gee/abstractcollection.vala |   28 ++++++++++----------
 gee/abstractlist.vala       |   24 ++++++++--------
 gee/abstractmap.vala        |   48 +++++++++++++++++-----------------
 gee/abstractqueue.vala      |   14 +++++-----
 gee/abstractset.vala        |    2 +-
 gee/arraylist.vala          |   28 ++++++++++----------
 gee/hashmap.vala            |   22 ++++++++--------
 gee/hashset.vala            |   12 ++++----
 gee/linkedlist.vala         |   60 +++++++++++++++++++++---------------------
 gee/priorityqueue.vala      |   26 +++++++++---------
 gee/readonlycollection.vala |   14 +++++-----
 gee/readonlylist.vala       |   14 +++++-----
 gee/readonlymap.vala        |   32 +++++++++++-----------
 gee/treemap.vala            |   22 ++++++++--------
 gee/treeset.vala            |   26 +++++++++---------
 15 files changed, 186 insertions(+), 186 deletions(-)
---
diff --git a/gee/abstractcollection.vala b/gee/abstractcollection.vala
index 9e70913..8ac10fa 100644
--- a/gee/abstractcollection.vala
+++ b/gee/abstractcollection.vala
@@ -31,39 +31,39 @@
 public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collection<G> {
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int size { get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool is_empty {
 		get { return size == 0; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool contains (G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool add (G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool remove (G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract void clear ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual G[] to_array() {
 		G[] array = new G[size];
@@ -75,7 +75,7 @@ public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collectio
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool add_all (Collection<G> collection) {
 		if (collection.is_empty) {
@@ -90,7 +90,7 @@ public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collectio
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool contains_all (Collection<G> collection) {
 		if (collection.size > size) {
@@ -106,7 +106,7 @@ public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collectio
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool remove_all (Collection<G> collection) {
 		bool changed = false;
@@ -117,7 +117,7 @@ public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collectio
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool retain_all (Collection<G> collection) {
 		bool changed = false;
@@ -132,21 +132,21 @@ public abstract class Gee.AbstractCollection<G> : Object, Iterable<G>, Collectio
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type element_type {
 		get { return typeof (G); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract Iterator<G> iterator ();
 
 	private weak Collection<G> _read_only_view;
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual Collection<G> read_only_view {
 		owned get {
diff --git a/gee/abstractlist.vala b/gee/abstractlist.vala
index 6c982a3..d0b189c 100644
--- a/gee/abstractlist.vala
+++ b/gee/abstractlist.vala
@@ -32,56 +32,56 @@
 public abstract class Gee.AbstractList<G> : Gee.AbstractCollection<G>, List<G> {
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract ListIterator<G> list_iterator ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract new G? get (int index);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract new void set (int index, G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int index_of (G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract void insert (int index, G item);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract G remove_at (int index);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract List<G>? slice (int start, int stop);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual G first () {
 		return get (0);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual G last () {
 		return get (size - 1);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual void insert_all (int index, Collection<G> collection) {
 		foreach (G item in collection) {
@@ -91,7 +91,7 @@ public abstract class Gee.AbstractList<G> : Gee.AbstractCollection<G>, List<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public void sort (CompareFunc? compare = null) {
 		if (compare == null) {
@@ -103,7 +103,7 @@ public abstract class Gee.AbstractList<G> : Gee.AbstractCollection<G>, List<G> {
 	private weak List<G> _read_only_view;
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual new List<G> read_only_view {
 		owned get {
diff --git a/gee/abstractmap.vala b/gee/abstractmap.vala
index ad6e764..fd350bd 100644
--- a/gee/abstractmap.vala
+++ b/gee/abstractmap.vala
@@ -33,71 +33,71 @@
 public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V> {
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int size { get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool is_empty {
 		get { return size == 0; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract Set<K> keys { owned get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract Collection<V> values { owned get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract Set<Map.Entry<K,V>> entries { owned get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool has_key (K key);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains (K key) {
 		return has_key (key);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool has (K key, V value);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract new V? get (K key);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract new void set (K key, V value);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool unset (K key, out V? value = null);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract MapIterator<K,V> map_iterator ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool remove (K key, out V? value = null) {
 		V removed_value;
@@ -109,12 +109,12 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract void clear ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual void set_all (Map<K,V> map) {
 		foreach (Map.Entry<K,V> entry in map.entries) {
@@ -123,7 +123,7 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool unset_all (Map<K,V> map) {
 		bool changed = false;
@@ -134,14 +134,14 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool remove_all (Map<K,V> map) {
 		return unset_all (map);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual bool has_all (Map<K,V> map) {
 		foreach (Map.Entry<K,V> entry in map.entries) {
@@ -153,7 +153,7 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains_all (Map<K,V> map) {
 		return has_all (map);
@@ -162,7 +162,7 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	private weak Map<K,V> _read_only_view;
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual Map<K,V> read_only_view {
 		owned get {
@@ -177,28 +177,28 @@ public abstract class Gee.AbstractMap<K,V> : Object, Iterable<Map.Entry<K,V>>, M
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type key_type {
 		get { return typeof (K); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type value_type {
 		get { return typeof (V); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type element_type {
 		get { return typeof (Map.Entry<K,V>); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Iterator<Map.Entry<K,V>> iterator () {
 		return entries.iterator ();
diff --git a/gee/abstractqueue.vala b/gee/abstractqueue.vala
index 3cc9cca..1ec1fa7 100644
--- a/gee/abstractqueue.vala
+++ b/gee/abstractqueue.vala
@@ -29,37 +29,37 @@
  */
 public abstract class Gee.AbstractQueue<G> : Gee.AbstractCollection<G>, Queue<G> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int capacity { get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int remaining_capacity { get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool is_full { get; }
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract bool offer (G element);
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract G? peek ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract G? poll ();
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public abstract int drain (Collection<G> recipient, int amount = -1);
 }
diff --git a/gee/abstractset.vala b/gee/abstractset.vala
index ed386f7..67245af 100644
--- a/gee/abstractset.vala
+++ b/gee/abstractset.vala
@@ -34,7 +34,7 @@ public abstract class Gee.AbstractSet<G> : Gee.AbstractCollection<G>, Set<G> {
 	private weak Set<G> _read_only_view;
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual new Set<G> read_only_view {
 		owned get {
diff --git a/gee/arraylist.vala b/gee/arraylist.vala
index f3f4ab3..420dcee 100644
--- a/gee/arraylist.vala
+++ b/gee/arraylist.vala
@@ -39,7 +39,7 @@ using GLib;
  */
 public class Gee.ArrayList<G> : AbstractList<G> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return _size; }
@@ -69,28 +69,28 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.Iterator<G> iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override ListIterator<G> list_iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool contains (G item) {
 		return (index_of (item) != -1);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int index_of (G item) {
 		for (int index = 0; index < _size; index++) {
@@ -102,7 +102,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G get (int index) {
 		assert (index >= 0);
@@ -112,7 +112,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void set (int index, G item) {
 		assert (index >= 0);
@@ -122,7 +122,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool add (G item) {
 		if (_size == _items.length) {
@@ -134,7 +134,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void insert (int index, G item) {
 		assert (index >= 0);
@@ -149,7 +149,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool remove (G item) {
 		for (int index = 0; index < _size; index++) {
@@ -162,7 +162,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G remove_at (int index) {
 		assert (index >= 0);
@@ -178,7 +178,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		for (int index = 0; index < _size; index++) {
@@ -189,7 +189,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override List<G>? slice (int start, int stop) {
 		return_val_if_fail (start <= stop, null);
@@ -205,7 +205,7 @@ public class Gee.ArrayList<G> : AbstractList<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool add_all (Collection<G> collection) {
 		if (collection.is_empty) {
diff --git a/gee/hashmap.vala b/gee/hashmap.vala
index 66b2679..34b19f7 100644
--- a/gee/hashmap.vala
+++ b/gee/hashmap.vala
@@ -35,14 +35,14 @@ using GLib;
  */
 public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return _nnodes; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Set<K> keys {
 		owned get {
@@ -57,7 +57,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Collection<V> values {
 		owned get {
@@ -72,7 +72,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Set<Map.Entry<K,V>> entries {
 		owned get {
@@ -150,7 +150,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool has_key (K key) {
 		Node<K,V>** node = lookup_node (key);
@@ -158,7 +158,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool has (K key, V value) {
 		Node<K,V>** node = lookup_node (key);
@@ -166,7 +166,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override V? get (K key) {
 		Node<K,V>* node = (*lookup_node (key));
@@ -178,7 +178,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void set (K key, V value) {
 		Node<K,V>** node = lookup_node (key);
@@ -194,7 +194,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool unset (K key, out V? value = null) {
 		Node<K,V>** node = lookup_node (key);
@@ -220,7 +220,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		for (int i = 0; i < _array_size; i++) {
@@ -237,7 +237,7 @@ public class Gee.HashMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.MapIterator<K,V> map_iterator () {
 		return new MapIterator<K,V> (this);
diff --git a/gee/hashset.vala b/gee/hashset.vala
index f3922c4..2dc97ed 100644
--- a/gee/hashset.vala
+++ b/gee/hashset.vala
@@ -35,7 +35,7 @@ using GLib;
  */
 public class Gee.HashSet<G> : AbstractSet<G> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return _nnodes; }
@@ -90,7 +90,7 @@ public class Gee.HashSet<G> : AbstractSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool contains (G key) {
 		Node<G>** node = lookup_node (key);
@@ -98,14 +98,14 @@ public class Gee.HashSet<G> : AbstractSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.Iterator<G> iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool add (G key) {
 		Node<G>** node = lookup_node (key);
@@ -122,7 +122,7 @@ public class Gee.HashSet<G> : AbstractSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool remove (G key) {
 		Node<G>** node = lookup_node (key);
@@ -144,7 +144,7 @@ public class Gee.HashSet<G> : AbstractSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		for (int i = 0; i < _array_size; i++) {
diff --git a/gee/linkedlist.vala b/gee/linkedlist.vala
index e021ee8..efa2912 100644
--- a/gee/linkedlist.vala
+++ b/gee/linkedlist.vala
@@ -56,35 +56,35 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.Iterator<G> iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override ListIterator<G> list_iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return this._size; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool contains (G item) {
 		return this.index_of (item) != -1;
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool add (G item) {
 		Node<G> n = new Node<G> (item);
@@ -104,7 +104,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool remove (G item) { // Should remove only the first occurence (a test should be added)
 		for (Node<G> n = this._head; n != null; n = n.next) {
@@ -117,7 +117,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		++this._stamp;
@@ -126,7 +126,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G get (int index) {
 		assert (index >= 0);
@@ -138,7 +138,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void set (int index, G item) {
 		assert (index >= 0);
@@ -150,7 +150,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int index_of (G item) {
 		int result = -1;
@@ -167,7 +167,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void insert (int index, G item) {
 		assert (index >= 0);
@@ -200,7 +200,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G remove_at (int index) {
 		assert (index >= 0);
@@ -214,7 +214,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override List<G>? slice (int start, int stop) {
 		return_val_if_fail (start <= stop, null);
@@ -232,7 +232,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G first () {
 		assert (_size > 0);
@@ -240,7 +240,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G last () {
 		assert (_size > 0);
@@ -248,56 +248,56 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int capacity {
 		get { return UNBOUNDED_CAPACITY; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int remaining_capacity {
 		get { return UNBOUNDED_CAPACITY; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool is_full {
 		get { return false; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool offer (G element) {
 		return offer_tail (element);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? peek () {
 		return peek_head ();
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? poll () {
 		return poll_head ();
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int drain (Collection<G> recipient, int amount = -1) {
 		return drain_head (recipient, amount);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool offer_head (G element) {
 		insert (0, element);
@@ -305,7 +305,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? peek_head () {
 		if (this._size == 0) {
@@ -315,7 +315,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? poll_head () {
 		if (this._size == 0) {
@@ -325,7 +325,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int drain_head (Collection<G> recipient, int amount = -1) {
 		if (amount == -1) {
@@ -341,14 +341,14 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool offer_tail (G element) {
 		return add (element);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? peek_tail () {
 		if (this._size == 0) {
@@ -358,7 +358,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? poll_tail () {
 		if (this._size == 0) {
@@ -368,7 +368,7 @@ public class Gee.LinkedList<G> : AbstractList<G>, Queue<G>, Deque<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int drain_tail (Collection<G> recipient, int amount = -1) {
 		if (amount == -1) {
diff --git a/gee/priorityqueue.vala b/gee/priorityqueue.vala
index ae47969..3c1661f 100644
--- a/gee/priorityqueue.vala
+++ b/gee/priorityqueue.vala
@@ -68,28 +68,28 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int capacity {
 		get { return UNBOUNDED_CAPACITY; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int remaining_capacity {
 		get { return UNBOUNDED_CAPACITY; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool is_full {
 		get { return false; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool offer (G element) {
 		if (_r == null) {
@@ -113,7 +113,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G? peek () {
 		if (_r == null) {
@@ -123,7 +123,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override G? poll () {
 		#if DEBUG
@@ -236,7 +236,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int drain (Collection<G> recipient, int amount = -1) {
 		if (amount == -1) {
@@ -252,14 +252,14 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return _size; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool contains (G item) {
 		foreach (G an_item in this) {
@@ -271,14 +271,14 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool add (G item) {
 		return offer (item);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool remove (G item) {
 		#if DEBUG
@@ -297,7 +297,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		_size = 0;
@@ -315,7 +315,7 @@ public class Gee.PriorityQueue<G> : Gee.AbstractQueue<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.Iterator<G> iterator () {
 		return new Iterator<G> (this);
diff --git a/gee/readonlycollection.vala b/gee/readonlycollection.vala
index 3fe34ba..79678cf 100644
--- a/gee/readonlycollection.vala
+++ b/gee/readonlycollection.vala
@@ -34,14 +34,14 @@ using GLib;
 internal class Gee.ReadOnlyCollection<G> : Object, Iterable<G>, Collection<G> {
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int size {
 		get { return _collection.size; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool is_empty {
 		get { return _collection.is_empty; }
@@ -60,21 +60,21 @@ internal class Gee.ReadOnlyCollection<G> : Object, Iterable<G>, Collection<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type element_type {
 		get { return typeof (G); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Gee.Iterator<G> iterator () {
 		return new Iterator<G> (_collection.iterator ());
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains (G item) {
 		return _collection.contains (item);
@@ -109,7 +109,7 @@ internal class Gee.ReadOnlyCollection<G> : Object, Iterable<G>, Collection<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains_all (Collection<G> collection) {
 		return _collection.contains_all (collection);
@@ -130,7 +130,7 @@ internal class Gee.ReadOnlyCollection<G> : Object, Iterable<G>, Collection<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G[] to_array() {
 		return _collection.to_array ();
diff --git a/gee/readonlylist.vala b/gee/readonlylist.vala
index ad85f59..b32c030 100644
--- a/gee/readonlylist.vala
+++ b/gee/readonlylist.vala
@@ -44,14 +44,14 @@ internal class Gee.ReadOnlyList<G> : Gee.ReadOnlyCollection<G>, List<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public ListIterator<G> list_iterator () {
 		return new Iterator<G> (((Gee.List<G>) _collection).list_iterator ());
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int index_of (G item) {
 		return ((Gee.List<G>) _collection).index_of (item);
@@ -72,7 +72,7 @@ internal class Gee.ReadOnlyList<G> : Gee.ReadOnlyCollection<G>, List<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public new G? get (int index) {
 		return ((Gee.List<G>) _collection).get (index);
@@ -93,14 +93,14 @@ internal class Gee.ReadOnlyList<G> : Gee.ReadOnlyCollection<G>, List<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? first () {
 		return ((Gee.List<G>) _collection).first ();
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G? last () {
 		return ((Gee.List<G>) _collection).last ();
@@ -114,14 +114,14 @@ internal class Gee.ReadOnlyList<G> : Gee.ReadOnlyCollection<G>, List<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public void sort (CompareFunc? compare = null) {
 		assert_not_reached ();
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public virtual new List<G> read_only_view {
 		owned get { return this; }
diff --git a/gee/readonlymap.vala b/gee/readonlymap.vala
index 3bf164b..13bc280 100644
--- a/gee/readonlymap.vala
+++ b/gee/readonlymap.vala
@@ -34,21 +34,21 @@ using GLib;
 internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V> {
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public int size {
 		get { return _map.size; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool is_empty {
 		get { return _map.is_empty; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Set<K> keys {
 		owned get {
@@ -57,7 +57,7 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Collection<V> values {
 		owned get {
@@ -66,7 +66,7 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Set<Map.Entry<K,V>> entries {
 		owned get {
@@ -86,28 +86,28 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool has_key (K key) {
 		return _map.has_key (key);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains (K key) {
 		return _map.has_key (key);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool has (K key, V value) {
 		return _map.has (key, value);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public new V? get (K key) {
 		return _map.get (key);
@@ -142,7 +142,7 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Gee.MapIterator<K,V> map_iterator () {
 		return new MapIterator<K,V> (_map.map_iterator ());
@@ -170,14 +170,14 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool has_all (Map<K,V> map) {
 		return _map.has_all (map);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public bool contains_all (Map<K,V> map) {
 		return _map.has_all (map);
@@ -188,28 +188,28 @@ internal class Gee.ReadOnlyMap<K,V> : Object, Iterable<Map.Entry<K,V>>, Map<K,V>
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type key_type {
 		get { return typeof (K); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type value_type {
 		get { return typeof (V); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Type element_type {
 		get { return typeof (Map.Entry<K,V>); }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public Iterator<Map.Entry<K,V>> iterator () {
 		return entries.iterator ();
diff --git a/gee/treemap.vala b/gee/treemap.vala
index cc61d36..6bd5b08 100644
--- a/gee/treemap.vala
+++ b/gee/treemap.vala
@@ -33,14 +33,14 @@ using GLib;
  */
 public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get { return _size; }
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Set<K> keys {
 		owned get {
@@ -55,7 +55,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Collection<V> values {
 		owned get {
@@ -70,7 +70,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Set<Map.Entry<K,V>> entries {
 		owned get {
@@ -145,7 +145,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool has_key (K key) {
 		weak Node<K, V>? cur = root;
@@ -163,7 +163,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool has (K key, V value) {
 		V? own_value = get (key);
@@ -171,7 +171,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override V? get (K key) {
 		weak Node<K, V>? cur = root;
@@ -213,7 +213,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void set (K key, V value) {
 		set_to_node (ref root, key, value, null, null);
@@ -325,7 +325,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool unset (K key, out V? value = null) {
 		V node_value;
@@ -343,7 +343,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		root = null;
@@ -352,7 +352,7 @@ public class Gee.TreeMap<K,V> : Gee.AbstractMap<K,V> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.MapIterator<K,V> map_iterator () {
 		return new MapIterator<K,V> (this);
diff --git a/gee/treeset.vala b/gee/treeset.vala
index 89ef142..4a4c8f0 100644
--- a/gee/treeset.vala
+++ b/gee/treeset.vala
@@ -34,7 +34,7 @@ using GLib;
  */
 public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override int size {
 		get {return _size;}
@@ -61,7 +61,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool contains (G item) {
 		weak Node<G>? cur = root;
@@ -161,7 +161,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 *
 	 * If the element already exists in the set it will not be added twice.
 	 */
@@ -291,7 +291,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override bool remove (G item) {
 #if CONSISTENCY_CHECKS
@@ -309,7 +309,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override void clear () {
 		root = null;
@@ -318,14 +318,14 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public override Gee.Iterator<G> iterator () {
 		return new Iterator<G> (this);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public BidirIterator<G> bidir_iterator () {
 		return new Iterator<G> (this);
@@ -336,7 +336,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G first () {
 		assert (_first != null);
@@ -344,7 +344,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public G last () {
 		assert (_last != null);
@@ -352,21 +352,21 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public SortedSet<G> head_set (G before) {
 		return new SubSet<G>.head (this, before);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public SortedSet<G> tail_set (G after) {
 		return new SubSet<G>.tail (this, after);
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public SortedSet<G> sub_set (G after, G before) {
 		return new SubSet<G> (this, after, before);
@@ -388,7 +388,7 @@ public class Gee.TreeSet<G> : AbstractSet<G>, SortedSet<G> {
 	}
 
 	/**
-	 * @inheritDoc
+	 * { inheritDoc}
 	 */
 	public BidirIterator<G>? iterator_at (G item) {
 		weak Node<G>? node = find_node (item);