avl.h File Reference

AVL tree implementation. More...

#include "libsapling/dm/graph.h"
#include "libsapling/dm/typed/typed_avl.h"

Go to the source code of this file.

Functions
void *	avl__data (const node_t node)
void	avl__access (enum qt qt, node_t *ref, void *info, predicate_t predicate, apply_t apply, cmp_t comparator)
void	avl__insert (node_t *ref, void *info, predicate_t predicate, cmp_t comparator)
void	avl__delete (node_t *ref, void *info, predicate_t predicate, cmp_t comparator)
void	avl__print (FILE *stream, node_t *ref, fpfdata_t fpfdata)
void	avl__dump_dot (FILE *stream, node_t *ref, fpfdata_t fpfdata)
int	avl__length (const node_t *ref)

Detailed Description

AVL tree implementation.

See also

graph.h

Attention

• With universal quantification the nodes are visited in inorder.
• The comparator only needs to be specified with existential quantification, otherwise it can just be left as NULL.
• Deletion with universal quantification is not defined for this implementation.