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 16:01:52 +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:47354 Date: 2017-07-11T16:01:52+03:00 List-Id: Victor Porton wrote: > J-P. Rosen wrote: > >> Le 10/07/2017 à 15:38, Victor Porton a écrit : >>> But AFAIK Ada does not support closures. >>> >>> Are closures really needed to implement generators? >>> >>> It is nearly impossible to add closures to Ada, right? >> >> Taking the example from Wikipedia: >> >> function startAt(x) >> function incrementBy(y) >> return x + y >> return incrementBy >> >> variable closure1 = startAt(1) >> variable closure2 = startAt(5) >> >> This could be written as: >> generic >> Start_Value : Integer >> function Increment_By (X : integer) return Integer; >> >> function Closure1 is new Increment_By (1); >> function Closure2 is new Increment_By (5); > > Please describe your solution with generics in more details, I do not > quite understand it. I want to see how to imitate closures with generics. I've realized how to imitate closures with generics. But is there is a way to add generators to Ada? -- Victor Porton - http://portonvictor.org