Re: How hash tables work
From: Martin Harvey (Demon account) (martin_at_nospam_pergolesi.demon.co.uk)
Date: 10/31/04
- Next message: Martin Harvey (Demon account): "Re: (Oz vs Delphi), Beating the Wizards of Oz, Part 1 Factorial."
- Previous message: Martin Harvey (Demon account): "Comment on one of Rob Kennedy's (old) replies on timers."
- In reply to: Peter Piper: "Re: How hash tables work"
- Next in thread: Marc Rohloff: "Re: How hash tables work"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 31 Oct 2004 00:16:23 GMT
On Mon, 11 Oct 2004 09:46:14 +0000 (UTC), Peter Piper
<NoEmail@Email.com> wrote:
>Thanks J, I think maybe i have used the wrong phrase and i am trying to
>produce a index table. Basically i need to sort my records by more than
>one key field eg. Lastname, then firstname.
Would you, by any chance, also need to index data to allow for fast
searching on several fields but without combining them?
If so, and providing the fields are unique indices, then I have some
code I hacked together to maintain multiple AVL tree indexes into
something a bit like a TList.
MH.
- Next message: Martin Harvey (Demon account): "Re: (Oz vs Delphi), Beating the Wizards of Oz, Part 1 Factorial."
- Previous message: Martin Harvey (Demon account): "Comment on one of Rob Kennedy's (old) replies on timers."
- In reply to: Peter Piper: "Re: How hash tables work"
- Next in thread: Marc Rohloff: "Re: How hash tables work"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|