On Fri, Feb 8, 2013 at 10:24 AM, Ozgun Ataman ozata...@gmail.com wrote:
Which, thanks to Johan's help yesterday, can still be worked around (for
now) by starting ghci with:
ghci -package-conf ./cabal-sandbox/your-package-conf-folder-here/
You can indeed do this. For real ghci support in
Hi all,
Summer of code has always been a good way for us to get some important
work, that no one has time to do, done. I encourage everyone to come up
with good summer of code projects so we have a good number when the time
for students to apply comes around. Empirically projects that focus on
Hi,
On Saturday, February 16, 2013, yi huang wrote:
I' m curious about the design and trade offs behind the new IO manager. I
see two changes from the code:
1. Run IO manager thread on each capability.
2. Use ONESHOT flag to save a system call.
Is there other interesting things to know?
On Mon, Feb 25, 2013 at 4:30 AM, Nicolas Trangez nico...@incubaid.comwrote:
- cereal supports chunk-based 'partial' parsing (runGetPartial). It
looks like support for this is introduced in recent versions of 'binary'
as well (runGetIncremental)
Yes. Binary now support an incremental
On Mon, Feb 25, 2013 at 2:32 PM, Don Stewart don...@gmail.com wrote:
Cassava is quite new, but has the same goals as lazy-csv.
Its about a year old now -
http://blog.johantibell.com/2012/08/a-new-fast-and-easy-to-use-csv-library.html
I know Johan has been working on the benchmarks of late -
On Mon, Feb 25, 2013 at 4:51 PM, Alexander Solla alex.so...@gmail.comwrote:
On Mon, Feb 25, 2013 at 11:59 AM, Johan Tibell johan.tib...@gmail.comwrote:
There are some blog posts and comments out there about merging cereal
and binary, is this what's the goal/going on (cfr runGetIncremental
On Tue, Feb 26, 2013 at 11:17 PM, Vincent Hanquez t...@snarc.org wrote:
On Mon, Feb 25, 2013 at 11:59:42AM -0800, Johan Tibell wrote:
- cereal can output a strict bytestring (runPut) or a lazy one
(runPutLazy), whilst binary only outputs lazy ones (runPut)
The lazy one is more
On Mon, Mar 4, 2013 at 11:39 AM, Łukasz Dąbek sznu...@gmail.com wrote:
Thank you for your help! This solved my performance problem :)
Anyway, the second question remains. Why performance of single
threaded calculation is affected by RTS -N parameter. Is GHC doing
some parallelization behind
Hi Mateusz,
On Wed, Mar 6, 2013 at 4:58 PM, Mateusz Kowalczyk
fuuze...@fuuzetsu.co.ukwrote:
Can someone that has been around for a bit longer comment on what level
of experience with Haskell and underlying concepts is usually expected
from candidates? Are applications discarded simply based
[bcc: hask...@haskell.org]
We should make sure that we apply for Google Summer of Code this year as
well. It's been very successful in the previous year, where we have
gotten several projects funded every year.
-- Johan
-- Forwarded message --
From: Carol Smith car...@google.com
On Tue, Mar 19, 2013 at 3:58 PM, Christopher Done chrisd...@gmail.comwrote:
From the paper Fun with Type Funs, it's said:
One compelling use of such type functions is to make type
coercions implicit, especially in arithmetic. Suppose we want to be able
to
write add a b to add two numeric
I had a 5 second look at the PSQueue implementation and here's what I got
so far:
* fromList should use foldl'.
* LTree should be spine strict (i.e. strict in the (LTree k p) fields).
* Winner should be strict in the (LTree k p) field and probably in all
other fields as well.
This is a nice
Hi all,
Haddock's current markup language leaves something to be desired once
you want to write more serious documentation (e.g. several paragraphs
of introductory text at the top of the module doc). Several features
are lacking (bold text, links that render as text instead of URLs,
inline HTML).
On Thu, Apr 4, 2013 at 9:49 AM, Johan Tibell johan.tib...@gmail.com wrote:
I suggest that we implement an alternative haddock syntax that's a
superset of Markdown. It's a superset in the sense that we still want
to support linkifying Haskell identifiers, etc. Modules that want to
use the new
Would it be too much to ask that a notation be used which has
a formal syntax and a formal semantics?
We will document our superset, sure. That's what others did as well.
The point is using Markdown as the shared base.
___
Haskell-Cafe mailing list
Thanks for working on this again this year!
On Mon, Apr 8, 2013 at 12:50 PM, Edward Kmett ekm...@gmail.com wrote:
We (haskell.org) have been officially accepted into the Google Summer of
Code for 2013. We should show up in the mentoring organization list as soon
as I get some information we
On Tue, Apr 9, 2013 at 12:40 PM, Joe Nash joen...@blackvine.co.uk wrote:
I would be interested in discussing this project with a potential mentor if
one happens to be reading. I'm a second year Computer Science student at the
University of Nottingham, very interested in doing a haskell.org SoC
Hi Ben,
On Thu, Apr 25, 2013 at 7:46 PM, Ben Lippmeier b...@ouroborus.net wrote:
The Repa plugin will also do proper SIMD vectorisation for stream programs,
producing the SIMD primops that Geoff recently added. Along the way it will
brutally convert all operations on boxed/lifted numeric
On Thu, Apr 25, 2013 at 10:30 PM, Andrew Cowie
and...@operationaldynamics.com wrote:
On Thu, 2013-04-25 at 21:15 -0700, Johan Tibell wrote:
{-# LANGUAGE Strict #-}
God, I would love this. Obviously the plugin approach could do it, but
could not GHC itself just _not create thunks_ for things
On Thu, Apr 25, 2013 at 9:20 PM, Ben Lippmeier b...@ouroborus.net wrote:
On 26/04/2013, at 2:15 PM, Johan Tibell wrote:
Hi Ben,
On Thu, Apr 25, 2013 at 7:46 PM, Ben Lippmeier b...@ouroborus.net wrote:
The Repa plugin will also do proper SIMD vectorisation for stream programs,
producing
Hi Adam,
Since we have already had *very* long discussions on this topic, I'm
worried that I might open a can of worms be weighing in here, but the issue
is important enough to me that I will do so regardless.
Instead of endorsing one of the listed proposals directly, I will emphasize
the
Sounds like a good idea. Go ahead and apply. :)
On Tue, Apr 30, 2013 at 2:46 AM, Martin Ruderer martin.rude...@gmail.comwrote:
Hi,
I am proposing a GSoC project on Cabal. It aims to open up the dependency
solver
for debugging purposes.
The details are here:
I filed a bug a while back:
http://ghc.haskell.org/trac/ghc/ticket/7752
Someone that understands the API needs to fix the doc. :)
On Thu, Jul 18, 2013 at 7:58 PM, John Blackbox
blackbox.dev...@gmail.com wrote:
Hi!
Please take a look here:
On Tue, Jul 23, 2013 at 5:45 PM, Ben Gamari bgamari.f...@gmail.com wrote:
Justin Paston-Cooper paston.coo...@gmail.com writes:
Dear All,
Recently I have been doing a lot of CSV processing. I initially tried to
use the Data.Csv (cassava) library provided on Hackage, but I found this to
still
July 2013 22:13, Johan Tibell johan.tib...@gmail.com wrote:
On Tue, Jul 23, 2013 at 5:45 PM, Ben Gamari bgamari.f...@gmail.com
wrote:
Justin Paston-Cooper paston.coo...@gmail.com writes:
Dear All,
Recently I have been doing a lot of CSV processing. I initially tried
to
use
in constant memory. My
programme instead quickly approaches full memory use. Is there any way to
work around this?
Justin
On 25 July 2013 17:53, Johan Tibell johan.tib...@gmail.com wrote:
You can use the Incremental or Streaming modules to get more fine
grained control over when new parsed
Hi,
Cabal 1.18 is still in the release candidate stage so it has in fact not
been released yet. We could either bump the dependency on base to 4.8
before the 1.8 release or we could make a Cabal-1.8.0.1 release together
with the GHC release that bumps the dependency.
-- Johan
On Wed, Aug 28,
A good starting point is to estimate how much space you think the data
should take using e.g.
http://blog.johantibell.com/2011/06/memory-footprints-of-some-common-data.html
If you do that, is the actual space usage close to what you expected?
On Thu, Aug 29, 2013 at 5:35 PM, Kyle Hanson
:
https://github.com/haskell/cabal/compare/cabal-install-v1.16.0.2...cabal-install-v1.18.0
(only shows the last 250 commits).
57 people contributed to this release!
503 Mikhail Glushenkov
99 Johan Tibell
41 Duncan Coutts
39 Ian Lynagh
19 Brent Yorgey
19 Thomas
I pasted your report into the bug tracker:
https://github.com/haskell/cabal/issues/1478
I don't know if you're on GitHub or not so I could link the report to your user.
On Thu, Sep 5, 2013 at 8:16 AM, Rogan Creswick cresw...@gmail.com wrote:
I ran into another oddity due to old build artifacts
Hideyuki Tanaka was missing from the list of contributors (his patch was
applied through me). His contribution made 'cabal update' faster!
On Wed, Sep 4, 2013 at 2:11 PM, Johan Tibell johan.tib...@gmail.com wrote:
Hi all,
On behalf of the cabal maintainers and contributors I'm proud
I don't think so. Perhaps we should set one. What's your use case? Perhaps
you could describe it in a new bug report at
https://github.com/haskell/cabal/issues
On Mon, Sep 9, 2013 at 7:29 PM, satvik chauhan mystic.sat...@gmail.comwrote:
Hi cafe,
I wanted to ask this as I couldn't find this
Hi,
It depends on what you mean by doesn't parse. From your message is assume
the CSV is valid, but some of the actual values fails to convert (using
FromField). There are a couple of things you could try:
1. Define a newtype for your field that calls runParser using e.g. the Int
parser and if
Whatever guarantees GHC offers (e.g. using Safe Haskell), I would always
run things like these in a sandbox. It's much better for security to
dissallow everything and then whitelist some things (e.g. let the sandbox
communicate with the rest of the world in some limited way) than the other
way
501 - 534 of 534 matches
Mail list logo
