From: kcline17@hotmail.com (Kevin Cline)
Subject: Re: Data Structure Choice for DOM
Date: 7 Mar 2003 14:48:32 -0800
Date: 2003-03-07T22:48:32+00:00 [thread overview]
Message-ID: <ba162549.0303071448.35da9100@posting.google.com> (raw)
In-Reply-To: oQ5aa.16185$EN3.130845@newsfep4-glfd.server.ntli.net
"chris.danx" <spamoff.danx@ntlworld.com> wrote in message news:<oQ5aa.16185$EN3.130845@newsfep4-glfd.server.ntli.net>...
> Hi all,
>
> 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 whichever is easiest. The maps typically contain only a few entries,
so the slight differences in performance will probably be undetectable.
next prev parent reply other threads:[~2003-03-07 22:48 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
2003-03-07 21:46 ` chris.danx
2003-03-10 19:10 ` Stephen Leake
2003-03-07 22:48 ` Kevin Cline [this message]
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