Optimized IntMap / IntSet construction from sorted input
Currently the "fromAscList" functions for building IntMaps and IntSets are aliases for fromList. Building a trie in linear time from sorted input is not magic, and results in a considerable performance increase. See this post:
http://www.haskell.org/pipermail/libraries/2008-May/009685.html
My impression was that the list generally approved of the patch, but for some reason its never been applied so I'm creating a ticket for it here. Tests are included in the patch. Really it just modifies an existing test (which was fromAscList xs == fromList xs) so that it's no longer vacuous.
Trac metadata
| Trac field | Value |
|---|---|
| Version | 6.8.3 |
| Type | Bug |
| TypeOfFailure | OtherFailure |
| Priority | normal |
| Resolution | Unresolved |
| Component | libraries (other) |
| Test case | |
| Differential revisions | |
| BlockedBy | |
| Related | |
| Blocking | |
| CC | |
| Operating system | |
| Architecture |