2 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
3 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
4 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
5 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
6 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
7 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
8 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
9 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
10 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
11 COPYRIGHT 1993-1999 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
27 int hashtable_init( hashtable *ht, int size ) {
32 for (i=1; i<13; i++ ) {
33 if ( (1<<i) >= size ) {
40 ht->and_mask = ht->size - 1;
42 Error( "Hashtable has size of 0" );
44 ht->key = (char **)d_malloc( size * sizeof(char *) );
46 Error( "Not enough memory to create a hash table of size %d", size );
48 for (i=0; i<size; i++ )
51 // Use calloc cause we want zero'd array.
52 ht->value = d_malloc( size*sizeof(int) );
53 if (ht->value==NULL) {
55 Error( "Not enough memory to create a hash table of size %d\n", size );
63 void hashtable_free( hashtable *ht ) {
66 if (ht->value != NULL )
71 int hashtable_getkey( char *key ) {
75 k^=((int)(*key++))<<i;
81 int hashtable_search( hashtable *ht, char *key ) {
86 k = hashtable_getkey( key );
89 while(i < ht->size ) {
90 j = (k+(i++)) & ht->and_mask;
91 if ( ht->key[j] == NULL )
93 if (!stricmp(ht->key[j], key ))
99 void hashtable_insert( hashtable *ht, char *key, int value ) {
103 k = hashtable_getkey( key );
106 while(i < ht->size) {
107 j = (k+(i++)) & ht->and_mask;
108 if ( ht->key[j] == NULL ) {
111 ht->value[j] = value;
113 } else if (!stricmp( key, ht->key[j] )) {
117 Error( "Out of hash slots\n" );