From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,ad0779dc60e28dee X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2003-03-07 13:31:05 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!kibo.news.demon.net!news.demon.co.uk!demon!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Data Structure Choice for DOM Date: 07 Mar 2003 21:29:46 +0000 Organization: Pushface Sender: simon@smaug.pushface.org Message-ID: References: NNTP-Posting-Host: pogner.demon.co.uk Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: news.demon.co.uk 1047072665 7597 62.49.19.209 (7 Mar 2003 21:31:05 GMT) X-Complaints-To: abuse@demon.net NNTP-Posting-Date: Fri, 7 Mar 2003 21:31:05 +0000 (UTC) User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.1 Xref: archiver1.google.com comp.lang.ada:35053 Date: 2003-03-07T21:29:46+00:00 List-Id: "chris.danx" 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!)