Revision e4a4c870

View differences:

libavutil/tree.h
18 18
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 19
 */
20 20

  
21
/**
22
 * @file tree.h
23
 * A tree container.
24
 * @author Michael Niedermayer <michaelni@gmx.at>
25
 */
26

  
21 27
#ifndef TREE_H
22 28
#define TREE_H
23 29

  
......
42 48
 *              to keep the tree balanced.
43 49
 *
44 50
 * @return If no insertion happened, the found element.
45
 *         If an insertion happened, then either key or NULL is returned (which
46
 *         one it is depends on the tree state and the implementation, you
47
 *         should make no assumptions that it's one or the other in the code).
51
 *         If an insertion happened, then either key or NULL will be returned.
52
 *         Which one it is depends on the tree state and the implementation. You
53
 *         should make no assumptions that it's one or the other in the code.
48 54
 */
49 55
void *av_tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b));
50 56
void av_tree_destroy(struct AVTreeNode *t);

Also available in: Unified diff