Index: trunk/psLib/src/collections/psHash.c
===================================================================
--- trunk/psLib/src/collections/psHash.c	(revision 4136)
+++ trunk/psLib/src/collections/psHash.c	(revision 4315)
@@ -12,6 +12,6 @@
 *  @author GLG, MHPCC
 *
-*  @version $Revision: 1.17 $ $Name: not supported by cvs2svn $
-*  @date $Date: 2005-06-07 22:37:52 $
+*  @version $Revision: 1.18 $ $Name: not supported by cvs2svn $
+*  @date $Date: 2005-06-18 02:30:49 $
 *
 *  Copyright 2004-2005 Maui High Performance Computing Center, University of Hawaii
@@ -43,5 +43,5 @@
     The linked list
  *****************************************************************************/
-psList* psHashKeyList(psHash* table)
+psList* psHashKeyList(const psHash* hash)
 {
     psS32 i = 0;                  // Loop index variable
@@ -49,5 +49,5 @@
     psHashBucket* ptr = NULL;   // Used to step thru linked list.
 
-    if (table == NULL) {
+    if (hash == NULL) {
         return NULL;
     }
@@ -57,10 +57,10 @@
     // Loop through every bucket in the hash table.  If that bucket is not
     // NULL, then add the bucket's key to the linked list.
-    for (i = 0; i < table->nbucket; i++) {
-        if (table->buckets[i] != NULL) {
+    for (i = 0; i < hash->nbucket; i++) {
+        if (hash->buckets[i] != NULL) {
             // Since a bucket contains a linked list of keys/data, we must
             // step trough each key in that linked list:
 
-            ptr = table->buckets[i];
+            ptr = hash->buckets[i];
             while (ptr != NULL) {
                 psListAdd(myLinkList, PS_LIST_HEAD, ptr->key);
@@ -135,5 +135,5 @@
     The new hash table.
  *****************************************************************************/
-psHash* psHashAlloc(psS32 nbucket)        // initial number of buckets
+psHash* psHashAlloc(long nalloc)        // initial number of buckets
 {
     psS32 i = 0;                  // loop index variable
@@ -145,11 +145,11 @@
 
     // Allocate memory for the buckets.
-    table->buckets = psAlloc(nbucket * sizeof(psHashBucket* ));
-    table->nbucket = nbucket;
-
-    psTrace("utils.hash", 1, "Creating %d-element hash table\n", nbucket);
+    table->buckets = psAlloc(nalloc * sizeof(psHashBucket* ));
+    table->nbucket = nalloc;
+
+    psTrace("utils.hash", 1, "Creating %d-element hash table\n", nalloc);
 
     // Initialize all buckets to NULL.
-    for (i = 0; i < nbucket; i++)
+    for (i = 0; i < nalloc; i++)
     {
         table->buckets[i] = NULL;
@@ -383,6 +383,6 @@
     boolean value defining success or failure
  *****************************************************************************/
-psBool psHashRemove(psHash* table,
-                    const char *key)
+bool psHashRemove(psHash* table,
+                  const char *key)
 {
     psPtr data = NULL;