-

Here are the classes, structs, unions and interfaces with brief descriptions:

- - - - - -

bt_node	A binary tree node
bt_tree	A binary tree
ht_node	A node in a hash table
ht_table	A hash table
sll_node	A linked list node

-

-Functions
bt_tree *	bt_new (bt_compare_func compare)
	Creates a new empty binary tree.
void	bt_free (bt_tree *tree, int free_contents)
	Frees the memory allocated for all nodes of a tree.
int	bt_compare_ptr (void obj1, void obj2)
	Compares the value of two pointers.
void	bt_insert (bt_tree tree, void data)
	Inserts a new node into the tree.
void	bt_delete (bt_tree tree, void data)
void *	bt_find (bt_tree tree, void data)
	Finds and returns the data from a node containing the given data.

int bt_compare_ptr	(	void *	obj1,
		void *	obj2
	)

obj1	The first object to be compared.
obj2	The second object to be compared.

void bt_delete	(	bt_tree *	tree,
		void *	data
	)

void* bt_find	(	bt_tree *	tree,
		void *	data
	)

tree	The tree to be searched.
data	The data to be searched for.

tree	The tree to be freed.
free_contents	Determines whether the contents pointers will be freed.

tree	The tree in which the node will be inserted.
data	The data that the new node will contain.

-Classes
struct	bt_node
	A binary tree node. More...
struct	bt_tree
	A binary tree. More...
-Typedefs
typedef int(*	bt_compare_func )(void , void )
	A function pointer for a comparison function.
typedef struct bt_node	bt_node
	A binary tree node.
typedef struct bt_tree	bt_tree
	A binary tree.
-Functions
bt_tree *	bt_new (bt_compare_func compare)
	Creates a new empty binary tree.
void	bt_free (bt_tree *tree, int free_contents)
	Frees the memory allocated for all nodes of a tree.
int	bt_compare_ptr (void obj1, void obj2)
	Compares the value of two pointers.
void	bt_insert (bt_tree tree, void data)
	Inserts a new node into the tree.
void	bt_delete (bt_tree tree, void data, int free_contents)
	Deletes a node for the tree.
void *	bt_find (bt_tree tree, void data)
	Finds and returns the data from a node containing the given data.

tree	The tree from which the node will be deleted.
data	The data to search for in the tree.
free_contents	Determines whether the contents pointer will be freed.

src/ht/ht.c [code]
src/ht/ht.h [code]
src/lists/double_link/dll.c [code]
src/lists/double_link/dll.h [code]
src/lists/single_link/sll.c [code]
src/lists/single_link/sll.h [code]
src/trees/avl/avl.c [code]
src/trees/avl/avl.h [code]
src/trees/binary/bt.c [code]
src/trees/binary/bt.h [code]
src/trees/redblack/rbt.c [code]
src/trees/redblack/rbt.h [code]

-Functions
unsigned int	ht_hash_string (void *key)
	Takes a string key value and returns it's hashed value.
ht_table *	ht_new (unsigned int size, ht_hash_func fn)
	Creates a new hash table.
void	ht_free (ht_table *table, int free_key, int free_value)
	Frees all memory used by the provided hash table.
void	ht_put (ht_table table, void key, void *val)
void *	ht_get (ht_table table, void key)
void	ht_delete (ht_table table, void key, int free_key, int free_value)
	Deletes a key/value pair from the provided hash table.
ht_table *	ht_resize (ht_table *table, unsigned int size)
	Resizes the underlying table used for storing key/value pairs.

void ht_delete	(	ht_table *	table,
		void *	key,
		int	free_key,
		int	free_value
	)

table	The table from which the key/value pait will be deleted.
key	The key for the key/value pair to be deleted.
free_key	Determines whether the key pointer will be freed.
free_value	Determines whether the value pointer will be freed.

void ht_free	(	ht_table *	table,
		int	free_key,
		int	free_value
	)

table	The table to be freed.
free_key	Determines whether the key pointers will be freed.
free_value	Determines whether the value pointers will be freed.

size	The size of the table to use for storing data.
fn	The function to use for hasing keys.

