Index: libcfa/src/bits/sequence.hfa
===================================================================
--- libcfa/src/bits/sequence.hfa	(revision 4f649cbe98a193675b9d3365013d7b6adc0efce2)
+++ libcfa/src/bits/sequence.hfa	(revision a32cbac249c437a50b3c8d7ecd4ff771150a78ca)
@@ -211,4 +211,7 @@
 	struct SeqIter {
 		inline ColIter;
+		// The Sequence must be passed to pred and succ to check for the end of the Sequence and return 0p. Without
+		// passing the sequence, traversing would require its length. Thus the iterator needs a pointer to the sequence
+		// to pass to succ/pred. Both stack and queue just encounter 0p since the lists are not circular.
 		Sequence(T) * seq;
 	};
@@ -251,4 +254,5 @@
 	struct SeqIterRev {
 		inline ColIter;
+		// See above for explanation.
 		Sequence(T) * seq;
 	};