Iterator for the bottom level group.
Iterator for mid level groups.
Iterator for the top level group.
(Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.
Called on the first time when hasNext of the innermost iterator returns
false.
Called on the first time when hasNext of the innermost iterator returns
false. The default implementation does nothing.
(groupIterator: MonadOps[A]).filter(p)
(groupIterator: MonadOps[A]).flatMap(f)
(groupIterator: MonadOps[A]).map(f)
(groupIterator: StringAdd).self
(groupIterator: StringFormat).self
(groupIterator: MonadOps[A]).withFilter(p)
(Since version 2.10.0) use fold instead
(groupIterator: ArrowAssoc[GroupIterator[A]]).x
(Since version 2.10.0) Use leftOfArrow instead
(groupIterator: Ensuring[GroupIterator[A]]).x
(Since version 2.10.0) Use resultOfEnsuring instead
Iterator facilitating group-wise iteration over two ore more levels. Each level is represented by an inner iterator. Interactions between these levels are handled internally thus the implementor just needs to define the individual level iterators. Level iterator implementations will typically be inner objects inheriting from the public inner traits of this trait.
This trait is not graph-specific.
Simple or composite type of elements being subject to the iteration. For instance, a two-level iteration could expose just the elements of the inner loop or both the outer and the inner loop elements as a tuple.