From: "chris.danx" <spamoff.danx@ntlworld.com>
Subject: Re: Data Structure Choice for DOM
Date: Fri, 07 Mar 2003 21:46:05 +0000
Date: 2003-03-07T21:46:05+00:00 [thread overview]
Message-ID: <oq8aa.16405$EN3.133044@newsfep4-glfd.server.ntli.net> (raw)
In-Reply-To: <x7vd6l2c1bp.fsf@smaug.pushface.org>
Simon Wright wrote:
>
> 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.
:) "Premature optimisation is the root of all evil" or something like that?
Linked list is easiest & quickest. It'll be O(n) in worst case but
it'll work. Later I'll change it to an AVL tree or something else.
> Aside from anything else, this will be much more fun (cos the DOM
> application you have in mind will be able to _do_ something!)
True. I suppose I should have just did it, rather than search for the
right data structure. That's one of my big problems, looking for the
"best" solution to a problem rather than getting stuck in and improving
the deficiencies later!
Thanks,
Chris
next prev parent reply other threads:[~2003-03-07 21:46 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 [this message]
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