Hi, Name matches are done through the hash tables, so you get hash speeds. Lsearch is big-O linear.
When I last did a lsearch vs hash comparison (for a speed discussion in my book), the difference between lsearch and hash didn't matter until around 500 elements. There are XML parsing libraries for Tcl. I tested them a few years ago, and they all worked. The compiled ones (TclExpat) were the fastest, but not by so much that I cared. For trivial XML parsing, I write my own parser with a simple stack class. I've never seen the need for a tree in any XML pages I've seen. Hope this helps, Clif -- ... Clif Flynt ... http://www.cwflynt.com ... c...@cflynt.com ... .. Tcl/Tk: A Developer's Guide (2nd edition) - Morgan Kauffman .. .... 18'th Annual Tcl/Tk Conference: 2011, Manassas, VA USA .... ............. http://www.tcl.tk/community/tcl2011/ ............ --------------------------------------------------------------------- To unsubscribe, e-mail: rivet-dev-unsubscr...@tcl.apache.org For additional commands, e-mail: rivet-dev-h...@tcl.apache.org