From: Martin J. <mar...@em...> - 2005-06-09 20:48:48
|
On Thu, 9 Jun 2005, Martin Jambon wrote: [...] > Plus maybe some specialized versions for efficiency and/or convenience. > > I am not sure if the gain in performance would be terrific, and Actually the union between a big and a small map could be quite fast if some subtrees can be kept unmodified and don't have to be scanned (shared between the arguments and the result). The algorithm in this case is close to the one which is used in Set, but scanning systematically each element on both maps given as arguments is a bit different. Martin -- Martin Jambon, PhD http://martin.jambon.free.fr |