Re: compile time Least Common Multiple, was Re: Ada and Internet stuff

[Ted Dennison<dennison@telepath.com>]

In article <UXPj7.34989$sa.18017934@news1.rdc1.sfba.home.com>, tmoran@acm.org
says...
>
>>Why are you doing that, though?  What you would generally want to figure
>>out with a stream is the minimum number of stream elements that will be
>>required to cover your data object's 'size.
>  No, I'm not concerned here with converting from my data objects to stream
>elements, but with encoding successive 24 bit chunks from a supplied
>stream_element_array.  So I need an Unchecked_Conversion from a
>subtype of stream_element_array of some length, to an array of 24 bit chunks,
>so I need to know how many stream_element's are needed to make that
>subtype an even multiple of 24 bits.

OK. So I was talking encoding while you were talking decoding. But both
processes are reversible, so we are still back to the same issue. Unless they
match up perfectly, you are still going to have to deal with some extra leftover
slag bits in the source object (the stream element array). So you are *still*
going to have some waste at the end, which you will have to deal with by
calulating the minimum number of 24 bit chunks needed to store it (or maximum
that doesn't, depending on whether you want to save the leftover data, or try to
use it). Why not just do that for the whole array at once and be done with it?

---
T.E.D.    homepage   - http://www.telepath.com/dennison/Ted/TED.html
          home email - mailto:dennison@telepath.com