Changeset 93cdd5c for src/libcfa/stdlib
 Timestamp:
 Jan 2, 2018, 8:34:33 AM (5 years ago)
 Branches:
 aaronthesis, armeh, cleanupdtors, deferred_resn, demangler, enum, forallpointerdecay, jacob/cs343translation, jenkinssandbox, master, newast, newastuniqueexpr, newenv, no_list, persistentindexer, pthreademulation, qualifiedEnum, resolvnew, with_gc
 Children:
 490d9972, f3458a8
 Parents:
 853451b
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/libcfa/stdlib
r853451b r93cdd5c 10 10 // Created On : Thu Jan 28 17:12:35 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Dec 28 18:43:12 201713 // Update Count : 2 7712 // Last Modified On : Mon Jan 1 17:35:43 2018 13 // Update Count : 291 14 14 // 15 15 … … 186 186 187 187 forall( otype E  { int ?<?( E, E ); } ) 188 E * bsearch( E key, const E * arr, size_t dim ); 189 190 forall( otype E  { int ?<?( E, E ); } ) 191 unsigned int bsearch( E key, const E * arr, size_t dim ); 192 193 forall( otype K, otype E  { int ?<?( K, K ); K getKey( E & ); } ) 194 E * bsearch( K key, const E * arr, size_t dim ); 195 196 forall( otype K, otype E  { int ?<?( K, K ); K getKey( E & ); } ) 197 unsigned int bsearch( K key, const E * arr, size_t dim ); 198 199 forall( otype E  { int ?<?( E, E ); } ) 200 void qsort( E * arr, size_t dim ); 188 E * bsearch( E key, const E * vals, size_t dim ); 189 190 forall( otype E  { int ?<?( E, E ); } ) 191 size_t bsearch( E key, const E * vals, size_t dim ); 192 193 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 194 E * bsearch( K key, const E * vals, size_t dim ); 195 196 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 197 size_t bsearch( K key, const E * vals, size_t dim ); 198 199 200 forall( otype E  { int ?<?( E, E ); } ) 201 E * bsearchl( E key, const E * vals, size_t dim ); 202 203 forall( otype E  { int ?<?( E, E ); } ) 204 size_t bsearchl( E key, const E * vals, size_t dim ); 205 206 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 207 E * bsearchl( K key, const E * vals, size_t dim ); 208 209 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 210 size_t bsearchl( K key, const E * vals, size_t dim ); 211 212 213 forall( otype E  { int ?<?( E, E ); } ) 214 E * bsearchu( E key, const E * vals, size_t dim ); 215 216 forall( otype E  { int ?<?( E, E ); } ) 217 size_t bsearchu( E key, const E * vals, size_t dim ); 218 219 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 220 E * bsearchu( K key, const E * vals, size_t dim ); 221 222 forall( otype K, otype E  { int ?<?( K, K ); K getKey( const E & ); } ) 223 size_t bsearchu( K key, const E * vals, size_t dim ); 224 225 226 forall( otype E  { int ?<?( E, E ); } ) 227 void qsort( E * vals, size_t dim ); 201 228 202 229 //
Note: See TracChangeset
for help on using the changeset viewer.