Revised draft available David Van Horn (09 May 2005 15:04 UTC)
Optional arguments Jens Axel Søgaard (09 May 2005 15:10 UTC)
Time complexity Jens Axel Søgaard (09 May 2005 15:26 UTC)

Time complexity Jens Axel Søgaard 09 May 2005 15:26 UTC

The abstract says

   "Hash tables have no intrinsic order for these associations, and
    allow key lookup and destructive updating in amortised constant time."

but as described in the section on hashing, it is a requirement is that
the hash function is good for the equivalence predicate associated with
the hash table.

How about adding "provided a good hash functions is used"?

--
Jens Axel Søgaard