[Andrew Koenig] > ... > Seriously, I don't know whether it would help in practice. > It might be that normalizing rationals from time to time would > be enough. Do check out Val=E9rie M=E9nissier-Morain's work on exact rational ar= ithmetic in Caml; I've referenced it several times before, and this discussion is= always the same <wink>. In real apps, the time it takes to normalize ration= als can be a disaster (the gcd of two random ints is most likely to be 1, and longint gcds are very expensive). In other real apps, not normalizin= g rationals can be a disaster. There isn't a one-size-fits-all policy = for this, and a serious implementation has to take that seriously (sorry,= Scheme <wink>).
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4