taskrambler  0.1.8
Web server and task management solution.
add.c
Go to the documentation of this file.
1 /**
2  * \file
3  *
4  * \author Georg Hopp
5  *
6  * \copyright
7  * Copyright © 2012 Georg Hopp
8  *
9  * This program is free software: you can redistribute it and/or modify
10  * it under the terms of the GNU General Public License as published by
11  * the Free Software Foundation, either version 3 of the License, or
12  * (at your option) any later version.
13  *
14  * This program is distributed in the hope that it will be useful,
15  * but WITHOUT ANY WARRANTY; without even the implied warranty of
16  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17  * GNU General Public License for more details.
18  *
19  * You should have received a copy of the GNU General Public License
20  * along with this program. If not, see <http://www.gnu.org/licenses/>.
21  */
22 
23 #include <search.h>
24 
25 #include "hash.h"
26 #include "class.h"
27 
28 static
29 inline
30 int
31 hashAddComp(const void * a, const void * b)
32 {
33  unsigned long hash_a = hashableGetHash((void*)a);
34  unsigned long hash_b = hashableGetHash((void*)b);
35 
36  if (hash_a < hash_b) {
37  return -1;
38  }
39 
40  if (hash_a > hash_b) {
41  return 1;
42  }
43 
44  return 0;
45 }
46 
47 void *
48 hashAdd(Hash this, void * operand)
49 {
50  void * found = treeInsert(&this->root, operand, hashAddComp);
51 
52  if (NULL == found) {
53  return NULL;
54  }
55 
56  if (operand != found) {
57  hashableHandleDouble(found, operand);
58  delete(operand);
59  }
60 
61  return found;
62 }
63 
64 // vim: set ts=4 sw=4:
static int hashAddComp(const void *a, const void *b)
Definition: add.c:31
void * hashAdd(Hash this, void *operand)
Definition: add.c:48
unsigned long hashableGetHash(void *)
Definition: hashable.c:36
void * treeInsert(Tree *, const void *, TreeComp)
Definition: insert.c:29
void hashableHandleDouble(void *, void *)
Definition: hashable.c:62