From: Simon Wright <simon@pushface.org>
Subject: Re: Data Structure Choice for DOM
Date: 07 Mar 2003 21:29:46 +0000
Date: 2003-03-07T21:29:46+00:00 [thread overview]
Message-ID: <x7vd6l2c1bp.fsf@smaug.pushface.org> (raw)
In-Reply-To: oQ5aa.16185$EN3.130845@newsfep4-glfd.server.ntli.net
"chris.danx" <spamoff.danx@ntlworld.com> writes:
> In the DOM Level 3 spec, a NamedNodeMap is defined. What's the best
> way to implement this? I'm implementing an OO version of the DOM
> Level 3 spec (in Ada*) and this one is posing a problem just
> choosing the right implementation. Under considering is a chained
> hash table and an AVL tree. Both have their advantage but there may
> be a more appropriate choice of which I'm not aware.
Do it the way that gets you working code quickest, profile it (speed
and memory), and choose another implementation for this part if it's
justified.
Aside from anything else, this will be much more fun (cos the DOM
application you have in mind will be able to _do_ something!)
next prev parent reply other threads:[~2003-03-07 21:29 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-03-07 18:49 Data Structure Choice for DOM chris.danx
2003-03-07 21:29 ` Simon Wright [this message]
2003-03-07 21:46 ` chris.danx
2003-03-10 19:10 ` Stephen Leake
2003-03-07 22:48 ` Kevin Cline
2003-03-08 21:47 ` chris.danx
2003-03-11 2:04 ` Matthew Heaney
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox