Changeset d0c91a6 for tests/searchsort.cfa

Timestamp:

Jan 15, 2019, 4:16:15 PM (7 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

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

Children:

c802eb88

Parents:

5e49e47 (diff), c9aba81 (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' into jenkins-sandbox

File:

• tests/searchsort.cfa (modified) (2 diffs)

tests/searchsort.cfa

@@ -10 +10 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Nov  6 18:00:38 2018
-// Update Count     : 102
+// Last Modified On : Thu Dec 20 22:49:46 2018
+// Update Count     : 108
 //
 
 #include <fstream.hfa>
-#include <stdlib.hfa>                                                                           // bsearch, qsort
+#include <stdlib.hfa>                                                                   // bsearch, qsort
 #include <stdlib.h>                                                                             // C version of bsearch
 
@@ -21 +21 @@
 
 int main( void ) {
-        const unsigned int size = 10;
+        const int size = 10;
         int iarr[size];
 
-        for ( i; 0u ~ size ) {
+        sout | nlOff;                                                                           // turn off auto newline
+
+        for ( i; 0 ~ size ) {
                 iarr[i] = size - i;
                 sout | iarr[i] | ", ";
         } // for
-        sout | endl | endl;
+        sout | nl | nl;
 
         // ascending sort/search by changing < to >
         qsort( iarr, size );
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 sout | iarr[i] | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {          // C version
+        sout | nl;
+        for ( i; 0 ~ size ) {           // C version
                 int key = size - i;
                 int * v = bsearch( &key, iarr, size, sizeof( iarr[0] ), comp );
                 sout | key | ':' | *v | ", ";
         } // for
-        sout | endl;
+        sout | nl;
 
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 int * v = bsearch( size - i, iarr, size );
                 sout | size - i | ':' | *v | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {
+        sout | nl;
+        for ( i; 0 ~ size ) {
                 unsigned int posn = bsearch( size - i, iarr, size );
                 sout | size - i | ':' | iarr[posn] | ", ";
         } // for
-        sout | endl | endl;
+        sout | nl | nl;
 
         // descending sort/search by changing < to >
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 iarr[i] = i + 1;
                 sout | iarr[i] | ", ";
         } // for
-        sout | endl;
+        sout | nl;
         {
-                int ?<?( int x, int y ) { return x > y; }
-                qsort( iarr, size );
-                for ( i; 0u ~ size ) {
+                // redefinition of ?<? can't overlap the loop controls:
+                {
+                        int (*?<?)(int, int) = ?>?;
+                        qsort( iarr, size );
+                }
+                for ( i; 0 ~ size ) {
                         sout | iarr[i] | ", ";
                 } // for
-                sout | endl;
-                for ( i; 0u ~ size ) {
+                sout | nl;
+                for ( i; 0 ~ size ) {
+                        int (*?<?)(int, int) = ?>?;
                         int * v = bsearch( size - i, iarr, size );
                         sout | size - i | ':' | *v | ", ";
                 } // for
-                sout | endl;
-                for ( i; 0u ~ size ) {
+                sout | nl;
+                for ( i; 0 ~ size ) {
+                        int (*?<?)(int, int) = ?>?;
                         unsigned int posn = bsearch( size - i, iarr, size );
                         sout | size - i | ':' | iarr[posn] | ", ";
                 } // for
         }
-        sout | endl | endl;
+        sout | nl | nl;
 
         double darr[size];
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 darr[i] = size - i + 0.5;
                 sout | darr[i] | ", ";
         } // for
-        sout | endl;
+        sout | nl;
         qsort( darr, size );
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 sout | darr[i] | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {
+        sout | nl;
+        for ( i; 0 ~ size ) {
                 double * v = bsearch( size - i + 0.5, darr, size );
                 sout | size - i + 0.5 | ':' | *v | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {
+        sout | nl;
+        for ( i; 0 ~ size ) {
                 unsigned int posn = bsearch( size - i + 0.5, darr, size );
                 sout | size - i + 0.5 | ':' | darr[posn] | ", ";
         } // for
-        sout | endl | endl;
+        sout | nl | nl;
 
         struct S { int i, j; } sarr[size];
         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 ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 sarr[i].i = size - i;
                 sarr[i].j = size - i + 1;
                 sout | sarr[i] | ", ";
         } // for
-        sout | endl;
+        sout | nl;
         qsort( sarr, size );
-        for ( i; 0u ~ size ) {
+        for ( i; 0 ~ size ) {
                 sout | sarr[i] | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {
+        sout | nl;
+        for ( i; 0 ~ size ) {
                 S temp = { size - i, size - i + 1 };
                 S * v = bsearch( temp, sarr, size );
                 sout | temp | ':' | *v | ", ";
         } // for
-        sout | endl;
-        for ( i; 0u ~ size ) {
+        sout | nl;
+        for ( i; 0 ~ size ) {
                 S temp = { size - i, size - i + 1 };
                 unsigned int posn = bsearch( temp, sarr, size );
                 sout | temp | ':' | sarr[posn] | ", ";
         } // for
-        sout | endl | endl;
+        sout | nl | nl;
         {
-                unsigned int getKey( const S & s ) { return s.j; }
-                for ( i; 0u ~ size ) {
+                int getKey( const S & s ) { return s.j; }
+                for ( i; 0 ~ size ) {
                         sout | sarr[i] | ", ";
                 } // for
-                sout | endl;
-                for ( i; 0u ~ size ) {
+                sout | nl;
+                for ( i; 0 ~ size ) {
                         S * v = bsearch( size - i + 1, sarr, size );
                         sout | size - i + 1 | ':' | *v | ", ";
                 } // for
-                sout | endl;
-                for ( i; 0u ~ size ) {
+                sout | nl;
+                for ( i; 0 ~ size ) {
                         unsigned int posn = bsearch( size - i + 1, sarr, size );
                         sout | size - i + 1 | ':' | sarr[posn] | ", ";
                 } // for
-                sout | endl | endl;
+                sout | nl | nl;
         }
 } // main