From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00
	autolearn=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Generators/coroutines in future Ada?
Date: Mon, 10 Jul 2017 10:01:12 -0700
Organization: A noiseless patient Spider
Message-ID: <87pod8dy5j.fsf@nightsong.com>
References: <oju353$b75$1@gioia.aioe.org> <ok001a$rhm$1@gioia.aioe.org>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org;
 posting-host="5b523bf926a5b12a0cfd5011774d5e6e";
	logging-data="15465"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1+ZGPiJlx9KXVPD1ksHDwqj"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux)
Cancel-Lock: sha1:6GDDLO5+l2w404H10Vi/32nt3L8=
	sha1:ra8GPkz5cnE3CdAjoz2suCsJCQE=
Xref: news.eternal-september.org comp.lang.ada:47344
Date: 2017-07-10T10:01:12-07:00
List-Id: <comp.lang.ada>

Victor Porton <porton@narod.ru> writes:
> Are closures really needed to implement generators?

You can do it with OOP, like with the iterator protocol in C++.
It's ugly.