Implement HashTable + fix some extra blank spaces, remove Bool type (using bool ...

[cgds.git] / src / Tree.c

diff --git a/src/Tree.c b/src/Tree.c
index fe21a6b..1ee3b51 100644 (file)
--- a/src/Tree.c
+++ b/src/Tree.c
@@ -25,7 +25,7 @@ Tree* _tree_new(size_t dataSize)
 Tree* tree_copy(Tree* tree)
 {
        Tree* treeCopy = _tree_new(tree->dataSize);
-       if (tree->root == NULL) 
+       if (tree->root == NULL)
                return treeCopy;
        _tree_set_root(treeCopy, tree->root->data);
 
@@ -88,7 +88,7 @@ Tree* tree_copy(Tree* tree)
        return treeCopy;
 }
 
-Bool tree_empty(Tree* tree)
+bool tree_empty(Tree* tree)
 {
        return (tree->root == NULL);
 }
@@ -100,14 +100,14 @@ UInt tree_size(Tree* tree)
 
 UInt _tree_height_rekursiv(TreeNode* treeNode)
 {
-       if (tree_is_leaf(treeNode)) 
+       if (tree_is_leaf(treeNode))
                return 1;
        TreeNode* child = treeNode->firstChild;
        UInt maxHeightChild = 0;
        while (child != NULL)
        {
                UInt heightChild = _tree_height_rekursiv(child);
-               if (heightChild > maxHeightChild) 
+               if (heightChild > maxHeightChild)
                        maxHeightChild = heightChild;
                child = child->next;
        }
@@ -116,12 +116,12 @@ UInt _tree_height_rekursiv(TreeNode* treeNode)
 
 UInt tree_height(Tree* tree)
 {
-       if (tree_empty(tree)) 
+       if (tree_empty(tree))
                return 0;
        return _tree_height_rekursiv(tree->root);
 }
 
-Bool tree_is_leaf(TreeNode* treeNode)
+bool tree_is_leaf(TreeNode* treeNode)
 {
        return (treeNode->firstChild == NULL);
 }
@@ -155,11 +155,11 @@ void _tree_add_child(Tree* tree, TreeNode* treeNode, void* data)
        newChildNode->data = safe_malloc(tree->dataSize);
        memcpy(newChildNode->data, data, tree->dataSize);
        newChildNode->next = NULL;
-       if (treeNode->lastChild != NULL) 
+       if (treeNode->lastChild != NULL)
                treeNode->lastChild->next = newChildNode;
        newChildNode->prev = treeNode->lastChild;
        treeNode->lastChild = newChildNode;
-       if (treeNode->firstChild == NULL) 
+       if (treeNode->firstChild == NULL)
                treeNode->firstChild = newChildNode;
        newChildNode->parent = treeNode;
        newChildNode->firstChild = NULL;
@@ -173,7 +173,7 @@ void _tree_add_sibling(Tree* tree, TreeNode* treeNode, void* data)
        newSiblingNode->data = safe_malloc(tree->dataSize);
        memcpy(newSiblingNode->data, data, tree->dataSize);
        newSiblingNode->next = treeNode->next;
-       if (treeNode->next != NULL) 
+       if (treeNode->next != NULL)
                treeNode->next->prev = newSiblingNode;
        newSiblingNode->prev = treeNode;
        treeNode->next = newSiblingNode;
@@ -201,14 +201,14 @@ void tree_remove(Tree* tree, TreeNode* treeNode)
 {
        if (treeNode->parent != NULL)
        {
-               if (treeNode->prev == NULL) 
+               if (treeNode->prev == NULL)
                        treeNode->parent->firstChild = treeNode->next;
-               if (treeNode->next == NULL) 
+               if (treeNode->next == NULL)
                        treeNode->parent->lastChild = treeNode->prev;
        }
-       if (treeNode->next != NULL) 
+       if (treeNode->next != NULL)
                treeNode->next->prev = treeNode->prev;
-       if (treeNode->prev != NULL) 
+       if (treeNode->prev != NULL)
                treeNode->prev->next = treeNode->next;
        _tree_remove_rekursiv(tree, treeNode);
 }
@@ -228,14 +228,14 @@ void tree_rm_childs(Tree* tree, TreeNode* treeNode)
 
 void tree_clear(Tree* tree)
 {
-       if (tree->root != NULL) 
+       if (tree->root != NULL)
                _tree_remove_rekursiv(tree, tree->root);
        _tree_init(tree, tree->dataSize);
 }
 
 void tree_destroy(Tree* tree)
 {
-       if (tree->root != NULL) 
+       if (tree->root != NULL)
                tree_clear(tree);
        safe_free(tree);
 }
@@ -258,7 +258,7 @@ void treeI_reset(TreeIterator* treeI)
        treeI->current = treeI->tree->root;
 }
 
-Bool treeI_has_data(TreeIterator* treeI)
+bool treeI_has_data(TreeIterator* treeI)
 {
        return (treeI->current != NULL);
 }