Hi Clif
On 11/09/2011 03:52 AM, Clif Flynt wrote:
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.
ok, I don't think I will ever get close to 500 handlers...I'll go the
elegant way and use ensembles to design the handler interface
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
I've been using tDOM for quite a few years now. It's based on expat and
it's stable...perhaps too stable. In the last years it's been stuck on
the 0.83 release and their website went dead until someone got kindly
bothered to move it to github. But after all provides also XSLT and it
worked well for my needs, so I had no reason for moving on.
-- Massimo
---------------------------------------------------------------------
To unsubscribe, e-mail: rivet-dev-unsubscr...@tcl.apache.org
For additional commands, e-mail: rivet-dev-h...@tcl.apache.org
