Index: src/libcfa/bits/algorithms.h
===================================================================
--- src/libcfa/bits/algorithms.h	(revision 6c7b1e798248e92edeafe38f86060a72a69e4070)
+++ src/libcfa/bits/algorithms.h	(revision 0dc954bd83db8e34f0ec3ef5aa7213bf36083ab9)
@@ -112,6 +112,6 @@
 static inline void __libcfa_small_sortN( void* * arr, size_t dim );
 
-forall( otype T | {  int ?<?( T, T ); int ?>?( T, T ); } )
-static inline void __libcfa_small_sort( T * arr, size_t dim ) {
+forall( dtype T )
+static inline void __libcfa_small_sort( T* * arr, size_t dim ) {
 	switch( dim ) {
 		case 1 : return;
Index: src/libcfa/stdlib
===================================================================
--- src/libcfa/stdlib	(revision 6c7b1e798248e92edeafe38f86060a72a69e4070)
+++ src/libcfa/stdlib	(revision 0dc954bd83db8e34f0ec3ef5aa7213bf36083ab9)
@@ -10,6 +10,6 @@
 // Created On       : Thu Jan 28 17:12:35 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Oct 30 22:43:03 2017
-// Update Count     : 244
+// Last Modified On : Tue Oct 31 13:47:24 2017
+// Update Count     : 245
 //
 
Index: src/tests/sched-ext-recurse.c
===================================================================
--- src/tests/sched-ext-recurse.c	(revision 6c7b1e798248e92edeafe38f86060a72a69e4070)
+++ src/tests/sched-ext-recurse.c	(revision 0dc954bd83db8e34f0ec3ef5aa7213bf36083ab9)
@@ -23,5 +23,5 @@
 	for (i = 0; i < 4; i++)
 	{
-	    int j = random( 4 );
+		int j = random( 4 );
 		enum state_t t = array[j];
 		array[j] = array[i];
Index: src/tests/sched-int-wait.c
===================================================================
--- src/tests/sched-int-wait.c	(revision 6c7b1e798248e92edeafe38f86060a72a69e4070)
+++ src/tests/sched-int-wait.c	(revision 0dc954bd83db8e34f0ec3ef5aa7213bf36083ab9)
@@ -62,5 +62,5 @@
 
 	while( waiter_left != 0 ) {
-	    unsigned action = random( 4 );
+		unsigned action = random( 4 );
 		switch( action ) {
 			case 0: