Carsten Hey wrote: > The above can easily be adapted to use only two times of the original > memory, even without an ordered hash:
Thanks. I think this is sufficient; probably in practice an ordered hash uses a certian amount of extra memory for bookkeeping. > I'll send an update after being able to measure the memory usage of > a simple implementation in C. I'd rather avoid dealing with custom hash tables in C. -- see shy jo
signature.asc
Description: Digital signature
