[Python-Dev] Pie-thon benchmark code ready (original) (raw)
Guido van Rossum guido at python.org
Wed Dec 31 19:50:33 EST 2003
- Previous message: [Python-Dev] Pie-thon benchmark code ready
- Next message: [Python-Dev] Pie-thon benchmark code ready
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
wondering whether the correctness checks are too much dependent on details of the representation of objects, especially the order of keys in a dict repr etc...
Probably. :-(
I could probably fix that by subclassing dict with something whose repr() sorts the keys -- it doesn't print the few large dicts that it uses, so this should be fine. The same approach could be used for fixing all repr()-related issues. I'll leave it to Dan to decide if he wants this to be fixed ASAP or if he's okay with putting it off until later -- I imagine it will take a while before he's got it running on Parrot well enough to hit the first assert...
(There's also an issue with the distinction between repr() of int and long, which will disappear in Python 3.0, and repr() of str vs. unicode, which already doesn't exist in Jython. So I predict that the benchmark currently doesn't have a chance of passing on Jython. (But it would be interesting to time it anyway -- simply disable the raises in b0.check() and in b5.check().)
--Guido van Rossum (home page: http://www.python.org/~guido/)
- Previous message: [Python-Dev] Pie-thon benchmark code ready
- Next message: [Python-Dev] Pie-thon benchmark code ready
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]