Hello cafe,
My first Hackage upload is a pure Haskell QR Code library (
http://hackage.haskell.org/package/qrcode-0.1). This is intended to be a
full featured QR Code library with encoding and decoding and other advanced
features. Currently it can only do encoding but I figured it would be nice
to
; On Tue, Aug 9, 2011 at 9:47 AM, Chris Yuen wrote:
>
>>
>> - I was using GHC 32-bit. Int is 32-bit there, so I needed Int64. It turns
>> out 64-bit operations in 32-bit programs are just darn slow. Maybe it's a
>> Windows problem.
>
>
> No, GHC calls out to
You can probably just post your code as Gists in GitHub. They provide an
"embed" button to give you a
GHC so it shouldn't be
related to call-by-pointer problem? If this is the case, shouldn't we always
wrap a "go" function for **any** recursive functions?
Thanks!
Chris
On Tue, Aug 9, 2011 at 9:09 AM, Reiner Pope wrote:
> On 9 August 2011 10:06, Bryan O'Sullivan
so obscure to write
"correctly" in Haskell :P
Chris
On Mon, Aug 8, 2011 at 1:40 AM, Eugene Kirpichov wrote:
> What about using unsafe array indexing operations? (i.e. array `unsafeAt`
> index)
>
> 2011/8/7 Chris Yuen :
> > Here is an updated version using Data.Arr
Here is an updated version using Data.Array.Unboxed http://ideone.com/YXuVL
And the profile http://hpaste.org/49940
Still taking 5+ minutes...
Chris
On Sun, Aug 7, 2011 at 5:20 PM, Daniel Fischer <
daniel.is.fisc...@googlemail.com> wrote:
> On Sunday 07 August 2011, 10:52:20, Max Bolingbroke w
Hello Cafe,
I was trying to solve ITA Software's "Word Nubmers" puzzle (
http://www.itasoftware.com/careers/puzzle_archive.html) using a brute force
approach.
Here's a my version of a quick recap of the problem:
> A wordNumber is defined as
>
> wordNumber 1 = "one"
> wordNumber 2 = "onetwo"
> wo
