[GHC] #14762: Foreign.Marshal.Pool functions use inefficient O(n) operations

[GHC]

#14762: Foreign.Marshal.Pool functions use inefficient O(n) operations
-------------------------------------+-------------------------------------
        Reporter:  nh2               |                Owner:  sighingnow
            Type:  bug               |               Status:  new
        Priority:  normal            |            Milestone:
       Component:  libraries/base    |              Version:  8.2.2
      Resolution:                    |             Keywords:
Operating System:  Unknown/Multiple  |         Architecture:
 Type of failure:  Runtime           |  Unknown/Multiple
  performance bug                    |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by sighingnow):

 Replying to [comment:1 bgamari]:
 > Sounds reasonable to me. Patches welcome!

 I'm willing to do the job. There's no tree data structure defined in base,
 could I add a minimal heap implementation in `Foreign/Marshal/Pool.hs` to
 support this patch ?

-- 
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/14762#comment:3>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler