From: "chris.danx" <spamoff.danx@ntlworld.com>
Subject: Data Structure Choice for DOM
Date: Fri, 07 Mar 2003 18:49:01 +0000
Date: 2003-03-07T18:49:01+00:00 [thread overview]
Message-ID: <oQ5aa.16185$EN3.130845@newsfep4-glfd.server.ntli.net> (raw)
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.
Chris
*gives me something to keep programming skills in Ada sharp
next reply other threads:[~2003-03-07 18:49 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2003-03-07 18:49 chris.danx [this message]
2003-03-07 21:29 ` Data Structure Choice for DOM Simon Wright
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