Ticket #667 (closed feature request: wontfix)

Opened 7 years ago

Last modified 5 years ago

Efficient Map <-> Set conversions

Reported by: jpbernardy Owned by: jpbernardy
Priority: normal Milestone: Not GHC
Component: libraries/base Version: 6.4.1
Keywords: Data Map Set collections Cc:
Operating System: Unknown/Multiple Architecture: Unknown/Multiple
Type of failure: Difficulty: Unknown
Test Case: N/A Blocked By:
Blocking: Related Tickets:

Description (last modified by jpbernardy) (diff)

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

Change History

Changed 7 years ago by jpbernardy

  • keywords collections added

Changed 7 years ago by jpbernardy

  • description modified (diff)

Changed 7 years ago by jpbernardy

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.

Changed 7 years ago by jpbernardy

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.

Changed 7 years ago by jpbernardy

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

Changed 7 years ago by jpbernardy

  • owner set to jpbernardy
  • status changed from new to assigned

Changed 7 years ago by igloo

  • testcase set to N/A
  • milestone set to 6.8

Changed 6 years ago by simonmar

  • milestone changed from 6.8 branch to Not GHC

Changed 5 years ago by igloo

  • status changed from assigned to closed
  • resolution set to wontfix

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

Changed 5 years ago by simonmar

  • architecture changed from Unknown to Unknown/Multiple

Changed 5 years ago by simonmar

  • os changed from Unknown to Unknown/Multiple
Note: See TracTickets for help on using tickets.