# HG changeset patch
# User stefano
# Date 1241910140 0
# Node ID ac8ea47c8d7e5e052404bf6548a57d3485d29c52
# Parent  6676b1979b688bf15ace8e91c16eadd3a4ec88cd
Add @code/@endcode commands to markup C code in av_tree_insert() doxy.

diff -r 6676b1979b68 -r ac8ea47c8d7e tree.h
--- a/tree.h	Sat May 09 23:00:46 2009 +0000
+++ b/tree.h	Sat May 09 23:02:20 2009 +0000
@@ -61,6 +61,7 @@
  *             This allows the use of flat arrays, which have
  *             lower overhead compared to many malloced elements.
  *             You might want to define a function like:
+ *             @code
  *             void *tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b), AVTreeNode **next){
  *                 if(!*next) *next= av_mallocz(av_tree_node_size);
  *                 return av_tree_insert(rootp, key, cmp, next);
@@ -69,7 +70,7 @@
  *                 if(*next) av_freep(next);
  *                 return av_tree_insert(rootp, key, cmp, next);
  *             }
- *
+ *             @endcode
  * @return If no insertion happened, the found element; if an insertion or
  *         removal happened, then either key or NULL will be returned.
  *         Which one it is depends on the tree state and the implementation. You