Changeset f2cdc44 for src

Timestamp:

Apr 2, 2017, 12:20:37 PM (8 years ago)

Author:

Peter A. Buhr <pabuhr@…>

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, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

0788c03d, ee89ad43

Parents:

06cf47f

Message:

more alternate bsearch returning posn of key

Location:

src/tests

Files:

• .expect/searchsort.txt (modified) (1 diff)
• searchsort.c (modified) (2 diffs)

src/tests/.expect/searchsort.txt

@@ -1 +1 @@
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
+
 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 
+10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 
 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 

src/tests/searchsort.c

@@ -10 +10 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Sat Apr  1 19:10:12 2017
-// Update Count     : 62
+// Last Modified On : Sun Apr  2 11:29:30 2017
+// Update Count     : 76
 // 
 
 #include <fstream>
 #include <stdlib>                                                                               // bsearch, qsort
+#include <stdlib.h>                                                                             // C version of bsearch
+
+int comp( const void * t1, const void * t2 ) { return *(int *)t1 < *(int *)t2 ? -1 : *(int *)t2 < *(int *)t1 ? 1 : 0; }
 
 int main( void ) {
@@ -25 +28 @@
                 sout | iarr[i] | ", ";
         } // for
-        sout | endl;
+        sout | endl | endl;
+
+        // ascending sort/search by changing < to >
         qsort( iarr, size );
         for ( unsigned int i = 0; i < size; i += 1 ) {
                 sout | iarr[i] | ", ";
+        } // for
+        sout | endl;
+        for ( unsigned int i = 0; i < size; i += 1 ) {          // C version
+                int key = size - i;
+                int *v = bsearch( &key, iarr, size, sizeof( iarr[0] ), comp );
+                sout | *v | ", ";
         } // for
         sout | endl;