delete.c
1.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/**
* \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 <sys/types.h>
#include "trhash.h"
#include "tr/interface/hashable.h"
#include "tr/hash.h"
#include "tr/tree.h"
static
inline
int
hashDeleteComp(const void * a, const void * b)
{
unsigned long hash_a = TR_hashableGetHash((void*)a);
if (hash_a < *(const unsigned long*)b) {
return -1;
}
if (hash_a > *(const unsigned long*)b) {
return 1;
}
return 0;
}
void *
TR_hashDelete(TR_Hash this, const char * search, size_t nsearch)
{
unsigned long hash = TR_sdbm((const unsigned char *)search, nsearch);
void * found = NULL;
found = TR_treeDelete(this->tree, &hash, hashDeleteComp);
return found;
}
void *
TR_hashDeleteByVal(TR_Hash this, unsigned long hash)
{
void * found = TR_treeDelete(this->tree, &hash, hashDeleteComp);
return found;
}
// vim: set ts=4 sw=4: