[Scummvm-cvs-logs] SF.net SVN: scummvm:[38556] scummvm/trunk/engines/sci/engine

[aquadran at users.sourceforge.net]

Revision: 38556
          http://scummvm.svn.sourceforge.net/scummvm/?rev=38556&view=rev
Author:   aquadran
Date:     2009-02-19 18:11:05 +0000 (Thu, 19 Feb 2009)

Log Message:
-----------
formating

Modified Paths:
--------------
    scummvm/trunk/engines/sci/engine/int_hashmap.cpp
    scummvm/trunk/engines/sci/engine/int_hashmap.h

Modified: scummvm/trunk/engines/sci/engine/int_hashmap.cpp
===================================================================
--- scummvm/trunk/engines/sci/engine/int_hashmap.cpp	2009-02-19 18:08:44 UTC (rev 38555)
+++ scummvm/trunk/engines/sci/engine/int_hashmap.cpp	2009-02-19 18:11:05 UTC (rev 38556)
@@ -67,7 +67,7 @@
 	if (*node) {
 		return (*node)->value;
 	}
-	/* Not found */
+	// Not found
 
 	if (!add)
 		return -1;
@@ -75,7 +75,7 @@
 	if (was_added)
 		*was_added = 1;
 
-	if (holes) { /* Re-use old node */
+	if (holes) { // Re-use old node
 		(*node) = holes;
 		holes = (*node)->next;
 		(*node)->next = NULL;
@@ -90,7 +90,6 @@
 	return (*node)->value;
 }
 
-
 int int_hash_map_t::remove_value(int value) {
 	node_t **node = &(nodes[HASH(value)]);
 
@@ -101,10 +100,10 @@
 		node_t *oldnode = *node;
 		*node = (*node)->next;
 
-		oldnode->next = holes; /* Old node is now a 'hole' */
+		oldnode->next = holes; // Old node is now a 'hole'
 		holes = oldnode;
 		return oldnode->value;
 	} else
-		return -1; /* Not found */
+		return -1; // Not found
 }
 

Modified: scummvm/trunk/engines/sci/engine/int_hashmap.h
===================================================================
--- scummvm/trunk/engines/sci/engine/int_hashmap.h	2009-02-19 18:08:44 UTC (rev 38555)
+++ scummvm/trunk/engines/sci/engine/int_hashmap.h	2009-02-19 18:11:05 UTC (rev 38556)
@@ -37,7 +37,7 @@
  */
 
 
-/* Assumes that the ints are relatively evenly distributed */
+// Assumes that the ints are relatively evenly distributed
 
 #define DCS_INT_HASH_MAX 255
 
@@ -49,8 +49,8 @@
 		node_t *next;
 	};
 
-	int base_value;  /* Starts at zero, counts upwards */
-	node_t *nodes[DCS_INT_HASH_MAX+1];
+	int base_value;  // Starts at zero, counts upwards 
+	node_t *nodes[DCS_INT_HASH_MAX + 1];
 	node_t *holes; /* List of freed entries to minimize
 				     ** memory operations and modifications
 				     ** to base_value  */
@@ -83,4 +83,4 @@
 typedef int_hash_map_t *int_hash_map_ptr;
 
 
-#endif /* INT_HASHMAP_H */
+#endif // INT_HASHMAP_H


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.