> Consider taking a parsed MiniDOM tree as a benchmark. It contains so > many instances of just a couple of different classes that it just has to > make a huge difference if each of those instances is even just a bit > smaller. It should also make a clear difference for plain Python > ElementTree. Of course, for minidom, Mark's current implementation should already save quite a lot of memory, since all elements and text nodes have the same attributes. Still, it would be good to see how Mark's implementation deals with that. Regards, Martin
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