Changeset 94980502 for src

Timestamp:

Mar 22, 2016, 10:19:00 PM (8 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

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

Children:

0438091

Parents:

984dce6

Message:

update examples

Location:

src/examples

Files:

• constants.c (modified) (3 diffs)
• limits.c (modified) (1 diff)
• searchsort.c (modified) (2 diffs)

src/examples/constants.c

@@ -10 +10 @@
 // Created On       : Wed May 27 17:56:53 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Jan 25 23:44:12 2016
-// Update Count     : 76
+// Last Modified On : Fri Mar 11 16:27:38 2016
+// Update Count     : 81
 //
 
@@ -44 +44 @@
         0x_ff_FF_ff_FF_ff_FF_ff_FF;
         9_223_372_036_854_775_807;
-        18_446_744_073_709_551_615;
+        18_446_744_073_709_551_615UL;
         3.141_59f;
         3.14159;
@@ -53 +53 @@
         L'\x_ff_ee';
         L_"\x_ff_ee";
-        L"a_b\r\Qyc\u_00_40  x_y_z\xff_AA";
-        L_"a_b\r\Qyc\u_00_40\
+        L"a_b\r\vyc\u_00_40  x_y_z\xff_AA";
+        L_"a_b\r\vyc\u_00_40\
   x_y_z\xff_AA";
         "abc" "def" "ghi";

src/examples/limits.c

@@ -98 +98 @@
 // Local Variables: //
 // tab-width: 4 //
-// compile-command: "cfa min.c" //
+// compile-command: "cfa limits.c" //
 // End: //

src/examples/searchsort.c

@@ -11 +11 @@
 // Created On       : Thu Feb  4 18:17:50 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Feb 17 12:21:04 2016
-// Update Count     : 46
+// Last Modified On : Tue Mar 22 22:16:46 2016
+// Update Count     : 55
 // 
 
@@ -36 +36 @@
                 sout | *v | ", ";
         } // for
+        sout | endl | endl;
+
+        // descending sort/search by changing < to >
+        for ( unsigned int i = 0; i < size; i += 1 ) {
+                iarr[i] = i + 1;
+                sout | iarr[i] | ", ";
+        } // for
+        sout | endl;
+        {
+                int ?<?( int x, int y ) { return x > y; }
+                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 ) {
+                        int *v = bsearch( size - i, iarr, size );
+                        sout | *v | ", ";
+                } // for
+        }
         sout | endl | endl;