Date: Fri, 23 Mar 2012 15:13:20 +0000 (-0400) Subject: Updated doxygen docs X-Git-Url: https://git.mdlowis.com/?a=commitdiff_plain;h=fd2b63d1b6f05436f8806424ace05c9252c4df54;p=projs%2Flibcds.git Updated doxygen docs --- diff --git a/docs/doxygen/html/annotated.html b/docs/doxygen/html/annotated.html index 7d67859..68515bd 100644 --- a/docs/doxygen/html/annotated.html +++ b/docs/doxygen/html/annotated.html @@ -83,14 +83,17 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

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
node	A node in a hash table
sll_node	A linked list node

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/avl_8c.html b/docs/doxygen/html/avl_8c.html index cc23a3f..e9bd0c7 100644 --- a/docs/doxygen/html/avl_8c.html +++ b/docs/doxygen/html/avl_8c.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

avl.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/avl_8c_source.html b/docs/doxygen/html/avl_8c_source.html index 1b86e11..84e40e1 100644 --- a/docs/doxygen/html/avl_8c_source.html +++ b/docs/doxygen/html/avl_8c_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/avl/avl.c

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

avl.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/avl_8h.html b/docs/doxygen/html/avl_8h.html index 57c45f3..5a7ce81 100644 --- a/docs/doxygen/html/avl_8h.html +++ b/docs/doxygen/html/avl_8h.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

avl.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/avl_8h_source.html b/docs/doxygen/html/avl_8h_source.html index f854c54..8d266c6 100644 --- a/docs/doxygen/html/avl_8h_source.html +++ b/docs/doxygen/html/avl_8h_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/avl/avl.h

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

avl.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/bt_8c.html b/docs/doxygen/html/bt_8c.html index af598b1..02213a5 100644 --- a/docs/doxygen/html/bt_8c.html +++ b/docs/doxygen/html/bt_8c.html @@ -77,20 +77,260 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

- +

#include "bt.h"
+

+Include dependency graph for bt.c:

+ + +

Go to the source code of this file.

+ + + + + + + + + + + +

+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.

Function Documentation

+ +

+ + + + + + + + + + + + + + + + + + +

int bt_compare_ptr	(	void *	obj1,
		void *	obj2
	)

+ +

Compares the value of two pointers.

This function takes two pointers and compares their values returning an integral value representing the result of the comparison. A return value of zero indicates the pointers are equal. A positive value indicates that obj2 is greater than obj1 and a negative value indicates the opposite.

Parameters:

+ + + +

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

Returns:: The result of the comparison.

+ +

Definition at line 39 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

void bt_delete	(	bt_tree *	tree,
		void *	data
	)

+ +

Definition at line 49 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

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

+ +

Finds and returns the data from a node containing the given data.

This function uses the tree's compare function to search the tree for a node containing the given data. If a node containing the given data is found then the pointer to the contents of the node is returned. Otherwise a null pointer is returned.

Parameters:

+ + + +

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

Returns:: Pointer to the found data.

+ +

Definition at line 54 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

void bt_free	(	bt_tree *	tree,
		int	free_contents
	)

+ +

Frees the memory allocated for all nodes of a tree.

This function frees all memory associated with the given tree. If free_contents has a non-zero value then the contents pointer of each node will aslo be freed.

Parameters:

+ + + +

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

+ +

Definition at line 34 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

void bt_insert	(	bt_tree *	tree,
		void *	data
	)

+ +

Inserts a new node into the tree.

This function uses the tree's compare function to traverse the tree until an existing node with the given data is found or until a leaf node is reached. If a node exists containing the given data then no insertion is performed. If a leaf node is reached then the a new leaf node is created and set as the left or right child of that leaf node.

Parameters:

+ + + +

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

+ +

Definition at line 44 of file bt.c.

+ +

+ + + + + + + + +

bt_tree* bt_new ( bt_compare_func compare )

+ +

Creates a new empty binary tree.

This function creates a new empty binary search tree with the given comparison function. The comparison function will be used during searching, insertions, and deletions, to find and traverse the tree.

Parameters:

+ + +

compare The function to use for comparing items in the tree.

Returns:: Pointer to the newly created tree.

+ +

Definition at line 29 of file bt.c.

+ +

bt.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/bt_8c__incl.map b/docs/doxygen/html/bt_8c__incl.map new file mode 100644 index 0000000..cd5f22b --- /dev/null +++ b/docs/doxygen/html/bt_8c__incl.map @@ -0,0 +1,3 @@ + + + diff --git a/docs/doxygen/html/bt_8c__incl.md5 b/docs/doxygen/html/bt_8c__incl.md5 new file mode 100644 index 0000000..2b0cb46 --- /dev/null +++ b/docs/doxygen/html/bt_8c__incl.md5 @@ -0,0 +1 @@ +39f16308d7e4e32fdc16d89e44160432 \ No newline at end of file diff --git a/docs/doxygen/html/bt_8c__incl.png b/docs/doxygen/html/bt_8c__incl.png new file mode 100644 index 0000000..2ec4a0c Binary files /dev/null and b/docs/doxygen/html/bt_8c__incl.png differ diff --git a/docs/doxygen/html/bt_8c_source.html b/docs/doxygen/html/bt_8c_source.html index ef05247..bcfb809 100644 --- a/docs/doxygen/html/bt_8c_source.html +++ b/docs/doxygen/html/bt_8c_source.html @@ -81,12 +81,70 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/binary/bt.c

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #include "bt.h"
+00028 
+00029 bt_tree* bt_new(bt_compare_func compare)
+00030 {
+00031 
+00032 }
+00033 
+00034 void bt_free(bt_tree* tree, int free_contents)
+00035 {
+00036 
+00037 }
+00038 
+00039 int bt_compare_ptr(void* obj1, void* obj2)
+00040 {
+00041 
+00042 }
+00043 
+00044 void bt_insert(bt_tree* tree, void* data)
+00045 {
+00046 
+00047 }
+00048 
+00049 void bt_delete(bt_tree* tree, void* data)
+00050 {
+00051 
+00052 }
+00053 
+00054 void* bt_find(bt_tree* tree, void* data)
+00055 {
+00056 
+00057 }
+00058 
+

bt.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/bt_8h.html b/docs/doxygen/html/bt_8h.html index 9908fac..d610afb 100644 --- a/docs/doxygen/html/bt_8h.html +++ b/docs/doxygen/html/bt_8h.html @@ -77,20 +77,339 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

- +

+This graph shows which files directly or indirectly include this file:

+ + +

Go to the source code of this file.

+ + + + + + + + + + + + + + + + + + + + + + + + +

+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.

Typedef Documentation

+ +

+ + + + +

typedef int(* bt_compare_func)(void *, void *)

+ +

A function pointer for a comparison function.

+ +

Definition at line 31 of file bt.h.

+ +

+ + + + +

typedef struct bt_node bt_node

+ +

A binary tree node.

+ +

+ + + + +

typedef struct bt_tree bt_tree

+ +

A binary tree.

+ +

Function Documentation

+ +

+ + + + + + + + + + + + + + + + + + +

int bt_compare_ptr	(	void *	obj1,
		void *	obj2
	)

+ +

Compares the value of two pointers.

Parameters:

+ + + +

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

Returns:: The result of the comparison.

+ +

Definition at line 39 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + + + + + + + +

void bt_delete	(	bt_tree *	tree,
		void *	data,
		int	free_contents
	)

+ +

Deletes a node for the tree.

This function uses the tree's compare function to search the tree for a node containing the given data. If a node containing the data is found then the node is freed otherwise no deletion is performed. If free_contents is passed a non-zero value then the contents pointer of the node is also freed.

Parameters:

+ + + + +

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.

+ +

+ + + + + + + + + + + + + + + + + + +

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

+ +

Finds and returns the data from a node containing the given data.

Parameters:

+ + + +

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

Returns:: Pointer to the found data.

+ +

Definition at line 54 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

void bt_free	(	bt_tree *	tree,
		int	free_contents
	)

+ +

Frees the memory allocated for all nodes of a tree.

This function frees all memory associated with the given tree. If free_contents has a non-zero value then the contents pointer of each node will aslo be freed.

Parameters:

+ + + +

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

+ +

Definition at line 34 of file bt.c.

+ +

+ + + + + + + + + + + + + + + + + + +

void bt_insert	(	bt_tree *	tree,
		void *	data
	)

+ +

Inserts a new node into the tree.

Parameters:

+ + + +

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

+ +

Definition at line 44 of file bt.c.

+ +

+ + + + + + + + +

bt_tree* bt_new ( bt_compare_func compare )

+ +

Creates a new empty binary tree.

Parameters:

+ + +

compare The function to use for comparing items in the tree.

Returns:: Pointer to the newly created tree.

+ +

Definition at line 29 of file bt.c.

+ +

bt.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/bt_8h__dep__incl.map b/docs/doxygen/html/bt_8h__dep__incl.map new file mode 100644 index 0000000..1a088c4 --- /dev/null +++ b/docs/doxygen/html/bt_8h__dep__incl.map @@ -0,0 +1,3 @@ + + + diff --git a/docs/doxygen/html/bt_8h__dep__incl.md5 b/docs/doxygen/html/bt_8h__dep__incl.md5 new file mode 100644 index 0000000..a3588df --- /dev/null +++ b/docs/doxygen/html/bt_8h__dep__incl.md5 @@ -0,0 +1 @@ +0ad7ff5b2f75f3c4fd634b13a1a3332b \ No newline at end of file diff --git a/docs/doxygen/html/bt_8h__dep__incl.png b/docs/doxygen/html/bt_8h__dep__incl.png new file mode 100644 index 0000000..edde292 Binary files /dev/null and b/docs/doxygen/html/bt_8h__dep__incl.png differ diff --git a/docs/doxygen/html/bt_8h_source.html b/docs/doxygen/html/bt_8h_source.html index 6993eaa..6e2731e 100644 --- a/docs/doxygen/html/bt_8h_source.html +++ b/docs/doxygen/html/bt_8h_source.html @@ -81,12 +81,69 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/binary/bt.h

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #ifndef BT_H
+00028 #define BT_H
+00029 
+00031 typedef int (* bt_compare_func) (void*,void*);
+00032 
+00034 typedef struct bt_node
+00035 {
+00037     void* contents;
+00039     struct bt_node* left;
+00041     struct bt_node* right;
+00042 } bt_node;
+00043 
+00045 typedef struct bt_tree
+00046 {
+00048     bt_node* root;
+00050     bt_compare_func compare;
+00051 } bt_tree;
+00052 
+00064 bt_tree* bt_new(bt_compare_func compare);
+00065 
+00076 void bt_free(bt_tree* tree, int free_contents);
+00077 
+00091 int bt_compare_ptr(void* obj1, void* obj2);
+00092 
+00105 void bt_insert(bt_tree* tree, void* data);
+00106 
+00119 void bt_delete(bt_tree* tree, void* data, int free_contents);
+00120 
+00134 void* bt_find(bt_tree* tree, void* data);
+00135 
+00136 #endif
+

bt.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/classes.html b/docs/doxygen/html/classes.html index 51d78a6..db1741b 100644 --- a/docs/doxygen/html/classes.html +++ b/docs/doxygen/html/classes.html @@ -82,16 +82,17 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Class Index

H | N

B | H | S

ht_table

node

H | N

+bt_tree ht_node

+sll_node bt_node

+ht_table

B | H | S

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/dll_8c.html b/docs/doxygen/html/dll_8c.html index 0606d61..fc17b8f 100644 --- a/docs/doxygen/html/dll_8c.html +++ b/docs/doxygen/html/dll_8c.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

dll.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/dll_8c_source.html b/docs/doxygen/html/dll_8c_source.html index 314d9a7..8a30adf 100644 --- a/docs/doxygen/html/dll_8c_source.html +++ b/docs/doxygen/html/dll_8c_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/lists/double_link/dll.c

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

dll.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/dll_8h.html b/docs/doxygen/html/dll_8h.html index 47787d2..c43f5fa 100644 --- a/docs/doxygen/html/dll_8h.html +++ b/docs/doxygen/html/dll_8h.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

dll.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/dll_8h_source.html b/docs/doxygen/html/dll_8h_source.html index 125e141..bffbfee 100644 --- a/docs/doxygen/html/dll_8h_source.html +++ b/docs/doxygen/html/dll_8h_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/lists/double_link/dll.h

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

dll.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/files.html b/docs/doxygen/html/files.html index bb4da1c..8424042 100644 --- a/docs/doxygen/html/files.html +++ b/docs/doxygen/html/files.html @@ -99,7 +99,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/functions.html b/docs/doxygen/html/functions.html index defab2c..45fd20f 100644 --- a/docs/doxygen/html/functions.html +++ b/docs/doxygen/html/functions.html @@ -85,17 +85,31 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Here is a list of all class members with links to the classes they belong to:

compare +: bt_tree +
contents -: node +: bt_node +, sll_node
hash_func : ht_table
key -: node +: ht_node +
left +: bt_node
next -: node +: ht_node +, sll_node +
right +: bt_node +
root +: bt_tree
size : ht_table @@ -104,14 +118,14 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : ht_table
val -: node +: ht_node

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/functions_vars.html b/docs/doxygen/html/functions_vars.html index 9b0dd07..c8faa65 100644 --- a/docs/doxygen/html/functions_vars.html +++ b/docs/doxygen/html/functions_vars.html @@ -85,17 +85,31 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

compare +: bt_tree +
contents -: node +: bt_node +, sll_node
hash_func : ht_table
key -: node +: ht_node +
left +: bt_node
next -: node +: ht_node +, sll_node +
right +: bt_node +
root +: bt_tree
size : ht_table @@ -104,14 +118,14 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : ht_table
val -: node +: ht_node

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/globals.html b/docs/doxygen/html/globals.html index 752de13..392fe15 100644 --- a/docs/doxygen/html/globals.html +++ b/docs/doxygen/html/globals.html @@ -71,6 +71,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

@@ -92,17 +93,54 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Here is a list of all file members with links to the files they belong to:

- b -

bt_compare_func +: bt.h +
bt_compare_ptr() +: bt.c +, bt.h +
bt_delete() +: bt.c +, bt.h +
bt_find() +: bt.c +, bt.h +
bt_free() +: bt.c +, bt.h +
bt_insert() +: bt.c +, bt.h +
bt_new() +: bt.h +, bt.c +
bt_node +: bt.h +
bt_tree +: bt.h +

+ +

- h -

ht_delete() -: ht.c +: ht.c , ht.h
ht_free() : ht.h -, ht.c +, ht.c
ht_get() -: ht.c +: ht.c , ht.h
ht_hash_func @@ -117,23 +155,23 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); , ht.h
ht_node -: ht.h +: ht.h
ht_put() -: ht.c +: ht.c , ht.h
ht_resize() : ht.h -, ht.c +, ht.c

- s -

sll_add() -: sll.c -, sll.h +
sll_back() +: sll.c +, sll.h
sll_delete() : sll.h @@ -143,35 +181,51 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : sll.c , sll.h
sll_get() -: sll.h -, sll.c +
sll_front() +: sll.h +, sll.c +
sll_index() +: sll.c +, sll.h
sll_insert() : sll.c , sll.h
sll_last() -: sll.c -, sll.h -
sll_length() -: sll.h -, sll.c +: sll.c +, sll.h
sll_new() -: sll.c -, sll.h +: sll.h +, sll.c
sll_node -: sll.h +: sll.h +
sll_pop_back() +: sll.c +, sll.h +
sll_pop_front() +: sll.c +, sll.h +
sll_push_back() +: sll.h +, sll.c +
sll_push_front() +: sll.h +, sll.c

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/globals_func.html b/docs/doxygen/html/globals_func.html index c23dfb6..2fb27bc 100644 --- a/docs/doxygen/html/globals_func.html +++ b/docs/doxygen/html/globals_func.html @@ -69,6 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Typedefs

@@ -84,17 +91,47 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

- b -

bt_compare_ptr() +: bt.c +, bt.h +
bt_delete() +: bt.h +, bt.c +
bt_find() +: bt.c +, bt.h +
bt_free() +: bt.h +, bt.c +
bt_insert() +: bt.h +, bt.c +
bt_new() +: bt.c +, bt.h +

- h -

ht_delete() -: ht.c +: ht.c , ht.h
ht_free() : ht.h -, ht.c +, ht.c
ht_get() -: ht.c +: ht.c , ht.h
ht_hash_string() @@ -106,16 +143,20 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); , ht.h
ht_put() -: ht.c +: ht.c , ht.h
ht_resize() : ht.h -, ht.c +, ht.c
sll_add() -: sll.c -, sll.h +

- s -

sll_back() +: sll.c +, sll.h
sll_delete() : sll.h @@ -125,18 +166,18 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : sll.c , sll.h
sll_get() -: sll.h -, sll.c +
sll_front() +: sll.h +, sll.c +
sll_index() +: sll.c +, sll.h
sll_insert() : sll.c , sll.h
sll_last() -: sll.c -, sll.h -
sll_length() : sll.c , sll.h @@ -145,12 +186,28 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); : sll.c , sll.h
sll_pop_back() +: sll.c +, sll.h +
sll_pop_front() +: sll.c +, sll.h +
sll_push_back() +: sll.c +, sll.h +
sll_push_front() +: sll.h +, sll.c +

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/globals_type.html b/docs/doxygen/html/globals_type.html index 4da91fe..9dcaace 100644 --- a/docs/doxygen/html/globals_type.html +++ b/docs/doxygen/html/globals_type.html @@ -85,21 +85,30 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

bt_compare_func +: bt.h +
bt_node +: bt.h +
bt_tree +: bt.h +
ht_hash_func : ht.h
ht_node -: ht.h +: ht.h
sll_node -: sll.h +: sll.h

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/graph_legend.html b/docs/doxygen/html/graph_legend.html index 669c2c9..9d76d8d 100644 --- a/docs/doxygen/html/graph_legend.html +++ b/docs/doxygen/html/graph_legend.html @@ -143,7 +143,7 @@ A yellow dashed arrow denotes a relation between a template instance and the tem

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/ht_8c.html b/docs/doxygen/html/ht_8c.html index d894678..5ea0a51 100644 --- a/docs/doxygen/html/ht_8c.html +++ b/docs/doxygen/html/ht_8c.html @@ -103,21 +103,24 @@ Functions 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 of the given size using the provided hash function or the built-in string hashing function otherwise.
-void ht_free (ht_table *table) -int ht_put (ht_table *table, void *key, void *val) - Inserts a key/value pair into the provided table.
-void * ht_get (ht_table *table, char *key) -unsigned int ht_delete (ht_table *table, char *key) -unsigned int ht_resize (ht_table *table, unsigned int size) - Resizes the underlying table used for storing key/value pairs.
+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) + Inserts a key/value pair into the provided table.
+void * ht_get (ht_table *table, void *key) + Retrieves a value from the provided table.
+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.

Function Documentation

- +

- + @@ -125,8 +128,20 @@ Functions - - + + + + + + + + + + + + + + @@ -137,11 +152,22 @@ Functions

Definition at line 116 of file ht.c.

Deletes a key/value pair from the provided hash table.

Parameters:: +

