- Timestamp:
- Oct 31, 2017, 2:09:43 PM (7 years ago)
- 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:
- b1e68d03, e706bfd
- Parents:
- 6c7b1e7 (diff), e1e8408 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - Location:
- src
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
src/libcfa/bits/algorithms.h
r6c7b1e7 r0dc954b 112 112 static inline void __libcfa_small_sortN( void* * arr, size_t dim ); 113 113 114 forall( otype T | { int ?<?( T, T ); int ?>?( T, T ); })115 static inline void __libcfa_small_sort( T * arr, size_t dim ) {114 forall( dtype T ) 115 static inline void __libcfa_small_sort( T* * arr, size_t dim ) { 116 116 switch( dim ) { 117 117 case 1 : return; -
src/libcfa/stdlib
r6c7b1e7 r0dc954b 10 10 // Created On : Thu Jan 28 17:12:35 2016 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Mon Oct 30 22:43:03201713 // Update Count : 24 412 // Last Modified On : Tue Oct 31 13:47:24 2017 13 // Update Count : 245 14 14 // 15 15 -
src/tests/sched-ext-recurse.c
r6c7b1e7 r0dc954b 23 23 for (i = 0; i < 4; i++) 24 24 { 25 25 int j = random( 4 ); 26 26 enum state_t t = array[j]; 27 27 array[j] = array[i]; -
src/tests/sched-int-wait.c
r6c7b1e7 r0dc954b 62 62 63 63 while( waiter_left != 0 ) { 64 64 unsigned action = random( 4 ); 65 65 switch( action ) { 66 66 case 0:
Note: See TracChangeset
for help on using the changeset viewer.