trie: Add a function to get an arbitrary leaf

This is useful if the stored values need to be cleaned up.

1 files changed, 10 insertions, 0 deletions

diff --git a/trie.h b/trie.h
index fcdd630..48f69cc 100644
--- a/trie.h
+++ b/trie.h
@@ -54,6 +54,16 @@ struct trie_leaf {
 void trie_init(struct trie *trie);
 
 /**
+ * Get the first (lexicographically earliest) leaf in the trie.
+ *
+ * @param trie
+ *         The trie to search.
+ * @return
+ *         The first leaf, or NULL if the trie is empty.
+ */
+struct trie_leaf *trie_first_leaf(const struct trie *trie);
+
+/**
  * Find the leaf for a string key.
  *
  * @param trie