Tim Peters wrote: > > [M.-A. Lemburg] > > Looks a lot like what I do in mxDateTime.c :-) > > The key difference is that the Dates.py Gregorian algorithms were loop-free, > no matter how large or small the year, even if the year requires a million > bits to express (although not even Guido may live long enough to verify that > in person <wink>). Oh, the mxDateTime algorithm is loop-free in a sense as well: the correction does at most 3 iterations, the month finder at most 12 iterations. I'll have a look at yours, though. Perhaps I can make the algorithms a bit faster ;-) (oh, I like competition). -- Marc-Andre Lemburg CEO eGenix.com Software GmbH ______________________________________________________________________ Company & Consulting: http://www.egenix.com/ Python Software: http://www.egenix.com/files/python/
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