table	The table to be resized.
size	The new size for the table.

table	The table in which to find the associated value.
key	The key to lookup.

table	The table to be freed.
key	The key for the associated value.
val	The value to be associated with the key.
free_value	Determines whether or not to free the old value pointer.

-Functions
sll_node *	sll_new (void *contents)
	Creates a new linked list node with the supplied value.
sll_node *	sll_front (sll_node *list)
	Finds and returns the first node in the supplied linked list.
sll_node *	sll_back (sll_node *list)
	Finds and returns the last node in the supplied linked list.
sll_node *	sll_index (sll_node *list, int index)
	Return the node at the specified index in a linked list.
sll_node *	sll_push_back (sll_node list, void contents)
	Adds a new node to the end of an existing linked list.
sll_node *	sll_push_front (sll_node list, void contents)
	Adds a new node to the front of an existing linked list.
sll_node *	sll_pop_back (sll_node *list)
sll_node *	sll_pop_front (sll_node *list)
sll_node *	sll_insert (sll_node list, int index, void contents)
	Inserts a new node in a linked list at the specified index.
sll_node *	sll_delete (sll_node *list, int index, int free_contents)
	Deletes a node from the supplied list.
void	sll_free (sll_node *list, int free_contents)
	Frees all memory used by a linked list.
unsigned int	sll_length (sll_node *list)
	Returns the number of elements in the list.

sll_node* sll_delete	(	sll_node *	list,
		int	index,
		int	free_contents
	)

list	The list to operate on.
index	The index of the node to delete.
free_contents	Whether or not to also free the contents of the node.

list	The list to be freed.
free_contents	Whether or not to also free the contents of each node.

list	The list to search for the supplied index.
index	The index of the node to return.

Class List

src/trees/avl/avl.c File Reference

src/trees/avl/avl.c

src/trees/avl/avl.h File Reference

src/trees/avl/avl.h

src/trees/binary/bt.c File Reference

-Functions

Function Documentation

src/trees/binary/bt.c

src/trees/binary/bt.h File Reference

-Classes

-Typedefs

-Functions

Typedef Documentation

Function Documentation

src/trees/binary/bt.h

Class Index

src/lists/double_link/dll.c File Reference

src/lists/double_link/dll.c

src/lists/double_link/dll.h File Reference

src/lists/double_link/dll.h

File List

- b -

- h -

- s -

- b -

- h -

- s -

Graph Legend

src/ht/ht.c File Reference

-Functions

Function Documentation

src/ht/ht.c

src/ht/ht.h File Reference

-Classes

-Typedefs

-Functions

Typedef Documentation

Function Documentation

src/ht/ht.h

Data Structures Documentation

src/trees/redblack/rbt.c File Reference

src/trees/redblack/rbt.c

src/trees/redblack/rbt.h File Reference

src/trees/redblack/rbt.h

src/lists/single_link/sll.c File Reference

-Functions

Function Documentation

src/lists/single_link/sll.c

src/lists/single_link/sll.h File Reference

-Classes

-Typedefs

-Functions

Typedef Documentation

Function Documentation

src/lists/single_link/sll.h

bt_node Member List

bt_node Struct Reference

-Public Attributes

Detailed Description

Member Data Documentation

bt_tree Member List

bt_tree Struct Reference

-Public Attributes

Detailed Description

Member Data Documentation

ht_node Member List

ht_node Struct Reference

-Public Attributes

Detailed Description

Member Data Documentation

ht_table Member List

ht_table Struct Reference

-Public Attributes

Detailed Description

Member Data Documentation

node Member List

node Struct Reference

-Public Attributes

Detailed Description

sll_node* sll_insert	(	sll_node *	list,
		int	index,
		void *	contents
	)

list	The list to operate on.
contents	The contents of the new node.

list	The lsit to operate on.
free_contents	Determines whether to free the contents pointer.

-Public Attributes
bt_node *	root
	The root of the binary tree.
bt_compare_func	compare
	The function used to compare data.

-Public Attributes
void *	key
	Pointer to the key.
void *	val
	Pointer to the value.
struct node *	next
	Pointer to the next node in the collision chain.