Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • libcfa/src/bits/sequence.hfa

    ra5a67ab8 ra32cbac2  
    211211        struct SeqIter {
    212212                inline ColIter;
     213                // The Sequence must be passed to pred and succ to check for the end of the Sequence and return 0p. Without
     214                // passing the sequence, traversing would require its length. Thus the iterator needs a pointer to the sequence
     215                // to pass to succ/pred. Both stack and queue just encounter 0p since the lists are not circular.
    213216                Sequence(T) * seq;
    214217        };
     
    251254        struct SeqIterRev {
    252255                inline ColIter;
     256                // See above for explanation.
    253257                Sequence(T) * seq;
    254258        };
Note: See TracChangeset for help on using the changeset viewer.