Phobos2: sorting and std.typecons.Tuple

Andrei Alexandrescu SeeWebsiteForEmail at erdani.org
Mon Apr 27 15:37:35 PDT 2009


Christopher Wright wrote:
> Andrei Alexandrescu wrote:
>> bearophile wrote:
>>> Andrei Alexandrescu:
>>>> s/recursive/transitive/
>>>> Litmus test: recursive could recurse forever. Transitive never does.
>>>
>>> I have used the word recursive because the functions I have designed 
>>> (and I think they are designed correctly) call themselves until they 
>>> stop calling themselves because a stopping criterion is met. That's 
>>> recursivity, I think.
>>
>> But then what if you have a web of class objects that ultimately will 
>> close a cycle?
>>
>> Transitive: you'd use a worklist. Recursive: you'd recurse forever.
>>
>>
>> Andrei
> 
> bearophile explicitly said "structs". I assume it would extend to 
> primitives, treating pointers as integer types. I also assume it would 
> call .toHash on any object.

No matter. As soon as a class is reached, the problem appears. I wanted 
more to fix a terminological issue than to naysay.

Andrei



More information about the Digitalmars-d mailing list