Changeset 0e0f128c for tests/searchsort.c

Timestamp:

Aug 14, 2018, 1:20:59 PM (6 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum

Children:

7b3a6e6

Parents:

0c827019 (diff), 26f4dbe (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.

Message:

Merge branch 'master' of plg.uwaterloo.ca:software/cfa/cfa-cc

File:

• tests/searchsort.c (modified) (12 diffs)

tests/searchsort.c

@@ -10 +10 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jan  2 08:01:17 2018
-// Update Count     : 100
+// Last Modified On : Thu Aug  9 07:54:57 2018
+// Update Count     : 101
 //
 
@@ -24 +24 @@
         int iarr[size];
 
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 iarr[i] = size - i;
                 sout | iarr[i] | ", ";
@@ -32 +32 @@
         // ascending sort/search by changing < to >
         qsort( iarr, size );
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 sout | iarr[i] | ", ";
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {          // C version
+        for ( i; 0u ~ size ) {          // C version
                 int key = size - i;
                 int * v = bsearch( &key, iarr, size, sizeof( iarr[0] ), comp );
@@ -43 +43 @@
         sout | endl;
 
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 int * v = bsearch( size - i, iarr, size );
                 sout | size - i | ':' | *v | ", ";
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 unsigned int posn = bsearch( size - i, iarr, size );
                 sout | size - i | ':' | iarr[posn] | ", ";
@@ -55 +55 @@
 
         // descending sort/search by changing < to >
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 iarr[i] = i + 1;
                 sout | iarr[i] | ", ";
@@ -63 +63 @@
                 int ?<?( int x, int y ) { return x > y; }
                 qsort( iarr, size );
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         sout | iarr[i] | ", ";
                 } // for
                 sout | endl;
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         int * v = bsearch( size - i, iarr, size );
                         sout | size - i | ':' | *v | ", ";
                 } // for
                 sout | endl;
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         unsigned int posn = bsearch( size - i, iarr, size );
                         sout | size - i | ':' | iarr[posn] | ", ";
@@ -80 +80 @@
 
         double darr[size];
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 darr[i] = size - i + 0.5;
                 sout | darr[i] | ", ";
@@ -86 +86 @@
         sout | endl;
         qsort( darr, size );
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 sout | darr[i] | ", ";
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 double * v = bsearch( size - i + 0.5, darr, size );
                 sout | size - i + 0.5 | ':' | *v | ", ";
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 unsigned int posn = bsearch( size - i + 0.5, darr, size );
                 sout | size - i + 0.5 | ':' | darr[posn] | ", ";
@@ -104 +104 @@
         int ?<?( S t1, S t2 ) { return t1.i < t2.i && t1.j < t2.j; }
         ofstream & ?|?( ofstream & os, S v ) { return os | v.i | ' ' | v.j; }
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 sarr[i].i = size - i;
                 sarr[i].j = size - i + 1;
@@ -111 +111 @@
         sout | endl;
         qsort( sarr, size );
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 sout | sarr[i] | ", ";
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 S temp = { size - i, size - i + 1 };
                 S * v = bsearch( temp, sarr, size );
@@ -121 +121 @@
         } // for
         sout | endl;
-        for ( unsigned int i = 0; i < size; i += 1 ) {
+        for ( i; 0u ~ size ) {
                 S temp = { size - i, size - i + 1 };
                 unsigned int posn = bsearch( temp, sarr, size );
@@ -129 +129 @@
         {
                 unsigned int getKey( const S & s ) { return s.j; }
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         sout | sarr[i] | ", ";
                 } // for
                 sout | endl;
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         S * v = bsearch( size - i + 1, sarr, size );
                         sout | size - i + 1 | ':' | *v | ", ";
                 } // for
                 sout | endl;
-                for ( unsigned int i = 0; i < size; i += 1 ) {
+                for ( i; 0u ~ size ) {
                         unsigned int posn = bsearch( size - i + 1, sarr, size );
                         sout | size - i + 1 | ':' | sarr[posn] | ", ";