Hi all, Is it possible to union/merge two immutable hash-maps in linear time? I could implement it myself if I could have linear time constructor of hashmap from a sorted list (and assuming converting hash-map->list is i) linear and ii) produces sorted list).
Regards, Alexey -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
