[Walter D=F6rwald] > ... > Has anybody tried state machines for symbol tables in Python? Not that I know of. > The size of the transition table might be a problem and any attempt > to reduce the size might kill performance in the inner loop. > Performancewise stringobject.c/string_hash() is hard to > beat (especially when the hash value is already cached). Which is why, if nobody ever did or ever does try alternative approac= hes, I would be neither surprised nor disappointed <0.9 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