TakeV/dxx-rebirth
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Move */*/hash.h -> common/include/hash.h

Browse source
This commit is contained in:
Kp 2013-03-03 01:03:33 +00:00
parent 7224dde00a
commit 49046095f5
2 changed files with 0 additions and 61 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

0
d2x-rebirth/include/hash.h → common/include/hash.h
View file

61
d1x-rebirth/main/hash.h
View file

@ -1,61 +0,0 @@
/*
THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
*/
/*
* $Source: /cvsroot/dxx-rebirth/d1x-rebirth/main/hash.h,v $
* $Revision: 1.1.1.1 $
* $Author: zicodxx $
* $Date: 2006/03/17 19:43:14 $
*
* .
*
* $Log: hash.h,v $
* Revision 1.1.1.1 2006/03/17 19:43:14 zicodxx
* initial import
*
* Revision 1.1.1.1 1999/06/14 22:12:28 donut
* Import of d1x 1.37 source.
*
* Revision 2.0 1995/02/27 11:26:46 john
* New version 2.0, which has no anonymous unions, builds with
* Watcom 10.0, and doesn't require parsing BITMAPS.TBL.
*
* Revision 1.2 1994/05/03 16:45:24 john
* Added hash table lookup to speed up loading.
*
* Revision 1.1 1994/05/03 11:35:16 john
* Initial revision
*
*
*/
#ifndef _HASH_H
#define _HASH_H
typedef struct hashtable {
int bitsize;
int and_mask;
int size;
int nitems;
char **key;
int *value;
} hashtable;
int hashtable_init( hashtable *ht, int size );
void hashtable_free( hashtable *ht );
int hashtable_search( hashtable *ht, char *key );
void hashtable_insert( hashtable *ht, char *key, int value );
#endif