Changeset 3ce0d440 for src/libcfa/stdlib.c

Timestamp:

Jun 2, 2018, 10:00:29 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, with_gc

Children:

428bef8

Parents:

d56cc219

Message:

more push/pop updates

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 : Wed Jan  3 08:29:29 2018
-// Update Count     : 444
+// Last Modified On : Sat Jun  2 06:15:05 2018
+// Update Count     : 448
 //
 
@@ -130 +130 @@
 //---------------------------------------
 
-forall( otype E | { int ?<?( E, E ); } )
-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
+forall( otype E | { int ?<?( E, E ); } ) {
+        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
+
+        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
+
+        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
+
+        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
+
+        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
+
+        E * bsearchu( E key, const E * vals, size_t dim ) {
+                size_t posn = bsearchu( key, vals, dim );
+                return (E *)(&vals[posn]);
+        } // bsearchu
+
+
+        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
+} // distribution
+
+
+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
+
+        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
+
+        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
+
+        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
+
+        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
+
+        E * bsearchu( K key, const E * vals, size_t dim ) {
+                size_t posn = bsearchu( key, vals, dim );
+                return (E *)(&vals[posn]);
+        } // bsearchu
+} // distribution
 
 //---------------------------------------