unsigned int ht_delete	void ht_delete	(	ht_table *	table,
		char *	key	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.

+ + + +

Definition at line 125 of file ht.c.

- +

@@ -149,18 +175,44 @@ Functions - + + + + + + + + + + + + + + + + +

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

Definition at line 45 of file ht.c.

Frees all memory used by the provided hash table.

Parameters:

+ + + + +

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.

+ +

Definition at line 55 of file ht.c.

- +

@@ -173,7 +225,7 @@ Functions - + @@ -185,7 +237,17 @@ Functions

Definition at line 99 of file ht.c.

Retrieves a value from the provided table.

Parameters:: +

char * void * key

+ + +

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

+ + +

Returns:: A pointer to the value associated with the provided key.

+ +

Definition at line 108 of file ht.c.

@@ -213,7 +275,7 @@ Functions

Returns:: The hashed value of the key.

Definition at line 22 of file ht.c.

Definition at line 32 of file ht.c.

Here is the caller graph for this function:

@@ -261,7 +323,7 @@ Here is the caller graph for this function:

Returns:: The newly created table.

Definition at line 34 of file ht.c.

Definition at line 44 of file ht.c.

Here is the call graph for this function:

@@ -274,12 +336,12 @@ Here is the call graph for this function:

- +

- + @@ -315,16 +377,16 @@ Here is the call graph for this function: -

Definition at line 63 of file ht.c.

Definition at line 73 of file ht.c.

- +

int ht_put void ht_put ( ht_table * table,

- + @@ -354,7 +416,7 @@ Here is the call graph for this function:

Returns:: A pointer to the resized table.

Definition at line 121 of file ht.c.

Definition at line 130 of file ht.c.

@@ -363,7 +425,7 @@ Here is the call graph for this function:

ht.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/ht_8c_source.html b/docs/doxygen/html/ht_8c_source.html index 40a9fde..d1a0264 100644 --- a/docs/doxygen/html/ht_8c_source.html +++ b/docs/doxygen/html/ht_8c_source.html @@ -82,136 +82,145 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Go to the documentation of this file.

00001 /******************************************************************************
-00002  *  Copyright (C) 2011 Michael D. Lowis
-00003  *
-00004  *  This program is free software: you can redistribute it and/or modify
-00005  *  it under the terms of the GNU General Public License as published by
-00006  *  the Free Software Foundation, either version 3 of the License, or
-00007  *  (at your option) any later version.
-00008  *
-00009  *  This program is distributed in the hope that it will be useful,
-00010  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
-00011  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-00012  *  GNU General Public License for more details.
-00013  *
-00014  *  You should have received a copy of the GNU General Public License
-00015  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
-00016  *****************************************************************************/
-00017 #include "ht.h"
-00018 #include <stdlib.h>
-00019 #include <string.h>
-00020 #include <stdio.h>
-00021 
-00022 unsigned int ht_hash_string(void* key)
-00023 {
-00024     char* key_str = (char*)key;
-00025     unsigned int hash = 0;
-00026     int i = 0;
-00027     for (i = 0; key_str[i] != '\0'; i++)
-00028     {
-00029         hash += key_str[i];
-00030     }
-00031     return hash;
-00032 }
-00033 
-00034 ht_table* ht_new(unsigned int size, ht_hash_func fn)
-00035 {
-00036     unsigned int table_size = size * sizeof(ht_node*);
-00037     ht_table* table = (ht_table*) malloc( sizeof(ht_table) );
-00038     table->size = size;
-00039     table->table = (ht_node**) malloc( table_size );
-00040     table->hash_func = (fn != NULL) ? fn : ht_hash_string;
-00041     memset(table->table, 0, table_size);
-00042     return table;
-00043 }
-00044 
-00045 void ht_free(ht_table* table)
-00046 {
-00047     int i = 0;
-00048     for (i = 0; i < table->size; i++)
-00049     {
-00050         ht_node* cur = table->table[i];
-00051         while (cur != NULL)
-00052         {
-00053             printf("Index: %d\tKey: %s\tVal: %#x\tNext: %#x\n", i, cur->key, (int)cur->val, (int)cur->next);
-00054             ht_node* next = cur->next;
-00055             free( cur->key );
-00056             free( cur->val );
-00057             free( cur );
-00058             cur = next;
-00059         }
-00060     }
-00061 }
-00062 
-00063 int ht_put(ht_table* table, void* key, void* val)
-00064 {
-00065     unsigned int index = table->hash_func( key ) % table->size;
-00066     ht_node* cur = table->table[index];
-00067     ht_node* last = cur;
-00068 
-00069     while (cur != NULL)
-00070     {
-00071         if ( !strcmp( key, cur->key ) )
-00072         {
-00073             cur->val = val;
-00074             break;
-00075         }
-00076         last = cur;
-00077         cur = cur->next;
-00078     }
-00079 
-00080     if (cur == NULL)
-00081     {
-00082         ht_node* node = (ht_node*) malloc( sizeof(ht_node) );
-00083         node->key = (char*) strdup( key );
-00084         node->val = val;
-00085         node->next = NULL;
-00086 
-00087         if (last != NULL)
-00088         {
-00089             last->next = node;
-00090         }
-00091         else
-00092         {
-00093             table->table[ index ] = node;
-00094         }
-00095     }
-00096     return 1;
-00097 }
-00098 
-00099 void* ht_get(ht_table* table, char* key)
-00100 {
-00101     void* ret = NULL;
-00102     unsigned int index= table->hash_func( key ) % table->size;
-00103     ht_node* node = table->table[ index ];
-00104     while ( node != NULL )
-00105     {
-00106         if ( !strcmp( key, node->key ) )
-00107         {
-00108             ret = node->val;
-00109             break;
-00110         }
-00111         node = node->next;
-00112     }
-00113     return ret;
-00114 }
-00115 
-00116 unsigned int ht_delete(ht_table* table, char* key)
-00117 {
-00118     return 0;
-00119 }
-00120 
-00121 unsigned int ht_resize(ht_table* table, unsigned int size)
-00122 {
-00123     return 0;
-00124 }
-00125 
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #include "ht.h"
+00028 #include <stdlib.h>
+00029 #include <string.h>
+00030 #include <stdio.h>
+00031 
+00032 unsigned int ht_hash_string(void* key)
+00033 {
+00034     char* key_str = (char*)key;
+00035     unsigned int hash = 0;
+00036     int i = 0;
+00037     for (i = 0; key_str[i] != '\0'; i++)
+00038     {
+00039         hash += key_str[i];
+00040     }
+00041     return hash;
+00042 }
+00043 
+00044 ht_table* ht_new(unsigned int size, ht_hash_func fn)
+00045 {
+00046     unsigned int table_size = size * sizeof(ht_node*);
+00047     ht_table* table = (ht_table*) malloc( sizeof(ht_table) );
+00048     table->size = size;
+00049     table->table = (ht_node**) malloc( table_size );
+00050     table->hash_func = (fn != NULL) ? fn : ht_hash_string;
+00051     memset(table->table, 0, table_size);
+00052     return table;
+00053 }
+00054 
+00055 void ht_free(ht_table* table, int free_key, int free_value)
+00056 {
+00057     int i = 0;
+00058     for (i = 0; i < table->size; i++)
+00059     {
+00060         ht_node* cur = table->table[i];
+00061         while (cur != NULL)
+00062         {
+00063             printf("Index: %d\tKey: %s\tVal: %#x\tNext: %#x\n", i, cur->key, (int)cur->val, (int)cur->next);
+00064             ht_node* next = cur->next;
+00065             free( cur->key );
+00066             free( cur->val );
+00067             free( cur );
+00068             cur = next;
+00069         }
+00070     }
+00071 }
+00072 
+00073 void ht_put(ht_table* table, void* key, void* val)
+00074 {
+00075     unsigned int index = table->hash_func( key ) % table->size;
+00076     ht_node* cur = table->table[index];
+00077     ht_node* last = cur;
+00078 
+00079     while (cur != NULL)
+00080     {
+00081         if ( !strcmp( key, cur->key ) )
+00082         {
+00083             cur->val = val;
+00084             break;
+00085         }
+00086         last = cur;
+00087         cur = cur->next;
+00088     }
+00089 
+00090     if (cur == NULL)
+00091     {
+00092         ht_node* node = (ht_node*) malloc( sizeof(ht_node) );
+00093         node->key = (char*) strdup( key );
+00094         node->val = val;
+00095         node->next = NULL;
+00096 
+00097         if (last != NULL)
+00098         {
+00099             last->next = node;
+00100         }
+00101         else
+00102         {
+00103             table->table[ index ] = node;
+00104         }
+00105     }
+00106 }
+00107 
+00108 void* ht_get(ht_table* table, void* key)
+00109 {
+00110     void* ret = NULL;
+00111     unsigned int index= table->hash_func( key ) % table->size;
+00112     ht_node* node = table->table[ index ];
+00113     while ( node != NULL )
+00114     {
+00115         if ( !strcmp( key, node->key ) )
+00116         {
+00117             ret = node->val;
+00118             break;
+00119         }
+00120         node = node->next;
+00121     }
+00122     return ret;
+00123 }
+00124 
+00125 void ht_delete(ht_table* table, void* key, int free_key, int free_value)
+00126 {
+00127     return 0;
+00128 }
+00129 
+00130 ht_table* ht_resize(ht_table* table, unsigned int size)
+00131 {
+00132     return 0;
+00133 }
+00134

ht.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/ht_8h.html b/docs/doxygen/html/ht_8h.html index fbf9e96..bf00903 100644 --- a/docs/doxygen/html/ht_8h.html +++ b/docs/doxygen/html/ht_8h.html @@ -97,16 +97,16 @@ This graph shows which files directly or indirectly include this file:

unsigned int ht_resize ht_table* ht_resize ( ht_table * table,

- - + + - - + + @@ -138,16 +138,16 @@ Functions

Hash function for hashing keys in a hash table.

Definition at line 21 of file ht.h.

Definition at line 31 of file ht.h.

- +

Classes
struct	node
	A node in a hash table. More...
struct	ht_node
	A node in a hash table. More...
struct	ht_table
	A hash table. More...
Typedefs
typedef unsigned int(*	ht_hash_func )(void *)
	Hash function for hashing keys in a hash table.
typedef struct node	ht_node
	A node in a hash table.
typedef struct ht_node	ht_node
	A node in a hash table.
Functions
unsigned int	ht_hash_string (void *key)

- +

typedef struct node ht_node typedef struct ht_node ht_node

@@ -206,6 +206,8 @@ Functions +

Definition at line 125 of file ht.c.

@@ -249,6 +251,8 @@ Functions +

Definition at line 55 of file ht.c.

+ @@ -286,6 +290,8 @@ Functions

Returns:: A pointer to the value associated with the provided key.

Definition at line 108 of file ht.c.

+ @@ -312,7 +318,7 @@ Functions

Returns:: The hashed value of the key.

Definition at line 22 of file ht.c.

Definition at line 32 of file ht.c.

Here is the caller graph for this function:

@@ -360,7 +366,7 @@ Here is the caller graph for this function:

Returns:: The newly created table.

Definition at line 34 of file ht.c.

Definition at line 44 of file ht.c.

Here is the call graph for this function:

@@ -414,7 +420,7 @@ Here is the call graph for this function: -

Definition at line 63 of file ht.c.

Definition at line 73 of file ht.c.

@@ -453,7 +459,7 @@ Here is the call graph for this function:

Returns:: A pointer to the resized table.

Definition at line 121 of file ht.c.

Definition at line 130 of file ht.c.

@@ -462,7 +468,7 @@ Here is the call graph for this function:

ht.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/ht_8h_source.html b/docs/doxygen/html/ht_8h_source.html index f7390d8..1b69fc4 100644 --- a/docs/doxygen/html/ht_8h_source.html +++ b/docs/doxygen/html/ht_8h_source.html @@ -82,61 +82,71 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Go to the documentation of this file.

00001 /******************************************************************************
-00002  *  Copyright (C) 2011 Michael D. Lowis
-00003  *
-00004  *  This program is free software: you can redistribute it and/or modify
-00005  *  it under the terms of the GNU General Public License as published by
-00006  *  the Free Software Foundation, either version 3 of the License, or
-00007  *  (at your option) any later version.
-00008  *
-00009  *  This program is distributed in the hope that it will be useful,
-00010  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
-00011  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-00012  *  GNU General Public License for more details.
-00013  *
-00014  *  You should have received a copy of the GNU General Public License
-00015  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
-00016  *****************************************************************************/
-00017 #ifndef HASHTABLE_H
-00018 #define HASHTABLE_H
-00019 
-00021 typedef unsigned int (*ht_hash_func) (void*);
-00022 
-00024 typedef struct node
-00025 {
-00027     void* key;
-00029     void* val;
-00031     struct node* next;
-00032 } ht_node;
-00033 
-00035 typedef struct
-00036 {
-00038     unsigned int size;
-00040     ht_node** table;
-00042     ht_hash_func hash_func;
-00043 } ht_table;
-00044 
-00052 unsigned int ht_hash_string(void* key);
-00053 
-00063 ht_table* ht_new(unsigned int size, ht_hash_func fn);
-00064 
-00072 void ht_free(ht_table* table, int free_key, int free_value);
-00073 
-00081 void ht_put(ht_table* table, void* key, void* val);
-00082 
-00091 void* ht_get(ht_table* table, void* key);
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #ifndef HT_H
+00028 #define HT_H
+00029 
+00031 typedef unsigned int (*ht_hash_func) (void*);
+00032 
+00034 typedef struct ht_node
+00035 {
+00037     void* key;
+00039     void* val;
+00041     struct node* next;
+00042 } ht_node;
+00043 
+00045 typedef struct
+00046 {
+00048     unsigned int size;
+00050     ht_node** table;
+00052     ht_hash_func hash_func;
+00053 } ht_table;
+00054 
+00062 unsigned int ht_hash_string(void* key);
+00063 
+00073 ht_table* ht_new(unsigned int size, ht_hash_func fn);
+00074 
+00082 void ht_free(ht_table* table, int free_key, int free_value);
+00083 
+00091 void ht_put(ht_table* table, void* key, void* val);
 00092 
-00101 void ht_delete(ht_table* table, void* key, int free_key, int free_value);
+00101 void* ht_get(ht_table* table, void* key);
 00102 
-00111 ht_table* ht_resize(ht_table* table, unsigned int size);
+00111 void ht_delete(ht_table* table, void* key, int free_key, int free_value);
 00112 
-00113 #endif
+00121 ht_table* ht_resize(ht_table* table, unsigned int size);
+00122 
+00123 #endif

ht.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/index.html b/docs/doxygen/html/index.html index 90a41a9..49313f3 100644 --- a/docs/doxygen/html/index.html +++ b/docs/doxygen/html/index.html @@ -79,7 +79,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/navtree.js b/docs/doxygen/html/navtree.js index 95d6da3..d4c508a 100644 --- a/docs/doxygen/html/navtree.js +++ b/docs/doxygen/html/navtree.js @@ -2,8 +2,11 @@ var NAVTREE = [ [ "Data Structures", "index.html", [ [ "Class List", "annotated.html", [ + [ "bt_node", "structbt__node.html", null ], + [ "bt_tree", "structbt__tree.html", null ], + [ "ht_node", "structht__node.html", null ], [ "ht_table", "structht__table.html", null ], - [ "node", "structnode.html", null ] + [ "sll_node", "structsll__node.html", null ] ] ], [ "Class Index", "classes.html", null ], [ "Class Members", "functions.html", null ], diff --git a/docs/doxygen/html/rbt_8c.html b/docs/doxygen/html/rbt_8c.html index a1900c0..206fcce 100644 --- a/docs/doxygen/html/rbt_8c.html +++ b/docs/doxygen/html/rbt_8c.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

rbt.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/rbt_8c_source.html b/docs/doxygen/html/rbt_8c_source.html index 465dacf..52d7310 100644 --- a/docs/doxygen/html/rbt_8c_source.html +++ b/docs/doxygen/html/rbt_8c_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/redblack/rbt.c

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

rbt.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/rbt_8h.html b/docs/doxygen/html/rbt_8h.html index 76f2f74..bd0157e 100644 --- a/docs/doxygen/html/rbt_8h.html +++ b/docs/doxygen/html/rbt_8h.html @@ -90,7 +90,7 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

rbt.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/rbt_8h_source.html b/docs/doxygen/html/rbt_8h_source.html index de04a2f..2520044 100644 --- a/docs/doxygen/html/rbt_8h_source.html +++ b/docs/doxygen/html/rbt_8h_source.html @@ -81,12 +81,39 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

src/trees/redblack/rbt.h

-Go to the documentation of this file.

+Go to the documentation of this file.

00001 /******************************************************************************
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 
+

rbt.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/search/all_62.html b/docs/doxygen/html/search/all_62.html index 0432a66..bed0ae8 100644 --- a/docs/doxygen/html/search/all_62.html +++ b/docs/doxygen/html/search/all_62.html @@ -17,6 +17,84 @@ bt.h

+ bt_compare_func + bt.h +

+ bt_compare_ptr +

+ bt_compare_ptr(void *obj1, void *obj2): bt.c + bt_compare_ptr(void *obj1, void *obj2): bt.c +

+ bt_delete +

+ bt_delete(bt_tree *tree, void *data): bt.c + bt_delete(bt_tree *tree, void *data, int free_contents): bt.h +

+ bt_find +

+ bt_find(bt_tree *tree, void *data): bt.c + bt_find(bt_tree *tree, void *data): bt.c +

+ bt_free +

+ bt_free(bt_tree *tree, int free_contents): bt.c + bt_free(bt_tree *tree, int free_contents): bt.c +

+ bt_insert +

+ bt_insert(bt_tree *tree, void *data): bt.c + bt_insert(bt_tree *tree, void *data): bt.c +

+ bt_new +

+ bt_new(bt_compare_func compare): bt.c + bt_new(bt_compare_func compare): bt.c +

+ bt_node +

+ bt_node + bt_node(): bt.h +

+ bt_tree +

+ bt_tree + bt_tree(): bt.h +

Searching...

No Matches

+ + + diff --git a/docs/doxygen/html/search/all_6e.html b/docs/doxygen/html/search/all_6e.html index dd80721..ec17e51 100644 --- a/docs/doxygen/html/search/all_6e.html +++ b/docs/doxygen/html/search/all_6e.html @@ -9,13 +9,11 @@

- next - node -

- node + next +

+ ht_node::next() + sll_node::next() +

Searching...

diff --git a/docs/doxygen/html/search/all_72.html b/docs/doxygen/html/search/all_72.html index 40dfec1..6a5f899 100644 --- a/docs/doxygen/html/search/all_72.html +++ b/docs/doxygen/html/search/all_72.html @@ -17,6 +17,18 @@ rbt.h +

+ right + bt_node +

+ root + bt_tree +

Searching...

No Matches

+ + + diff --git a/docs/doxygen/html/search/classes_68.html b/docs/doxygen/html/search/classes_68.html index f5cafb0..58e6efa 100644 --- a/docs/doxygen/html/search/classes_68.html +++ b/docs/doxygen/html/search/classes_68.html @@ -7,9 +7,14 @@

+ ht_node +

- ht_table + ht_table

Searching...

diff --git a/docs/doxygen/html/search/classes_73.html b/docs/doxygen/html/search/classes_73.html new file mode 100644 index 0000000..07e2696 --- /dev/null +++ b/docs/doxygen/html/search/classes_73.html @@ -0,0 +1,25 @@ + + + + + + + +

+ sll_node +

Searching...

No Matches

+ +

+ + diff --git a/docs/doxygen/html/search/functions_62.html b/docs/doxygen/html/search/functions_62.html new file mode 100644 index 0000000..7e92e6c --- /dev/null +++ b/docs/doxygen/html/search/functions_62.html @@ -0,0 +1,74 @@ + + + + + + + +

+ bt_compare_ptr +

+ bt_compare_ptr(void *obj1, void *obj2): bt.c + bt_compare_ptr(void *obj1, void *obj2): bt.c +

+ bt_delete +

+ bt_delete(bt_tree *tree, void *data): bt.c + bt_delete(bt_tree *tree, void *data, int free_contents): bt.h +

+ bt_find +

+ bt_find(bt_tree *tree, void *data): bt.c + bt_find(bt_tree *tree, void *data): bt.c +

+ bt_free +

+ bt_free(bt_tree *tree, int free_contents): bt.c + bt_free(bt_tree *tree, int free_contents): bt.c +

+ bt_insert +

+ bt_insert(bt_tree *tree, void *data): bt.c + bt_insert(bt_tree *tree, void *data): bt.c +

+ bt_new +

+ bt_new(bt_compare_func compare): bt.c + bt_new(bt_compare_func compare): bt.c +

Searching...

No Matches

+ +

+ + diff --git a/docs/doxygen/html/search/functions_68.html b/docs/doxygen/html/search/functions_68.html index 5437f4e..819cf90 100644 --- a/docs/doxygen/html/search/functions_68.html +++ b/docs/doxygen/html/search/functions_68.html @@ -11,8 +11,8 @@

ht_delete

- ht_delete(ht_table *table, char *key): ht.c - ht_delete(ht_table *table, void *key, int free_key, int free_value): ht.h + ht_delete(ht_table *table, void *key, int free_key, int free_value): ht.c + ht_delete(ht_table *table, void *key, int free_key, int free_value): ht.c

@@ -20,8 +20,8 @@

ht_free

- ht_free(ht_table *table): ht.c - ht_free(ht_table *table, int free_key, int free_value): ht.h + ht_free(ht_table *table, int free_key, int free_value): ht.c + ht_free(ht_table *table, int free_key, int free_value): ht.c

@@ -29,8 +29,8 @@

ht_get

- ht_get(ht_table *table, char *key): ht.c - ht_get(ht_table *table, void *key): ht.h + ht_get(ht_table *table, void *key): ht.c + ht_get(ht_table *table, void *key): ht.c

@@ -56,7 +56,7 @@

ht_put

- ht_put(ht_table *table, void *key, void *val): ht.c + ht_put(ht_table *table, void *key, void *val): ht.c ht_put(ht_table *table, void *key, void *val): ht.c

@@ -65,7 +65,7 @@

ht_resize

- ht_resize(ht_table *table, unsigned int size): ht.c + ht_resize(ht_table *table, unsigned int size): ht.c ht_resize(ht_table *table, unsigned int size): ht.c

diff --git a/docs/doxygen/html/search/functions_73.html b/docs/doxygen/html/search/functions_73.html index 1a38215..be09f29 100644 --- a/docs/doxygen/html/search/functions_73.html +++ b/docs/doxygen/html/search/functions_73.html @@ -7,12 +7,12 @@

- sll_add + sll_back

- sll_add(sll_node *list, void *contents): sll.c - sll_add(sll_node *list, void *contents): sll.c + sll_back(sll_node *list): sll.c + sll_back(sll_node *list): sll.c

@@ -34,30 +34,30 @@

- sll_get + sll_front

- sll_get(sll_node *list, int index): sll.c - sll_get(sll_node *list, int index): sll.c + sll_front(sll_node *list): sll.c + sll_front(sll_node *list): sll.c

- sll_insert + sll_index

- sll_insert(sll_node *list, int index, void *contents): sll.c - sll_insert(sll_node *list, int index, void *contents): sll.c + sll_index(sll_node *list, int index): sll.c + sll_index(sll_node *list, int index): sll.c

- sll_last + sll_insert

- sll_last(sll_node *list): sll.c - sll_last(sll_node *list): sll.c + sll_insert(sll_node *list, int index, void *contents): sll.c + sll_insert(sll_node *list, int index, void *contents): sll.c

@@ -79,6 +79,42 @@

+ sll_pop_back +

+ sll_pop_back(sll_node *list): sll.c + sll_pop_back(sll_node *list): sll.c +

+ sll_pop_front +

+ sll_pop_front(sll_node *list): sll.c + sll_pop_front(sll_node *list): sll.c +

+ sll_push_back +

+ sll_push_back(sll_node *list, void *contents): sll.c + sll_push_back(sll_node *list, void *contents): sll.c +

+ sll_push_front +

+ sll_push_front(sll_node *list, void *contents): sll.c + sll_push_front(sll_node *list, void *contents): sll.c +

Searching...

No Matches

+ + + diff --git a/docs/doxygen/html/search/typedefs_68.html b/docs/doxygen/html/search/typedefs_68.html index 1a306b4..b38a89f 100644 --- a/docs/doxygen/html/search/typedefs_68.html +++ b/docs/doxygen/html/search/typedefs_68.html @@ -15,7 +15,7 @@

- ht_node + ht_node ht.h

diff --git a/docs/doxygen/html/search/typedefs_73.html b/docs/doxygen/html/search/typedefs_73.html index 3a0b8db..9884e2e 100644 --- a/docs/doxygen/html/search/typedefs_73.html +++ b/docs/doxygen/html/search/typedefs_73.html @@ -9,7 +9,7 @@

- sll_node + sll_node sll.h

diff --git a/docs/doxygen/html/search/variables_63.html b/docs/doxygen/html/search/variables_63.html index b1b11f6..b032bf2 100644 --- a/docs/doxygen/html/search/variables_63.html +++ b/docs/doxygen/html/search/variables_63.html @@ -7,10 +7,19 @@

+ compare + bt_tree +

- contents - node + contents +

+ sll_node::contents() + bt_node::contents() +

Searching...

diff --git a/docs/doxygen/html/search/variables_6b.html b/docs/doxygen/html/search/variables_6b.html index 7abfe07..df8f87b 100644 --- a/docs/doxygen/html/search/variables_6b.html +++ b/docs/doxygen/html/search/variables_6b.html @@ -9,8 +9,8 @@

- key - node + key + ht_node

Searching...

diff --git a/docs/doxygen/html/search/variables_6c.html b/docs/doxygen/html/search/variables_6c.html new file mode 100644 index 0000000..cd6897b --- /dev/null +++ b/docs/doxygen/html/search/variables_6c.html @@ -0,0 +1,26 @@ + + + + + + + +

+ left + bt_node +

Searching...

No Matches

+ +

+ + diff --git a/docs/doxygen/html/search/variables_6e.html b/docs/doxygen/html/search/variables_6e.html index fb0f8d8..ec17e51 100644 --- a/docs/doxygen/html/search/variables_6e.html +++ b/docs/doxygen/html/search/variables_6e.html @@ -9,8 +9,11 @@

- next - node + next +

+ ht_node::next() + sll_node::next() +

Searching...

diff --git a/docs/doxygen/html/search/variables_72.html b/docs/doxygen/html/search/variables_72.html new file mode 100644 index 0000000..a48d749 --- /dev/null +++ b/docs/doxygen/html/search/variables_72.html @@ -0,0 +1,32 @@ + + + + + + + +

+ right + bt_node +

+ root + bt_tree +

Searching...

No Matches

+ +

+ + diff --git a/docs/doxygen/html/search/variables_76.html b/docs/doxygen/html/search/variables_76.html index c85b40a..638e224 100644 --- a/docs/doxygen/html/search/variables_76.html +++ b/docs/doxygen/html/search/variables_76.html @@ -9,8 +9,8 @@

- val - node + val + ht_node

Searching...

diff --git a/docs/doxygen/html/sll_8c.html b/docs/doxygen/html/sll_8c.html index f850ba8..92d332c 100644 --- a/docs/doxygen/html/sll_8c.html +++ b/docs/doxygen/html/sll_8c.html @@ -97,67 +97,64 @@ Include dependency graph for sll.c:

- + - - - - - - - + + + + + + + + + + + + + + + - + - + - +

Functions
sll_node *	sll_new (void *contents)
sll_node *	sll_new (void *contents)
	Creates a new linked list node with the supplied value.
sll_node *	sll_last (sll_node *list)
	Finds and returns the last node in the supplied linked list.
sll_node *	sll_get (sll_node *list, int index)
	Return the node at the specified index in a linked list.
sll_node *	sll_add (sll_node list, void contents)
	Adds a new node to an existing linked list.
sll_node *	sll_insert (sll_node list, int index, void contents)
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)
	Removes and returns a pointer to the last element of the list.
sll_node *	sll_pop_front (sll_node *list)
	Removes and returns a pointer to the first element of the 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)
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)
void	sll_free (sll_node *list, int free_contents)
	Frees all memory used by a linked list.
unsigned int	sll_length (sll_node *list)
unsigned int	sll_length (sll_node *list)
	Returns the number of elements in the list.

Function Documentation

- +

- + - - - - - - - - - - + + - -

sll_node* sll_add	sll_node* sll_back	(	sll_node *	list,
		void *	contents
sll_node *	list	)		)

Adds a new node to an existing linked list.

Finds and returns the last node in the supplied linked list.

Parameters:

- - +

list
contents
list	The linked list to search.

Returns:: Pointer to the newly added node.

Returns:: Pointer to the last node in the supplied list.

Definition at line 59 of file sll.c.

Definition at line 42 of file sll.c.

-Here is the call graph for this function:

+Here is the caller graph for this function:

- - +

+ +

@@ -168,9 +165,9 @@ Here is the call graph for this function:

- + - + @@ -206,14 +203,14 @@ Here is the call graph for this function:

Returns:: Pointer to the node that is now at the supplied index.

Definition at line 79 of file sll.c.

Definition at line 102 of file sll.c.

Here is the call graph for this function:

- +

@@ -226,7 +223,7 @@ Here is the call graph for this function: - + @@ -254,18 +251,46 @@ Here is the call graph for this function: -

Definition at line 96 of file sll.c.

Definition at line 119 of file sll.c.

+ + + + +

sll_node* sll_delete	sll_node* sll_delete	(	sll_node *	sll_node *	list,
void sll_free	(	sll_node *	sll_node *	list,

+ + + + + + + +

sll_node* sll_front ( sll_node * list )

+ +

Finds and returns the first node in the supplied linked list.

Parameters:

+ + +

list	The linked list to search.

Returns:: Pointer to the last node in the supplied list.

+ +

Definition at line 38 of file sll.c.

- +

- + - + @@ -294,14 +319,14 @@ Here is the call graph for this function:

Returns:: A pointer to the node and the supplied index, NULL if out of range.

Definition at line 41 of file sll.c.

Definition at line 52 of file sll.c.

Here is the caller graph for this function:

- - +

+ +

@@ -312,9 +337,9 @@ Here is the caller graph for this function:

sll_node* sll_get sll_node* sll_index ( sll_node * sll_node * list,

- + - + @@ -349,27 +374,27 @@ Here is the caller graph for this function:

Returns:: Pointer to the newly inserted node, NULL if index is out of range.

Definition at line 65 of file sll.c.

Definition at line 88 of file sll.c.

Here is the call graph for this function:

- +

sll_node* sll_insert sll_node* sll_insert ( sll_node * sll_node * list,

- + - + @@ -377,36 +402,66 @@ Here is the call graph for this function:

Finds and returns the last node in the supplied linked list.

Returns the number of elements in the list.

Loops through the supplied list and returns a count of the number of elements contained in the list.

Parameters:

sll_node* sll_last unsigned int sll_length ( sll_node * sll_node * list )

- +

list	The linked list to search.
list	The list to be counted.

Returns:: Pointer to the last node in the supplied list.

Returns:: The number of elements in the list.

+ +

Definition at line 134 of file sll.c.

+ +

+ + + + + + + + +

sll_node* sll_new ( void * contents )

Definition at line 31 of file sll.c.

Creates a new linked list node with the supplied value.

This function allocates a new node on the heap and populates the node contents with the supplied contents pointer.

Parameters:

+ + +

contents The contents of the newly created node.

Returns:: A pointer to the newly created node.

+ +

Definition at line 30 of file sll.c.

Here is the caller graph for this function:

- - +

+ +

- +

- + - + @@ -414,56 +469,134 @@ Here is the caller graph for this function:

Returns the number of elements in the list.

Loops through the supplied list and returns a count of the number of elements contained in the list.

Removes and returns a pointer to the last element of the list.

Parameters:

unsigned int sll_length sll_node* sll_pop_back ( sll_node * sll_node * list )

- + +

list	The list to be counted.
list
contents

Returns:: The number of elements in the list.

Returns:: Pointer to the newly added node.

Definition at line 111 of file sll.c.

Definition at line 80 of file sll.c.

- + +

+ + + + + + + + +

sll_node* sll_pop_front ( sll_node * list )

+ +

Removes and returns a pointer to the first element of the list.

Parameters:

+ + + +

list
contents

Returns:: Pointer to the newly added node.

+ +

Definition at line 84 of file sll.c.

+ +

- + + + + + + + - + + + + +

sll_node* sll_new	sll_node* sll_push_back	(	sll_node *	list,
		void *	contents	)	contents
	)

Creates a new linked list node with the supplied value.

Allocates a new node on the heap and populates the node contents with the supplied contents pointer.

Adds a new node to the end of an existing linked list.

Parameters:

- + +

contents	The contents of the newly created node.
list
contents

Returns:: A pointer to the newly created node.

Returns:: Pointer to the newly added node.

Definition at line 23 of file sll.c.

Definition at line 70 of file sll.c.

-Here is the caller graph for this function:

+Here is the call graph for this function:

- - +

+ +

+ + +

+ + + + + + + + + + + + + + + + + + +

sll_node* sll_push_front	(	sll_node *	list,
		void *	contents
	)

+ +

Adds a new node to the front of an existing linked list.

Parameters:

+ + + +

list
contents

Returns:: Pointer to the newly added node.

+ +

Definition at line 76 of file sll.c.

@@ -471,7 +604,7 @@ Here is the caller graph for this function:

sll.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.map b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.map new file mode 100644 index 0000000..215a775 --- /dev/null +++ b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 new file mode 100644 index 0000000..bab161b --- /dev/null +++ b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 @@ -0,0 +1 @@ +b6584d19ee0d40d5efb71710f0e680e9 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.png b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.png new file mode 100644 index 0000000..5848b13 Binary files /dev/null and b/docs/doxygen/html/sll_8c_a0582f263482ead73d53b018978513540_icgraph.png differ diff --git a/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map new file mode 100644 index 0000000..f76c40d --- /dev/null +++ b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 new file mode 100644 index 0000000..21203ee --- /dev/null +++ b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 @@ -0,0 +1 @@ +f0eaae5a00fe62d72874f4a790f93d86 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png new file mode 100644 index 0000000..d613aa9 Binary files /dev/null and b/docs/doxygen/html/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png differ diff --git a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.map b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.map index 9ab754b..f5abede 100644 --- a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.map +++ b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.map @@ -1,4 +1,4 @@ - - + + diff --git a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 index 78fa678..17add7a 100644 --- a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 +++ b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 @@ -1 +1 @@ -1ae6766da0c2ac7f937ec87db8fab253 \ No newline at end of file +24311e03e208ca06ba4307b0636c7bf5 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.png b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.png index 73dff1e..236c2b6 100644 Binary files a/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.png and b/docs/doxygen/html/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.png differ diff --git a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.map b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.map index c271b5f..d3ea992 100644 --- a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.map +++ b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.map @@ -1,4 +1,4 @@ - - + + diff --git a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 index b5e07bd..aed6b8d 100644 --- a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 +++ b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 @@ -1 +1 @@ -ff11d8f8b0b38a1b305a7bf13e6f2952 \ No newline at end of file +493ae324bbbeae2a5e2343119345e996 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.png b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.png index 27fafb2..24428c5 100644 Binary files a/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.png and b/docs/doxygen/html/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.png differ diff --git a/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.map b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.map new file mode 100644 index 0000000..af2458c --- /dev/null +++ b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.map @@ -0,0 +1,3 @@ + + + diff --git a/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 new file mode 100644 index 0000000..b9a1cdb --- /dev/null +++ b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 @@ -0,0 +1 @@ +ec7827fa24fb39aad7229bcdca5234c5 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.png b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.png new file mode 100644 index 0000000..eff8ca7 Binary files /dev/null and b/docs/doxygen/html/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.png differ diff --git a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.map b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.map index 5b3d4d0..65f9037 100644 --- a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.map +++ b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.map @@ -1,3 +1,3 @@ - + diff --git a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 index bb0f2dc..9205e80 100644 --- a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 +++ b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 @@ -1 +1 @@ -2b69d7a9b9aa88a844d7bbc6333b6f89 \ No newline at end of file +0421e0bf499fbdebfb519e23e96452d9 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.png b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.png index 417228a..55889dc 100644 Binary files a/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.png and b/docs/doxygen/html/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.png differ diff --git a/docs/doxygen/html/sll_8c_source.html b/docs/doxygen/html/sll_8c_source.html index 55edf84..7dcda9c 100644 --- a/docs/doxygen/html/sll_8c_source.html +++ b/docs/doxygen/html/sll_8c_source.html @@ -82,132 +82,155 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Go to the documentation of this file.

00001 /******************************************************************************
-00002  *  Copyright (C) 2011  Michael D. Lowis
-00003  *
-00004  *  This program is free software: you can redistribute it and/or modify
-00005  *  it under the terms of the GNU General Public License as published by
-00006  *  the Free Software Foundation, either version 3 of the License, or
-00007  *  (at your option) any later version.
-00008  *
-00009  *  This program is distributed in the hope that it will be useful,
-00010  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
-00011  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-00012  *  GNU General Public License for more details.
-00013  *
-00014  *  You should have received a copy of the GNU General Public License
-00015  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
-00016  *****************************************************************************/
-00017 #include "sll.h"
-00018 #include <stdlib.h>
-00019 
-00020 /******************************************************************************
-00021  * Public Functions
-00022  ******************************************************************************/
-00023 sll_node* sll_new( void* contents )
-00024 {
-00025     sll_node* list = (sll_node*)malloc( sizeof(sll_node) );
-00026     list->contents = contents;
-00027     list->next = NULL;
-00028     return list;
-00029 }
-00030 
-00031 sll_node* sll_last( sll_node* list )
-00032 {
-00033     sll_node* node = list;
-00034     while((node != NULL) && (node->next != NULL))
-00035     {
-00036         node = node->next;
-00037     }
-00038     return node;
-00039 }
-00040 
-00041 sll_node* sll_get( sll_node* list, int index )
-00042 {
-00043     int current = 0;
-00044     sll_node* node = list;
-00045     sll_node* indexed_node = NULL;
-00046     while ((node != NULL))
-00047     {
-00048         if ( current == index )
-00049         {
-00050             indexed_node = node;
-00051             break;
-00052         }
-00053         node = node->next;
-00054         current++;
-00055     }
-00056     return indexed_node;
-00057 }
-00058 
-00059 sll_node* sll_add( sll_node* list, void* contents )
-00060 {
-00061     sll_node* node = sll_last( list );
-00062     node->next = sll_new( contents );
-00063 }
-00064 
-00065 sll_node* sll_insert( sll_node* list, int index, void* contents )
-00066 {
-00067     int req_index = ((index-1) < 0) ? 0 : index-1;
-00068     sll_node* node = sll_get( list, req_index );
-00069     if(node != NULL)
-00070     {
-00071         sll_node* next_next = node->next;
-00072         node->next = sll_new( contents );
-00073         node->next->next = next_next;
-00074         node = node->next;
-00075     }
-00076     return node;
-00077 }
-00078 
-00079 sll_node* sll_delete( sll_node* list, int index, int free_contents)
-00080 {
-00081     sll_node* node = sll_get( list, (index-1));
-00082     if((node != NULL) && (node->next != NULL))
-00083     {
-00084         sll_node* node_to_delete = node->next;
-00085         node->next = node_to_delete->next;
-00086         if (free_contents)
-00087         {
-00088             free(node_to_delete->contents);
-00089         }
-00090         free(node_to_delete);
-00091         node = node->next;
-00092     }
-00093     return node;
-00094 }
-00095 
-00096 void sll_free( sll_node* list, int free_contents)
-00097 {
-00098     sll_node* node = list;
-00099     while( node != NULL )
-00100     {
-00101         sll_node* next = node->next;
-00102         if (free_contents)
-00103             {
-00104             free(node->contents);
-00105             }
-00106         free(node);
-00107         node = next;
-00108     }
-00109 }
-00110 
-00111 unsigned int sll_length(sll_node* list)
-00112 {
-00113     unsigned int length = 0;
-00114     sll_node* item = list;
-00115     for ( item = list; item != NULL; item = item->next )
-00116     {
-00117         length++;
-00118     }
-00119     return length;
-00120 }
-00121 
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #include "sll.h"
+00028 #include <stdlib.h>
+00029 
+00030 sll_node* sll_new( void* contents )
+00031 {
+00032     sll_node* list = (sll_node*)malloc( sizeof(sll_node) );
+00033     list->contents = contents;
+00034     list->next = NULL;
+00035     return list;
+00036 }
+00037 
+00038 sll_node* sll_front( sll_node* list )
+00039 {
+00040 }
+00041 
+00042 sll_node* sll_back( sll_node* list )
+00043 {
+00044     sll_node* node = list;
+00045     while((node != NULL) && (node->next != NULL))
+00046     {
+00047         node = node->next;
+00048     }
+00049     return node;
+00050 }
+00051 
+00052 sll_node* sll_index( sll_node* list, int index )
+00053 {
+00054     int current = 0;
+00055     sll_node* node = list;
+00056     sll_node* indexed_node = NULL;
+00057     while ((node != NULL))
+00058     {
+00059         if ( current == index )
+00060         {
+00061             indexed_node = node;
+00062             break;
+00063         }
+00064         node = node->next;
+00065         current++;
+00066     }
+00067     return indexed_node;
+00068 }
+00069 
+00070 sll_node* sll_push_back( sll_node* list, void* contents )
+00071 {
+00072     sll_node* node = sll_back( list );
+00073     node->next = sll_new( contents );
+00074 }
+00075 
+00076 sll_node* sll_push_front( sll_node* list, void* contents )
+00077 {
+00078 }
+00079 
+00080 sll_node* sll_pop_back( sll_node* list )
+00081 {
+00082 }
+00083 
+00084 sll_node* sll_pop_front( sll_node* list )
+00085 {
+00086 }
+00087 
+00088 sll_node* sll_insert( sll_node* list, int index, void* contents )
+00089 {
+00090     int req_index = ((index-1) < 0) ? 0 : index-1;
+00091     sll_node* node = sll_index( list, req_index );
+00092     if(node != NULL)
+00093     {
+00094         sll_node* next_next = node->next;
+00095         node->next = sll_new( contents );
+00096         node->next->next = next_next;
+00097         node = node->next;
+00098     }
+00099     return node;
+00100 }
+00101 
+00102 sll_node* sll_delete( sll_node* list, int index, int free_contents)
+00103 {
+00104     sll_node* node = sll_index( list, (index-1));
+00105     if((node != NULL) && (node->next != NULL))
+00106     {
+00107         sll_node* node_to_delete = node->next;
+00108         node->next = node_to_delete->next;
+00109         if (free_contents)
+00110         {
+00111             free(node_to_delete->contents);
+00112         }
+00113         free(node_to_delete);
+00114         node = node->next;
+00115     }
+00116     return node;
+00117 }
+00118 
+00119 void sll_free( sll_node* list, int free_contents)
+00120 {
+00121     sll_node* node = list;
+00122     while( node != NULL )
+00123     {
+00124         sll_node* next = node->next;
+00125         if (free_contents)
+00126             {
+00127             free(node->contents);
+00128             }
+00129         free(node);
+00130         node = next;
+00131     }
+00132 }
+00133 
+00134 unsigned int sll_length(sll_node* list)
+00135 {
+00136     unsigned int length = 0;
+00137     sll_node* item = list;
+00138     for ( item = list; item != NULL; item = item->next )
+00139     {
+00140         length++;
+00141     }
+00142     return length;
+00143 }
+00144

sll.c
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:03 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/sll_8h.html b/docs/doxygen/html/sll_8h.html index 73e13d0..03d1e85 100644 --- a/docs/doxygen/html/sll_8h.html +++ b/docs/doxygen/html/sll_8h.html @@ -97,88 +97,88 @@ This graph shows which files directly or indirectly include this file:

- - + + - + + - + - - - - - - - + + + + + + + + + + + + + + + - + - + - +

Classes
struct	node
	A node in a hash table. More...
struct	sll_node
	A linked list node. More...
Typedefs
typedef struct node	sll_node
typedef struct sll_node	sll_node
	A linked list node.
Functions
sll_node *	sll_new (void *contents)
sll_node *	sll_new (void *contents)
	Creates a new linked list node with the supplied value.
sll_node *	sll_last (sll_node *list)
	Finds and returns the last node in the supplied linked list.
sll_node *	sll_get (sll_node *list, int index)
	Return the node at the specified index in a linked list.
sll_node *	sll_add (sll_node list, void contents)
	Adds a new node to an existing linked list.
sll_node *	sll_insert (sll_node list, int index, void contents)
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)
	Removes and returns a pointer to the last element of the list.
sll_node *	sll_pop_front (sll_node *list)
	Removes and returns a pointer to the first element of the 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)
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)
void	sll_free (sll_node *list, int free_contents)
	Frees all memory used by a linked list.
unsigned int	sll_length (sll_node *list)
unsigned int	sll_length (sll_node *list)
	Returns the number of elements in the list.

Typedef Documentation

- +

typedef struct node sll_node typedef struct sll_node sll_node

A linked list node.

Function Documentation

- +

- + - - - - - - - - - - + + - -

sll_node* sll_add	sll_node* sll_back	(	sll_node *	list,
		void *	contents
sll_node *	list	)		)

Adds a new node to an existing linked list.

Finds and returns the last node in the supplied linked list.

Parameters:

- - +

list
contents
list	The linked list to search.

Returns:: Pointer to the newly added node.

Returns:: Pointer to the last node in the supplied list.

Definition at line 59 of file sll.c.

Definition at line 42 of file sll.c.

-Here is the call graph for this function:

+Here is the caller graph for this function:

- - +

+ +

@@ -189,9 +189,9 @@ Here is the call graph for this function:

- + - + @@ -227,14 +227,14 @@ Here is the call graph for this function:

Returns:: Pointer to the node that is now at the supplied index.

Definition at line 79 of file sll.c.

Definition at line 102 of file sll.c.

Here is the call graph for this function:

- +

@@ -247,7 +247,7 @@ Here is the call graph for this function: - + @@ -275,18 +275,46 @@ Here is the call graph for this function: -

Definition at line 96 of file sll.c.

Definition at line 119 of file sll.c.

- +

sll_node* sll_delete	sll_node* sll_delete	(	sll_node *	sll_node *	list,
void sll_free	(	sll_node *	sll_node *	list,

- + - + + + + +

sll_node* sll_get sll_node* sll_front ( sll_node * sll_node * list )

+ +

Finds and returns the first node in the supplied linked list.

Parameters:

+ + +

list	The linked list to search.

Returns:: Pointer to the last node in the supplied list.

+ +

Definition at line 38 of file sll.c.

+ +

+ + +

+ + + + + @@ -315,14 +343,14 @@ Here is the call graph for this function:

Returns:: A pointer to the node and the supplied index, NULL if out of range.

Definition at line 41 of file sll.c.

Definition at line 52 of file sll.c.

Here is the caller graph for this function:

- - +

+ +

@@ -333,9 +361,9 @@ Here is the caller graph for this function:

sll_node* sll_index ( sll_node * list,

- + - + @@ -370,27 +398,27 @@ Here is the caller graph for this function:

Returns:: Pointer to the newly inserted node, NULL if index is out of range.

Definition at line 65 of file sll.c.

Definition at line 88 of file sll.c.

Here is the call graph for this function:

- +

sll_node* sll_insert sll_node* sll_insert ( sll_node * sll_node * list,

- + - + @@ -398,36 +426,66 @@ Here is the call graph for this function:

Finds and returns the last node in the supplied linked list.

Returns the number of elements in the list.

Loops through the supplied list and returns a count of the number of elements contained in the list.

Parameters:

sll_node* sll_last unsigned int sll_length ( sll_node * sll_node * list )

- +

list	The linked list to search.
list	The list to be counted.

Returns:: Pointer to the last node in the supplied list.

Returns:: The number of elements in the list.

+ +

Definition at line 134 of file sll.c.

+ +

+ + + + + + + + +

sll_node* sll_new ( void * contents )

Definition at line 31 of file sll.c.

Creates a new linked list node with the supplied value.

This function allocates a new node on the heap and populates the node contents with the supplied contents pointer.

Parameters:

+ + +

contents The contents of the newly created node.

Returns:: A pointer to the newly created node.

+ +

Definition at line 30 of file sll.c.

Here is the caller graph for this function:

- - +

+ +

- +

- + - + @@ -435,56 +493,134 @@ Here is the caller graph for this function:

Returns the number of elements in the list.

Loops through the supplied list and returns a count of the number of elements contained in the list.

Removes and returns a pointer to the last element of the list.

Parameters:

unsigned int sll_length sll_node* sll_pop_back ( sll_node * sll_node * list )

- + +

list	The list to be counted.
list
contents

Returns:: The number of elements in the list.

Returns:: Pointer to the newly added node.

Definition at line 111 of file sll.c.

Definition at line 80 of file sll.c.

- +

- + + + + + +

sll_node* sll_new sll_node* sll_pop_front ( sll_node * list )

+ +

Removes and returns a pointer to the first element of the list.

Parameters:

+ + + +

list
contents

Returns:: Pointer to the newly added node.

+ +

Definition at line 84 of file sll.c.

+ +

+ + + + + + + + + + - + + + + +

sll_node* sll_push_back	(	sll_node *	list,
		void *	contents	)	contents
	)

Creates a new linked list node with the supplied value.

Allocates a new node on the heap and populates the node contents with the supplied contents pointer.

Adds a new node to the end of an existing linked list.

Parameters:

- + +

contents	The contents of the newly created node.
list
contents

Returns:: A pointer to the newly created node.

Returns:: Pointer to the newly added node.

Definition at line 23 of file sll.c.

Definition at line 70 of file sll.c.

-Here is the caller graph for this function:

+Here is the call graph for this function:

- - +

+ +

+ + +

+ + + + + + + + + + + + + + + + + + +

sll_node* sll_push_front	(	sll_node *	list,
		void *	contents
	)

+ +

Adds a new node to the front of an existing linked list.

Parameters:

+ + + +

list
contents

Returns:: Pointer to the newly added node.

+ +

Definition at line 76 of file sll.c.

@@ -492,7 +628,7 @@ Here is the caller graph for this function:

sll.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.map b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.map new file mode 100644 index 0000000..215a775 --- /dev/null +++ b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 new file mode 100644 index 0000000..bab161b --- /dev/null +++ b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 @@ -0,0 +1 @@ +b6584d19ee0d40d5efb71710f0e680e9 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.png b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.png new file mode 100644 index 0000000..2888cc8 Binary files /dev/null and b/docs/doxygen/html/sll_8h_a0582f263482ead73d53b018978513540_icgraph.png differ diff --git a/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map new file mode 100644 index 0000000..f76c40d --- /dev/null +++ b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 new file mode 100644 index 0000000..21203ee --- /dev/null +++ b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 @@ -0,0 +1 @@ +f0eaae5a00fe62d72874f4a790f93d86 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png new file mode 100644 index 0000000..d613aa9 Binary files /dev/null and b/docs/doxygen/html/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.png differ diff --git a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.map b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.map index 9ab754b..f5abede 100644 --- a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.map +++ b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.map @@ -1,4 +1,4 @@ - - + + diff --git a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 index 78fa678..17add7a 100644 --- a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 +++ b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 @@ -1 +1 @@ -1ae6766da0c2ac7f937ec87db8fab253 \ No newline at end of file +24311e03e208ca06ba4307b0636c7bf5 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.png b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.png index d30be02..236c2b6 100644 Binary files a/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.png and b/docs/doxygen/html/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.png differ diff --git a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.map b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.map index c271b5f..d3ea992 100644 --- a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.map +++ b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.map @@ -1,4 +1,4 @@ - - + + diff --git a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 index b5e07bd..aed6b8d 100644 --- a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 +++ b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 @@ -1 +1 @@ -ff11d8f8b0b38a1b305a7bf13e6f2952 \ No newline at end of file +493ae324bbbeae2a5e2343119345e996 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.png b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.png index 191a75e..8717600 100644 Binary files a/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.png and b/docs/doxygen/html/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.png differ diff --git a/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.map b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.map new file mode 100644 index 0000000..af2458c --- /dev/null +++ b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.map @@ -0,0 +1,3 @@ + + + diff --git a/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 new file mode 100644 index 0000000..b9a1cdb --- /dev/null +++ b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 @@ -0,0 +1 @@ +ec7827fa24fb39aad7229bcdca5234c5 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.png b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.png new file mode 100644 index 0000000..69860c3 Binary files /dev/null and b/docs/doxygen/html/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.png differ diff --git a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.map b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.map index 5b3d4d0..65f9037 100644 --- a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.map +++ b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.map @@ -1,3 +1,3 @@ - + diff --git a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 index bb0f2dc..9205e80 100644 --- a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 +++ b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 @@ -1 +1 @@ -2b69d7a9b9aa88a844d7bbc6333b6f89 \ No newline at end of file +0421e0bf499fbdebfb519e23e96452d9 \ No newline at end of file diff --git a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.png b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.png index 417228a..977493f 100644 Binary files a/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.png and b/docs/doxygen/html/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.png differ diff --git a/docs/doxygen/html/sll_8h_source.html b/docs/doxygen/html/sll_8h_source.html index ce402e2..5ca3dbe 100644 --- a/docs/doxygen/html/sll_8h_source.html +++ b/docs/doxygen/html/sll_8h_source.html @@ -82,53 +82,71 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

Go to the documentation of this file.

00001 /******************************************************************************
-00002  *  Copyright (C) 2011  Michael D. Lowis
-00003  *
-00004  *  This program is free software: you can redistribute it and/or modify
-00005  *  it under the terms of the GNU General Public License as published by
-00006  *  the Free Software Foundation, either version 3 of the License, or
-00007  *  (at your option) any later version.
-00008  *
-00009  *  This program is distributed in the hope that it will be useful,
-00010  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
-00011  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-00012  *  GNU General Public License for more details.
-00013  *
-00014  *  You should have received a copy of the GNU General Public License
-00015  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
-00016  *****************************************************************************/
-00017 #ifndef LINKED_LIST_H
-00018 #define LINKED_LIST_H
-00019 
-00020 typedef struct node
-00021 {
-00022     void* contents;
-00023     struct node* next;
-00024 } sll_node;
-00025 
-00036 sll_node* sll_new( void* contents );
-00037 
-00045 sll_node* sll_last(sll_node* list);
-00046 
-00058 sll_node* sll_get(sll_node* list, int index);
+00002  * Copyright (c) 2012, Michael D. Lowis
+00003  * All rights reserved.
+00004  *
+00005  * Redistribution and use in source and binary forms, with or without
+00006  * modification, are permitted provided that the following conditions are met:
+00007  *
+00008  * * Redistributions of source code must retain the above copyright notice,
+00009  *   this list of conditions and the following disclaimer.
+00010  *
+00011  * * Redistributions in binary form must reproduce the above copyright notice,
+00012  *   this list of conditions and the following disclaimer in the documentation
+00013  *   and/or other materials provided with the distribution.
+00014  *
+00015  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+00016  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+00017  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+00018  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
+00019  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+00020  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+00021  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+00022  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+00023  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+00024  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+00025  * POSSIBILITY OF SUCH DAMAGE.
+00026  *****************************************************************************/
+00027 #ifndef SLL_H
+00028 #define SLL_H
+00029 
+00031 typedef struct sll_node
+00032 {
+00034     void* contents;
+00036     struct sll_node* next;
+00037 } sll_node;
+00038 
+00049 sll_node* sll_new( void* contents );
+00050 
+00058 sll_node* sll_front(sll_node* list);
 00059 
-00068 sll_node* sll_add( sll_node* list, void* contents );
-00069 
-00079 sll_node* sll_insert( sll_node* list, int index, void* contents);
-00080 
-00093 sll_node* sll_delete( sll_node* list, int index, int free_contents);
-00094 
-00105 void sll_free( sll_node* list, int free_contents);
-00106 
-00117 unsigned int sll_length(sll_node* list);
-00118 
-00119 #endif
+00067 sll_node* sll_back(sll_node* list);
+00068 
+00080 sll_node* sll_index(sll_node* list, int index);
+00081 
+00090 sll_node* sll_push_back( sll_node* list, void* contents );
+00091 
+00100 sll_node* sll_push_front( sll_node* list, void* contents );
+00101 
+00110 sll_node* sll_pop_back( sll_node* list );
+00111 
+00120 sll_node* sll_pop_front( sll_node* list );
+00121 
+00131 sll_node* sll_insert( sll_node* list, int index, void* contents);
+00132 
+00145 sll_node* sll_delete( sll_node* list, int index, int free_contents);
+00146 
+00157 void sll_free( sll_node* list, int free_contents);
+00158 
+00169 unsigned int sll_length(sll_node* list);
+00170 
+00171 #endif

sll.h
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/structbt__node-members.html b/docs/doxygen/html/structbt__node-members.html new file mode 100644 index 0000000..f49d8b6 --- /dev/null +++ b/docs/doxygen/html/structbt__node-members.html @@ -0,0 +1,114 @@ + + + + +Data Structures: Member List + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

+This is the complete list of members for bt_node, including all inherited members. + + + +

contents	bt_node
left	bt_node
right	bt_node

Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structbt__node.html b/docs/doxygen/html/structbt__node.html new file mode 100644 index 0000000..3936ba5 --- /dev/null +++ b/docs/doxygen/html/structbt__node.html @@ -0,0 +1,194 @@ + + + + +Data Structures: bt_node Struct Reference + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

A binary tree node. +More...

+ +

#include <bt.h>

+Collaboration diagram for bt_node:

+[legend]

+ +

List of all members.

+ + + + + + + + +

+Public Attributes
void *	contents
	The contents of the tree node.
struct bt_node *	left
	The left child of the tree node.
struct bt_node *	right
	the right child of the tree node.

Detailed Description

A binary tree node.

+ +

Definition at line 34 of file bt.h.

Member Data Documentation

+ +

+ + + + +

void* bt_node::contents

+ +

The contents of the tree node.

+ +

Definition at line 37 of file bt.h.

+ +

+ + + + +

struct bt_node* bt_node::left

+ +

The left child of the tree node.

+ +

Definition at line 39 of file bt.h.

+ +

+ + + + +

struct bt_node* bt_node::right

+ +

the right child of the tree node.

+ +

Definition at line 41 of file bt.h.

+ +

The documentation for this struct was generated from the following file:

src/trees/binary/bt.h

bt_node
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structbt__node__coll__graph.map b/docs/doxygen/html/structbt__node__coll__graph.map new file mode 100644 index 0000000..8be6a30 --- /dev/null +++ b/docs/doxygen/html/structbt__node__coll__graph.map @@ -0,0 +1,2 @@ + + diff --git a/docs/doxygen/html/structbt__node__coll__graph.md5 b/docs/doxygen/html/structbt__node__coll__graph.md5 new file mode 100644 index 0000000..172e698 --- /dev/null +++ b/docs/doxygen/html/structbt__node__coll__graph.md5 @@ -0,0 +1 @@ +87d98d54805d23183bb2452718287e70 \ No newline at end of file diff --git a/docs/doxygen/html/structbt__node__coll__graph.png b/docs/doxygen/html/structbt__node__coll__graph.png new file mode 100644 index 0000000..72a14f5 Binary files /dev/null and b/docs/doxygen/html/structbt__node__coll__graph.png differ diff --git a/docs/doxygen/html/structbt__tree-members.html b/docs/doxygen/html/structbt__tree-members.html new file mode 100644 index 0000000..bea5d8c --- /dev/null +++ b/docs/doxygen/html/structbt__tree-members.html @@ -0,0 +1,113 @@ + + + + +Data Structures: Member List + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

+This is the complete list of members for bt_tree, including all inherited members. + + +

compare	bt_tree
root	bt_tree

Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structbt__tree.html b/docs/doxygen/html/structbt__tree.html new file mode 100644 index 0000000..5ccb338 --- /dev/null +++ b/docs/doxygen/html/structbt__tree.html @@ -0,0 +1,177 @@ + + + + +Data Structures: bt_tree Struct Reference + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

A binary tree. +More...

+ +

#include <bt.h>

+Collaboration diagram for bt_tree:

+ + +[legend]

+ +

List of all members.

+ + + + + + +

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

Detailed Description

A binary tree.

+ +

Definition at line 45 of file bt.h.

Member Data Documentation

+ +

+ + + + +

bt_compare_func bt_tree::compare

+ +

The function used to compare data.

+ +

Definition at line 50 of file bt.h.

+ +

+ + + + +

bt_node* bt_tree::root

+ +

The root of the binary tree.

+ +

Definition at line 48 of file bt.h.

+ +

The documentation for this struct was generated from the following file:

src/trees/binary/bt.h

bt_tree
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structbt__tree__coll__graph.map b/docs/doxygen/html/structbt__tree__coll__graph.map new file mode 100644 index 0000000..8953904 --- /dev/null +++ b/docs/doxygen/html/structbt__tree__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/docs/doxygen/html/structbt__tree__coll__graph.md5 b/docs/doxygen/html/structbt__tree__coll__graph.md5 new file mode 100644 index 0000000..182a7b6 --- /dev/null +++ b/docs/doxygen/html/structbt__tree__coll__graph.md5 @@ -0,0 +1 @@ +a0300b13010e96b2f69776cc395f6be1 \ No newline at end of file diff --git a/docs/doxygen/html/structbt__tree__coll__graph.png b/docs/doxygen/html/structbt__tree__coll__graph.png new file mode 100644 index 0000000..64ea8dd Binary files /dev/null and b/docs/doxygen/html/structbt__tree__coll__graph.png differ diff --git a/docs/doxygen/html/structht__node-members.html b/docs/doxygen/html/structht__node-members.html new file mode 100644 index 0000000..97192f6 --- /dev/null +++ b/docs/doxygen/html/structht__node-members.html @@ -0,0 +1,114 @@ + + + + +Data Structures: Member List + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

+This is the complete list of members for ht_node, including all inherited members. + + + +

key	ht_node
next	ht_node
val	ht_node

Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structht__node.html b/docs/doxygen/html/structht__node.html new file mode 100644 index 0000000..13ec7d0 --- /dev/null +++ b/docs/doxygen/html/structht__node.html @@ -0,0 +1,189 @@ + + + + +Data Structures: ht_node Struct Reference + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

A node in a hash table. +More...

+ +

#include <ht.h>

+ +

List of all members.

+ + + + + + + + +

+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.

Detailed Description

A node in a hash table.

+ +

Definition at line 34 of file ht.h.

Member Data Documentation

+ +

+ + + + +

void* ht_node::key

+ +

Pointer to the key.

+ +

Definition at line 37 of file ht.h.

+ +

+ + + + +

struct node* ht_node::next

+ +

Pointer to the next node in the collision chain.

+ +

Definition at line 41 of file ht.h.

+ +

+ + + + +

void* ht_node::val

+ +

Pointer to the value.

+ +

Definition at line 39 of file ht.h.

+ +

The documentation for this struct was generated from the following file:

src/ht/ht.h

ht_node
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structht__table-members.html b/docs/doxygen/html/structht__table-members.html index ef21118..747eede 100644 --- a/docs/doxygen/html/structht__table-members.html +++ b/docs/doxygen/html/structht__table-members.html @@ -90,7 +90,7 @@ This is the complete list of members for

Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/structht__table.html b/docs/doxygen/html/structht__table.html index a9b4548..628ce81 100644 --- a/docs/doxygen/html/structht__table.html +++ b/docs/doxygen/html/structht__table.html @@ -94,7 +94,7 @@ Collaboration diagram for ht_table:

- + [legend]

List of all members.

@@ -103,7 +103,7 @@ Collaboration diagram for ht_table: Public Attributes unsigned int size Size of the internal table.
-ht_node ** table +ht_node ** table Pointer to the internal hashing table.
ht_hash_func hash_func Function used for hashing elements.
@@ -111,7 +111,7 @@ Public Attributes

Detailed Description

A hash table.

Definition at line 35 of file ht.h.

Definition at line 45 of file ht.h.

Member Data Documentation

@@ -126,7 +126,7 @@ Public Attributes

Function used for hashing elements.

Definition at line 42 of file ht.h.

Definition at line 52 of file ht.h.

@@ -143,7 +143,7 @@ Public Attributes

Size of the internal table.

Definition at line 38 of file ht.h.

Definition at line 48 of file ht.h.

@@ -152,7 +152,7 @@ Public Attributes

- +

ht_node** ht_table::table ht_node** ht_table::table

@@ -160,7 +160,7 @@ Public Attributes

Pointer to the internal hashing table.

Definition at line 40 of file ht.h.

Definition at line 50 of file ht.h.

@@ -172,7 +172,7 @@ Public Attributes

ht_table
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/structht__table__coll__graph.map b/docs/doxygen/html/structht__table__coll__graph.map index 04ae492..c6b2096 100644 --- a/docs/doxygen/html/structht__table__coll__graph.map +++ b/docs/doxygen/html/structht__table__coll__graph.map @@ -1,3 +1,3 @@ - + diff --git a/docs/doxygen/html/structht__table__coll__graph.md5 b/docs/doxygen/html/structht__table__coll__graph.md5 index d9c64e8..3746564 100644 --- a/docs/doxygen/html/structht__table__coll__graph.md5 +++ b/docs/doxygen/html/structht__table__coll__graph.md5 @@ -1 +1 @@ -ea893cd46a010dfcebb9ac9fc29c52d2 \ No newline at end of file +92e4c354a7643cd56d954c6c073fb760 \ No newline at end of file diff --git a/docs/doxygen/html/structht__table__coll__graph.png b/docs/doxygen/html/structht__table__coll__graph.png index b621242..ed73567 100644 Binary files a/docs/doxygen/html/structht__table__coll__graph.png and b/docs/doxygen/html/structht__table__coll__graph.png differ diff --git a/docs/doxygen/html/structnode-members.html b/docs/doxygen/html/structnode-members.html index a28d85e..c39e2b4 100644 --- a/docs/doxygen/html/structnode-members.html +++ b/docs/doxygen/html/structnode-members.html @@ -83,15 +83,14 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');

This is the complete list of members for node, including all inherited members. - - +

contents	node
key	node
next	node
next	node
val	node

Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:11:20 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/structnode.html b/docs/doxygen/html/structnode.html index d25ba5a..af96ce6 100644 --- a/docs/doxygen/html/structnode.html +++ b/docs/doxygen/html/structnode.html @@ -93,8 +93,6 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); Collaboration diagram for node:

- - [legend]

List of all members.

@@ -104,31 +102,15 @@ Public Attributes void * key Pointer to the key.
void * val - Pointer to tke value.
-struct node * next - Pointer to the next node in the collision chain.
-void * contents + Pointer to the value.
+struct node * next + Pointer to the next node in the collision chain.

Detailed Description

A node in a hash table.

Definition at line 24 of file ht.h.

Definition at line 34 of file ht.h.

Member Data Documentation

- -

- - - - -

void* node::contents

- -

Definition at line 22 of file sll.h.

- -

@@ -142,16 +124,16 @@ Public Attributes

Pointer to the key.

Definition at line 27 of file ht.h.

Definition at line 37 of file ht.h.

- +

struct node * node::next struct node* node::next

@@ -159,7 +141,7 @@ Public Attributes

Pointer to the next node in the collision chain.

Definition at line 31 of file ht.h.

Definition at line 41 of file ht.h.

@@ -174,22 +156,21 @@ Public Attributes

Pointer to tke value.

Pointer to the value.

Definition at line 29 of file ht.h.

Definition at line 39 of file ht.h.

The documentation for this struct was generated from the following files:

src/ht/ht.h
src/lists/single_link/sll.h

node
Generated on Thu Mar 22 2012 16:12:15 for Data Structures by +
Generated on Fri Mar 23 2012 11:11:20 for Data Structures by 1.7.3

diff --git a/docs/doxygen/html/structsll__node-members.html b/docs/doxygen/html/structsll__node-members.html new file mode 100644 index 0000000..5153e2e --- /dev/null +++ b/docs/doxygen/html/structsll__node-members.html @@ -0,0 +1,113 @@ + + + + +Data Structures: Member List + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

+This is the complete list of members for sll_node, including all inherited members. + + +

contents	sll_node
next	sll_node

Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structsll__node.html b/docs/doxygen/html/structsll__node.html new file mode 100644 index 0000000..08dd356 --- /dev/null +++ b/docs/doxygen/html/structsll__node.html @@ -0,0 +1,175 @@ + + + + +Data Structures: sll_node Struct Reference + + + + + + + + + + + + + +

+ + + + + + +

Data Structures v0.1

A collection of classic data structures implemented in C

Main Page
Classes
Files
+
+ + + + + + +
+

+ +

A linked list node. +More...

+ +

#include <sll.h>

+Collaboration diagram for sll_node:

+[legend]

+ +

List of all members.

+ + + + + + +

+Public Attributes
void *	contents
	Pointer to the contents the node.
struct sll_node *	next
	Pointer to next node in the list.

Detailed Description

A linked list node.

+ +

Definition at line 31 of file sll.h.

Member Data Documentation

+ +

+ + + + +

void* sll_node::contents

+ +

Pointer to the contents the node.

+ +

Definition at line 34 of file sll.h.

+ +

+ + + + +

struct sll_node* sll_node::next

+ +

Pointer to next node in the list.

+ +

Definition at line 36 of file sll.h.

+ +

The documentation for this struct was generated from the following file:

src/lists/single_link/sll.h

sll_node
Generated on Fri Mar 23 2012 11:12:04 for Data Structures by + + 1.7.3

+ +

+ All Classes Files Functions Variables Typedefs

+ + +

+ +

+ + + + diff --git a/docs/doxygen/html/structsll__node__coll__graph.map b/docs/doxygen/html/structsll__node__coll__graph.map new file mode 100644 index 0000000..8be6a30 --- /dev/null +++ b/docs/doxygen/html/structsll__node__coll__graph.map @@ -0,0 +1,2 @@ + + diff --git a/docs/doxygen/html/structsll__node__coll__graph.md5 b/docs/doxygen/html/structsll__node__coll__graph.md5 new file mode 100644 index 0000000..14e56cc --- /dev/null +++ b/docs/doxygen/html/structsll__node__coll__graph.md5 @@ -0,0 +1 @@ +5300c452bdaf4885ca37ae7b4793eaf7 \ No newline at end of file diff --git a/docs/doxygen/html/structsll__node__coll__graph.png b/docs/doxygen/html/structsll__node__coll__graph.png new file mode 100644 index 0000000..f070819 Binary files /dev/null and b/docs/doxygen/html/structsll__node__coll__graph.png differ diff --git a/docs/doxygen/latex/annotated.tex b/docs/doxygen/latex/annotated.tex index b735a2c..d95c0a9 100644 --- a/docs/doxygen/latex/annotated.tex +++ b/docs/doxygen/latex/annotated.tex @@ -1,5 +1,8 @@ \section{Class List} Here are the classes, structs, unions and interfaces with brief descriptions:\begin{DoxyCompactList} +\item\contentsline{section}{\hyperlink{structbt__node}{bt\_\-node} (A binary tree node )}{\pageref{structbt__node}}{} +\item\contentsline{section}{\hyperlink{structbt__tree}{bt\_\-tree} (A binary tree )}{\pageref{structbt__tree}}{} +\item\contentsline{section}{\hyperlink{structht__node}{ht\_\-node} (A node in a hash table )}{\pageref{structht__node}}{} \item\contentsline{section}{\hyperlink{structht__table}{ht\_\-table} (A hash table )}{\pageref{structht__table}}{} -\item\contentsline{section}{\hyperlink{structnode}{node} (A node in a hash table )}{\pageref{structnode}}{} +\item\contentsline{section}{\hyperlink{structsll__node}{sll\_\-node} (A linked list node )}{\pageref{structsll__node}}{} \end{DoxyCompactList} diff --git a/docs/doxygen/latex/bt_8c.tex b/docs/doxygen/latex/bt_8c.tex index 0780974..7539649 100644 --- a/docs/doxygen/latex/bt_8c.tex +++ b/docs/doxygen/latex/bt_8c.tex @@ -2,3 +2,184 @@ \section{src/trees/binary/bt.c File Reference} \label{bt_8c}\index{src/trees/binary/bt.c@{src/trees/binary/bt.c}} } +{\ttfamily \#include \char`\"{}bt.h\char`\"{}}\par +Include dependency graph for bt.c:\nopagebreak +\begin{figure}[H] +\begin{center} +\leavevmode +\includegraphics[width=184pt]{bt_8c__incl} +\end{center} +\end{figure} +\subsection*{Functions} +\begin{DoxyCompactItemize} +\item +\hyperlink{structbt__tree}{bt\_\-tree} $\ast$ \hyperlink{bt_8c_a3682c3b6d0e0d70a0280de485ca687cc}{bt\_\-new} (\hyperlink{bt_8h_a8a7bf1216efb8b05f20a020acd705f75}{bt\_\-compare\_\-func} compare) +\begin{DoxyCompactList}\small\item\em Creates a new empty binary tree. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8c_aa24dd75e23a367ec824d99793c2ba1bb}{bt\_\-free} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, int free\_\-contents) +\begin{DoxyCompactList}\small\item\em Frees the memory allocated for all nodes of a tree. \item\end{DoxyCompactList}\item +int \hyperlink{bt_8c_a89f764721b6fb39787a79a597a7759b1}{bt\_\-compare\_\-ptr} (void $\ast$obj1, void $\ast$obj2) +\begin{DoxyCompactList}\small\item\em Compares the value of two pointers. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8c_a08bc1827223c57790bbf396cd60e3317}{bt\_\-insert} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data) +\begin{DoxyCompactList}\small\item\em Inserts a new node into the tree. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8c_ad23029f65222ccc60e026a60e124cbb6}{bt\_\-delete} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data) +\item +void $\ast$ \hyperlink{bt_8c_a4f6d976b294d6f4e0968e5d4e75a7d31}{bt\_\-find} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data) +\begin{DoxyCompactList}\small\item\em Finds and returns the data from a node containing the given data. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Function Documentation} +\hypertarget{bt_8c_a89f764721b6fb39787a79a597a7759b1}{ +\index{bt.c@{bt.c}!bt\_\-compare\_\-ptr@{bt\_\-compare\_\-ptr}} +\index{bt\_\-compare\_\-ptr@{bt\_\-compare\_\-ptr}!bt.c@{bt.c}} +\subsubsection[{bt\_\-compare\_\-ptr}]{\setlength{\rightskip}{0pt plus 5cm}int bt\_\-compare\_\-ptr ( +\begin{DoxyParamCaption} +\item[{void $\ast$}]{obj1, } +\item[{void $\ast$}]{obj2} +\end{DoxyParamCaption} +)}} +\label{bt_8c_a89f764721b6fb39787a79a597a7759b1} + + +Compares the value of two pointers. + +This function takes two pointers and compares their values returning an integral value representing the result of the comparison. A return value of zero indicates the pointers are equal. A positive value indicates that obj2 is greater than obj1 and a negative value indicates the opposite. + + +\begin{DoxyParams}{Parameters} +{\em obj1} & The first object to be compared. \\ +\hline +{\em obj2} & The second object to be compared.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +The result of the comparison. +\end{DoxyReturn} + + +Definition at line 39 of file bt.c. + +\hypertarget{bt_8c_ad23029f65222ccc60e026a60e124cbb6}{ +\index{bt.c@{bt.c}!bt\_\-delete@{bt\_\-delete}} +\index{bt\_\-delete@{bt\_\-delete}!bt.c@{bt.c}} +\subsubsection[{bt\_\-delete}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-delete ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data} +\end{DoxyParamCaption} +)}} +\label{bt_8c_ad23029f65222ccc60e026a60e124cbb6} + + +Definition at line 49 of file bt.c. + +\hypertarget{bt_8c_a4f6d976b294d6f4e0968e5d4e75a7d31}{ +\index{bt.c@{bt.c}!bt\_\-find@{bt\_\-find}} +\index{bt\_\-find@{bt\_\-find}!bt.c@{bt.c}} +\subsubsection[{bt\_\-find}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ bt\_\-find ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data} +\end{DoxyParamCaption} +)}} +\label{bt_8c_a4f6d976b294d6f4e0968e5d4e75a7d31} + + +Finds and returns the data from a node containing the given data. + +This function uses the tree's compare function to search the tree for a node containing the given data. If a node containing the given data is found then the pointer to the contents of the node is returned. Otherwise a null pointer is returned. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree to be searched. \\ +\hline +{\em data} & The data to be searched for.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the found data. +\end{DoxyReturn} + + +Definition at line 54 of file bt.c. + +\hypertarget{bt_8c_aa24dd75e23a367ec824d99793c2ba1bb}{ +\index{bt.c@{bt.c}!bt\_\-free@{bt\_\-free}} +\index{bt\_\-free@{bt\_\-free}!bt.c@{bt.c}} +\subsubsection[{bt\_\-free}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-free ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{int}]{free\_\-contents} +\end{DoxyParamCaption} +)}} +\label{bt_8c_aa24dd75e23a367ec824d99793c2ba1bb} + + +Frees the memory allocated for all nodes of a tree. + +This function frees all memory associated with the given tree. If free\_\-contents has a non-\/zero value then the contents pointer of each node will aslo be freed. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree to be freed. \\ +\hline +{\em free\_\-contents} & Determines whether the contents pointers will be freed. \\ +\hline +\end{DoxyParams} + + +Definition at line 34 of file bt.c. + +\hypertarget{bt_8c_a08bc1827223c57790bbf396cd60e3317}{ +\index{bt.c@{bt.c}!bt\_\-insert@{bt\_\-insert}} +\index{bt\_\-insert@{bt\_\-insert}!bt.c@{bt.c}} +\subsubsection[{bt\_\-insert}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-insert ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data} +\end{DoxyParamCaption} +)}} +\label{bt_8c_a08bc1827223c57790bbf396cd60e3317} + + +Inserts a new node into the tree. + +This function uses the tree's compare function to traverse the tree until an existing node with the given data is found or until a leaf node is reached. If a node exists containing the given data then no insertion is performed. If a leaf node is reached then the a new leaf node is created and set as the left or right child of that leaf node. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree in which the node will be inserted. \\ +\hline +{\em data} & The data that the new node will contain. \\ +\hline +\end{DoxyParams} + + +Definition at line 44 of file bt.c. + +\hypertarget{bt_8c_a3682c3b6d0e0d70a0280de485ca687cc}{ +\index{bt.c@{bt.c}!bt\_\-new@{bt\_\-new}} +\index{bt\_\-new@{bt\_\-new}!bt.c@{bt.c}} +\subsubsection[{bt\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf bt\_\-tree}$\ast$ bt\_\-new ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-compare\_\-func}}]{compare} +\end{DoxyParamCaption} +)}} +\label{bt_8c_a3682c3b6d0e0d70a0280de485ca687cc} + + +Creates a new empty binary tree. + +This function creates a new empty binary search tree with the given comparison function. The comparison function will be used during searching, insertions, and deletions, to find and traverse the tree. + + +\begin{DoxyParams}{Parameters} +{\em compare} & The function to use for comparing items in the tree.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly created tree. +\end{DoxyReturn} + + +Definition at line 29 of file bt.c. + diff --git a/docs/doxygen/latex/bt_8c__incl.md5 b/docs/doxygen/latex/bt_8c__incl.md5 new file mode 100644 index 0000000..132757d --- /dev/null +++ b/docs/doxygen/latex/bt_8c__incl.md5 @@ -0,0 +1 @@ +d415069c538eb3b092984126fece7bb9 \ No newline at end of file diff --git a/docs/doxygen/latex/bt_8c__incl.pdf b/docs/doxygen/latex/bt_8c__incl.pdf new file mode 100644 index 0000000..e210562 Binary files /dev/null and b/docs/doxygen/latex/bt_8c__incl.pdf differ diff --git a/docs/doxygen/latex/bt_8h.tex b/docs/doxygen/latex/bt_8h.tex index 2273e78..96229b0 100644 --- a/docs/doxygen/latex/bt_8h.tex +++ b/docs/doxygen/latex/bt_8h.tex @@ -2,3 +2,245 @@ \section{src/trees/binary/bt.h File Reference} \label{bt_8h}\index{src/trees/binary/bt.h@{src/trees/binary/bt.h}} } +This graph shows which files directly or indirectly include this file:\nopagebreak +\begin{figure}[H] +\begin{center} +\leavevmode +\includegraphics[width=184pt]{bt_8h__dep__incl} +\end{center} +\end{figure} +\subsection*{Classes} +\begin{DoxyCompactItemize} +\item +struct \hyperlink{structbt__node}{bt\_\-node} +\begin{DoxyCompactList}\small\item\em A binary tree node. \item\end{DoxyCompactList}\item +struct \hyperlink{structbt__tree}{bt\_\-tree} +\begin{DoxyCompactList}\small\item\em A binary tree. \item\end{DoxyCompactList}\end{DoxyCompactItemize} +\subsection*{Typedefs} +\begin{DoxyCompactItemize} +\item +typedef int($\ast$ \hyperlink{bt_8h_a8a7bf1216efb8b05f20a020acd705f75}{bt\_\-compare\_\-func} )(void $\ast$, void $\ast$) +\begin{DoxyCompactList}\small\item\em A function pointer for a comparison function. \item\end{DoxyCompactList}\item +typedef struct \hyperlink{structbt__node}{bt\_\-node} \hyperlink{bt_8h_a0add8fba825be5e3f912ab7323c1adaa}{bt\_\-node} +\begin{DoxyCompactList}\small\item\em A binary tree node. \item\end{DoxyCompactList}\item +typedef struct \hyperlink{structbt__tree}{bt\_\-tree} \hyperlink{bt_8h_acc5ee766f7f379b1d2fde9e7468d7e2a}{bt\_\-tree} +\begin{DoxyCompactList}\small\item\em A binary tree. \item\end{DoxyCompactList}\end{DoxyCompactItemize} +\subsection*{Functions} +\begin{DoxyCompactItemize} +\item +\hyperlink{structbt__tree}{bt\_\-tree} $\ast$ \hyperlink{bt_8h_a3682c3b6d0e0d70a0280de485ca687cc}{bt\_\-new} (\hyperlink{bt_8h_a8a7bf1216efb8b05f20a020acd705f75}{bt\_\-compare\_\-func} compare) +\begin{DoxyCompactList}\small\item\em Creates a new empty binary tree. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8h_aa24dd75e23a367ec824d99793c2ba1bb}{bt\_\-free} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, int free\_\-contents) +\begin{DoxyCompactList}\small\item\em Frees the memory allocated for all nodes of a tree. \item\end{DoxyCompactList}\item +int \hyperlink{bt_8h_a89f764721b6fb39787a79a597a7759b1}{bt\_\-compare\_\-ptr} (void $\ast$obj1, void $\ast$obj2) +\begin{DoxyCompactList}\small\item\em Compares the value of two pointers. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8h_a08bc1827223c57790bbf396cd60e3317}{bt\_\-insert} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data) +\begin{DoxyCompactList}\small\item\em Inserts a new node into the tree. \item\end{DoxyCompactList}\item +void \hyperlink{bt_8h_afcbfcbca8b25fe867ea8b7b0deeaef9c}{bt\_\-delete} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data, int free\_\-contents) +\begin{DoxyCompactList}\small\item\em Deletes a node for the tree. \item\end{DoxyCompactList}\item +void $\ast$ \hyperlink{bt_8h_a4f6d976b294d6f4e0968e5d4e75a7d31}{bt\_\-find} (\hyperlink{structbt__tree}{bt\_\-tree} $\ast$tree, void $\ast$data) +\begin{DoxyCompactList}\small\item\em Finds and returns the data from a node containing the given data. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Typedef Documentation} +\hypertarget{bt_8h_a8a7bf1216efb8b05f20a020acd705f75}{ +\index{bt.h@{bt.h}!bt\_\-compare\_\-func@{bt\_\-compare\_\-func}} +\index{bt\_\-compare\_\-func@{bt\_\-compare\_\-func}!bt.h@{bt.h}} +\subsubsection[{bt\_\-compare\_\-func}]{\setlength{\rightskip}{0pt plus 5cm}typedef int($\ast$ {\bf bt\_\-compare\_\-func})(void $\ast$, void $\ast$)}} +\label{bt_8h_a8a7bf1216efb8b05f20a020acd705f75} + + +A function pointer for a comparison function. + + + +Definition at line 31 of file bt.h. + +\hypertarget{bt_8h_a0add8fba825be5e3f912ab7323c1adaa}{ +\index{bt.h@{bt.h}!bt\_\-node@{bt\_\-node}} +\index{bt\_\-node@{bt\_\-node}!bt.h@{bt.h}} +\subsubsection[{bt\_\-node}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf bt\_\-node} {\bf bt\_\-node}}} +\label{bt_8h_a0add8fba825be5e3f912ab7323c1adaa} + + +A binary tree node. + +\hypertarget{bt_8h_acc5ee766f7f379b1d2fde9e7468d7e2a}{ +\index{bt.h@{bt.h}!bt\_\-tree@{bt\_\-tree}} +\index{bt\_\-tree@{bt\_\-tree}!bt.h@{bt.h}} +\subsubsection[{bt\_\-tree}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf bt\_\-tree} {\bf bt\_\-tree}}} +\label{bt_8h_acc5ee766f7f379b1d2fde9e7468d7e2a} + + +A binary tree. + + + +\subsection{Function Documentation} +\hypertarget{bt_8h_a89f764721b6fb39787a79a597a7759b1}{ +\index{bt.h@{bt.h}!bt\_\-compare\_\-ptr@{bt\_\-compare\_\-ptr}} +\index{bt\_\-compare\_\-ptr@{bt\_\-compare\_\-ptr}!bt.h@{bt.h}} +\subsubsection[{bt\_\-compare\_\-ptr}]{\setlength{\rightskip}{0pt plus 5cm}int bt\_\-compare\_\-ptr ( +\begin{DoxyParamCaption} +\item[{void $\ast$}]{obj1, } +\item[{void $\ast$}]{obj2} +\end{DoxyParamCaption} +)}} +\label{bt_8h_a89f764721b6fb39787a79a597a7759b1} + + +Compares the value of two pointers. + +This function takes two pointers and compares their values returning an integral value representing the result of the comparison. A return value of zero indicates the pointers are equal. A positive value indicates that obj2 is greater than obj1 and a negative value indicates the opposite. + + +\begin{DoxyParams}{Parameters} +{\em obj1} & The first object to be compared. \\ +\hline +{\em obj2} & The second object to be compared.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +The result of the comparison. +\end{DoxyReturn} + + +Definition at line 39 of file bt.c. + +\hypertarget{bt_8h_afcbfcbca8b25fe867ea8b7b0deeaef9c}{ +\index{bt.h@{bt.h}!bt\_\-delete@{bt\_\-delete}} +\index{bt\_\-delete@{bt\_\-delete}!bt.h@{bt.h}} +\subsubsection[{bt\_\-delete}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-delete ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data, } +\item[{int}]{free\_\-contents} +\end{DoxyParamCaption} +)}} +\label{bt_8h_afcbfcbca8b25fe867ea8b7b0deeaef9c} + + +Deletes a node for the tree. + +This function uses the tree's compare function to search the tree for a node containing the given data. If a node containing the data is found then the node is freed otherwise no deletion is performed. If free\_\-contents is passed a non-\/zero value then the contents pointer of the node is also freed. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree from which the node will be deleted. \\ +\hline +{\em data} & The data to search for in the tree. \\ +\hline +{\em free\_\-contents} & Determines whether the contents pointer will be freed. \\ +\hline +\end{DoxyParams} +\hypertarget{bt_8h_a4f6d976b294d6f4e0968e5d4e75a7d31}{ +\index{bt.h@{bt.h}!bt\_\-find@{bt\_\-find}} +\index{bt\_\-find@{bt\_\-find}!bt.h@{bt.h}} +\subsubsection[{bt\_\-find}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ bt\_\-find ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data} +\end{DoxyParamCaption} +)}} +\label{bt_8h_a4f6d976b294d6f4e0968e5d4e75a7d31} + + +Finds and returns the data from a node containing the given data. + +This function uses the tree's compare function to search the tree for a node containing the given data. If a node containing the given data is found then the pointer to the contents of the node is returned. Otherwise a null pointer is returned. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree to be searched. \\ +\hline +{\em data} & The data to be searched for.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the found data. +\end{DoxyReturn} + + +Definition at line 54 of file bt.c. + +\hypertarget{bt_8h_aa24dd75e23a367ec824d99793c2ba1bb}{ +\index{bt.h@{bt.h}!bt\_\-free@{bt\_\-free}} +\index{bt\_\-free@{bt\_\-free}!bt.h@{bt.h}} +\subsubsection[{bt\_\-free}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-free ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{int}]{free\_\-contents} +\end{DoxyParamCaption} +)}} +\label{bt_8h_aa24dd75e23a367ec824d99793c2ba1bb} + + +Frees the memory allocated for all nodes of a tree. + +This function frees all memory associated with the given tree. If free\_\-contents has a non-\/zero value then the contents pointer of each node will aslo be freed. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree to be freed. \\ +\hline +{\em free\_\-contents} & Determines whether the contents pointers will be freed. \\ +\hline +\end{DoxyParams} + + +Definition at line 34 of file bt.c. + +\hypertarget{bt_8h_a08bc1827223c57790bbf396cd60e3317}{ +\index{bt.h@{bt.h}!bt\_\-insert@{bt\_\-insert}} +\index{bt\_\-insert@{bt\_\-insert}!bt.h@{bt.h}} +\subsubsection[{bt\_\-insert}]{\setlength{\rightskip}{0pt plus 5cm}void bt\_\-insert ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-tree} $\ast$}]{tree, } +\item[{void $\ast$}]{data} +\end{DoxyParamCaption} +)}} +\label{bt_8h_a08bc1827223c57790bbf396cd60e3317} + + +Inserts a new node into the tree. + +This function uses the tree's compare function to traverse the tree until an existing node with the given data is found or until a leaf node is reached. If a node exists containing the given data then no insertion is performed. If a leaf node is reached then the a new leaf node is created and set as the left or right child of that leaf node. + + +\begin{DoxyParams}{Parameters} +{\em tree} & The tree in which the node will be inserted. \\ +\hline +{\em data} & The data that the new node will contain. \\ +\hline +\end{DoxyParams} + + +Definition at line 44 of file bt.c. + +\hypertarget{bt_8h_a3682c3b6d0e0d70a0280de485ca687cc}{ +\index{bt.h@{bt.h}!bt\_\-new@{bt\_\-new}} +\index{bt\_\-new@{bt\_\-new}!bt.h@{bt.h}} +\subsubsection[{bt\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf bt\_\-tree}$\ast$ bt\_\-new ( +\begin{DoxyParamCaption} +\item[{{\bf bt\_\-compare\_\-func}}]{compare} +\end{DoxyParamCaption} +)}} +\label{bt_8h_a3682c3b6d0e0d70a0280de485ca687cc} + + +Creates a new empty binary tree. + +This function creates a new empty binary search tree with the given comparison function. The comparison function will be used during searching, insertions, and deletions, to find and traverse the tree. + + +\begin{DoxyParams}{Parameters} +{\em compare} & The function to use for comparing items in the tree.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly created tree. +\end{DoxyReturn} + + +Definition at line 29 of file bt.c. + diff --git a/docs/doxygen/latex/bt_8h__dep__incl.md5 b/docs/doxygen/latex/bt_8h__dep__incl.md5 new file mode 100644 index 0000000..04f24e1 --- /dev/null +++ b/docs/doxygen/latex/bt_8h__dep__incl.md5 @@ -0,0 +1 @@ +1c44a8d7d290d71225b96567bd2507d6 \ No newline at end of file diff --git a/docs/doxygen/latex/bt_8h__dep__incl.pdf b/docs/doxygen/latex/bt_8h__dep__incl.pdf new file mode 100644 index 0000000..1752e80 Binary files /dev/null and b/docs/doxygen/latex/bt_8h__dep__incl.pdf differ diff --git a/docs/doxygen/latex/doxygen.sty b/docs/doxygen/latex/doxygen.sty index 916d6b3..81d7ea7 100644 --- a/docs/doxygen/latex/doxygen.sty +++ b/docs/doxygen/latex/doxygen.sty @@ -73,8 +73,8 @@ \fancyhead[RO]{\fancyplain{}{\bfseries\thepage}} \fancyfoot[LE]{\fancyplain{}{}} \fancyfoot[CE]{\fancyplain{}{}} -\fancyfoot[RE]{\fancyplain{}{\bfseries\scriptsize Generated on Thu Mar 22 2012 16:12:15 for Data Structures by Doxygen }} -\fancyfoot[LO]{\fancyplain{}{\bfseries\scriptsize Generated on Thu Mar 22 2012 16:12:15 for Data Structures by Doxygen }} +\fancyfoot[RE]{\fancyplain{}{\bfseries\scriptsize Generated on Fri Mar 23 2012 11:12:03 for Data Structures by Doxygen }} +\fancyfoot[LO]{\fancyplain{}{\bfseries\scriptsize Generated on Fri Mar 23 2012 11:12:03 for Data Structures by Doxygen }} \fancyfoot[CO]{\fancyplain{}{}} \fancyfoot[RO]{\fancyplain{}{}} %---------- Internal commands used in this style file ---------------- diff --git a/docs/doxygen/latex/ht_8c.tex b/docs/doxygen/latex/ht_8c.tex index a27840b..5a49634 100644 --- a/docs/doxygen/latex/ht_8c.tex +++ b/docs/doxygen/latex/ht_8c.tex @@ -6,8 +6,7 @@ {\ttfamily \#include $<$stdlib.h$>$}\par {\ttfamily \#include $<$string.h$>$}\par {\ttfamily \#include $<$stdio.h$>$}\par -Include dependency graph for ht.c: -\nopagebreak +Include dependency graph for ht.c:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -21,59 +20,105 @@ unsigned int \hyperlink{ht_8c_a278174a0154a10b8b10b23937ca4c721}{ht\_\-hash\_\-s \begin{DoxyCompactList}\small\item\em Takes a string key value and returns it's hashed value. \item\end{DoxyCompactList}\item \hyperlink{structht__table}{ht\_\-table} $\ast$ \hyperlink{ht_8c_a0a3e03a29413673acd8899d250cd0844}{ht\_\-new} (unsigned int size, \hyperlink{ht_8h_a91a8d03489ef281e6f26d389c44d42cf}{ht\_\-hash\_\-func} fn) \begin{DoxyCompactList}\small\item\em Creates a new hash table of the given size using the provided hash function or the built-\/in string hashing function otherwise. \item\end{DoxyCompactList}\item -void \hyperlink{ht_8c_a36132061ce1dfb439cde8c8caa2b63bc}{ht\_\-free} (\hyperlink{structht__table}{ht\_\-table} $\ast$table) -\item -int \hyperlink{ht_8c_a41caab4f2767cdd00399b2fb6f6ec424}{ht\_\-put} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, void $\ast$key, void $\ast$val) +void \hyperlink{ht_8c_a96de71bf3880ed0a879f60b6e5254803}{ht\_\-free} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, int free\_\-key, int free\_\-value) +\begin{DoxyCompactList}\small\item\em Frees all memory used by the provided hash table. \item\end{DoxyCompactList}\item +void \hyperlink{ht_8c_a8c17c7288d2f510dd5c091cccc6dd056}{ht\_\-put} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, void $\ast$key, void $\ast$val) \begin{DoxyCompactList}\small\item\em Inserts a key/value pair into the provided table. \item\end{DoxyCompactList}\item -void $\ast$ \hyperlink{ht_8c_a3d4217bc8aafc5cf0e37dda811afc3c5}{ht\_\-get} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, char $\ast$key) -\item -unsigned int \hyperlink{ht_8c_abb67271f276fde7155cbbe63566d97c4}{ht\_\-delete} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, char $\ast$key) -\item -unsigned int \hyperlink{ht_8c_a4c967f60d2129911b4311d9f4c7f3424}{ht\_\-resize} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, unsigned int size) +void $\ast$ \hyperlink{ht_8c_a5bc0ba0d31b944797e17a96372bce33e}{ht\_\-get} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, void $\ast$key) +\begin{DoxyCompactList}\small\item\em Retrieves a value from the provided table. \item\end{DoxyCompactList}\item +void \hyperlink{ht_8c_a81a813f472a9b689032704fca76b3ce8}{ht\_\-delete} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, void $\ast$key, int free\_\-key, int free\_\-value) +\begin{DoxyCompactList}\small\item\em Deletes a key/value pair from the provided hash table. \item\end{DoxyCompactList}\item +\hyperlink{structht__table}{ht\_\-table} $\ast$ \hyperlink{ht_8c_ad9cac6da8b459d5960079b0d95489960}{ht\_\-resize} (\hyperlink{structht__table}{ht\_\-table} $\ast$table, unsigned int size) \begin{DoxyCompactList}\small\item\em Resizes the underlying table used for storing key/value pairs. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection{Function Documentation} -\hypertarget{ht_8c_abb67271f276fde7155cbbe63566d97c4}{ +\hypertarget{ht_8c_a81a813f472a9b689032704fca76b3ce8}{ \index{ht.c@{ht.c}!ht\_\-delete@{ht\_\-delete}} \index{ht\_\-delete@{ht\_\-delete}!ht.c@{ht.c}} -\subsubsection[{ht\_\-delete}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int ht\_\-delete ( +\subsubsection[{ht\_\-delete}]{\setlength{\rightskip}{0pt plus 5cm}void ht\_\-delete ( \begin{DoxyParamCaption} \item[{{\bf ht\_\-table} $\ast$}]{table, } -\item[{char $\ast$}]{key} +\item[{void $\ast$}]{key, } +\item[{int}]{free\_\-key, } +\item[{int}]{free\_\-value} \end{DoxyParamCaption} )}} -\label{ht_8c_abb67271f276fde7155cbbe63566d97c4} +\label{ht_8c_a81a813f472a9b689032704fca76b3ce8} + + +Deletes a key/value pair from the provided hash table. + + +\begin{DoxyParams}{Parameters} +{\em table} & The table from which the key/value pait will be deleted. \\ +\hline +{\em key} & The key for the key/value pair to be deleted. \\ +\hline +{\em free\_\-key} & Determines whether the key pointer will be freed. \\ +\hline +{\em free\_\-value} & Determines whether the value pointer will be freed. \\ +\hline +\end{DoxyParams} -Definition at line 116 of file ht.c. +Definition at line 125 of file ht.c. -\hypertarget{ht_8c_a36132061ce1dfb439cde8c8caa2b63bc}{ +\hypertarget{ht_8c_a96de71bf3880ed0a879f60b6e5254803}{ \index{ht.c@{ht.c}!ht\_\-free@{ht\_\-free}} \index{ht\_\-free@{ht\_\-free}!ht.c@{ht.c}} \subsubsection[{ht\_\-free}]{\setlength{\rightskip}{0pt plus 5cm}void ht\_\-free ( \begin{DoxyParamCaption} -\item[{{\bf ht\_\-table} $\ast$}]{table} +\item[{{\bf ht\_\-table} $\ast$}]{table, } +\item[{int}]{free\_\-key, } +\item[{int}]{free\_\-value} \end{DoxyParamCaption} )}} -\label{ht_8c_a36132061ce1dfb439cde8c8caa2b63bc} +\label{ht_8c_a96de71bf3880ed0a879f60b6e5254803} + + +Frees all memory used by the provided hash table. + + +\begin{DoxyParams}{Parameters} +{\em table} & The table to be freed. \\ +\hline +{\em free\_\-key} & Determines whether the key pointers will be freed. \\ +\hline +{\em free\_\-value} & Determines whether the value pointers will be freed. \\ +\hline +\end{DoxyParams} -Definition at line 45 of file ht.c. +Definition at line 55 of file ht.c. -\hypertarget{ht_8c_a3d4217bc8aafc5cf0e37dda811afc3c5}{ +\hypertarget{ht_8c_a5bc0ba0d31b944797e17a96372bce33e}{ \index{ht.c@{ht.c}!ht\_\-get@{ht\_\-get}} \index{ht\_\-get@{ht\_\-get}!ht.c@{ht.c}} \subsubsection[{ht\_\-get}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ ht\_\-get ( \begin{DoxyParamCaption} \item[{{\bf ht\_\-table} $\ast$}]{table, } -\item[{char $\ast$}]{key} +\item[{void $\ast$}]{key} \end{DoxyParamCaption} )}} -\label{ht_8c_a3d4217bc8aafc5cf0e37dda811afc3c5} +\label{ht_8c_a5bc0ba0d31b944797e17a96372bce33e} + + +Retrieves a value from the provided table. + + +\begin{DoxyParams}{Parameters} +{\em table} & The table in which to find the associated value. \\ +\hline +{\em key} & The key to lookup.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +A pointer to the value associated with the provided key. +\end{DoxyReturn} -Definition at line 99 of file ht.c. +Definition at line 108 of file ht.c. \hypertarget{ht_8c_a278174a0154a10b8b10b23937ca4c721}{ \index{ht.c@{ht.c}!ht\_\-hash\_\-string@{ht\_\-hash\_\-string}} @@ -98,12 +143,11 @@ The hashed value of the key. \end{DoxyReturn} -Definition at line 22 of file ht.c. +Definition at line 32 of file ht.c. -Here is the caller graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -138,12 +182,11 @@ The newly created table. \end{DoxyReturn} -Definition at line 34 of file ht.c. +Definition at line 44 of file ht.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -152,17 +195,17 @@ Here is the call graph for this function: \end{figure} -\hypertarget{ht_8c_a41caab4f2767cdd00399b2fb6f6ec424}{ +\hypertarget{ht_8c_a8c17c7288d2f510dd5c091cccc6dd056}{ \index{ht.c@{ht.c}!ht\_\-put@{ht\_\-put}} \index{ht\_\-put@{ht\_\-put}!ht.c@{ht.c}} -\subsubsection[{ht\_\-put}]{\setlength{\rightskip}{0pt plus 5cm}int ht\_\-put ( +\subsubsection[{ht\_\-put}]{\setlength{\rightskip}{0pt plus 5cm}void ht\_\-put ( \begin{DoxyParamCaption} \item[{{\bf ht\_\-table} $\ast$}]{table, } \item[{void $\ast$}]{key, } \item[{void $\ast$}]{val} \end{DoxyParamCaption} )}} -\label{ht_8c_a41caab4f2767cdd00399b2fb6f6ec424} +\label{ht_8c_a8c17c7288d2f510dd5c091cccc6dd056} Inserts a key/value pair into the provided table. @@ -178,18 +221,18 @@ Inserts a key/value pair into the provided table. \end{DoxyParams} -Definition at line 63 of file ht.c. +Definition at line 73 of file ht.c. -\hypertarget{ht_8c_a4c967f60d2129911b4311d9f4c7f3424}{ +\hypertarget{ht_8c_ad9cac6da8b459d5960079b0d95489960}{ \index{ht.c@{ht.c}!ht\_\-resize@{ht\_\-resize}} \index{ht\_\-resize@{ht\_\-resize}!ht.c@{ht.c}} -\subsubsection[{ht\_\-resize}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int ht\_\-resize ( +\subsubsection[{ht\_\-resize}]{\setlength{\rightskip}{0pt plus 5cm}{\bf ht\_\-table}$\ast$ ht\_\-resize ( \begin{DoxyParamCaption} \item[{{\bf ht\_\-table} $\ast$}]{table, } \item[{unsigned int}]{size} \end{DoxyParamCaption} )}} -\label{ht_8c_a4c967f60d2129911b4311d9f4c7f3424} +\label{ht_8c_ad9cac6da8b459d5960079b0d95489960} Resizes the underlying table used for storing key/value pairs. @@ -206,5 +249,5 @@ A pointer to the resized table. \end{DoxyReturn} -Definition at line 121 of file ht.c. +Definition at line 130 of file ht.c. diff --git a/docs/doxygen/latex/ht_8h.tex b/docs/doxygen/latex/ht_8h.tex index b39d65a..bc2ca0d 100644 --- a/docs/doxygen/latex/ht_8h.tex +++ b/docs/doxygen/latex/ht_8h.tex @@ -2,8 +2,7 @@ \section{src/ht/ht.h File Reference} \label{ht_8h}\index{src/ht/ht.h@{src/ht/ht.h}} } -This graph shows which files directly or indirectly include this file: -\nopagebreak +This graph shows which files directly or indirectly include this file:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -13,7 +12,7 @@ This graph shows which files directly or indirectly include this file: \subsection*{Classes} \begin{DoxyCompactItemize} \item -struct \hyperlink{structnode}{node} +struct \hyperlink{structht__node}{ht\_\-node} \begin{DoxyCompactList}\small\item\em A node in a hash table. \item\end{DoxyCompactList}\item struct \hyperlink{structht__table}{ht\_\-table} \begin{DoxyCompactList}\small\item\em A hash table. \item\end{DoxyCompactList}\end{DoxyCompactItemize} @@ -22,7 +21,7 @@ struct \hyperlink{structht__table}{ht\_\-table} \item typedef unsigned int($\ast$ \hyperlink{ht_8h_a91a8d03489ef281e6f26d389c44d42cf}{ht\_\-hash\_\-func} )(void $\ast$) \begin{DoxyCompactList}\small\item\em Hash function for hashing keys in a hash table. \item\end{DoxyCompactList}\item -typedef struct \hyperlink{structnode}{node} \hyperlink{ht_8h_a27a2fadaf99569e4b5c18dbd0b0a8160}{ht\_\-node} +typedef struct \hyperlink{structht__node}{ht\_\-node} \hyperlink{ht_8h_a3b70269a378f408bce2ae501e7ed1205}{ht\_\-node} \begin{DoxyCompactList}\small\item\em A node in a hash table. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection*{Functions} \begin{DoxyCompactItemize} @@ -55,13 +54,13 @@ Hash function for hashing keys in a hash table. -Definition at line 21 of file ht.h. +Definition at line 31 of file ht.h. -\hypertarget{ht_8h_a27a2fadaf99569e4b5c18dbd0b0a8160}{ +\hypertarget{ht_8h_a3b70269a378f408bce2ae501e7ed1205}{ \index{ht.h@{ht.h}!ht\_\-node@{ht\_\-node}} \index{ht\_\-node@{ht\_\-node}!ht.h@{ht.h}} -\subsubsection[{ht\_\-node}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf node} {\bf ht\_\-node}}} -\label{ht_8h_a27a2fadaf99569e4b5c18dbd0b0a8160} +\subsubsection[{ht\_\-node}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf ht\_\-node} {\bf ht\_\-node}}} +\label{ht_8h_a3b70269a378f408bce2ae501e7ed1205} A node in a hash table. @@ -96,6 +95,10 @@ Deletes a key/value pair from the provided hash table. {\em free\_\-value} & Determines whether the value pointer will be freed. \\ \hline \end{DoxyParams} + + +Definition at line 125 of file ht.c. + \hypertarget{ht_8h_a96de71bf3880ed0a879f60b6e5254803}{ \index{ht.h@{ht.h}!ht\_\-free@{ht\_\-free}} \index{ht\_\-free@{ht\_\-free}!ht.h@{ht.h}} @@ -120,6 +123,10 @@ Frees all memory used by the provided hash table. {\em free\_\-value} & Determines whether the value pointers will be freed. \\ \hline \end{DoxyParams} + + +Definition at line 55 of file ht.c. + \hypertarget{ht_8h_a5bc0ba0d31b944797e17a96372bce33e}{ \index{ht.h@{ht.h}!ht\_\-get@{ht\_\-get}} \index{ht\_\-get@{ht\_\-get}!ht.h@{ht.h}} @@ -144,6 +151,10 @@ Retrieves a value from the provided table. \begin{DoxyReturn}{Returns} A pointer to the value associated with the provided key. \end{DoxyReturn} + + +Definition at line 108 of file ht.c. + \hypertarget{ht_8h_a278174a0154a10b8b10b23937ca4c721}{ \index{ht.h@{ht.h}!ht\_\-hash\_\-string@{ht\_\-hash\_\-string}} \index{ht\_\-hash\_\-string@{ht\_\-hash\_\-string}!ht.h@{ht.h}} @@ -167,12 +178,11 @@ The hashed value of the key. \end{DoxyReturn} -Definition at line 22 of file ht.c. +Definition at line 32 of file ht.c. -Here is the caller graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -207,12 +217,11 @@ The newly created table. \end{DoxyReturn} -Definition at line 34 of file ht.c. +Definition at line 44 of file ht.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -247,7 +256,7 @@ Inserts a key/value pair into the provided table. \end{DoxyParams} -Definition at line 63 of file ht.c. +Definition at line 73 of file ht.c. \hypertarget{ht_8h_ad9cac6da8b459d5960079b0d95489960}{ \index{ht.h@{ht.h}!ht\_\-resize@{ht\_\-resize}} @@ -275,5 +284,5 @@ A pointer to the resized table. \end{DoxyReturn} -Definition at line 121 of file ht.c. +Definition at line 130 of file ht.c. diff --git a/docs/doxygen/latex/refman.tex b/docs/doxygen/latex/refman.tex index 3de519a..8ffa925 100644 --- a/docs/doxygen/latex/refman.tex +++ b/docs/doxygen/latex/refman.tex @@ -44,7 +44,7 @@ \vspace*{1cm} {\large Generated by Doxygen 1.7.3}\\ \vspace*{0.5cm} -{\small Thu Mar 22 2012 16:12:15}\\ +{\small Fri Mar 23 2012 11:12:03}\\ \end{center} \end{titlepage} \clearemptydoublepage @@ -58,8 +58,11 @@ \chapter{File Index} \input{files} \chapter{Class Documentation} +\input{structbt__node} +\input{structbt__tree} +\input{structht__node} \input{structht__table} -\input{structnode} +\input{structsll__node} \chapter{File Documentation} \input{ht_8c} \input{ht_8h} diff --git a/docs/doxygen/latex/sll_8c.tex b/docs/doxygen/latex/sll_8c.tex index 4603968..3593d1a 100644 --- a/docs/doxygen/latex/sll_8c.tex +++ b/docs/doxygen/latex/sll_8c.tex @@ -4,8 +4,7 @@ } {\ttfamily \#include \char`\"{}sll.h\char`\"{}}\par {\ttfamily \#include $<$stdlib.h$>$}\par -Include dependency graph for sll.c: -\nopagebreak +Include dependency graph for sll.c:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -15,61 +14,65 @@ Include dependency graph for sll.c: \subsection*{Functions} \begin{DoxyCompactItemize} \item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a471151d11dc385e3364c9a38b19ecba7}{sll\_\-new} (void $\ast$contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a471151d11dc385e3364c9a38b19ecba7}{sll\_\-new} (void $\ast$contents) \begin{DoxyCompactList}\small\item\em Creates a new linked list node with the supplied value. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_af7327f24d1900d495c1bf914a592b631}{sll\_\-last} (\hyperlink{structnode}{sll\_\-node} $\ast$list) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_abe6fe02fbfcbf1d647ff94295b855e7e}{sll\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Finds and returns the first node in the supplied linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a78ef5151212d47bb63f2fd93453283ed}{sll\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) \begin{DoxyCompactList}\small\item\em Finds and returns the last node in the supplied linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_aaf7e4557200dec55dec679f63de2b4d1}{sll\_\-get} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a0582f263482ead73d53b018978513540}{sll\_\-index} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index) \begin{DoxyCompactList}\small\item\em Return the node at the specified index in a linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a0751beeb21d1540c9ddcd5e01964e23e}{sll\_\-add} (\hyperlink{structnode}{sll\_\-node} $\ast$list, void $\ast$contents) -\begin{DoxyCompactList}\small\item\em Adds a new node to an existing linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a66769edc21579f71972ac90de6da4a9f}{sll\_\-insert} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index, void $\ast$contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0}{sll\_\-push\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, void $\ast$contents) +\begin{DoxyCompactList}\small\item\em Adds a new node to the end of an existing linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_acfe3ebc296fe75f1d0ee21195dd7b9bf}{sll\_\-push\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, void $\ast$contents) +\begin{DoxyCompactList}\small\item\em Adds a new node to the front of an existing linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_af72e93329186ac936d2bf6f544aa1f6b}{sll\_\-pop\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Removes and returns a pointer to the last element of the list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a1588e5a1f90852ee48403d5313d64269}{sll\_\-pop\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Removes and returns a pointer to the first element of the list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_a66769edc21579f71972ac90de6da4a9f}{sll\_\-insert} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index, void $\ast$contents) \begin{DoxyCompactList}\small\item\em Inserts a new node in a linked list at the specified index. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8c_afd494f171c24981f0d7a007841f21cfe}{sll\_\-delete} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index, int free\_\-contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8c_afd494f171c24981f0d7a007841f21cfe}{sll\_\-delete} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index, int free\_\-contents) \begin{DoxyCompactList}\small\item\em Deletes a node from the supplied list. \item\end{DoxyCompactList}\item -void \hyperlink{sll_8c_a7373cc6bac0876b330da73722e24910b}{sll\_\-free} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int free\_\-contents) +void \hyperlink{sll_8c_a7373cc6bac0876b330da73722e24910b}{sll\_\-free} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int free\_\-contents) \begin{DoxyCompactList}\small\item\em Frees all memory used by a linked list. \item\end{DoxyCompactList}\item -unsigned int \hyperlink{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe}{sll\_\-length} (\hyperlink{structnode}{sll\_\-node} $\ast$list) +unsigned int \hyperlink{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe}{sll\_\-length} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) \begin{DoxyCompactList}\small\item\em Returns the number of elements in the list. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection{Function Documentation} -\hypertarget{sll_8c_a0751beeb21d1540c9ddcd5e01964e23e}{ -\index{sll.c@{sll.c}!sll\_\-add@{sll\_\-add}} -\index{sll\_\-add@{sll\_\-add}!sll.c@{sll.c}} -\subsubsection[{sll\_\-add}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-add ( +\hypertarget{sll_8c_a78ef5151212d47bb63f2fd93453283ed}{ +\index{sll.c@{sll.c}!sll\_\-back@{sll\_\-back}} +\index{sll\_\-back@{sll\_\-back}!sll.c@{sll.c}} +\subsubsection[{sll\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-back ( \begin{DoxyParamCaption} -\item[{{\bf sll\_\-node} $\ast$}]{list, } -\item[{void $\ast$}]{contents} +\item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8c_a0751beeb21d1540c9ddcd5e01964e23e} +\label{sll_8c_a78ef5151212d47bb63f2fd93453283ed} -Adds a new node to an existing linked list. +Finds and returns the last node in the supplied linked list. \begin{DoxyParams}{Parameters} -{\em list} & \\ -\hline -{\em contents} & \\ +{\em list} & The linked list to search.\\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -Pointer to the newly added node. +Pointer to the last node in the supplied list. \end{DoxyReturn} -Definition at line 59 of file sll.c. +Definition at line 42 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=214pt]{sll_8c_a0751beeb21d1540c9ddcd5e01964e23e_cgraph} +\includegraphics[width=250pt]{sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph} \end{center} \end{figure} @@ -105,16 +108,15 @@ Pointer to the node that is now at the supplied index. \end{DoxyReturn} -Definition at line 79 of file sll.c. +Definition at line 102 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=220pt]{sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph} +\includegraphics[width=230pt]{sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph} \end{center} \end{figure} @@ -144,18 +146,43 @@ Loops through the supplied list and frees all nodes. Also frees contents if free \end{DoxyParams} -Definition at line 96 of file sll.c. +Definition at line 119 of file sll.c. + +\hypertarget{sll_8c_abe6fe02fbfcbf1d647ff94295b855e7e}{ +\index{sll.c@{sll.c}!sll\_\-front@{sll\_\-front}} +\index{sll\_\-front@{sll\_\-front}!sll.c@{sll.c}} +\subsubsection[{sll\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list} +\end{DoxyParamCaption} +)}} +\label{sll_8c_abe6fe02fbfcbf1d647ff94295b855e7e} + + +Finds and returns the first node in the supplied linked list. + + +\begin{DoxyParams}{Parameters} +{\em list} & The linked list to search.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the last node in the supplied list. +\end{DoxyReturn} + + +Definition at line 38 of file sll.c. -\hypertarget{sll_8c_aaf7e4557200dec55dec679f63de2b4d1}{ -\index{sll.c@{sll.c}!sll\_\-get@{sll\_\-get}} -\index{sll\_\-get@{sll\_\-get}!sll.c@{sll.c}} -\subsubsection[{sll\_\-get}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-get ( +\hypertarget{sll_8c_a0582f263482ead73d53b018978513540}{ +\index{sll.c@{sll.c}!sll\_\-index@{sll\_\-index}} +\index{sll\_\-index@{sll\_\-index}!sll.c@{sll.c}} +\subsubsection[{sll\_\-index}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-index ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list, } \item[{int}]{index} \end{DoxyParamCaption} )}} -\label{sll_8c_aaf7e4557200dec55dec679f63de2b4d1} +\label{sll_8c_a0582f263482ead73d53b018978513540} Return the node at the specified index in a linked list. @@ -174,16 +201,15 @@ A pointer to the node and the supplied index, NULL if out of range. \end{DoxyReturn} -Definition at line 41 of file sll.c. +Definition at line 52 of file sll.c. -Here is the caller graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=220pt]{sll_8c_aaf7e4557200dec55dec679f63de2b4d1_icgraph} +\includegraphics[width=230pt]{sll_8c_a0582f263482ead73d53b018978513540_icgraph} \end{center} \end{figure} @@ -217,120 +243,202 @@ Pointer to the newly inserted node, NULL if index is out of range. \end{DoxyReturn} -Definition at line 65 of file sll.c. +Definition at line 88 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=222pt]{sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph} +\includegraphics[width=228pt]{sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph} \end{center} \end{figure} -\hypertarget{sll_8c_af7327f24d1900d495c1bf914a592b631}{ -\index{sll.c@{sll.c}!sll\_\-last@{sll\_\-last}} -\index{sll\_\-last@{sll\_\-last}!sll.c@{sll.c}} -\subsubsection[{sll\_\-last}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-last ( +\hypertarget{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe}{ +\index{sll.c@{sll.c}!sll\_\-length@{sll\_\-length}} +\index{sll\_\-length@{sll\_\-length}!sll.c@{sll.c}} +\subsubsection[{sll\_\-length}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int sll\_\-length ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8c_af7327f24d1900d495c1bf914a592b631} +\label{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe} -Finds and returns the last node in the supplied linked list. +Returns the number of elements in the list. + +Loops through the supplied list and returns a count of the number of elements contained in the list. \begin{DoxyParams}{Parameters} -{\em list} & The linked list to search.\\ +{\em list} & The list to be counted.\\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -Pointer to the last node in the supplied list. +The number of elements in the list. \end{DoxyReturn} -Definition at line 31 of file sll.c. +Definition at line 134 of file sll.c. +\hypertarget{sll_8c_a471151d11dc385e3364c9a38b19ecba7}{ +\index{sll.c@{sll.c}!sll\_\-new@{sll\_\-new}} +\index{sll\_\-new@{sll\_\-new}!sll.c@{sll.c}} +\subsubsection[{sll\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-new ( +\begin{DoxyParamCaption} +\item[{void $\ast$}]{contents} +\end{DoxyParamCaption} +)}} +\label{sll_8c_a471151d11dc385e3364c9a38b19ecba7} -Here is the caller graph for this function: -\nopagebreak +Creates a new linked list node with the supplied value. + +This function allocates a new node on the heap and populates the node contents with the supplied contents pointer. + + +\begin{DoxyParams}{Parameters} +{\em contents} & The contents of the newly created node.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +A pointer to the newly created node. +\end{DoxyReturn} + + +Definition at line 30 of file sll.c. + + + +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=212pt]{sll_8c_af7327f24d1900d495c1bf914a592b631_icgraph} +\includegraphics[width=246pt]{sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph} \end{center} \end{figure} -\hypertarget{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe}{ -\index{sll.c@{sll.c}!sll\_\-length@{sll\_\-length}} -\index{sll\_\-length@{sll\_\-length}!sll.c@{sll.c}} -\subsubsection[{sll\_\-length}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int sll\_\-length ( +\hypertarget{sll_8c_af72e93329186ac936d2bf6f544aa1f6b}{ +\index{sll.c@{sll.c}!sll\_\-pop\_\-back@{sll\_\-pop\_\-back}} +\index{sll\_\-pop\_\-back@{sll\_\-pop\_\-back}!sll.c@{sll.c}} +\subsubsection[{sll\_\-pop\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-pop\_\-back ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8c_af5f6589df6d0ef48ed6f57ac5527ddfe} +\label{sll_8c_af72e93329186ac936d2bf6f544aa1f6b} -Returns the number of elements in the list. +Removes and returns a pointer to the last element of the list. + + +\begin{DoxyParams}{Parameters} +{\em list} & \\ +\hline +{\em contents} & \\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly added node. +\end{DoxyReturn} -Loops through the supplied list and returns a count of the number of elements contained in the list. + +Definition at line 80 of file sll.c. + +\hypertarget{sll_8c_a1588e5a1f90852ee48403d5313d64269}{ +\index{sll.c@{sll.c}!sll\_\-pop\_\-front@{sll\_\-pop\_\-front}} +\index{sll\_\-pop\_\-front@{sll\_\-pop\_\-front}!sll.c@{sll.c}} +\subsubsection[{sll\_\-pop\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-pop\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list} +\end{DoxyParamCaption} +)}} +\label{sll_8c_a1588e5a1f90852ee48403d5313d64269} + + +Removes and returns a pointer to the first element of the list. \begin{DoxyParams}{Parameters} -{\em list} & The list to be counted.\\ +{\em list} & \\ +\hline +{\em contents} & \\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -The number of elements in the list. +Pointer to the newly added node. \end{DoxyReturn} -Definition at line 111 of file sll.c. +Definition at line 84 of file sll.c. -\hypertarget{sll_8c_a471151d11dc385e3364c9a38b19ecba7}{ -\index{sll.c@{sll.c}!sll\_\-new@{sll\_\-new}} -\index{sll\_\-new@{sll\_\-new}!sll.c@{sll.c}} -\subsubsection[{sll\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-new ( +\hypertarget{sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0}{ +\index{sll.c@{sll.c}!sll\_\-push\_\-back@{sll\_\-push\_\-back}} +\index{sll\_\-push\_\-back@{sll\_\-push\_\-back}!sll.c@{sll.c}} +\subsubsection[{sll\_\-push\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-push\_\-back ( \begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list, } \item[{void $\ast$}]{contents} \end{DoxyParamCaption} )}} -\label{sll_8c_a471151d11dc385e3364c9a38b19ecba7} +\label{sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0} -Creates a new linked list node with the supplied value. - -Allocates a new node on the heap and populates the node contents with the supplied contents pointer. +Adds a new node to the end of an existing linked list. \begin{DoxyParams}{Parameters} -{\em contents} & The contents of the newly created node.\\ +{\em list} & \\ +\hline +{\em contents} & \\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -A pointer to the newly created node. +Pointer to the newly added node. \end{DoxyReturn} -Definition at line 23 of file sll.c. +Definition at line 70 of file sll.c. -Here is the caller graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=222pt]{sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph} +\includegraphics[width=250pt]{sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph} \end{center} \end{figure} +\hypertarget{sll_8c_acfe3ebc296fe75f1d0ee21195dd7b9bf}{ +\index{sll.c@{sll.c}!sll\_\-push\_\-front@{sll\_\-push\_\-front}} +\index{sll\_\-push\_\-front@{sll\_\-push\_\-front}!sll.c@{sll.c}} +\subsubsection[{sll\_\-push\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-push\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list, } +\item[{void $\ast$}]{contents} +\end{DoxyParamCaption} +)}} +\label{sll_8c_acfe3ebc296fe75f1d0ee21195dd7b9bf} + + +Adds a new node to the front of an existing linked list. + + +\begin{DoxyParams}{Parameters} +{\em list} & \\ +\hline +{\em contents} & \\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly added node. +\end{DoxyReturn} + + +Definition at line 76 of file sll.c. + diff --git a/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 b/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 new file mode 100644 index 0000000..4dcf5ad --- /dev/null +++ b/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.md5 @@ -0,0 +1 @@ +97869c702dd3b7d1f194fdca6b728d80 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.pdf b/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.pdf new file mode 100644 index 0000000..70c1903 Binary files /dev/null and b/docs/doxygen/latex/sll_8c_a0582f263482ead73d53b018978513540_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 b/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 new file mode 100644 index 0000000..b04e3a4 --- /dev/null +++ b/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 @@ -0,0 +1 @@ +19e92655d2cd2aed2ed1ac777c5a4137 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf b/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf new file mode 100644 index 0000000..c91bed9 Binary files /dev/null and b/docs/doxygen/latex/sll_8c_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 b/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 index 5ef72be..1faac50 100644 --- a/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 +++ b/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 @@ -1 +1 @@ -fa69abfe1524b408e1013703ef11ab79 \ No newline at end of file +593f610131b43e39c633453ac1cd8021 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf b/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf index ea0db86..9c2d6e1 100644 Binary files a/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf and b/docs/doxygen/latex/sll_8c_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 b/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 index 4cd5181..c2e76c5 100644 --- a/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 +++ b/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 @@ -1 +1 @@ -24bbfb6c09b742de8660687837fb6d72 \ No newline at end of file +ce51c1faa4690651fe962f50f6718bc2 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf b/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf index ae82db7..2657e31 100644 Binary files a/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf and b/docs/doxygen/latex/sll_8c_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 b/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 new file mode 100644 index 0000000..3cb5c56 --- /dev/null +++ b/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 @@ -0,0 +1 @@ +ce635f8e203afe654ab1fbbed4de8e33 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf b/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf new file mode 100644 index 0000000..578de4e Binary files /dev/null and b/docs/doxygen/latex/sll_8c_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 b/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 index a23430a..a925b7f 100644 --- a/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 +++ b/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 @@ -1 +1 @@ -4cd3c941317bf91587f919a442219736 \ No newline at end of file +4a11eeb37ed04053ce55403269c262c4 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf b/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf index 27559de..2ccb94f 100644 Binary files a/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf and b/docs/doxygen/latex/sll_8c_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h.tex b/docs/doxygen/latex/sll_8h.tex index a200cbc..3adff5f 100644 --- a/docs/doxygen/latex/sll_8h.tex +++ b/docs/doxygen/latex/sll_8h.tex @@ -2,8 +2,7 @@ \section{src/lists/single\_\-link/sll.h File Reference} \label{sll_8h}\index{src/lists/single\_\-link/sll.h@{src/lists/single\_\-link/sll.h}} } -This graph shows which files directly or indirectly include this file: -\nopagebreak +This graph shows which files directly or indirectly include this file:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -13,79 +12,87 @@ This graph shows which files directly or indirectly include this file: \subsection*{Classes} \begin{DoxyCompactItemize} \item -struct \hyperlink{structnode}{node} -\begin{DoxyCompactList}\small\item\em A node in a hash table. \item\end{DoxyCompactList}\end{DoxyCompactItemize} +struct \hyperlink{structsll__node}{sll\_\-node} +\begin{DoxyCompactList}\small\item\em A linked list node. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection*{Typedefs} \begin{DoxyCompactItemize} \item -typedef struct \hyperlink{structnode}{node} \hyperlink{sll_8h_a74030fe22c7f9308540aee0c4259b111}{sll\_\-node} -\end{DoxyCompactItemize} +typedef struct \hyperlink{structsll__node}{sll\_\-node} \hyperlink{sll_8h_a168d63554ec6362ceecf64acc3e15bce}{sll\_\-node} +\begin{DoxyCompactList}\small\item\em A linked list node. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection*{Functions} \begin{DoxyCompactItemize} \item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a471151d11dc385e3364c9a38b19ecba7}{sll\_\-new} (void $\ast$contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a471151d11dc385e3364c9a38b19ecba7}{sll\_\-new} (void $\ast$contents) \begin{DoxyCompactList}\small\item\em Creates a new linked list node with the supplied value. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_af7327f24d1900d495c1bf914a592b631}{sll\_\-last} (\hyperlink{structnode}{sll\_\-node} $\ast$list) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_abe6fe02fbfcbf1d647ff94295b855e7e}{sll\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Finds and returns the first node in the supplied linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a78ef5151212d47bb63f2fd93453283ed}{sll\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) \begin{DoxyCompactList}\small\item\em Finds and returns the last node in the supplied linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_aaf7e4557200dec55dec679f63de2b4d1}{sll\_\-get} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a0582f263482ead73d53b018978513540}{sll\_\-index} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index) \begin{DoxyCompactList}\small\item\em Return the node at the specified index in a linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a0751beeb21d1540c9ddcd5e01964e23e}{sll\_\-add} (\hyperlink{structnode}{sll\_\-node} $\ast$list, void $\ast$contents) -\begin{DoxyCompactList}\small\item\em Adds a new node to an existing linked list. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a66769edc21579f71972ac90de6da4a9f}{sll\_\-insert} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index, void $\ast$contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0}{sll\_\-push\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, void $\ast$contents) +\begin{DoxyCompactList}\small\item\em Adds a new node to the end of an existing linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_acfe3ebc296fe75f1d0ee21195dd7b9bf}{sll\_\-push\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, void $\ast$contents) +\begin{DoxyCompactList}\small\item\em Adds a new node to the front of an existing linked list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_af72e93329186ac936d2bf6f544aa1f6b}{sll\_\-pop\_\-back} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Removes and returns a pointer to the last element of the list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a1588e5a1f90852ee48403d5313d64269}{sll\_\-pop\_\-front} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) +\begin{DoxyCompactList}\small\item\em Removes and returns a pointer to the first element of the list. \item\end{DoxyCompactList}\item +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_a66769edc21579f71972ac90de6da4a9f}{sll\_\-insert} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index, void $\ast$contents) \begin{DoxyCompactList}\small\item\em Inserts a new node in a linked list at the specified index. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{sll\_\-node} $\ast$ \hyperlink{sll_8h_afd494f171c24981f0d7a007841f21cfe}{sll\_\-delete} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int index, int free\_\-contents) +\hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{sll_8h_afd494f171c24981f0d7a007841f21cfe}{sll\_\-delete} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int index, int free\_\-contents) \begin{DoxyCompactList}\small\item\em Deletes a node from the supplied list. \item\end{DoxyCompactList}\item -void \hyperlink{sll_8h_a7373cc6bac0876b330da73722e24910b}{sll\_\-free} (\hyperlink{structnode}{sll\_\-node} $\ast$list, int free\_\-contents) +void \hyperlink{sll_8h_a7373cc6bac0876b330da73722e24910b}{sll\_\-free} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list, int free\_\-contents) \begin{DoxyCompactList}\small\item\em Frees all memory used by a linked list. \item\end{DoxyCompactList}\item -unsigned int \hyperlink{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe}{sll\_\-length} (\hyperlink{structnode}{sll\_\-node} $\ast$list) +unsigned int \hyperlink{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe}{sll\_\-length} (\hyperlink{structsll__node}{sll\_\-node} $\ast$list) \begin{DoxyCompactList}\small\item\em Returns the number of elements in the list. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection{Typedef Documentation} -\hypertarget{sll_8h_a74030fe22c7f9308540aee0c4259b111}{ +\hypertarget{sll_8h_a168d63554ec6362ceecf64acc3e15bce}{ \index{sll.h@{sll.h}!sll\_\-node@{sll\_\-node}} \index{sll\_\-node@{sll\_\-node}!sll.h@{sll.h}} -\subsubsection[{sll\_\-node}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf node} {\bf sll\_\-node}}} -\label{sll_8h_a74030fe22c7f9308540aee0c4259b111} +\subsubsection[{sll\_\-node}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf sll\_\-node} {\bf sll\_\-node}}} +\label{sll_8h_a168d63554ec6362ceecf64acc3e15bce} + + +A linked list node. + \subsection{Function Documentation} -\hypertarget{sll_8h_a0751beeb21d1540c9ddcd5e01964e23e}{ -\index{sll.h@{sll.h}!sll\_\-add@{sll\_\-add}} -\index{sll\_\-add@{sll\_\-add}!sll.h@{sll.h}} -\subsubsection[{sll\_\-add}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-add ( +\hypertarget{sll_8h_a78ef5151212d47bb63f2fd93453283ed}{ +\index{sll.h@{sll.h}!sll\_\-back@{sll\_\-back}} +\index{sll\_\-back@{sll\_\-back}!sll.h@{sll.h}} +\subsubsection[{sll\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-back ( \begin{DoxyParamCaption} -\item[{{\bf sll\_\-node} $\ast$}]{list, } -\item[{void $\ast$}]{contents} +\item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8h_a0751beeb21d1540c9ddcd5e01964e23e} +\label{sll_8h_a78ef5151212d47bb63f2fd93453283ed} -Adds a new node to an existing linked list. +Finds and returns the last node in the supplied linked list. \begin{DoxyParams}{Parameters} -{\em list} & \\ -\hline -{\em contents} & \\ +{\em list} & The linked list to search.\\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -Pointer to the newly added node. +Pointer to the last node in the supplied list. \end{DoxyReturn} -Definition at line 59 of file sll.c. +Definition at line 42 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=214pt]{sll_8h_a0751beeb21d1540c9ddcd5e01964e23e_cgraph} +\includegraphics[width=250pt]{sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph} \end{center} \end{figure} @@ -121,16 +128,15 @@ Pointer to the node that is now at the supplied index. \end{DoxyReturn} -Definition at line 79 of file sll.c. +Definition at line 102 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=220pt]{sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph} +\includegraphics[width=230pt]{sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph} \end{center} \end{figure} @@ -160,18 +166,43 @@ Loops through the supplied list and frees all nodes. Also frees contents if free \end{DoxyParams} -Definition at line 96 of file sll.c. +Definition at line 119 of file sll.c. + +\hypertarget{sll_8h_abe6fe02fbfcbf1d647ff94295b855e7e}{ +\index{sll.h@{sll.h}!sll\_\-front@{sll\_\-front}} +\index{sll\_\-front@{sll\_\-front}!sll.h@{sll.h}} +\subsubsection[{sll\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list} +\end{DoxyParamCaption} +)}} +\label{sll_8h_abe6fe02fbfcbf1d647ff94295b855e7e} + + +Finds and returns the first node in the supplied linked list. + + +\begin{DoxyParams}{Parameters} +{\em list} & The linked list to search.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the last node in the supplied list. +\end{DoxyReturn} + + +Definition at line 38 of file sll.c. -\hypertarget{sll_8h_aaf7e4557200dec55dec679f63de2b4d1}{ -\index{sll.h@{sll.h}!sll\_\-get@{sll\_\-get}} -\index{sll\_\-get@{sll\_\-get}!sll.h@{sll.h}} -\subsubsection[{sll\_\-get}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-get ( +\hypertarget{sll_8h_a0582f263482ead73d53b018978513540}{ +\index{sll.h@{sll.h}!sll\_\-index@{sll\_\-index}} +\index{sll\_\-index@{sll\_\-index}!sll.h@{sll.h}} +\subsubsection[{sll\_\-index}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-index ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list, } \item[{int}]{index} \end{DoxyParamCaption} )}} -\label{sll_8h_aaf7e4557200dec55dec679f63de2b4d1} +\label{sll_8h_a0582f263482ead73d53b018978513540} Return the node at the specified index in a linked list. @@ -190,16 +221,15 @@ A pointer to the node and the supplied index, NULL if out of range. \end{DoxyReturn} -Definition at line 41 of file sll.c. +Definition at line 52 of file sll.c. -Here is the caller graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=220pt]{sll_8h_aaf7e4557200dec55dec679f63de2b4d1_icgraph} +\includegraphics[width=230pt]{sll_8h_a0582f263482ead73d53b018978513540_icgraph} \end{center} \end{figure} @@ -233,120 +263,202 @@ Pointer to the newly inserted node, NULL if index is out of range. \end{DoxyReturn} -Definition at line 65 of file sll.c. +Definition at line 88 of file sll.c. -Here is the call graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=222pt]{sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph} +\includegraphics[width=228pt]{sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph} \end{center} \end{figure} -\hypertarget{sll_8h_af7327f24d1900d495c1bf914a592b631}{ -\index{sll.h@{sll.h}!sll\_\-last@{sll\_\-last}} -\index{sll\_\-last@{sll\_\-last}!sll.h@{sll.h}} -\subsubsection[{sll\_\-last}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-last ( +\hypertarget{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe}{ +\index{sll.h@{sll.h}!sll\_\-length@{sll\_\-length}} +\index{sll\_\-length@{sll\_\-length}!sll.h@{sll.h}} +\subsubsection[{sll\_\-length}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int sll\_\-length ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8h_af7327f24d1900d495c1bf914a592b631} +\label{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe} -Finds and returns the last node in the supplied linked list. +Returns the number of elements in the list. + +Loops through the supplied list and returns a count of the number of elements contained in the list. \begin{DoxyParams}{Parameters} -{\em list} & The linked list to search.\\ +{\em list} & The list to be counted.\\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -Pointer to the last node in the supplied list. +The number of elements in the list. +\end{DoxyReturn} + + +Definition at line 134 of file sll.c. + +\hypertarget{sll_8h_a471151d11dc385e3364c9a38b19ecba7}{ +\index{sll.h@{sll.h}!sll\_\-new@{sll\_\-new}} +\index{sll\_\-new@{sll\_\-new}!sll.h@{sll.h}} +\subsubsection[{sll\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-new ( +\begin{DoxyParamCaption} +\item[{void $\ast$}]{contents} +\end{DoxyParamCaption} +)}} +\label{sll_8h_a471151d11dc385e3364c9a38b19ecba7} + + +Creates a new linked list node with the supplied value. + +This function allocates a new node on the heap and populates the node contents with the supplied contents pointer. + + +\begin{DoxyParams}{Parameters} +{\em contents} & The contents of the newly created node.\\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +A pointer to the newly created node. \end{DoxyReturn} -Definition at line 31 of file sll.c. +Definition at line 30 of file sll.c. -Here is the caller graph for this function: -\nopagebreak +Here is the caller graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=212pt]{sll_8h_af7327f24d1900d495c1bf914a592b631_icgraph} +\includegraphics[width=246pt]{sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph} \end{center} \end{figure} -\hypertarget{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe}{ -\index{sll.h@{sll.h}!sll\_\-length@{sll\_\-length}} -\index{sll\_\-length@{sll\_\-length}!sll.h@{sll.h}} -\subsubsection[{sll\_\-length}]{\setlength{\rightskip}{0pt plus 5cm}unsigned int sll\_\-length ( +\hypertarget{sll_8h_af72e93329186ac936d2bf6f544aa1f6b}{ +\index{sll.h@{sll.h}!sll\_\-pop\_\-back@{sll\_\-pop\_\-back}} +\index{sll\_\-pop\_\-back@{sll\_\-pop\_\-back}!sll.h@{sll.h}} +\subsubsection[{sll\_\-pop\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-pop\_\-back ( \begin{DoxyParamCaption} \item[{{\bf sll\_\-node} $\ast$}]{list} \end{DoxyParamCaption} )}} -\label{sll_8h_af5f6589df6d0ef48ed6f57ac5527ddfe} +\label{sll_8h_af72e93329186ac936d2bf6f544aa1f6b} -Returns the number of elements in the list. +Removes and returns a pointer to the last element of the list. + + +\begin{DoxyParams}{Parameters} +{\em list} & \\ +\hline +{\em contents} & \\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly added node. +\end{DoxyReturn} + + +Definition at line 80 of file sll.c. + +\hypertarget{sll_8h_a1588e5a1f90852ee48403d5313d64269}{ +\index{sll.h@{sll.h}!sll\_\-pop\_\-front@{sll\_\-pop\_\-front}} +\index{sll\_\-pop\_\-front@{sll\_\-pop\_\-front}!sll.h@{sll.h}} +\subsubsection[{sll\_\-pop\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-pop\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list} +\end{DoxyParamCaption} +)}} +\label{sll_8h_a1588e5a1f90852ee48403d5313d64269} -Loops through the supplied list and returns a count of the number of elements contained in the list. + +Removes and returns a pointer to the first element of the list. \begin{DoxyParams}{Parameters} -{\em list} & The list to be counted.\\ +{\em list} & \\ +\hline +{\em contents} & \\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -The number of elements in the list. +Pointer to the newly added node. \end{DoxyReturn} -Definition at line 111 of file sll.c. +Definition at line 84 of file sll.c. -\hypertarget{sll_8h_a471151d11dc385e3364c9a38b19ecba7}{ -\index{sll.h@{sll.h}!sll\_\-new@{sll\_\-new}} -\index{sll\_\-new@{sll\_\-new}!sll.h@{sll.h}} -\subsubsection[{sll\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-new ( +\hypertarget{sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0}{ +\index{sll.h@{sll.h}!sll\_\-push\_\-back@{sll\_\-push\_\-back}} +\index{sll\_\-push\_\-back@{sll\_\-push\_\-back}!sll.h@{sll.h}} +\subsubsection[{sll\_\-push\_\-back}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-push\_\-back ( \begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list, } \item[{void $\ast$}]{contents} \end{DoxyParamCaption} )}} -\label{sll_8h_a471151d11dc385e3364c9a38b19ecba7} +\label{sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0} -Creates a new linked list node with the supplied value. - -Allocates a new node on the heap and populates the node contents with the supplied contents pointer. +Adds a new node to the end of an existing linked list. \begin{DoxyParams}{Parameters} -{\em contents} & The contents of the newly created node.\\ +{\em list} & \\ +\hline +{\em contents} & \\ \hline \end{DoxyParams} \begin{DoxyReturn}{Returns} -A pointer to the newly created node. +Pointer to the newly added node. \end{DoxyReturn} -Definition at line 23 of file sll.c. +Definition at line 70 of file sll.c. -Here is the caller graph for this function: -\nopagebreak +Here is the call graph for this function:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=222pt]{sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph} +\includegraphics[width=250pt]{sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph} \end{center} \end{figure} +\hypertarget{sll_8h_acfe3ebc296fe75f1d0ee21195dd7b9bf}{ +\index{sll.h@{sll.h}!sll\_\-push\_\-front@{sll\_\-push\_\-front}} +\index{sll\_\-push\_\-front@{sll\_\-push\_\-front}!sll.h@{sll.h}} +\subsubsection[{sll\_\-push\_\-front}]{\setlength{\rightskip}{0pt plus 5cm}{\bf sll\_\-node}$\ast$ sll\_\-push\_\-front ( +\begin{DoxyParamCaption} +\item[{{\bf sll\_\-node} $\ast$}]{list, } +\item[{void $\ast$}]{contents} +\end{DoxyParamCaption} +)}} +\label{sll_8h_acfe3ebc296fe75f1d0ee21195dd7b9bf} + + +Adds a new node to the front of an existing linked list. + + +\begin{DoxyParams}{Parameters} +{\em list} & \\ +\hline +{\em contents} & \\ +\hline +\end{DoxyParams} +\begin{DoxyReturn}{Returns} +Pointer to the newly added node. +\end{DoxyReturn} + + +Definition at line 76 of file sll.c. + diff --git a/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 b/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 new file mode 100644 index 0000000..4dcf5ad --- /dev/null +++ b/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.md5 @@ -0,0 +1 @@ +97869c702dd3b7d1f194fdca6b728d80 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.pdf b/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.pdf new file mode 100644 index 0000000..70c1903 Binary files /dev/null and b/docs/doxygen/latex/sll_8h_a0582f263482ead73d53b018978513540_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 b/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 new file mode 100644 index 0000000..b04e3a4 --- /dev/null +++ b/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.md5 @@ -0,0 +1 @@ +19e92655d2cd2aed2ed1ac777c5a4137 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf b/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf new file mode 100644 index 0000000..c91bed9 Binary files /dev/null and b/docs/doxygen/latex/sll_8h_a19ad0a86a87451a3ab68ad6d18c3e3e0_cgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 b/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 index 5ef72be..1faac50 100644 --- a/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 +++ b/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.md5 @@ -1 +1 @@ -fa69abfe1524b408e1013703ef11ab79 \ No newline at end of file +593f610131b43e39c633453ac1cd8021 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf b/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf index ea0db86..9c2d6e1 100644 Binary files a/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf and b/docs/doxygen/latex/sll_8h_a471151d11dc385e3364c9a38b19ecba7_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 b/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 index 4cd5181..c2e76c5 100644 --- a/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 +++ b/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.md5 @@ -1 +1 @@ -24bbfb6c09b742de8660687837fb6d72 \ No newline at end of file +ce51c1faa4690651fe962f50f6718bc2 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf b/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf index ae82db7..2657e31 100644 Binary files a/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf and b/docs/doxygen/latex/sll_8h_a66769edc21579f71972ac90de6da4a9f_cgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 b/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 new file mode 100644 index 0000000..3cb5c56 --- /dev/null +++ b/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.md5 @@ -0,0 +1 @@ +ce635f8e203afe654ab1fbbed4de8e33 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf b/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf new file mode 100644 index 0000000..578de4e Binary files /dev/null and b/docs/doxygen/latex/sll_8h_a78ef5151212d47bb63f2fd93453283ed_icgraph.pdf differ diff --git a/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 b/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 index a23430a..a925b7f 100644 --- a/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 +++ b/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.md5 @@ -1 +1 @@ -4cd3c941317bf91587f919a442219736 \ No newline at end of file +4a11eeb37ed04053ce55403269c262c4 \ No newline at end of file diff --git a/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf b/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf index 27559de..2ccb94f 100644 Binary files a/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf and b/docs/doxygen/latex/sll_8h_afd494f171c24981f0d7a007841f21cfe_cgraph.pdf differ diff --git a/docs/doxygen/latex/structbt__node.tex b/docs/doxygen/latex/structbt__node.tex new file mode 100644 index 0000000..bcd68f2 --- /dev/null +++ b/docs/doxygen/latex/structbt__node.tex @@ -0,0 +1,85 @@ +\hypertarget{structbt__node}{ +\section{bt\_\-node Struct Reference} +\label{structbt__node}\index{bt\_\-node@{bt\_\-node}} +} + + +A binary tree node. + + + + +{\ttfamily \#include $<$bt.h$>$} + + + +Collaboration diagram for bt\_\-node:\nopagebreak +\begin{figure}[H] +\begin{center} +\leavevmode +\includegraphics[width=167pt]{structbt__node__coll__graph} +\end{center} +\end{figure} +\subsection*{Public Attributes} +\begin{DoxyCompactItemize} +\item +void $\ast$ \hyperlink{structbt__node_a9e0d7c8bb9ca7bb4b69bd4af9ca1440c}{contents} +\begin{DoxyCompactList}\small\item\em The contents of the tree node. \item\end{DoxyCompactList}\item +struct \hyperlink{structbt__node}{bt\_\-node} $\ast$ \hyperlink{structbt__node_a689e6fb3fde56bc337d5234b0d7f8e80}{left} +\begin{DoxyCompactList}\small\item\em The left child of the tree node. \item\end{DoxyCompactList}\item +struct \hyperlink{structbt__node}{bt\_\-node} $\ast$ \hyperlink{structbt__node_aefe84db5b1f24953aba4743200b24898}{right} +\begin{DoxyCompactList}\small\item\em the right child of the tree node. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Detailed Description} +A binary tree node. + +Definition at line 34 of file bt.h. + + + +\subsection{Member Data Documentation} +\hypertarget{structbt__node_a9e0d7c8bb9ca7bb4b69bd4af9ca1440c}{ +\index{bt\_\-node@{bt\_\-node}!contents@{contents}} +\index{contents@{contents}!bt_node@{bt\_\-node}} +\subsubsection[{contents}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ {\bf bt\_\-node::contents}}} +\label{structbt__node_a9e0d7c8bb9ca7bb4b69bd4af9ca1440c} + + +The contents of the tree node. + + + +Definition at line 37 of file bt.h. + +\hypertarget{structbt__node_a689e6fb3fde56bc337d5234b0d7f8e80}{ +\index{bt\_\-node@{bt\_\-node}!left@{left}} +\index{left@{left}!bt_node@{bt\_\-node}} +\subsubsection[{left}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf bt\_\-node}$\ast$ {\bf bt\_\-node::left}}} +\label{structbt__node_a689e6fb3fde56bc337d5234b0d7f8e80} + + +The left child of the tree node. + + + +Definition at line 39 of file bt.h. + +\hypertarget{structbt__node_aefe84db5b1f24953aba4743200b24898}{ +\index{bt\_\-node@{bt\_\-node}!right@{right}} +\index{right@{right}!bt_node@{bt\_\-node}} +\subsubsection[{right}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf bt\_\-node}$\ast$ {\bf bt\_\-node::right}}} +\label{structbt__node_aefe84db5b1f24953aba4743200b24898} + + +the right child of the tree node. + + + +Definition at line 41 of file bt.h. + + + +The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize} +\item +src/trees/binary/\hyperlink{bt_8h}{bt.h}\end{DoxyCompactItemize} diff --git a/docs/doxygen/latex/structbt__node__coll__graph.md5 b/docs/doxygen/latex/structbt__node__coll__graph.md5 new file mode 100644 index 0000000..342abb3 --- /dev/null +++ b/docs/doxygen/latex/structbt__node__coll__graph.md5 @@ -0,0 +1 @@ +f856bfd02666749fdb3c89616eece6d9 \ No newline at end of file diff --git a/docs/doxygen/latex/structbt__node__coll__graph.pdf b/docs/doxygen/latex/structbt__node__coll__graph.pdf new file mode 100644 index 0000000..988d9cf Binary files /dev/null and b/docs/doxygen/latex/structbt__node__coll__graph.pdf differ diff --git a/docs/doxygen/latex/structbt__tree.tex b/docs/doxygen/latex/structbt__tree.tex new file mode 100644 index 0000000..defe19b --- /dev/null +++ b/docs/doxygen/latex/structbt__tree.tex @@ -0,0 +1,70 @@ +\hypertarget{structbt__tree}{ +\section{bt\_\-tree Struct Reference} +\label{structbt__tree}\index{bt\_\-tree@{bt\_\-tree}} +} + + +A binary tree. + + + + +{\ttfamily \#include $<$bt.h$>$} + + + +Collaboration diagram for bt\_\-tree:\nopagebreak +\begin{figure}[H] +\begin{center} +\leavevmode +\includegraphics[width=167pt]{structbt__tree__coll__graph} +\end{center} +\end{figure} +\subsection*{Public Attributes} +\begin{DoxyCompactItemize} +\item +\hyperlink{structbt__node}{bt\_\-node} $\ast$ \hyperlink{structbt__tree_ae428a77981f3b9f27f959b78ed468db7}{root} +\begin{DoxyCompactList}\small\item\em The root of the binary tree. \item\end{DoxyCompactList}\item +\hyperlink{bt_8h_a8a7bf1216efb8b05f20a020acd705f75}{bt\_\-compare\_\-func} \hyperlink{structbt__tree_a7ac2a5e50551c1a10b1bf3884cd12af5}{compare} +\begin{DoxyCompactList}\small\item\em The function used to compare data. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Detailed Description} +A binary tree. + +Definition at line 45 of file bt.h. + + + +\subsection{Member Data Documentation} +\hypertarget{structbt__tree_a7ac2a5e50551c1a10b1bf3884cd12af5}{ +\index{bt\_\-tree@{bt\_\-tree}!compare@{compare}} +\index{compare@{compare}!bt_tree@{bt\_\-tree}} +\subsubsection[{compare}]{\setlength{\rightskip}{0pt plus 5cm}{\bf bt\_\-compare\_\-func} {\bf bt\_\-tree::compare}}} +\label{structbt__tree_a7ac2a5e50551c1a10b1bf3884cd12af5} + + +The function used to compare data. + + + +Definition at line 50 of file bt.h. + +\hypertarget{structbt__tree_ae428a77981f3b9f27f959b78ed468db7}{ +\index{bt\_\-tree@{bt\_\-tree}!root@{root}} +\index{root@{root}!bt_tree@{bt\_\-tree}} +\subsubsection[{root}]{\setlength{\rightskip}{0pt plus 5cm}{\bf bt\_\-node}$\ast$ {\bf bt\_\-tree::root}}} +\label{structbt__tree_ae428a77981f3b9f27f959b78ed468db7} + + +The root of the binary tree. + + + +Definition at line 48 of file bt.h. + + + +The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize} +\item +src/trees/binary/\hyperlink{bt_8h}{bt.h}\end{DoxyCompactItemize} diff --git a/docs/doxygen/latex/structbt__tree__coll__graph.md5 b/docs/doxygen/latex/structbt__tree__coll__graph.md5 new file mode 100644 index 0000000..24e5ae2 --- /dev/null +++ b/docs/doxygen/latex/structbt__tree__coll__graph.md5 @@ -0,0 +1 @@ +92a8ab8fa9e52963611ba11b39ae0108 \ No newline at end of file diff --git a/docs/doxygen/latex/structbt__tree__coll__graph.pdf b/docs/doxygen/latex/structbt__tree__coll__graph.pdf new file mode 100644 index 0000000..766b54f Binary files /dev/null and b/docs/doxygen/latex/structbt__tree__coll__graph.pdf differ diff --git a/docs/doxygen/latex/structht__node.tex b/docs/doxygen/latex/structht__node.tex new file mode 100644 index 0000000..e52535e --- /dev/null +++ b/docs/doxygen/latex/structht__node.tex @@ -0,0 +1,76 @@ +\hypertarget{structht__node}{ +\section{ht\_\-node Struct Reference} +\label{structht__node}\index{ht\_\-node@{ht\_\-node}} +} + + +A node in a hash table. + + + + +{\ttfamily \#include $<$ht.h$>$} + +\subsection*{Public Attributes} +\begin{DoxyCompactItemize} +\item +void $\ast$ \hyperlink{structht__node_a7ae2a850d1c6e0abb86b3d901fb5d16b}{key} +\begin{DoxyCompactList}\small\item\em Pointer to the key. \item\end{DoxyCompactList}\item +void $\ast$ \hyperlink{structht__node_a0e050852d00670316f005463a7d749f8}{val} +\begin{DoxyCompactList}\small\item\em Pointer to the value. \item\end{DoxyCompactList}\item +struct node $\ast$ \hyperlink{structht__node_ae1c5c426c9f752a40b5db427b506060e}{next} +\begin{DoxyCompactList}\small\item\em Pointer to the next node in the collision chain. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Detailed Description} +A node in a hash table. + +Definition at line 34 of file ht.h. + + + +\subsection{Member Data Documentation} +\hypertarget{structht__node_a7ae2a850d1c6e0abb86b3d901fb5d16b}{ +\index{ht\_\-node@{ht\_\-node}!key@{key}} +\index{key@{key}!ht_node@{ht\_\-node}} +\subsubsection[{key}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ {\bf ht\_\-node::key}}} +\label{structht__node_a7ae2a850d1c6e0abb86b3d901fb5d16b} + + +Pointer to the key. + + + +Definition at line 37 of file ht.h. + +\hypertarget{structht__node_ae1c5c426c9f752a40b5db427b506060e}{ +\index{ht\_\-node@{ht\_\-node}!next@{next}} +\index{next@{next}!ht_node@{ht\_\-node}} +\subsubsection[{next}]{\setlength{\rightskip}{0pt plus 5cm}struct node$\ast$ {\bf ht\_\-node::next}}} +\label{structht__node_ae1c5c426c9f752a40b5db427b506060e} + + +Pointer to the next node in the collision chain. + + + +Definition at line 41 of file ht.h. + +\hypertarget{structht__node_a0e050852d00670316f005463a7d749f8}{ +\index{ht\_\-node@{ht\_\-node}!val@{val}} +\index{val@{val}!ht_node@{ht\_\-node}} +\subsubsection[{val}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ {\bf ht\_\-node::val}}} +\label{structht__node_a0e050852d00670316f005463a7d749f8} + + +Pointer to the value. + + + +Definition at line 39 of file ht.h. + + + +The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize} +\item +src/ht/\hyperlink{ht_8h}{ht.h}\end{DoxyCompactItemize} diff --git a/docs/doxygen/latex/structht__table.tex b/docs/doxygen/latex/structht__table.tex index cbe8d9a..97f4a71 100644 --- a/docs/doxygen/latex/structht__table.tex +++ b/docs/doxygen/latex/structht__table.tex @@ -18,7 +18,7 @@ Collaboration diagram for ht\_\-table: \begin{figure}[H] \begin{center} \leavevmode -\includegraphics[width=161pt]{structht__table__coll__graph} +\includegraphics[width=130pt]{structht__table__coll__graph} \end{center} \end{figure} \subsection*{Public Attributes} @@ -26,7 +26,7 @@ Collaboration diagram for ht\_\-table: \item unsigned int \hyperlink{structht__table_a493b0baf20b4274a08b5451e61f8e5f4}{size} \begin{DoxyCompactList}\small\item\em Size of the internal table. \item\end{DoxyCompactList}\item -\hyperlink{structnode}{ht\_\-node} $\ast$$\ast$ \hyperlink{structht__table_ae739f6f0d8b6cd6f55337ae7d0761dfc}{table} +\hyperlink{structht__node}{ht\_\-node} $\ast$$\ast$ \hyperlink{structht__table_ae739f6f0d8b6cd6f55337ae7d0761dfc}{table} \begin{DoxyCompactList}\small\item\em Pointer to the internal hashing table. \item\end{DoxyCompactList}\item \hyperlink{ht_8h_a91a8d03489ef281e6f26d389c44d42cf}{ht\_\-hash\_\-func} \hyperlink{structht__table_abe53fe8d261dea812255944769d22f45}{hash\_\-func} \begin{DoxyCompactList}\small\item\em Function used for hashing elements. \item\end{DoxyCompactList}\end{DoxyCompactItemize} @@ -35,7 +35,7 @@ unsigned int \hyperlink{structht__table_a493b0baf20b4274a08b5451e61f8e5f4}{size} \subsection{Detailed Description} A hash table. -Definition at line 35 of file ht.h. +Definition at line 45 of file ht.h. @@ -51,7 +51,7 @@ Function used for hashing elements. -Definition at line 42 of file ht.h. +Definition at line 52 of file ht.h. \hypertarget{structht__table_a493b0baf20b4274a08b5451e61f8e5f4}{ \index{ht\_\-table@{ht\_\-table}!size@{size}} @@ -64,7 +64,7 @@ Size of the internal table. -Definition at line 38 of file ht.h. +Definition at line 48 of file ht.h. \hypertarget{structht__table_ae739f6f0d8b6cd6f55337ae7d0761dfc}{ \index{ht\_\-table@{ht\_\-table}!table@{table}} @@ -77,7 +77,7 @@ Pointer to the internal hashing table. -Definition at line 40 of file ht.h. +Definition at line 50 of file ht.h. diff --git a/docs/doxygen/latex/structht__table__coll__graph.md5 b/docs/doxygen/latex/structht__table__coll__graph.md5 index bf27bf8..c14c656 100644 --- a/docs/doxygen/latex/structht__table__coll__graph.md5 +++ b/docs/doxygen/latex/structht__table__coll__graph.md5 @@ -1 +1 @@ -869d2d9ff0499d50d91209afdb1146e1 \ No newline at end of file +c099f525bafd0cf5b8d3a0f2c07b8269 \ No newline at end of file diff --git a/docs/doxygen/latex/structht__table__coll__graph.pdf b/docs/doxygen/latex/structht__table__coll__graph.pdf index 3c1bd2b..afd2b46 100644 Binary files a/docs/doxygen/latex/structht__table__coll__graph.pdf and b/docs/doxygen/latex/structht__table__coll__graph.pdf differ diff --git a/docs/doxygen/latex/structnode.tex b/docs/doxygen/latex/structnode.tex index 5916c60..2c57567 100644 --- a/docs/doxygen/latex/structnode.tex +++ b/docs/doxygen/latex/structnode.tex @@ -13,8 +13,7 @@ A node in a hash table. -Collaboration diagram for node: -\nopagebreak +Collaboration diagram for node:\nopagebreak \begin{figure}[H] \begin{center} \leavevmode @@ -27,30 +26,19 @@ Collaboration diagram for node: void $\ast$ \hyperlink{structnode_a72c8a0c41b801c92db89c5078642f28b}{key} \begin{DoxyCompactList}\small\item\em Pointer to the key. \item\end{DoxyCompactList}\item void $\ast$ \hyperlink{structnode_a3866f55c05d50265b730d8cdeec0a1f8}{val} -\begin{DoxyCompactList}\small\item\em Pointer to tke value. \item\end{DoxyCompactList}\item -struct \hyperlink{structnode}{node} $\ast$ \hyperlink{structnode_a111a569ab2765add9b91c9f94cf9f063}{next} -\begin{DoxyCompactList}\small\item\em Pointer to the next node in the collision chain. \item\end{DoxyCompactList}\item -void $\ast$ \hyperlink{structnode_a6658978058886a89ccc39f1d1a56e6d1}{contents} -\end{DoxyCompactItemize} +\begin{DoxyCompactList}\small\item\em Pointer to the value. \item\end{DoxyCompactList}\item +struct \hyperlink{structnode}{node} $\ast$ \hyperlink{structnode_aa3e8aa83f864292b5a01210f4453fcc0}{next} +\begin{DoxyCompactList}\small\item\em Pointer to the next node in the collision chain. \item\end{DoxyCompactList}\end{DoxyCompactItemize} \subsection{Detailed Description} A node in a hash table. -Definition at line 24 of file ht.h. +Definition at line 34 of file ht.h. \subsection{Member Data Documentation} -\hypertarget{structnode_a6658978058886a89ccc39f1d1a56e6d1}{ -\index{node@{node}!contents@{contents}} -\index{contents@{contents}!node@{node}} -\subsubsection[{contents}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ {\bf node::contents}}} -\label{structnode_a6658978058886a89ccc39f1d1a56e6d1} - - -Definition at line 22 of file sll.h. - \hypertarget{structnode_a72c8a0c41b801c92db89c5078642f28b}{ \index{node@{node}!key@{key}} \index{key@{key}!node@{node}} @@ -62,20 +50,20 @@ Pointer to the key. -Definition at line 27 of file ht.h. +Definition at line 37 of file ht.h. -\hypertarget{structnode_a111a569ab2765add9b91c9f94cf9f063}{ +\hypertarget{structnode_aa3e8aa83f864292b5a01210f4453fcc0}{ \index{node@{node}!next@{next}} \index{next@{next}!node@{node}} -\subsubsection[{next}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf node} $\ast$ {\bf node::next}}} -\label{structnode_a111a569ab2765add9b91c9f94cf9f063} +\subsubsection[{next}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf node}$\ast$ {\bf node::next}}} +\label{structnode_aa3e8aa83f864292b5a01210f4453fcc0} Pointer to the next node in the collision chain. -Definition at line 31 of file ht.h. +Definition at line 41 of file ht.h. \hypertarget{structnode_a3866f55c05d50265b730d8cdeec0a1f8}{ \index{node@{node}!val@{val}} @@ -84,15 +72,14 @@ Definition at line 31 of file ht.h. \label{structnode_a3866f55c05d50265b730d8cdeec0a1f8} -Pointer to tke value. +Pointer to the value. -Definition at line 29 of file ht.h. +Definition at line 39 of file ht.h. -The documentation for this struct was generated from the following files:\begin{DoxyCompactItemize} +The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize} \item -src/ht/\hyperlink{ht_8h}{ht.h}\item -src/lists/single\_\-link/\hyperlink{sll_8h}{sll.h}\end{DoxyCompactItemize} +src/ht/\hyperlink{ht_8h}{ht.h}\end{DoxyCompactItemize} diff --git a/docs/doxygen/latex/structsll__node.tex b/docs/doxygen/latex/structsll__node.tex new file mode 100644 index 0000000..c5b1745 --- /dev/null +++ b/docs/doxygen/latex/structsll__node.tex @@ -0,0 +1,70 @@ +\hypertarget{structsll__node}{ +\section{sll\_\-node Struct Reference} +\label{structsll__node}\index{sll\_\-node@{sll\_\-node}} +} + + +A linked list node. + + + + +{\ttfamily \#include $<$sll.h$>$} + + + +Collaboration diagram for sll\_\-node:\nopagebreak +\begin{figure}[H] +\begin{center} +\leavevmode +\includegraphics[width=169pt]{structsll__node__coll__graph} +\end{center} +\end{figure} +\subsection*{Public Attributes} +\begin{DoxyCompactItemize} +\item +void $\ast$ \hyperlink{structsll__node_aafacbed96ba149b0b8c705426196154c}{contents} +\begin{DoxyCompactList}\small\item\em Pointer to the contents the node. \item\end{DoxyCompactList}\item +struct \hyperlink{structsll__node}{sll\_\-node} $\ast$ \hyperlink{structsll__node_aa2e4c5d743ad44e759b5ca13f9915826}{next} +\begin{DoxyCompactList}\small\item\em Pointer to next node in the list. \item\end{DoxyCompactList}\end{DoxyCompactItemize} + + +\subsection{Detailed Description} +A linked list node. + +Definition at line 31 of file sll.h. + + + +\subsection{Member Data Documentation} +\hypertarget{structsll__node_aafacbed96ba149b0b8c705426196154c}{ +\index{sll\_\-node@{sll\_\-node}!contents@{contents}} +\index{contents@{contents}!sll_node@{sll\_\-node}} +\subsubsection[{contents}]{\setlength{\rightskip}{0pt plus 5cm}void$\ast$ {\bf sll\_\-node::contents}}} +\label{structsll__node_aafacbed96ba149b0b8c705426196154c} + + +Pointer to the contents the node. + + + +Definition at line 34 of file sll.h. + +\hypertarget{structsll__node_aa2e4c5d743ad44e759b5ca13f9915826}{ +\index{sll\_\-node@{sll\_\-node}!next@{next}} +\index{next@{next}!sll_node@{sll\_\-node}} +\subsubsection[{next}]{\setlength{\rightskip}{0pt plus 5cm}struct {\bf sll\_\-node}$\ast$ {\bf sll\_\-node::next}}} +\label{structsll__node_aa2e4c5d743ad44e759b5ca13f9915826} + + +Pointer to next node in the list. + + + +Definition at line 36 of file sll.h. + + + +The documentation for this struct was generated from the following file:\begin{DoxyCompactItemize} +\item +src/lists/single\_\-link/\hyperlink{sll_8h}{sll.h}\end{DoxyCompactItemize} diff --git a/docs/doxygen/latex/structsll__node__coll__graph.md5 b/docs/doxygen/latex/structsll__node__coll__graph.md5 new file mode 100644 index 0000000..c1f3675 --- /dev/null +++ b/docs/doxygen/latex/structsll__node__coll__graph.md5 @@ -0,0 +1 @@ +da110d52695e8fef0d9b15f8212329e0 \ No newline at end of file diff --git a/docs/doxygen/latex/structsll__node__coll__graph.pdf b/docs/doxygen/latex/structsll__node__coll__graph.pdf new file mode 100644 index 0000000..8dd0aeb Binary files /dev/null and b/docs/doxygen/latex/structsll__node__coll__graph.pdf differ

src/trees/avl/avl.c

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

src/lists/double_link/dll.h

- b -

- h -

- s -

- b -

- h -

- s -

Function Documentation

Classes

Typedefs

Functions

src/trees/redblack/rbt.c

src/trees/redblack/rbt.h

Functions

Function Documentation

Classes

Typedefs

Functions

Typedef Documentation

Function Documentation

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

Detailed Description

Member Data Documentation

Detailed Description

Member Data Documentation

sll_node Member List

sll_node Struct Reference

+Public Attributes

Detailed Description

Member Data Documentation