Re: Choice of data structures
From: Will Hartung (willh_at_msoft.com)
Date: 09/27/04
- Next message: rif: "Re: Sockets and UFFI"
- Previous message: Will Hartung: "Re: Writing a Text Editor in Lisp"
- In reply to: Jon Boone: "Re: Choice of data structures"
- Next in thread: Jon Boone: "Re: Choice of data structures"
- Reply: Jon Boone: "Re: Choice of data structures"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Mon, 27 Sep 2004 11:39:15 -0700
"Jon Boone" <ipmonger@comcast.net> wrote in message
news:BD7D8353.37308%ipmonger@comcast.net...
> I was planning on using hashes to make out-of-order data insertion
easier.
> Since things would be keyed by the data-collection-date, I could just
insert
> the data according to the hash (not really caring where it ended up).
When
> I wanted to pull things out in sequence, I'd use the sorted keys to pull
the
> data in sequence.
Sounds like you want a Tree to me, not a hash. Then you don't have to sort
anything. There are certainly RB-Tree implementations floating around in the
assorted libraries.
Regards,
Will Hartung
(willh@msoft.com)
- Next message: rif: "Re: Sockets and UFFI"
- Previous message: Will Hartung: "Re: Writing a Text Editor in Lisp"
- In reply to: Jon Boone: "Re: Choice of data structures"
- Next in thread: Jon Boone: "Re: Choice of data structures"
- Reply: Jon Boone: "Re: Choice of data structures"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|