X-Git-Url: https://git.sesse.net/?a=blobdiff_plain;f=libavutil%2Ftree.h;h=81610b6b791f0a870f8899d45051a3995140670a;hb=4121148388f4fd02ace89eca364904d3ea8bcfe7;hp=8c7de2ffbf8bb35f6739e6a6a3404daf3e98549b;hpb=c5db8b4d09762f5228eaf3c3a0017657ed27d866;p=ffmpeg

diff --git a/libavutil/tree.h b/libavutil/tree.h
index 8c7de2ffbf8..81610b6b791 100644
--- a/libavutil/tree.h
+++ b/libavutil/tree.h
@@ -21,14 +21,24 @@
 /**
  * @file
  * A tree container.
- * Insertion, removal, finding equal, largest which is smaller than and
- * smallest which is larger than, all have O(log n) worst case complexity.
  * @author Michael Niedermayer <michaelni@gmx.at>
  */
 
 #ifndef AVUTIL_TREE_H
 #define AVUTIL_TREE_H
 
+/**
+ * @addtogroup lavu_tree AVTree
+ * @ingroup lavu_data
+ *
+ * Low complexity tree container
+ *
+ * Insertion, removal, finding equal, largest which is smaller than and
+ * smallest which is larger than, all have O(log n) worst case complexity.
+ * @{
+ */
+
+
 struct AVTreeNode;
 extern const int av_tree_node_size;
 
@@ -91,5 +101,8 @@ void av_tree_destroy(struct AVTreeNode *t);
  */
 void av_tree_enumerate(struct AVTreeNode *t, void *opaque, int (*cmp)(void *opaque, void *elem), int (*enu)(void *opaque, void *elem));
 
+/**
+ * @}
+ */
 
 #endif /* AVUTIL_TREE_H */