File: hash.h

package info (click to toggle)
xmhtml 1.1.7-7
  • links: PTS
  • area: main
  • in suites: woody
  • size: 6,104 kB
  • ctags: 8,347
  • sloc: ansic: 68,063; makefile: 496; sh: 161; perl: 36
file content (76 lines) | stat: -rw-r--r-- 2,253 bytes parent folder | download | duplicates (10)
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
/*****
* hash.h : generic hash routines
*
* This file Version	$Revision: 1.1 $
*
* Creation date:		Sat Oct 24 01:35:48 CEST 1998
* Last modification: 	$Date$
* By:					$Author$
* Current State:		$State$
*
* Author:				XmHTML Developers Account
*
* Copyright (C) 1994-1998 by Ripley Software Development 
* All Rights Reserved
*
* This file is part of the XmHTML Widget Library
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this library; if not, write to the Free
* Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
*****/
/*****
* $Source$
*****/
/*****
* ChangeLog 
* $Log$
*
*****/ 

#ifndef _hash_h_
#define _hash_h_

/* Hashtable is an opaque type defined in hash.c */
typedef struct _HashTable HashTable;

/*****
* Hash key comparison function prototype. This function is optional,
* but if present, it should return a positive, non-zero value on a valid
* match. Otherwise it should return 0.
*****/
typedef int (*HashCompareFunc)(unsigned long, unsigned long);

/* Create a new hashtable */
extern HashTable *HashCreate(int hsize, HashCompareFunc comparer);

/* initialize the given hashtable. */
extern HashTable *HashInit(HashTable *table, int hsize, HashCompareFunc
	comparer);

/* put a new entry in the hashtable */
extern void HashPut(HashTable *table, unsigned long key, unsigned long data);

/* get an entry from the hashtable */
extern int HashGet(HashTable *table, unsigned long key, unsigned long *data);

/* delete an entry from the hashtable */
extern void HashDelete(HashTable *table, unsigned long key);

/* completely wipe the given hashtable */
extern void HashDestroy(HashTable *table);

/* Don't add anything after this endif! */
#endif /* _hash_h_ */