On 2005-02-18, Hanford Carr <"handycarr<nospam>"@[EMAIL PROTECTED]
> wrote:
>> begin
>> b:=[a1,a2,a3];
>> for i:=ord(low(myset)) to ord(high(myset)) do
>> if i in uglyset(b) then writeln(i);
>> end.
>
> Wouldn't the ord (a1) always be equal 0?
original enumeration b = (a1 , , , a6), then
type b2=a3..a5;
bset = set of b2;
Can imagine implementations keeping a3 at 3, and mangle the difference in
de
codegeneration.
Of course
> Of course HiMySet will overshoot by some bits but now with
is an IMHO worse problem.
|
