[Gllug] Faster maths?

[Adrian McMenamin]

On Sat, 2007-03-10 at 01:20 +0000, Nix wrote:
> On 9 Mar 2007, Adrian McMenamin stated:
> 
> > On Fri, March 9, 2007 12:03 pm, Andy Farnsworth wrote:
> >> Adrian McMenamin wrote:
> >>> Is hashing in perl really that slow?
> >>>
> >> Hashing in perl has been highly optimized.  I have used hashes on the
> >> order of a million entries and it has worked extremely quickly (<1
> >> second for 1000 lookups).  The only real issue is if you start to get a
> >> very large number of hash collisions, then it may slow down.
> >
> > There should be no clashes. Though this is about adding an entry to the
> > hash rather than a lookup.
> 
> I can't see how you can possibly be sure that there will be no hash
> collisions. (Of course hash collisions do not mean colliding *keys*!)
> 
Yes, I realised that after I sent it - oh well, made a fool of when
playing with the bigger boys again :-)

Yes, I have lots of colliding keys...

-------------- next part --------------
-- 
Gllug mailing list  -  Gllug at gllug.org.uk
http://lists.gllug.org.uk/mailman/listinfo/gllug