Write @arg instead of @param arg in doc comments

1 files changed, 16 insertions, 16 deletions

diff --git a/src/trie.h b/src/trie.h
index 8f7f94b..318a23b 100644
--- a/src/trie.h
+++ b/src/trie.h
@@ -46,9 +46,9 @@ void trie_init(struct trie *trie);
 /**
  * Find the leaf for a string key.
  *
- * @param trie
+ * @trie
  *         The trie to search.
- * @param key
+ * @key
  *         The key to look up.
  * @return
  *         The found leaf, or NULL if the key is not present.
@@ -58,11 +58,11 @@ struct trie_leaf *trie_find_str(const struct trie *trie, const char *key);
 /**
  * Find the leaf for a fixed-size key.
  *
- * @param trie
+ * @trie
  *         The trie to search.
- * @param key
+ * @key
  *         The key to look up.
- * @param length
+ * @length
  *         The length of the key in bytes.
  * @return
  *         The found leaf, or NULL if the key is not present.
@@ -72,9 +72,9 @@ struct trie_leaf *trie_find_mem(const struct trie *trie, const void *key, size_t
 /**
  * Find the shortest leaf that starts with a given key.
  *
- * @param trie
+ * @trie
  *         The trie to search.
- * @param key
+ * @key
  *         The key to look up.
  * @return
  *         A leaf that starts with the given key, or NULL.
@@ -84,9 +84,9 @@ struct trie_leaf *trie_find_postfix(const struct trie *trie, const char *key);
 /**
  * Find the leaf that is the longest prefix of the given key.
  *
- * @param trie
+ * @trie
  *         The trie to search.
- * @param key
+ * @key
  *         The key to look up.
  * @return
  *         The longest prefix match for the given key, or NULL.
@@ -96,9 +96,9 @@ struct trie_leaf *trie_find_prefix(const struct trie *trie, const char *key);
 /**
  * Insert a string key into the trie.
  *
- * @param trie
+ * @trie
  *         The trie to modify.
- * @param key
+ * @key
  *         The key to insert.
  * @return
  *         The inserted leaf, or NULL on failure.
@@ -108,11 +108,11 @@ struct trie_leaf *trie_insert_str(struct trie *trie, const char *key);
 /**
  * Insert a fixed-size key into the trie.
  *
- * @param trie
+ * @trie
  *         The trie to modify.
- * @param key
+ * @key
  *         The key to insert.
- * @param length
+ * @length
  *         The length of the key in bytes.
  * @return
  *         The inserted leaf, or NULL on failure.
@@ -122,9 +122,9 @@ struct trie_leaf *trie_insert_mem(struct trie *trie, const void *key, size_t len
 /**
  * Remove a leaf from a trie.
  *
- * @param trie
+ * @trie
  *         The trie to modify.
- * @param leaf
+ * @leaf
  *         The leaf to remove.
  */
 void trie_remove(struct trie *trie, struct trie_leaf *leaf);