avl-tree.h File Reference

The cdc_avl_tree is a struct and functions that provide an avl tree. More...

#include <cdcontainers/common.h>
#include <cdcontainers/status.h>
#include <assert.h>
#include <stdarg.h>
#include <stdbool.h>

Go to the source code of this file.

Data Structures
struct	cdc_avl_tree_node
	The cdc_avl_tree_node is service struct. More...
struct	cdc_avl_tree
	The cdc_avl_tree is service struct. More...
struct	cdc_avl_tree_iter
	The cdc_avl_tree_iter is service struct. More...
struct	cdc_pair_avl_tree_iter
struct	cdc_pair_avl_tree_iter_bool

Functions
enum cdc_stat	cdc_avl_tree_ctor (struct cdc_avl_tree **t, struct cdc_data_info *info)
	Constructs an empty avl tree. More...
enum cdc_stat	cdc_avl_tree_ctorl (struct cdc_avl_tree **t, struct cdc_data_info *info,...)
	Constructs an avl tree, initialized by an variable number of pointers on cdc_pair's(first - key, and the second - value). The last item must be CDC_END. More...
enum cdc_stat	cdc_avl_tree_ctorv (struct cdc_avl_tree **t, struct cdc_data_info *info, va_list args)
	Constructs an avl tree, initialized by args. The last item must be CDC_END. More...
void	cdc_avl_tree_dtor (struct cdc_avl_tree *t)
	Destroys the avl tree. More...
enum cdc_stat	cdc_avl_tree_get (struct cdc_avl_tree *t, void *key, void **value)
	Returns a value that is mapped to a key. If the key does not exist, then NULL will return. More...
size_t	cdc_avl_tree_count (struct cdc_avl_tree *t, void *key)
	Returns the number of elements with key that compares equal to the specified argument key, which is either 1 or 0 since this container does not allow duplicates. More...
void	cdc_avl_tree_find (struct cdc_avl_tree *t, void *key, struct cdc_avl_tree_iter *it)
	Finds an element with key equivalent to key. More...
static size_t	cdc_avl_tree_size (struct cdc_avl_tree *t)
	Returns the number of items in the avl_tree. More...
static bool	cdc_avl_tree_empty (struct cdc_avl_tree *t)
	Checks if the avl tree has no elements. More...
void	cdc_avl_tree_clear (struct cdc_avl_tree *t)
	Removes all the elements from the avl_tree. More...
enum cdc_stat	cdc_avl_tree_insert (struct cdc_avl_tree *t, void *key, void *value, struct cdc_pair_avl_tree_iter_bool *ret)
	Inserts an element into the container, if the container doesn't already contain an element with an equivalent key. More...
enum cdc_stat	cdc_avl_tree_insert1 (struct cdc_avl_tree *t, void *key, void *value, struct cdc_avl_tree_iter *it, bool *inserted)
	Inserts an element into the container, if the container doesn't already contain an element with an equivalent key. More...
enum cdc_stat	cdc_avl_tree_insert_or_assign (struct cdc_avl_tree *t, void *key, void *value, struct cdc_pair_avl_tree_iter_bool *ret)
	Inserts an element or assigns to the current element if the key already exists. More...
enum cdc_stat	cdc_avl_tree_insert_or_assign1 (struct cdc_avl_tree *t, void *key, void *value, struct cdc_avl_tree_iter *it, bool *inserted)
	Inserts an element or assigns to the current element if the key already exists. More...
size_t	cdc_avl_tree_erase (struct cdc_avl_tree *t, void *key)
	Removes the element (if one exists) with the key equivalent to key. More...
void	cdc_avl_tree_swap (struct cdc_avl_tree *a, struct cdc_avl_tree *b)
	Swaps avl_trees a and b. This operation is very fast and never fails. More...
void	cdc_avl_tree_begin (struct cdc_avl_tree *t, struct cdc_avl_tree_iter *it)
	Initializes the iterator to the beginning. More...
void	cdc_avl_tree_end (struct cdc_avl_tree *t, struct cdc_avl_tree_iter *it)
	Initializes the iterator to the end. More...
void	cdc_avl_tree_iter_next (struct cdc_avl_tree_iter *it)
	Advances the iterator to the next element in the avl tree. More...
void	cdc_avl_tree_iter_prev (struct cdc_avl_tree_iter *it)
	Advances the iterator to the previous element in the avl tree. More...
static bool	cdc_avl_tree_iter_has_next (struct cdc_avl_tree_iter *it)
	Returns true if there is at least one element ahead of the iterator, i.e. the iterator is not at the back of the container; otherwise returns false. More...
static bool	cdc_avl_tree_iter_has_prev (struct cdc_avl_tree_iter *it)
	Returns true if there is at least one element behind the iterator, i.e. the iterator is not at the front of the container; otherwise returns false. More...
static void *	cdc_avl_tree_iter_key (struct cdc_avl_tree_iter *it)
	Returns an item's key. More...
static void *	cdc_avl_tree_iter_value (struct cdc_avl_tree_iter *it)
	Returns an item's value. More...
static struct cdc_pair	cdc_avl_tree_iter_key_value (struct cdc_avl_tree_iter *it)
	Returns a pair, where first - key, second - value. More...
static bool	cdc_avl_tree_iter_is_eq (struct cdc_avl_tree_iter *it1, struct cdc_avl_tree_iter *it2)
	Returns false if the iterator |it1| equal to the iterator |it2|, otherwise returns false. More...

Detailed Description

The cdc_avl_tree is a struct and functions that provide an avl tree.

Author

Maksim Andrianov maksi.nosp@m.mand.nosp@m.riano.nosp@m.v1@y.nosp@m.andex.nosp@m..ru