You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
77 lines
2.0 KiB
77 lines
2.0 KiB
/**
|
|
* \file
|
|
*
|
|
* \author Georg Hopp
|
|
*
|
|
* \copyright
|
|
* Copyright © 2012 Georg Hopp
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "trbase.h"
|
|
#include "tr/tree.h"
|
|
|
|
void *
|
|
TR_treeInsert(TR_Tree * this, const void * search, TR_TreeComp comp)
|
|
{
|
|
TR_Tree node = *this;
|
|
TR_Tree new_node = NULL;
|
|
int found;
|
|
|
|
/*
|
|
* insert the node or return the one in tree if comparison
|
|
* succeeds.
|
|
*/
|
|
if (NULL == node) {
|
|
/*
|
|
* if the root is NULL we simple add the element and set
|
|
* node to it.
|
|
*/
|
|
*this = node = new_node = TR_new(TR_Tree, search);
|
|
} else {
|
|
TR_TREE_FIND(node, search, found, comp);
|
|
|
|
if (found == 0) {
|
|
// we found an element
|
|
// as this is insert and not find this will overwrite an existing
|
|
// value, but return the previous one so that it can be freed if
|
|
// neccessary.
|
|
void * data = node->data;
|
|
node->data = (void *)search;
|
|
return data;
|
|
} else {
|
|
// not found
|
|
if (0 < found) {
|
|
node->left = TR_new(TR_Tree, search);
|
|
node->left->parent = node;
|
|
node = new_node = node->left;
|
|
} else {
|
|
node->right = TR_new(TR_Tree, search);
|
|
node->right->parent = node;
|
|
node = new_node = node->right;
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* we expect node not to be NULL and pointing to our
|
|
* new node at this point...now rabalance the tree
|
|
*/
|
|
TR_TREE_BALANCE_INSERT(this, node);
|
|
|
|
return new_node->data;
|
|
}
|
|
|
|
// vim: set ts=4 sw=4:
|