> "Benjamin" == Benjamin Franksen <[EMAIL PROTECTED]> writes:
Benjamin> Bulat Ziganshin wrote:
>> Friday, November 24, 2006, 7:32:55 PM, you wrote:
>> Josef Svenningsson posted a comment on my blog today that got me to
>>> thinking. He suggested that people may be "intimidated by the
>>> size
An updated version of the Glade tutorial for Haskell & Gtk2Hs is now
available on the Gtk2Hs website:
http://haskell.org/gtk2hs/docs/tutorial/glade/
This is of course linked from the documentation page on the Gtk2Hs site:
http://haskell.org/gtk2hs/documentation/#tutorials
Thanks very much to Ed
"Ken Takusagawa" <[EMAIL PROTECTED]> writes:
> Is there a Haskell implementation of an efficient priority queue
> (probably heap-based) out there that I can use? I do not see it in
> the GHC libraries.
ISTR Okasaki's algorithms book has a suitable one.
-- Mark
_
On Sun, Nov 26, 2006 at 04:58:13PM -0500, Ken Takusagawa wrote:
> Is there a Haskell implementation of an efficient priority queue
> (probably heap-based) out there that I can use? I do not see it in
> the GHC libraries.
As already mentioned, there are several in Edison. If you want to roll
your
Ken Takusagawa wrote:
> Is there a Haskell implementation of an efficient priority queue
> (probably heap-based) out there that I can use? I do not see it in
> the GHC libraries.
Unfortunately the base package contains only the specialized Data.Sequence
and not the general annotated 2-3 finger tr
Bulat Ziganshin wrote:
> Friday, November 24, 2006, 7:32:55 PM, you wrote:
>> Josef Svenningsson posted a comment on my blog today that got me to
>> thinking. He suggested that people may be "intimidated by the size of
>> MissingH, confused by the undescriptive name, and don't quite know what's
>>
I recommend the Edison library, which has several heap implementations.
http://www.eecs.tufts.edu/~rdocki01/edison.html
Cheers,
Spencer Janssen
On Nov 26, 2006, at 3:58 PM, Ken Takusagawa wrote:
Is there a Haskell implementation of an efficient priority queue
(probably heap-based) out there
Is there a Haskell implementation of an efficient priority queue
(probably heap-based) out there that I can use? I do not see it in
the GHC libraries.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Quoth Bulat Ziganshin, nevermore,
> while i personally prefer to read source code and fascinated with
> quality of code documenting in your lib, most peoples prefer to read
> Haddocks, which again should be made available on web
I just thought I should point out, cos there appears to be some
confu
You could also look at http://darcs.haskell.org/crypto/Data/LargeWord.hs but
it would need modifying to produce a 33 bit word.
Dominic.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello John,
Friday, November 24, 2006, 7:32:55 PM, you wrote:
> Josef Svenningsson posted a comment on my blog today that got me to
> thinking. He suggested that people may be "intimidated by the size of
> MissingH, confused by the undescriptive name, and don't quite know what's
> in there." An
> Yesterday evening I had a go at porting Bob Jenkins' hash function
> (http://www.burtleburtle.net/bob/c/lookup3.c) to Haskell.
If you need hash functions, I hope that you don't need them to become a
hash table necromancer: this dark data structure simply does not fit
well into Haskell. Tries are
don, i am glad you raised this point, i was going to write a note to
this list soon with a similar request
i would suggest comparing perldoc to haddock and other haskell
documentation tools.
generally speaking, i find that documentation for perl libraries is
written as if the author is enthusiast
su, 2006-11-26 kello 15:12 +1100, Ivan Tomac kirjoitti:
> The first version I came up with ran 20 times slower than C.
> Thanks to Don Stewart's suggestions on IRC, I managed to improve the
> ...
> Options used to compile the version using the hash function written
> in Haskell:
> ghc -O -funb
Ok, With your example I realized that I don't write the type signature
declaration of anything. Without the type Haddock don't put the
comments from code in the generated doc. Now it works.
Thanks. Luis
On 11/26/06, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
It appears to be an error in cu
15 matches
Mail list logo
