summaryrefslogtreecommitdiffstats
path: root/Hashtable.h
blob: 21dfdcc6e6fe2003f19adf6d83d612c634a8aade (plain) (blame)
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
/* Do not edit this file. It was automatically generated. */

#ifndef HEADER_Hashtable
#define HEADER_Hashtable
/*
htop
(C) 2004-2006 Hisham H. Muhammad
Released under the GNU GPL, see the COPYING file
in the source distribution for its full text.
*/


#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>

#include "debug.h"

typedef struct Hashtable_ Hashtable;

typedef void(*Hashtable_PairFunction)(int, void*, void*);

typedef struct HashtableItem {
   unsigned int key;
   void* value;
   struct HashtableItem* next;
} HashtableItem;

struct Hashtable_ {
   int size;
   HashtableItem** buckets;
   int items;
   bool owner;
};

#ifdef DEBUG

bool Hashtable_isConsistent(Hashtable* this);

int Hashtable_count(Hashtable* this);

#endif

HashtableItem* HashtableItem_new(unsigned int key, void* value);

Hashtable* Hashtable_new(int size, bool owner);

void Hashtable_delete(Hashtable* this);

inline int Hashtable_size(Hashtable* this);

void Hashtable_put(Hashtable* this, unsigned int key, void* value);

void* Hashtable_remove(Hashtable* this, unsigned int key);

inline void* Hashtable_get(Hashtable* this, unsigned int key);

void Hashtable_foreach(Hashtable* this, Hashtable_PairFunction f, void* userData);

#endif

© 2014-2024 Faster IT GmbH | imprint | privacy policy