On Sat, Jun 07, 2003 at 08:24:41PM -0500, Stecher, Jack wrote:
It sounds like you're on the right track...
You could get a moderately more efficient implementation by keeping
the active list as a heap rather than a list.
I had thought about that, and took the BinomialHeap.hs file from
At 18:44 05/06/03 +0100, Liyang HU wrote:
I'd just about figured the ShowS idea, but I've yet to get a handle on
this
idea of [a] 'monoid'.
Might http://www.engr.mun.ca/~theo/Misc/haskell_and_monads.htm be of any
help?
Ah, thanks. I see:
[[
A monoid is an algebraic structure consisting of a
Hi!
Is there any easy way to display an IO String with Fudgets?
I know how to display a String:
import Fudgets
main :: IO ()
main = fudlogue (shellF Prog showMe)
showMe = (Hello `labLeftOfF` displayF) ==
mapF getString == (buttonF ClickMe!)
getString :: Click - String
In article [EMAIL PROTECTED],
Thomas Hallgren [EMAIL PROTECTED] wrote:
The fudget library was designed before Haskell switched to monadic IO,
and there is still no support for combining arbitrary monadic IO and
fudgets.
Would it be worth rewriting Fudgets to take advantage of such recent
