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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/**************************************************************/
/* ********************************************************** */
/* * * */
/* * SIMPLE HASHING * */
/* * * */
/* * $Module: HASH * */
/* * * */
/* * Copyright (C) 1996, 1999, 2000, 2001 * */
/* * MPI fuer Informatik * */
/* * * */
/* * 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 2 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, write * */
/* * to the Free Software Foundation, Inc., 59 Temple * */
/* * Place, Suite 330, Boston, MA 02111-1307 USA * */
/* * * */
/* * * */
/* $Revision: 21527 $ * */
/* $State$ * */
/* $Date: 2005-04-24 21:10:28 -0700 (Sun, 24 Apr 2005) $ * */
/* $Author: duraid $ * */
/* * * */
/* * Contact: * */
/* * Christoph Weidenbach * */
/* * MPI fuer Informatik * */
/* * Stuhlsatzenhausweg 85 * */
/* * 66123 Saarbruecken * */
/* * Email: weidenb@mpi-sb.mpg.de * */
/* * Germany * */
/* * * */
/* ********************************************************** */
/**************************************************************/
/* $RCSfile$ */
#ifndef _HASH_
#define _HASH_
/**************************************************************/
/* Includes */
/**************************************************************/
#include "list.h"
/**************************************************************/
/* Structures */
/**************************************************************/
#define hash__SIZE 29 /* a prime */
/* Each Entry is a list of pairs <key,value> */
extern LIST hash_TABLE[hash__SIZE];
/**************************************************************/
/* Inline Functions */
/**************************************************************/
static __inline__ NAT hash_Index(POINTER Key)
{
return (NAT)Key % hash__SIZE;
}
static __inline__ LIST hash_List(NAT Index)
{
return hash_TABLE[Index];
}
static __inline__ void hash_PutList(NAT Index, LIST List)
{
hash_TABLE[Index] = List;
}
static __inline__ void hash_Put(POINTER Key, POINTER Value)
{
hash_PutList(hash_Index(Key), list_Cons(list_PairCreate((POINTER)Key, Value),
hash_List(hash_Index(Key))));
}
/**************************************************************/
/* Functions */
/**************************************************************/
void hash_Init(void);
void hash_Reset(void);
void hash_ResetWithValue(void (*)(POINTER));
POINTER hash_Get(POINTER);
#endif
|
