Sather extends the notion of an iterator in a powerful new way. We argue that iteration abstractions belong in class interfaces on an equal footing with routines. Sather iterators were derived from CLU iterators but are much more flexible and better suited for object-oriented programming. We retain the property that iterators are structured, i.e., strictly bound to a controlling structured statement. We motivate and describe the construct along with several simple examples. We compare it with iteration based on CLU iterators, cursors, riders, streams, series, generators, coroutines, blocks, closures, and lambda expressions. Finally, we describe experiences with iterators in the Sather compiler and libraries.
CITATION STYLE
Murer, S., Omohundro, S., Stoutamire, D., & Szyperski, C. (1996). Iteration Abstraction in Sather. ACM Transactions on Programming Languages and Systems, 18(1), 1–15. https://doi.org/10.1145/225540.225541
Mendeley helps you to discover research relevant for your work.