2006-11-14 03:02:30 +02:00
|
|
|
/*
|
|
|
|
* copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
*
|
|
|
|
* This file is part of FFmpeg.
|
|
|
|
*
|
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef TREE_H
|
|
|
|
#define TREE_H
|
|
|
|
|
|
|
|
struct AVTreeNode;
|
2006-11-30 14:00:29 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Finds an element.
|
|
|
|
* @param root a pointer to the root node of the tree
|
2007-02-27 02:16:39 +02:00
|
|
|
* @param next If next is not NULL then next[0] will contain the previous
|
|
|
|
* element and next[1] the next element if either does not exist
|
|
|
|
* then the corresponding entry in next is unchanged.
|
|
|
|
* @return An element with cmp(key, elem)==0 or NULL if no such element exists in
|
|
|
|
* the tree.
|
2006-11-30 14:00:29 +02:00
|
|
|
*/
|
|
|
|
void *av_tree_find(const struct AVTreeNode *root, void *key, int (*cmp)(void *key, const void *b), void *next[2]);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Finds a element for which cmp(key, elem)==0, if no such element is found key
|
|
|
|
* is inserted into the tree.
|
2007-02-27 02:16:39 +02:00
|
|
|
* @param rootp A pointer to a pointer to the root node of the tree. Note that
|
|
|
|
* the root node can change during insertions, this is required
|
|
|
|
* to keep the tree balanced.
|
2006-11-30 14:00:29 +02:00
|
|
|
*
|
2007-02-27 02:16:39 +02:00
|
|
|
* @return If no insertion happened, the found element.
|
|
|
|
* If an insertion happened, then either key or NULL is returned (which
|
|
|
|
* one it is depends on the tree state and the implementation, you
|
|
|
|
* should make no assumptions that it's one or the other in the code).
|
2006-11-30 14:00:29 +02:00
|
|
|
*/
|
|
|
|
void *av_tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b));
|
2006-11-14 03:02:30 +02:00
|
|
|
void av_tree_destroy(struct AVTreeNode *t);
|
|
|
|
|
|
|
|
#endif /* TREE_H */
|