[GHC] #969: Inconsistent complexities in Data.Set

[GHC]

#969: Inconsistent complexities in Data.Set
-----------------------------------+----------------------------------------
    Reporter:  dpt at bostoncoop.net  |       Owner:         
        Type:  bug                 |      Status:  new    
    Priority:  normal              |   Milestone:         
   Component:  libraries/base      |     Version:  6.6    
    Severity:  minor               |    Keywords:         
  Difficulty:  Unknown             |    Testcase:         
Architecture:  Unknown             |          Os:  Unknown
-----------------------------------+----------------------------------------
The documentation for Data.Set says that 'insert' can be performed in time
 O(log n).  On the other hand, the same operation can also be done with
 'singleton' followed by 'union', for a claimed complexity of O(n), which
 doesn't seem credible.

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/969>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler