Related articles |
---|
Masters course with compiler specialization jeremy.wright@microfocus.com (Jeremy Wright) (2002-11-12) |
Re: Masters course with compiler specialization jeremy.wright@microfocus.com (Jeremy Wright) (2002-12-07) |
Re: Masters course with compiler specialization Trevor.Jenkins@suneidesis.com (2002-12-11) |
Re: Masters course with compiler specialization etechweb@yahoo.com (2002-12-19) |
Size of hash tables was Re: Masters course with compiler specializat Trevor.Jenkins@suneidesis.com (2002-12-22) |
Re: Size of hash tables was Re: Masters course ... joachim_d@gmx.de (Joachim Durchholz) (2002-12-30) |
Re: Size of hash tables was Re: Masters course ... neeri@iis.ee.ethz.ch (Matthias Neeracher) (2003-01-04) |
Re: Size of hash tables was Re: Masters course ... bonzini@gnu.org (2003-01-04) |
Re: Size of hash tables was Re: Masters course ... stephan@stack.nl (Stephan Eggermont) (2003-01-07) |
From: | etechweb@yahoo.com (Sebastiano Pilla) |
Newsgroups: | comp.compilers |
Date: | 19 Dec 2002 12:41:25 -0500 |
Organization: | Compilers Central |
References: | 02-11-060 02-12-056 |
Keywords: | courses |
Posted-Date: | 19 Dec 2002 12:41:25 EST |
Trevor Jenkins <Trevor.Jenkins@suneidesis.com> wrote:
> If Hopgood continues to teach this module then you'll at least come
> out with the correct view that hash-tables based on the powers of 2
> are better than Maurer's gospel that such tables can only ever be
> absed on prime numbers.
Could you please expand on that? I don't think I'll have the opportunity
to attend Hopgood's course.
Sebastiano Pilla
Return to the
comp.compilers page.
Search the
comp.compilers archives again.