Index: libcfa/src/containers/stackLockFree.hfa
===================================================================
--- libcfa/src/containers/stackLockFree.hfa	(revision 64a7146c54101e2d816b7c6fd793f072222b5599)
+++ libcfa/src/containers/stackLockFree.hfa	(revision b232745aa346d2a551cb84ea589c6e3eb116ad6a)
@@ -31,5 +31,5 @@
 }; // Link
 
-forall( otype T | { Link(T) * getNext( T * ); } ) {
+forall( otype T | { Link(T) * ?`next( T * ); } ) {
 	struct StackLF {
 		Link(T) stack;
@@ -43,6 +43,6 @@
 		void push( StackLF(T) & this, T & n ) with(this) {
 			for () {									// busy wait
-				*getNext( &n ) = stack;					// atomic assignment unnecessary, or use CAA
-			  if ( __atomic_compare_exchange_n( &stack.atom, &getNext( &n )->atom, (Link(T))@{ {&n, getNext( &n )->count + 1} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) break; // attempt to update top node
+				*( &n )`next = stack;					// atomic assignment unnecessary, or use CAA
+			  if ( __atomic_compare_exchange_n( &stack.atom, &( &n )`next->atom, (Link(T))@{ {&n, ( &n )`next->count + 1} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) break; // attempt to update top node
 			} // for
 		} // push
@@ -53,5 +53,5 @@
 				t = stack;								// atomic assignment unnecessary, or use CAA
 			  if ( t.top == 0p ) return 0p;				// empty stack ?
-			  if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ {getNext( t.top )->top, t.count} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.top; // attempt to update top node
+			  if ( __atomic_compare_exchange_n( &stack.atom, &t.atom, (Link(T))@{ {( t.top )`next->top, t.count} }.atom, false, __ATOMIC_SEQ_CST, __ATOMIC_SEQ_CST ) ) return t.top; // attempt to update top node
 			} // for
 		} // pop
@@ -62,9 +62,9 @@
 				T * next = link->top;
 				if( next == node ) {
-					link->top = getNext( node )->top;
+					link->top = ( node )`next->top;
 					return true;
 				}
 				if( next == 0p ) return false;
-				link = getNext(next);
+				link = (next)`next;
 			}
 		}