Changeset a797e2b1

Timestamp:

Jul 6, 2016, 2:46:20 PM (9 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, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc

Children:

e04c5ff

Parents:

fcf041c

Message:

remove const from parameters to remove warnings from incorrectly generated code

Location:

src/libcfa

Files:

• stdlib (modified) (3 diffs)
• stdlib.c (modified) (3 diffs)

src/libcfa/stdlib

@@ -10 +10 @@
 // Created On       : Thu Jan 28 17:12:35 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jul  5 09:56:31 2016
-// Update Count     : 98
+// Last Modified On : Wed Jul  6 14:28:55 2016
+// Update Count     : 99
 //
 
@@ -76 +76 @@
 
 forall( otype T | { int ?<?( T, T ); } )
-T * bsearch( const T key, const T * arr, size_t dimension );
+T * bsearch( T key, const T * arr, size_t dimension );
 
 forall( otype T | { int ?<?( T, T ); } )
@@ -116 +116 @@
 
 forall( otype T | { int ?<?( T, T ); } )
-T min( const T t1, const T t2 );
+T min( T t1, T t2 );
 
 forall( otype T | { int ?>?( T, T ); } )
-T max( const T t1, const T t2 );
+T max( T t1, T t2 );
 
 forall( otype T | { T min( T, T ); T max( T, T ); } )
-T clamp( const T value, const T min_val, const T max_val );
+T clamp( T value, T min_val, T max_val );
 
 forall( otype T )

src/libcfa/stdlib.c

@@ -10 +10 @@
 // Created On       : Thu Jan 28 17:10:29 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Jun 30 15:04:25 2016
-// Update Count     : 168
+// Last Modified On : Wed Jul  6 14:28:57 2016
+// Update Count     : 169
 //
 
@@ -200 +200 @@
 
 forall( otype T | { int ?<?( T, T ); } )
-T * bsearch( const T key, const T * arr, size_t dimension ) {
+T * bsearch( T key, const T * arr, size_t dimension ) {
         int comp( const void * t1, const void * t2 ) { return *(T *)t1 < *(T *)t2 ? -1 : *(T *)t2 < *(T *)t1 ? 1 : 0; }
         return (T *)bsearch( &key, arr, dimension, sizeof(T), comp );
@@ -245 +245 @@
 
 forall( otype T | { int ?<?( T, T ); } )
-T min( const T t1, const T t2 ) {
+T min( T t1, T t2 ) {
         return t1 < t2 ? t1 : t2;
 } // min
 
 forall( otype T | { int ?>?( T, T ); } )
-T max( const T t1, const T t2 ) {
+T max( T t1, T t2 ) {
         return t1 > t2 ? t1 : t2;
 } // max
 
 forall( otype T | { T min( T, T ); T max( T, T ); } )
-T clamp( const T value, const T min_val, const T max_val ) {
+T clamp( T value, T min_val, T max_val ) {
         return max( min_val, min( value, max_val ) );
 } // clamp