Chaddaï Fouché wrote:
IOUArray Bool exists, and is even a bits array in reality (which makes
it really efficient), is there any reason that DiffUArray Bool can't
exist ?
No good reason that I can think of, no.
Cheers,
Simon
___
After reading your email i went to the discussion of IArray
on the haskell
doc page
(http://www.haskell.org/ghc/docs/latest/set/sec-iarray.html) and
am somewhat disturbed by it. There is the introduction of
the following
class:
class HasBounds a where
bounds :: Ix ix = a ix e -
Just a quick follow-up that I meant to say in that last email. For
instance, I think it would be reasonable to define tuples as instances of
a HasBounds class, but that's not possible with the current
definition. With my definition, I'd write:
instance HasBounds (a,b) Int where { bnds _ =
