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,FREEMAIL_FROM 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!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: Victor Porton Newsgroups: comp.lang.ada Subject: Re: Generators/coroutines in future Ada? Date: Tue, 11 Jul 2017 21:36:24 +0300 Organization: Aioe.org NNTP Server Message-ID: References: NNTP-Posting-Host: i1vc24+njmQErCAdcylhNA.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8Bit X-Complaints-To: abuse@aioe.org User-Agent: KNode/4.14.10 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:47359 Date: 2017-07-11T21:36:24+03:00 List-Id: J-P. Rosen wrote: > Le 11/07/2017 à 15:01, Victor Porton a écrit : >> I've realized how to imitate closures with generics. >> >> But is there is a way to add generators to Ada? > > AFAIU, generators are functions with states, where the returned value at > one call depends on the state that was left behind by the previous call. This state also includes the point of execution (like "We are in the second loop in its second operator.") > This can easily be achieved with a function within a package, where the > package serves to protect and hide the function's state. Ada currently has no support to save such (point of execution) states. -- Victor Porton - http://portonvictor.org