Re: stopping a loop iteration without exiting it

[Niklas Holsti <niklas.holsti@tidorum.invalid>]

On 18-01-07 14:05 , Dmitry A. Kazakov wrote:
> On 2018-01-07 12:36, Niklas Holsti wrote:
>> On 18-01-06 19:20 , Dmitry A. Kazakov wrote:
>
>>> T is a single type. T'Class is a range of types similar to
>>> 5..Integer'Last. Certainly definite ranges of types must be supported as
>>> well:
>>>
>>>    X in T..S
>>>
>>> which same as
>>>
>>>    X in T'Class and T in S'Class and (X in S or else X not in S'Class)
>>
>> That is a bit hard to understand.
>
> If you want to have mutually exclusive alternatives you need type
> ranges.

Ok, I understand you now, and yes, you are right, if you want to 
include, in the same (hypothetical) class-based "case" statement, 
related cases at different levels in the class hierarchy. But there is 
an alternative: use nested "case" statements, one per level.

> If S is a descendant of T then in order to build a case you have
> to spell choices like:
>
>    when T..S'Parent =>
>    when S'Class =>
>
> X in T..S'Parent = X in T'Class and X not in S'Class and T in S'Class.

Yes, but I think your formula has a mistake. You assume that S is a 
descendant of T, but the formula requires that T is in S'Class, which 
under your assumption happens only if S = T. Perhaps you meant "S in 
T'Class"?

-- 
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
       .      @       .