Re: FiniteMap

Malcolm Wallace <[email protected]> Tue, 5 Sep 2006 14:59:21 +0100

Newsgroups	gmane.comp.lang.haskell.cvs.hugs
Organization	Dept of Computer Science, University of York
Message-ID	<20060905145921.7b04879e.Malcolm.Wallace__10691.6734636345$1157464783$gmane$org@cs.york.ac.uk>

Ross Paterson <[email protected]> wrote:

> Why not do it the other way round:
> 
> #if __GLASGOW_HASKELL__ >= 604 || __NHC__ >= 118 || defined(__HUGS__)
> -- Data.Map, if it is available
> import Prelude hiding (lookup)
> import Data.Map (Map, lookup, fromList)
> #else

Fair enough.  Like I say, these lookup structures are not critical.  For
many simple XML documents, ordinary lists might actually be faster for
lookups, despite their worse asymptotic complexity...

Does this mean you can re-instate HaXml as a package built by default
with Hugs?

Regards,
    Malcolm