less, it takes
forever to compute even `p 20'. What's wrong? (I even tried using a
strict container along the lines of `N !Rational' for storing the results
of `p' and `q'. It didn't help.)
The program seems to work correctly for small values of `k', by
verloading
(destructive vs. non-destructive) for functions which also seems an
interesting research area.
Regards,
-- Lajos Nagy
Computer Science Ph.D. Student, Florida Institute of Technology
___
Glasgow-haskell-users mailing list
Glasgow-has
ct the operations to insert and lookup then
ER is restored. (And those two operations is all I
need.)
I tried several ways of implementing it but those
monadic types just kept cropping up in the map interface.
I'd appreciate any ideas or pointers.
Regards,
Lajos Nagy
inition of `fmap': fmap f s = Data.Set.map f s
In the definition for method `fmap'
In the instance declaration for `Functor Data.Set.Set'
On the other hand, it seems intuitively natural to make Set an instance of
fmap. Any ideas on how to do