Index: trunk/psLib/src/collections/psHash.c
===================================================================
--- trunk/psLib/src/collections/psHash.c	(revision 1420)
+++ trunk/psLib/src/collections/psHash.c	(revision 1440)
@@ -11,6 +11,6 @@
 *  @author George Gusciora, MHPCC
 *
-*  @version $Revision: 1.1 $ $Name: not supported by cvs2svn $
-*  @date $Date: 2004-08-09 20:29:43 $
+*  @version $Revision: 1.2 $ $Name: not supported by cvs2svn $
+*  @date $Date: 2004-08-09 23:34:57 $
 *
 *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -26,9 +26,9 @@
 #include "psAbort.h"
 
-static psHashBucket *hashBucketAlloc(const char *key, void *data, psHashBucket * next);
-static void hashBucketFree(psHashBucket * bucket);
-static void *doHashWork(psHash * table, const char *key, void *data, bool remove
+static psHashBucket* hashBucketAlloc(const char *key, void *data, psHashBucket* next);
+static void hashBucketFree(psHashBucket* bucket);
+static void *doHashWork(psHash* table, const char *key, void *data, bool remove
                            );
-static void hashFree(psHash * table);
+static void hashFree(psHash* table);
 
 /******************************************************************************
@@ -40,9 +40,9 @@
     The linked list
  *****************************************************************************/
-psList *psHashKeyList(psHash * table)
+psList* psHashKeyList(psHash* table)
 {
     int i = 0;                  // Loop index variable
-    psList *myLinkList = NULL;  // The output data structure
-    psHashBucket *ptr = NULL;   // Used to step thru linked list.
+    psList* myLinkList = NULL;  // The output data structure
+    psHashBucket* ptr = NULL;   // Used to step thru linked list.
 
     if (table == NULL) {
@@ -81,5 +81,5 @@
     the new hash bucket.
  *****************************************************************************/
-static psHashBucket *hashBucketAlloc(const char *key, void *data, psHashBucket * next)
+static psHashBucket* hashBucketAlloc(const char *key, void *data, psHashBucket* next)
 {
     if (key == NULL) {
@@ -87,5 +87,5 @@
     }
     // Allocate memory for the new hash bucket.
-    psHashBucket *bucket = psAlloc(sizeof(psHashBucket));
+    psHashBucket* bucket = psAlloc(sizeof(psHashBucket));
 
     p_psMemSetDeallocator(bucket, (psFreeFcn) hashBucketFree);
@@ -114,5 +114,5 @@
     NONE
  *****************************************************************************/
-static void hashBucketFree(psHashBucket * bucket)
+static void hashBucketFree(psHashBucket* bucket)
 {
     if (bucket == NULL) {
@@ -133,15 +133,15 @@
     The new hash table.
  *****************************************************************************/
-psHash *psHashAlloc(int nbucket)        // initial number of buckets
+psHash* psHashAlloc(int nbucket)        // initial number of buckets
 {
     int i = 0;                  // loop index variable
 
     // Create the new hash table.
-    psHash *table = psAlloc(sizeof(psHash));
+    psHash* table = psAlloc(sizeof(psHash));
 
     p_psMemSetDeallocator(table, (psFreeFcn) hashFree);
 
     // Allocate memory for the buckets.
-    table->buckets = psAlloc(nbucket * sizeof(psHashBucket *));
+    table->buckets = psAlloc(nbucket * sizeof(psHashBucket* ));
     table->nbucket = nbucket;
 
@@ -168,5 +168,5 @@
     NONE
  *****************************************************************************/
-static void hashFree(psHash * table)
+static void hashFree(psHash* table)
 {
     int i = 0;                  // Loop index variable.
@@ -210,5 +210,5 @@
 there is little common code between those functions.
   *****************************************************************************/
-static void *doHashWork(psHash * table, const char *key, void *data, bool remove
+static void *doHashWork(psHash* table, const char *key, void *data, bool remove
                            )
 {
@@ -217,6 +217,6 @@
     // "hashed" from the key.
     char *tmpchar = NULL;       // Used in computing the hash function.
-    psHashBucket *ptr = NULL;   // Used to retrieve the hash bucket.
-    psHashBucket *optr = NULL;  // "original pointer": used to step
+    psHashBucket* ptr = NULL;   // Used to retrieve the hash bucket.
+    psHashBucket* optr = NULL;  // "original pointer": used to step
 
     // thru the linked list for a bucket.
@@ -338,5 +338,5 @@
     boolean value defining success or failure
  *****************************************************************************/
-bool psHashAdd(psHash * table, const char *key, void *data)
+bool psHashAdd(psHash* table, const char *key, void *data)
 {
     if (table == NULL) {
@@ -364,5 +364,5 @@
     The data associated with that key.
  *****************************************************************************/
-void *psHashLookup(psHash * table,      // table to lookup key in
+void *psHashLookup(psHash* table,      // table to lookup key in
                    const char *key)     // key to lookup
 {
@@ -387,5 +387,5 @@
     boolean value defining success or failure
  *****************************************************************************/
-bool psHashRemove(psHash * table, const char *key)
+bool psHashRemove(psHash* table, const char *key)
 {
     void *data = NULL;