| From: Henk Boom (lunarc.lists at gmail.com) Date: Tue Apr 8 02:44:48 EDT 2008  | 
  | 
On 07/04/2008, Matthew Flatt <mflatt at cs.utah.edu> wrote: > Immutable hash-table update will be constant time. (Well, O(lg n), but > the constant will be so small that it's effectively O(n).) Mutable > hash-table update would be O(n). You mean "the constant will be so small that it's effectively O(1)," right? Henk
| Posted on the users mailing list. | 
  |