Ignore:
File:
1 edited

Legend:

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

    ra32cbac2 ra5a67ab8  
    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.
    216213                Sequence(T) * seq;
    217214        };
     
    254251        struct SeqIterRev {
    255252                inline ColIter;
    256                 // See above for explanation.
    257253                Sequence(T) * seq;
    258254        };
Note: See TracChangeset for help on using the changeset viewer.