Re: Red-black trees?
- From: Jon Harrop <jon@xxxxxxxxxxxxxxxxx>
- Date: Sat, 15 Nov 2008 07:01:58 +0000
CBFalconer wrote:
Mark Wooding wrote:
Jon Harrop <jon@xxxxxxxxxxxxxxxxx> wrote:... snip ...
So arbitrarily-large hash tables are really bad all-round for
soft real-time apps in managed languages.
I don't write real-time code, so it's never bothered me. I am
enlightened. Thanks.
Nonsense. If the hash-table is properly designed, operations are
O(1), and size doesn't matter.
As I just explained, that is completely wrong.
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/?u
.
- Follow-Ups:
- Re: Red-black trees?
- From: CBFalconer
- Re: Red-black trees?
- References:
- Re: Red-black trees?
- From: Mark Wooding
- Re: Red-black trees?
- From: Jon Harrop
- Re: Red-black trees?
- From: Mark Wooding
- Re: Red-black trees?
- From: Jon Harrop
- Re: Red-black trees?
- From: Mark Wooding
- Re: Red-black trees?
- From: CBFalconer
- Re: Red-black trees?
- Prev by Date: Re: fast stable sort
- Next by Date: Re: Beginning Learning Computer Programming
- Previous by thread: Re: Red-black trees?
- Next by thread: Re: Red-black trees?
- Index(es):
Relevant Pages
|