Changeset 9596 for trunk/gsdl/src/hashfile

Timestamp:

2005-04-07T17:06:26+12:00 (19 years ago)

Author:

kjdon

Message:

added some x++ -> ++x changes submitted by Emanuel Dejanu

File:

• trunk/gsdl/src/hashfile/hashfile.cpp (modified) (8 diffs)

trunk/gsdl/src/hashfile/hashfile.cpp

@@ -63 +63 @@
     a.num[i] = (unsigned char)num;
 
-    i++;
+    ++i;
   }
 
@@ -85 +85 @@
       if (a.num[i] > b.num[i]) break;
       if (a.num[i] < b.num[i]) return 0;
-      i--;
+      --i;
     }
   }
@@ -105 +105 @@
     a.num[j] = (unsigned char) num;
     
-    j++;
+    ++j;
     if (num != 0) len = j;
   }
@@ -133 +133 @@
   }
 
-  for (i=a.len-1, len=0; i >= 0; i--) {
+  for (i=a.len-1, len=0; i >= 0; --i) {
     result[len++] = convert[a.num[i]/16];
     result[len++] = convert[a.num[i]%16];
@@ -201 +201 @@
   // calculate 8 multiples of the prime number.
   // These are used to find the remainder using only subtraction operations
-  for (i=0; i<8; i++) {
+  for (i=0; i<8; ++i) {
     primepow[i] = pow;
     my_inc (pow, pow);
@@ -225 +225 @@
 
     // remainder = remainder * 256 + c
-    for (i=remainder.len; i>0; i--) {
+    for (i=remainder.len; i>0; --i) {
       remainder.num[i] = remainder.num[i-1];
     }
@@ -232 +232 @@
     
     // remainder = (remainder % large-prime-number)
-    for (i=7; i>=0; i--) {
+    for (i=7; i>=0; --i) {
       my_ifpos_dec (remainder, primepow[i]);
     }
@@ -250 +250 @@
   char *result;
 
-  for (i = 1; i < argc; i++) {
+  for (i = 1; i < argc; ++i) {
     result = hashfile (argv[i]);
     if (result == NULL) {