Index: libcfa/src/concurrency/future.hfa
===================================================================
--- libcfa/src/concurrency/future.hfa	(revision a51dc0de37fbbde4fc497460bcc75e0b98fc4a8f)
+++ libcfa/src/concurrency/future.hfa	(revision 9bb6c5f932cd0dc4fdb4d3e7678e9286959c06a0)
@@ -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; }
 	}