News for hackers. Stuff that matters.
Re:A Python Optimization Anecdote by cool-RR on Tuesday October 25, 2011 @08:30AM (#3153807)
Or possibly faster than a dict lookup: An array or a list of strings where the index number is the ordinal number of the character. So `array[ord('(')] == '&#(;'`.
Re:A Python Optimization Anecdote by gbog on Tuesday October 25, 2011 @10:15AM (#3154107)
I think I remember that list indexing "list[x]" is o(n), while hash access "hash[x]" is o(1), but my Martelli is not here around.

If I were the guy, I'd first ensure the final escaped result is cached in a key-value store, then I'll check if this func is the real bottleneck. If so, I might also have tried accessing it's content as a byte array. Then, if the file is of Asian origin (ascii being very low minority), I'd bulk escape it with the "&#x%s;" trick. It is rare to have documents with even mix of ascii/latin and other glyph, so I makes sense to have two functions, like he did.

Re:A Python Optimization Anecdote by kbd on Tuesday October 25, 2011 @11:25AM (#3154363)
Python's lists are not linked lists. List indexing is O(1).
Re:A Python Optimization Anecdote by gbog on Tuesday October 25, 2011 @10:04PM (#3156796)
You are right, double checked in my Martelli.
Re:A Python Optimization Anecdote by pwang on Tuesday October 25, 2011 @12:05PM (#3154544)
Unfortunately, the ord() function call overhead in Python may swamp the difference in speed between a dict lookup (hashtable) and a list lookup (ordinal index).