Changeset 93cdd5c for src/libcfa/stdlib.c

Timestamp:

Jan 2, 2018, 8:34:33 AM (6 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:

490d9972, f3458a8

Parents:

853451b

Message:

add lower/upper bound bsearch, and update bsearch and its test

File:

• src/libcfa/stdlib.c (modified) (2 diffs)

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 Dec 28 18:43:16 2017
-// Update Count     : 378
+// Last Modified On : Mon Jan  1 19:03:16 2018
+// Update Count     : 437
 //
 
@@ -129 +129 @@
 
 forall( otype E | { int ?<?( E, E ); } )
-E * bsearch( E key, const E * arr, size_t dim ) {
-        int comp( const void * t1, const void * t2 ) { return *(E *)t1 < *(E *)t2 ? -1 : *(E *)t2 < *(E *)t1 ? 1 : 0; }
-        return (E *)bsearch( &key, arr, dim, sizeof(E), comp );
-} // bsearch
-
-forall( otype E | { int ?<?( E, E ); } )
-unsigned int bsearch( E key, const E * arr, size_t dim ) {
-        E * result = bsearch( key, arr, dim );
-        return result ? result - arr : dim;                                     // pointer subtraction includes sizeof(E)
-} // bsearch
-
-forall( otype K, otype E | { int ?<?( K, K ); K getKey( E & ); } )
-E * bsearch( K key, const E * arr, size_t dim ) {
-        int comp( const void * t1, const void * t2 ) { return *(K *)t1 < getKey( *(E *)t2 ) ? -1 : getKey( *(E *)t2 ) < *(K *)t1 ? 1 : 0; }
-        return (E *)bsearch( &key, arr, dim, sizeof(E), comp );
-} // bsearch
-
-forall( otype K, otype E | { int ?<?( K, K ); K getKey( E & ); } )
-unsigned int bsearch( K key, const E * arr, size_t dim ) {
-        E * result = bsearch( key, arr, dim );
-        return result ? result - arr : dim;                                     // pointer subtraction includes sizeof(E)
-} // bsearch
-
-forall( otype E | { int ?<?( E, E ); } )
-void qsort( E * arr, size_t dim ) {
-        int comp( const void * t1, const void * t2 ) { return *(E *)t1 < *(E *)t2 ? -1 : *(E *)t2 < *(E *)t1 ? 1 : 0; }
-        qsort( arr, dim, sizeof(E), comp );
+E * bsearch( E key, const E * vals, size_t dim ) {
+        int cmp( const void * t1, const void * t2 ) {
+                return *(E *)t1 < *(E *)t2 ? -1 : *(E *)t2 < *(E *)t1 ? 1 : 0;
+        } // cmp
+        return (E *)bsearch( &key, vals, dim, sizeof(E), cmp );
+} // bsearch
+
+forall( otype E | { int ?<?( E, E ); } )
+size_t bsearch( E key, const E * vals, size_t dim ) {
+        E * result = bsearch( key, vals, dim );
+        return result ? result - vals : dim;                            // pointer subtraction includes sizeof(E)
+} // bsearch
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+E * bsearch( K key, const E * vals, size_t dim ) {
+        int cmp( const void * t1, const void * t2 ) {
+                return *(K *)t1 < getKey( *(E *)t2 ) ? -1 : getKey( *(E *)t2 ) < *(K *)t1 ? 1 : 0;
+        } // cmp
+        return (E *)bsearch( &key, vals, dim, sizeof(E), cmp );
+} // bsearch
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+size_t bsearch( K key, const E * vals, size_t dim ) {
+        E * result = bsearch( key, vals, dim );
+        return result ? result - vals : dim;                            // pointer subtraction includes sizeof(E)
+} // bsearch
+
+
+forall( otype E | { int ?<?( E, E ); } )
+size_t bsearchl( E key, const E * vals, size_t dim ) {
+        size_t l = 0, m, h = dim;
+        while ( l < h ) {
+                m = (l + h) / 2;
+                if ( (E &)(vals[m]) < key ) {                                   // cast away const
+                        l = m + 1;
+                } else {
+                        h = m;
+                } // if
+        } // while
+        return l;
+} // bsearchl
+
+forall( otype E | { int ?<?( E, E ); } )
+E * bsearchl( E key, const E * vals, size_t dim ) {
+        size_t posn = bsearchl( key, vals, dim );
+        return (E *)(&vals[posn]);                                                      // cast away const
+} // bsearchl
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+size_t bsearchl( K key, const E * vals, size_t dim ) {
+        size_t l = 0, m, h = dim;
+        while ( l < h ) {
+                m = (l + h) / 2;
+                if ( getKey( vals[m] ) < key ) {
+                        l = m + 1;
+                } else {
+                        h = m;
+                } // if
+        } // while
+        return l;
+} // bsearchl
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+E * bsearchl( K key, const E * vals, size_t dim ) {
+        size_t posn = bsearchl( key, vals, dim );
+        return (E *)(&vals[posn]);                                                      // cast away const
+} // bsearchl
+
+
+forall( otype E | { int ?<?( E, E ); } )
+size_t bsearchu( E key, const E * vals, size_t dim ) {
+        size_t l = 0, m, h = dim;
+        while ( l < h ) {
+                m = (l + h) / 2;
+                if ( ! ( key < (E &)(vals[m]) ) ) {                             // cast away const
+                        l = m + 1;
+                } else {
+                        h = m;
+                } // if
+        } // while
+        return l;
+} // bsearchu
+
+forall( otype E | { int ?<?( E, E ); } )
+E * bsearchu( E key, const E * vals, size_t dim ) {
+        size_t posn = bsearchu( key, vals, dim );
+        return (E *)(&vals[posn]);
+} // bsearchu
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+size_t bsearchu( K key, const E * vals, size_t dim ) {
+        size_t l = 0, m, h = dim;
+        while ( l < h ) {
+                m = (l + h) / 2;
+                if ( ! ( key < getKey( vals[m] ) ) ) {
+                        l = m + 1;
+                } else {
+                        h = m;
+                } // if
+        } // while
+        return l;
+} // bsearchu
+
+forall( otype K, otype E | { int ?<?( K, K ); K getKey( const E & ); } )
+E * bsearchu( K key, const E * vals, size_t dim ) {
+        size_t posn = bsearchu( key, vals, dim );
+        return (E *)(&vals[posn]);
+} // bsearchu
+
+
+forall( otype E | { int ?<?( E, E ); } )
+void qsort( E * vals, size_t dim ) {
+        int cmp( const void * t1, const void * t2 ) {
+                return *(E *)t1 < *(E *)t2 ? -1 : *(E *)t2 < *(E *)t1 ? 1 : 0;
+        } // cmp
+        qsort( vals, dim, sizeof(E), cmp );
 } // qsort