Re: Motion 46: finalise interval literals, amendments
Vincent wrote, noting that rationals have arbitrarily-long equivalents:
> This means that even if you have a limited datatype for rationals, it may
> be complex to parse the literals. Can you do that with bounded memory?
Well, you're making my point: you have to match the full precision of the
given input. You need to be able to make one copy of the inputs; I think
the rest can then pretty much be computed in place, using variants of the
GCD algorithm.
Michel.
---Sent: 2013-07-09 16:02:51 UTC