Efficient Map <-> Set conversions

We should be able to convert a Set into a Map without re-computation of the tree Shape. (initially proposed by John Meacham)

changed weight to 5

added Tfeature request Trac import core libraries labels

changed the description

This requires to move the tree structures to another module, so Set and Map can both see the structure.

Providing, toTree and "unsafeFromTree" would allow the user to implement his own algorithms.

This requires moving the raw tree types to their own module so Map can see Set structure and vice-versa. Note that this will be given for free if we move to A. Hey's AVL trees.

This ticket is resolved for the new AVL-based types.

assigned to @trac-jpbernardy

Trac metadata

Trac field	Value
Test case	- → N/A

changed milestone to %Not GHC

closed

The conversion functions should be proposed with the library submissions process: http://www.haskell.org/haskellwiki/Library_submissions

Trac metadata

Trac field	Value
Resolution	Unresolved → ResolvedWon'tFix

Trac metadata

Trac field	Value
Architecture	Unknown → Unknown/Multiple

Trac metadata

Trac field	Value
Operating system	Unknown → Unknown/Multiple

mentioned in commit bcfae08c

added Pnormal label