You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

59 lines
2.2KB

  1. /*
  2. * copyright (c) 2006 Michael Niedermayer <michaelni@gmx.at>
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with FFmpeg; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. /**
  21. * @file tree.h
  22. * A tree container.
  23. * @author Michael Niedermayer <michaelni@gmx.at>
  24. */
  25. #ifndef TREE_H
  26. #define TREE_H
  27. struct AVTreeNode;
  28. /**
  29. * Finds an element.
  30. * @param root a pointer to the root node of the tree
  31. * @param next If next is not NULL then next[0] will contain the previous
  32. * element and next[1] the next element if either does not exist
  33. * then the corresponding entry in next is unchanged.
  34. * @return An element with cmp(key, elem)==0 or NULL if no such element exists in
  35. * the tree.
  36. */
  37. void *av_tree_find(const struct AVTreeNode *root, void *key, int (*cmp)(void *key, const void *b), void *next[2]);
  38. /**
  39. * Finds a element for which cmp(key, elem)==0, if no such element is found key
  40. * is inserted into the tree.
  41. * @param rootp A pointer to a pointer to the root node of the tree. Note that
  42. * the root node can change during insertions, this is required
  43. * to keep the tree balanced.
  44. *
  45. * @return If no insertion happened, the found element.
  46. * If an insertion happened, then either key or NULL will be returned.
  47. * Which one it is depends on the tree state and the implementation. You
  48. * should make no assumptions that it's one or the other in the code.
  49. */
  50. void *av_tree_insert(struct AVTreeNode **rootp, void *key, int (*cmp)(void *key, const void *b));
  51. void av_tree_destroy(struct AVTreeNode *t);
  52. #endif /* TREE_H */