Index: libcfa/src/collections/lockfree.hfa
===================================================================
--- libcfa/src/collections/lockfree.hfa	(revision 5db913f46e93b12eef193c9ac4a156a1a6b97739)
+++ libcfa/src/collections/lockfree.hfa	(revision 656c8ac30a1b2b1d963a9dbd8ab1d0800aaad6be)
@@ -6,5 +6,5 @@
 #include <bits/defs.hfa>
 
-forall( T &) {
+forall( T & ) {
 	//------------------------------------------------------------
 	// Queue based on the MCS lock
@@ -200,6 +200,6 @@
 forall( T & )
 struct LinkData {
-	T * volatile top;								// pointer to stack top
-	uintptr_t count;								// count each push
+	T * volatile top;									// pointer to stack top
+	uintptr_t count;									// count each push
 };
 
@@ -215,5 +215,5 @@
 }; // Link
 
-forall( T | sized(T) | { Link(T) * ?`next( T * ); } ) {
+forall( T /*| sized(T)*/ | { Link(T) * ?`next( T * ); } ) {
 	struct StackLF {
 		Link(T) stack;
@@ -235,5 +235,5 @@
 			Link(T) t @= stack;							// atomic assignment unnecessary, or use CAA
 			for () {									// busy wait
-				if ( t.data.top == 0p ) return 0p;				// empty stack ?
+				if ( t.data.top == 0p ) return 0p;		// empty stack ?
 				Link(T) * next = ( t.data.top )`next;
 				if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ (LinkData(T))@{ next->data.top, t.data.count } }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.data.top; // attempt to update top node