Re: Generators/coroutines in future Ada?

["Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>]

On 2017-07-11 15:26, 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.

Which is an incredibly bad idea for sure.

> But once again, please provide an example where you find generators
> convenient, and we can discuss the best solution in Ada (I know other
> people in this group who would be interested too ;-) )

(:-)) I remember a few cases when this results in a disaster. Even 
innocent cases like saving the last found item of a search do. Or when 
Ada.Text_IO.Put_Line with no file is used for anything except debugging. 
How big are chances to discover much later that you need to change the 
output file?

There must be no hidden state, almost never. The state must be packed 
into an object which must be an explicit parameter.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de