Index: libcfa/prelude/prototypes.awk
===================================================================
--- libcfa/prelude/prototypes.awk	(revision 4b75ae900398d0a16e55d7422207b420367e03e9)
+++ libcfa/prelude/prototypes.awk	(revision db19e1d0d4adcc296ca7022c295f441155d4b6dc)
@@ -103,5 +103,4 @@
 
 	for ( prototype in prototypes ) {
-		# printf( "//\"%s\"\n", prototype )
 		if ( index( "BT_LAST", prototype ) == 1 ) {
 			continue
@@ -126,23 +125,21 @@
 
 		# generate function parameter types as macro
-		if ( index( prototype, "VAR" ) != 2 ) {			# C-style empty parameters ?
-			for ( p = 0; length( prototype ) > 0; p += 1 ) { # until all parameters types are removed
-				sub( "_", "", prototype)				# remove "_"
-				printf( ", ", type )
-				temp = prototype
-				for ( t = 0; t < N; t += 1 ) {			# find longest match
-					type = types[t];
-					if ( index( prototype, type ) == 1 ) { # found match
-						printf( "BT_%s", type )
-						sub( type, "", prototype )
-						break;
-					} # if
-				} # for
-				if ( temp == prototype ) {				# no match found for parameter in macro table
-					printf( "\n********** MISSING TYPE \"%s\" **********\n", prototype )
-					exit 0
+		for ( p = 0; length( prototype ) > 0; p += 1 ) { # until all parameters types are removed
+			sub( "_", "", prototype)				# remove "_"
+			printf( ", ", type )
+			temp = prototype
+			for ( t = 0; t < N; t += 1 ) {			# find longest match
+				type = types[t];
+				if ( index( prototype, type ) == 1 ) { # found match
+					printf( "BT_%s", type )
+					sub( type, "", prototype )
+					break;
 				} # if
 			} # for
-		} # if
+			if ( temp == prototype ) {				# no match found for parameter in macro table
+				printf( "\n********** MISSING TYPE \"%s\" **********\n", prototype )
+				exit 0
+			} # if
+		} # for
 		printf( ")\n" )
 	} # for
Index: libcfa/src/concurrency/future.hfa
===================================================================
--- libcfa/src/concurrency/future.hfa	(revision 4b75ae900398d0a16e55d7422207b420367e03e9)
+++ libcfa/src/concurrency/future.hfa	(revision db19e1d0d4adcc296ca7022c295f441155d4b6dc)
@@ -88,5 +88,5 @@
                 if ( s.clause_status == 0p ) // poke in result so that woken threads do not need to reacquire any locks
                     copy_T( result, *(((future_node(T) &)s).my_result) );
-                
+
                 wake_one( waiters, s );
             }
@@ -146,5 +146,5 @@
             }
             unlock( lock );
-            
+
             return [ret_val, false];
         }
@@ -154,5 +154,5 @@
 
             // check if we can complete operation. If so race to establish winner in special OR case
-            if ( !s.park_counter && state != FUTURE_EMPTY ) { 
+            if ( !s.park_counter && state != FUTURE_EMPTY ) {
                 if ( !__make_select_node_available( s ) ) { // we didn't win the race so give up on registering
                     unlock( lock );
@@ -180,5 +180,5 @@
             return false;
         }
-		
+
         bool on_selected( future(T) & this, select_node & node ) { return true; }
 	}