Hi,
2012/2/23 Maxime Henrion
>
> > * Why do you have the instance:
> >
> > instance GDeepSeq V1 where grnf _ = ()
> >
> > The only way to construct values of a void type is using ⊥. And I
> > would expect that rnf ⊥ = ⊥, not (). I think the best thing is to just
> > remove the V1 instance.
>
> T
So I started working on moving JuicyPixels to a streaming interface, and
have some observations. This is going to be a pretty major change, touching
pretty much every function, and the end result will end up looking very
close to the code that I have already written. I'm not nearly as close to
the
On 2/23/12 10:22 PM, Clark Gaebel wrote:
The situation I encounted this is doing a batch update of a map. Is there
an easy way to do that? I'm doing something like adding 20-or-so elements
to an existing map of a few thousand.
The O(m+n) of the merging functions is actually on the order of the
The situation I encounted this is doing a batch update of a map. Is there
an easy way to do that? I'm doing something like adding 20-or-so elements
to an existing map of a few thousand.
On Thu, Feb 23, 2012 at 10:13 PM, wren ng thornton wrote:
> On 2/23/12 9:16 PM, Clark Gaebel wrote:
>
>> Lookin
Hello all,
I posted a minor update to unix-bytestring a few days ago in order to
deal with the Num not implying Eq thing in GHC 7.4, but it looks like
the documentation still hasn't been made (nor the built-on field).
Are the Hackage builders down intentionally since the recent crash, or
acc
I though it might work without it, but I get the error I mentioned:
cabal: Error: some packages failed to install:
network-2.3.0.10 failed during the configure step. The exception was:
ExitFailure 1
Well, I'll try with msys. Thanks for your time!
___
Ha
On 2/23/12 9:16 PM, Clark Gaebel wrote:
Looking at IntMap's left-biased 'union' function [1], I noticed that the
complexity is O(n+m) where n is the size of the left map, and m is the size
of the right map.
Since insertion [2] is O(min(n, W)) [ where W is the number of bits in an
Int ], wouldn't
Hey all,
I'm gathering usage data on my main FOSS projects, to help me prioritize and
steer them. I've prepared a short survey, 10 optional questions that should
take 1-5 minutes per project. If you use any of these projects and/or would
like them to continue, you can help a lot by adding your
LLVM has a .net and JVM code generator. I don't think it is production ready
yet. GHC can generate code via LLVM. So in theory one could run on either VM.
However, see the "Why isn't GHC available ..." link below. The GC and library
integration would require lot's of work. Good senior project
Hello,
> Looking at IntMap's left-biased 'union' function [1], I noticed that the
> complexity is O(n+m) where n is the size of the left map, and m is the size of
> the right map.
>
> Since insertion [2] is O(min(n, W)) [ where W is the number of bits in an Int
> ], wouldn't it be more efficient
Looking at IntMap's left-biased 'union' function [1], I noticed that the
complexity is O(n+m) where n is the size of the left map, and m is the size
of the right map.
Since insertion [2] is O(min(n, W)) [ where W is the number of bits in an
Int ], wouldn't it be more efficient to just fold 'insert
On 24 February 2012 01:01, Joey Adams wrote:
> On Wed, Feb 22, 2012 at 10:23 PM, Johan Tibell wrote:
>> But the network package doesn't try to let you work with raw file
>> descriptors elsewhere (e.g. send and recv.) I'm not saying that
>> functions on Fds aren't useful, they are, just that the n
On Thu, 2012-02-23 at 23:45 +0100, Maxime Henrion wrote:
> On Thu, 2012-02-23 at 23:24 +0100, Bas van Dijk wrote:
> > * Why do you have the instance:
> >
> > instance GDeepSeq V1 where grnf _ = ()
> >
> > The only way to construct values of a void type is using ⊥. And I
> > would expect that rnf
On Thu, 2012-02-23 at 23:24 +0100, Bas van Dijk wrote:
> On 23 February 2012 22:09, Maxime Henrion wrote:
> > On Sun, 2012-02-19 at 21:06 +0100, Bas van Dijk wrote:
> >> On 19 February 2012 18:11, Maxime Henrion wrote:
> >> > I'm guilty of not having preserved the "rnf :: a -> ()"
> >> > function
On 23 February 2012 22:09, Maxime Henrion wrote:
> On Sun, 2012-02-19 at 21:06 +0100, Bas van Dijk wrote:
>> On 19 February 2012 18:11, Maxime Henrion wrote:
>> > I'm guilty of not having preserved the "rnf :: a -> ()"
>> > function as the class function though, it's a wrapper around "deepseq"
>>
2012/2/23 Maxime Henrion :
> According to criterion, the performance of the old generic-deepseq code
> was 6 to 7 times worse than that of the deepseq package. After switching
> the class function to rnf, it got on par, if not better than the deepseq
> package. I'm saying "if not", because I've obs
Hi all,
I'm reading the haskellwiki article on multiplate. Is it possible to
modify the getVariablesPlate example to return the free variables?
One idea I had is to store an environment in a reader monad, and use
local to update the environment at a let expression. Couldn't figure
it out, though.
A more subtle issue is that there's some sort of memory leak that arises
when you can't instruct the GC to follow projection functions of data
types. I believe the GHC heap representation has a built-in notion of these
forwarding closures and the GC follows them when possible, but most VM GCs
are j
On Wed, Feb 22, 2012 at 10:23 PM, Johan Tibell wrote:
> But the network package doesn't try to let you work with raw file
> descriptors elsewhere (e.g. send and recv.) I'm not saying that
> functions on Fds aren't useful, they are, just that the network
> package is the wrong place for them. I'd p
There are some substantial technical challenges:
http://www.haskell.org/haskellwiki/GHC:FAQ#Why_isn.27t_GHC_available_for_.NET_or_on_the_JVM.3F
Not that it can't be done, but there's nothing ready yet.
Tom (IRC: amindfv)
On 2/23/12, ARJANEN Loïc Jean David wrote:
> Hello,
>
> Does any one kno
I have uploaded a new version of cabal-file-th which bumps the Cabal upper
bound to avoid difficulties with GHC 7.4.
Best - Simon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
The UHC can compile to JVM[1, 2], but the backend is far from production-ready.
Also, I don't believe anyone is working on the backend currently.
Jurriën
[1] http://www.cs.uu.nl/wiki/bin/view/Ehc/Documentation
[2] http://www.cs.uu.nl/groups/ST/Projects/ehc/ehc-jazy-doc.pdf
On 23 Feb 2012, at 1
Thank you. I have specified addrSocketType. And now it works.
23 февраля 2012 г. 13:17 пользователь iquiw написал:
> I suppose you need to specify addrSocketType (usually Stream or
> Datagram) for defaultHints.
>
> Although it seems it is not required on recent versions of FreeBSD (>=
> 8.x?),
>
Hello,
Does any one knows of an Haskell compiler targeting the JVM ? And of one
targeting the .Net virtual machine ?
Regards,
ARJANEN Loïc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of opening and closing is not statically known:
>> it is decided on values read from the files.
>>
>> So, Faucelme's question can be answered in affirmative using the
>> existing RegionIO library (which, as has been shown, well integrates
>> with Iteratees). There is a
I suppose you need to specify addrSocketType (usually Stream or
Datagram) for defaultHints.
Although it seems it is not required on recent versions of FreeBSD (>= 8.x?),
I think it is better to specify addrSocketType always.
# sorry, I forgot CC to haskell-cafe.
On Wed, Feb 22, 2012 at 8:26 PM,
Dear all,
it's time again for our monthly Haskell meeting in Munich. If you plan
to join us on Tuesday, 28th of February at Cafe Puck in Munich at 19h30,
please go to:
http://www.haskell-munich.de/dates
and hit the button. This will help us to reserve tables.
With hope to meet many of you,
Hi, so there are different regions libraries?
Is there a shootout comparing them, possibly also with ResourceT from
conduit (which has also been implemented in a stand-alone package
http://hackage.haskell.org/package/resource-simple-0.1 by Robin Banks), for
I take it it tries to respond to the same
28 matches
Mail list logo
