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.
65 lines
1.4 KiB
65 lines
1.4 KiB
/**
|
|
* \file
|
|
*
|
|
* \author Georg Hopp
|
|
*
|
|
* \copyright
|
|
* Copyright © 2014 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 <search.h>
|
|
|
|
#include "tr/hash.h"
|
|
#include "tr/interface/hashable.h"
|
|
#include "tr/tree.h"
|
|
|
|
static
|
|
inline
|
|
int
|
|
hashAddComp(const void * a, const void * b)
|
|
{
|
|
unsigned long hash_a = TR_hashableGetHash((void*)a);
|
|
unsigned long hash_b = TR_hashableGetHash((void*)b);
|
|
|
|
if (hash_a < hash_b) {
|
|
return -1;
|
|
}
|
|
|
|
if (hash_a > hash_b) {
|
|
return 1;
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
void *
|
|
TR_hashAdd(TR_Hash this, void * operand)
|
|
{
|
|
void * found = TR_treeInsert(&this->root, operand, hashAddComp);
|
|
|
|
if (NULL == found) {
|
|
return NULL;
|
|
}
|
|
|
|
if (operand != found) {
|
|
TR_hashableHandleDouble(found, operand);
|
|
TR_delete(operand);
|
|
}
|
|
|
|
return found;
|
|
}
|
|
|
|
// vim: set ts=4 sw=4:
|