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: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Generators/coroutines in future Ada? Date: Tue, 11 Jul 2017 20:27:17 +0100 Organization: A noiseless patient Spider Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain Injection-Info: mx02.eternal-september.org; posting-host="585814444ae6a26d6e89ee85d3c5225e"; logging-data="5576"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1815COjhsur1pMR4gOkEWPlphpgKqvpzGI=" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/25.2 (darwin) Cancel-Lock: sha1:ZWMrxpUnBhERjQf21mhN4xeCdo0= sha1:u3dpSxnWMN+7WucFZg0qFL9ikJo= Xref: news.eternal-september.org comp.lang.ada:47361 Date: 2017-07-11T20:27:17+01:00 List-Id: Victor Porton writes: > But is there is a way to add generators to Ada? Could one build something based on generalized iterators? Brad Moore had some examples of unusual iterators, e.g. for prime numbers - see the thread starting at [1], and the link to ACATS code at [2]. [1] https://groups.google.com/d/msg/comp.lang.ada/jZS9uHYF0KM/yrKywKuUBwAJ [2] https://groups.google.com/d/msg/comp.lang.ada/jZS9uHYF0KM/nQH17Pe-BwAJ