virtualenv/FFmpeg
1
0
Fork 0
mirror of https://github.com/FFmpeg/FFmpeg.git synced 2025-01-24 13:56:33 +02:00
Code Issues Releases Activity

Add @code/@endcode commands to markup C code in av_tree_insert() doxy.

Browse Source 
Originally committed as revision 18776 to svn://svn.ffmpeg.org/ffmpeg/trunk
This commit is contained in:
Stefano Sabatini 2009-05-09 23:02:20 +00:00
parent 9c5a4ea28c
commit 7a79e51cd6
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
libavutil/tree.h
View File

@ -61,6 +61,7 @@ void *av_tree_find(const struct AVTreeNode *root, void *key, int (*cmp)(void *ke
* This allows the use of flat arrays, which have * This allows the use of flat arrays, which have
* lower overhead compared to many malloced elements. * lower overhead compared to many malloced elements.
* You might want to define a function like: * 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){ * 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); * if(!*next) *next= av_mallocz(av_tree_node_size);
* return av_tree_insert(rootp, key, cmp, next); * return av_tree_insert(rootp, key, cmp, next);
@ -69,7 +70,7 @@ void *av_tree_find(const struct AVTreeNode *root, void *key, int (*cmp)(void *ke
* if(*next) av_freep(next); * if(*next) av_freep(next);
* return av_tree_insert(rootp, key, cmp, next); * return av_tree_insert(rootp, key, cmp, next);
* } * }
* * @endcode
* @return If no insertion happened, the found element; if an insertion or * @return If no insertion happened, the found element; if an insertion or
* removal happened, then either key or NULL will be returned. * removal happened, then either key or NULL will be returned.
* Which one it is depends on the tree state and the implementation. You * Which one it is depends on the tree state and the implementation. You