hash-tables using equal? very inefficient ?

From: Brian Denheyer <briand_at_deldotd.com>
Date: Fri, 12 Mar 1999 16:01:40 -0800 (PST)

I re-wrote one of the hash tables I was using so that it was using
string=? instead of equal?

This made a big difference in performance.

I was using a pair as a key and it looks as though, from looking at
the code, that using an equal? hash is very expensive in terms of key
calculation _and_ cons'ing.

Does this make sense ?

Received on Sat Mar 13 1999 - 01:03:21 CET

This archive was generated by hypermail 2.3.0 : Mon Jul 21 2014 - 19:38:59 CEST