On Mon, Jul 22, 2013 at 4:00 PM, Manuel Gómez tar...@gmail.com wrote:
* I could sacrifice relational integrity and store the expression
serialized, perhaps as an AST represented in JSON or somesuch —
although the rest of the data model is a rather traditional,
normalized relational schema,
Are you using `cabal haddock` or calling haddock manually?
Cheers,
On Fri, Jul 12, 2013 at 3:25 PM, Evan Laforge qdun...@gmail.com wrote:
So haddock ignores {-# LANGUAGE CPP #-}, which makes it crash on any
file that uses it. But if you pass --optghc=-cpp, it runs CPP on
everything, which
...@gmail.com wrote:
I'm calling haddock myself. Cabal might have some special magic for CPP,
when I searched for haddock CPP I got some old bugs about adding cabal
support. So presumably it's possible.
On Jul 12, 2013 1:15 PM, Felipe Almeida Lessa felipe.le...@gmail.com
wrote:
Are you using `cabal
On Thu, Jul 11, 2013 at 10:56 AM, Michael Snoyman mich...@snoyman.com wrote:
The only
approach that handles the situation correctly is John's separate thread
approach (tryAll3).
I think you meant tryAll2 here. Got me confused for some time =).
Cheers,
--
Felipe.
Well, you could use p's type for something.
let x | foo (undefined `asTypeOf` x) = 3
foo _ = True
in x
Arguably not very useful. It seems to me that the most compelling
rationale is being consistent with the cases where, instead of being a
data type, p is a function. Even so most of
Hey!
I'd like to announce a new version of the esqueleto package [0].
Besides SELECTs, UPDATEs, DELETEs and simple INSERTs, now esqueleto
supports INSERT FROMs as well. We hope that esqueleto will be able to
fulfill most of your SQL querying needs. This new feature was
contributed by Sam
On Thu, Jun 27, 2013 at 11:18 PM, Marc Weber marco-owe...@gmx.de wrote:
Excerpts from David Fox's message of Fri Jun 28 04:04:59 +0200 2013:
So you will get modules Start.A, Start.B and Start.C. If there are
But that's very unlikly what the programmer wants. I mean I might want
Types and
On Mon, Jun 24, 2013 at 11:32 PM, Mark Lentczner
mark.lentcz...@gmail.com wrote:
(apologies for keeping this tangential topic alive for so long... but it is
the cafe... and it is all for a good Haskell related cause...)
...
Ah, the indomitable Mr. Parker, we meet again! While the other console
I leave my terminal with the default font that comes with Ubuntu,
mainly because sometimes I like to enlarge its size effortlessly.
OTOH, on emacs I use GohuFont-10, which is quite nice. I'm not on a
retina display though.
Cheers,
On Mon, Jun 24, 2013 at 12:18 PM, Tobias Dammers
Brent, maybe I'm misunderstanding what you're saying, but I don't
think that the order of the arguments is playing any role here besides
defining the order in which the pattern matches are desugared.
To illustrate,
-- This does work
foo1' :: a - Foo a - Int
foo1' m Foo = case m of
Prelude 10 `mod` 256
0
So [1..10] == [1..0].
Cheers,
On Thu, May 16, 2013 at 6:15 PM, Jose A. Lopes jose.lo...@ist.utl.pt wrote:
Hello everyone,
I was playing with Word8 and list comprehensions and
the following examples came up. I have to admit the
behavior looks quite
I do think it's a real problem even for seasoned haskellers. I don't have
problems in remembering which packages I should use for the things I've
already used before recently, but I need to search Hackage just as everyone
else as soon as I need to do something new.
I also agree that this is more
Just checking the repo wouldn't work. It may still have some activity
but not be maintained and vice-versa.
On Sun, May 5, 2013 at 2:19 PM, Doug Burke dburke...@gmail.com wrote:
On May 5, 2013 7:25 AM, Petr Pudlák petr@gmail.com wrote:
Hi,
on another thread there was a suggestion which
/libraries/base/Control-Exception.html#g:14
On Mon, Apr 15, 2013 at 5:25 PM, Bertram Felgenhauer
bertram.felgenha...@googlemail.com wrote:
Felipe Almeida Lessa wrote:
I have some code that is not behaving the way I thought it should.
The gist of it is
sleeper =
mask_
Hey!
I have some code that is not behaving the way I thought it should.
The gist of it is
sleeper =
mask_ $
forkIOWithUnmask $ \restore -
forever $
restore sleep `catch` throwBack
throwBack (Ping tid) = myThreadId = throwTo tid . Pong
throwBack (Pong tid) =
Control.Exception fits the bill.
Thanks, =)
[1]
http://www.haskell.org/ghc/docs/latest/html/libraries/base/Control-Exception.html#g:14
On Mon, Apr 15, 2013 at 5:25 PM, Bertram Felgenhauer
bertram.felgenha...@googlemail.com wrote:
Felipe Almeida Lessa wrote:
I have some code that is not behaving the way I
Quick tip: did you try using withSocketsDo[1]?
[1]
http://hackage.haskell.org/packages/archive/network/2.4.1.2/doc/html/Network.html#g:2
On Thu, Mar 28, 2013 at 5:00 PM, Lars Kuhtz hask...@kuhtz.eu wrote:
Hi,
I'd like to know what is wrong with the following program on windows8 (GHC
7.4.2,
On Wed, Feb 20, 2013 at 9:20 PM, Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com wrote:
My (getting-long-in-the-tooth-and-could-do-with-a-rewrite) SourceGraph
package does identify these definitions.
What a coincidence, then! I was trying to use SourceGraph for other
reasons but it didn't work
Hey!
GHC warns me about unused definitions in a module. However, is it
possible to warn me about unused definitions in a package?
For example, suppose that module A exports function f and that module
B uses A.f (everything on a single package). However, after some time
B stops using A.f. Is
On Wed, Feb 13, 2013 at 4:32 PM, Joachim Breitner
m...@joachim-breitner.de wrote:
No. But there are currently no packages that depend on both base and io,
and anyone adding a dependency on io would remove the base dependency at
the same time.
hmm, that reminds me of how haskell98 was handled,
On Mon, Feb 4, 2013 at 7:45 PM, Ben Doyle
benjamin.peter.do...@gmail.com wrote:
General advice on speeding compilation is here: [2].
Its first advice should already be enough to give you something
usable. Call cabal configure with the --disable-optimization flag and
see if it helps.
Cheers, =)
I guess you could use the Flush datatype [1] depending on how your
data is generated.
Cheers,
[1]
http://hackage.haskell.org/packages/archive/conduit/0.5.4.1/doc/html/Data-Conduit.html#t:Flush
On Fri, Feb 1, 2013 at 6:28 AM, Simon Marechal si...@banquise.net wrote:
On 01/02/2013 08:21,
Everything that Johan Tibell said + you may be interested in the
resourcet package [1] (which is used by conduit to handle resources).
Cheers,
[1] http://hackage.haskell.org/package/resourcet
On Tue, Jan 29, 2013 at 8:59 PM, Thiago Negri evoh...@gmail.com wrote:
`Control.Exception.bracket` is
. :)
The resources I need to keep around are the objects used for the simulation.
Do you recomend using resourcet to handle this or something else?
Thanks.
2013/1/30 Felipe Almeida Lessa felipe.le...@gmail.com
Everything that Johan Tibell said + you may be interested in the
resourcet package [1] (which
IMHO Hackage and Cabal should support package signing even if they
aren't package managers.
On Wed, Jan 30, 2013 at 6:59 PM, Joachim Breitner nome...@debian.org wrote:
Hi,
Am Mittwoch, den 30.01.2013, 11:27 -0800 schrieb Edward Z. Yang:
https://status.heroku.com/incidents/489
Unsigned
Do you mean the Cabal User Guide?
http://www.haskell.org/cabal/users-guide/
On Sun, Jan 27, 2013 at 1:07 PM, Richard Cobbe co...@ccs.neu.edu wrote:
I'm not able to access the cabal manual today: links to my local copy and
links to the copy at haskell.org result in a 404.
I'm running the
Herbert Valerio actually pointed out to me in PVT that funnily enough
I've actually *forgotten* and *rediscovered* this idiom! =)
http://www.haskell.org/pipermail/libraries/2011-November/017257.html
Cheers!
On Sat, Jan 26, 2013 at 5:43 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote
For someone as lazy as myself:
http://hackage.haskell.org/package/hslogstash
https://github.com/bartavelle/hslogstash
Cheers,
On Fri, Jan 25, 2013 at 2:48 PM, Simon Marechal si...@banquise.net wrote:
This is a library for sysadmins and/or tool writers. It provides proper
types and correct
Em 23/01/2013 04:03, John Wiegley jo...@fpcomplete.com escreveu:
I'll ask Ross Paterson to deprecate monad-bool. And in future, I'll seek
review here first before uploading.
Release early and release often, don't worry about asking the mailing list
beforehand (unless you want to, of course).
Where can we find it, Kazu? =)
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
For your particular constraints, it can be as easy as:
class IsA a where
toA :: a - A
foo' :: IsA a = a - C
foo' = foo . toA
However, you may asking the wrong question since it smells like you're
trying to embed OO into Haskell =).
Cheers,
On Wed, Jan 16, 2013 at 1:03 PM, Thiago
AFAIK, persistent's PostgreSQL support does depend on libpq via
postgresql-libpq.
On Wed, Jan 9, 2013 at 12:39 PM, Alexander Alexeev m...@eax.me wrote:
Try Persistent package. It doesn't depends on libpq and has many useful
features (see http://www.yesodweb.com/book/persistent for details)
While you're at it, maybe whitelisting cpphs would be nice as well =).
On Thu, Dec 13, 2012 at 12:03 PM, Michael Snoyman mich...@snoyman.com wrote:
On Thu, Dec 13, 2012 at 3:53 PM, Vincent Hanquez t...@snarc.org wrote:
On 12/13/2012 12:51 PM, Michael Snoyman wrote:
I think that's a great
change
the cabal file to mention the BSD3 so that its package description is less
intimidating?
On Thu, Dec 13, 2012 at 4:12 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
While you're at it, maybe whitelisting cpphs would be nice as well =).
On Thu, Dec 13, 2012 at 12:03 PM
When deciding what license to use, I think one should also think about
the role of their library. For example, containers is quite central
to the Haskell community and not easily replaceable. The tie-knot
library, OTOH, may be rewritten from scratch or even just skipped
(just tie the knot
Crisis averted!
=)
On Wed, Dec 12, 2012 at 11:15 PM, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Dec 12, 2012 at 12:18 PM, Dmitry Kulagin
dmitry.kula...@gmail.com wrote:
Clark, Johan, thank you! That looks like perfect solution to the problem.
Clean-room reimplementation merged and
Hey, Petr!
Have you considered licensing your library as BSD? Given the current
way that Haskell programs are compiled, your library is effectively
licensed as GPL and that will scare away many people from using it.
Cheers, =)
On Mon, Dec 10, 2012 at 6:58 PM, Petr P petr@gmail.com wrote:
Did you try pinging him again?
On Wed, Dec 5, 2012 at 3:59 PM, Ivan Perez ivanperezdoming...@gmail.com wrote:
Hello haskellers,
A few months ago I sent an email to Vasyl Pasternak regarding a couple
of bugs in hgettext [1], together with a small patch that fixes them.
I never received an
Aeson doesn't have an incremental parser so it'll be
difficult/impossible to do what you want. I guess you want an
event-based JSON parser, such as yajl [1]. I've never used this
library, though.
Cheers,
[1] http://hackage.haskell.org/package/yajl-0.3.0.5
On Tue, Dec 4, 2012 at 12:11 PM,
Hey!
I'd like to invite you to the 1st São Paulo Haskell Meeting! It's
going to be something simple, we just want to meet each other and talk
about Haskell =). We already have 9 people confirmed on the Google+
event [1], so come join us already!
Cheers,
PS: We still didn't set the place yet.
http://hackage.haskell.org/packages/archive/base/4.6.0.0/doc/html/System-Mem.html#v:performGC
On Tue, Nov 27, 2012 at 5:52 PM, timothyho...@seznam.cz wrote:
What triggers GC in haskell? We obviously aren't using Java's method of GC
as needed(for good reasons, Java's method is terrible because
On Thu, Sep 27, 2012 at 1:02 PM, spacestat...@venussociety.org
spacestat...@venussociety.org wrote:
How is it possible to run 2 different versions of GHC on the same computer (
OS , in my case OpenSuse 6.1x and hopefully 7.6 )
Just use hsenv [1] (formerly known as virthualenv).
[1]
On Sun, Sep 16, 2012 at 7:57 AM, Marco Túlio Pimenta Gontijo
marcotmar...@gmail.com wrote:
I have a question about cost-centre names, as shown on .hp files
produced by +RTS -hc. They have the form A/B/C/D/E/F/G/... Usually,
it seems that it means A, called by B, called by C, etc, but that's
On Thu, Sep 6, 2012 at 1:05 PM, Ian Lynagh i...@well-typed.com wrote:
* It is now possible to defer type errors until runtime using the
-fdefer-type-errors flag.
I don't remember if this was part of the motivation in creating this
feature, but it has a nice use case: asserting on a test
On Thu, Sep 6, 2012 at 2:49 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
We're getting more meta than Haskell provides cleanly, but all
significant uses I can currently think of for something like that
would require universal quantification over types:
Forall types t.
t `notElem`
Some comments wrt. performance:
On Mon, Sep 3, 2012 at 9:57 AM, timothyho...@seznam.cz wrote:
Right (medianBucket,stubLen) =
foldr
(\thisBucket@(thisBucketLen,_) eitheriOrMedianBucket -
case eitheriOrMedianBucket of
Left i -
if i + thisBucketLen (length `div` 2)
On Mon, Sep 3, 2012 at 11:18 AM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
Ditto for oldLen here. Also, you can simplify this lambda a lot:
import Control.Applicative (($))
\(oldLen, oldVal) -
let newLen = oldLen + 1
newVal = (number:) $ oldVal
in newLen `seq
On Fri, Aug 31, 2012 at 9:45 PM, David McBride toa...@gmail.com wrote:
Hamlet is whitespace sensitive like haskell and python. If you put a tag
after text, it is treated as text.
Write the a... on the next line and it will work.
Another option is to manually put the closing /a when the tag
[moving discussion to haskell-cafe]
Congratulations and thanks for your new open source contribution! I
hope you feel at home =).
Your library looks really interesting but I'm completely overwhelmed
by its size. Its Cabal description is huge and there's no example of
how to use the library (it
On Mon, Aug 27, 2012 at 7:25 PM, J Baptist arc38...@hotmail.com wrote:
real 0m6.053s
user 0m1.480s
sys 0m4.550s
Do these timings include RTS startup?
--
Felipe.
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
I can't give you a definite answer. However, I guess that's because
the monad sequencing (i.e. where = of your monad is called) is
inside the 'pipe' function [1] (i.e., $$, $=, =$), the function that
connects pipes and runs them. 'pipe' needs to be able to interleave
lifted actions between both
On Tue, Aug 21, 2012 at 9:01 PM, Thiago Negri evoh...@gmail.com wrote:
My view of Cloud Haskell usage would be something similar to this: a
master node sending work to slaves; slave instances getting up or down
based on demand. So, the master node should be slave-failure-proof and
also find
On Sat, Aug 18, 2012 at 3:57 AM, David Feuer david.fe...@gmail.com wrote:
If the language is changed (without possibility of breakage, I
believe) so that names declared in a module shadow imported names,
incompatibility can only arise if two different imports offer the same
name, and it is
Christopher, did you ever take a look at acid-state [1]? It seems to
me that it solves the same problem you have but, instead of
Client - JSON - Server (going through the web)
it solves
Server - Storage - Server (going through time)
Cheers,
[1]
On Thu, Aug 16, 2012 at 10:01 AM, Chris Smith cdsm...@gmail.com wrote:
Twan van Laarhoven twa...@gmail.com wrote:
Would adding a single convenience function be low or high risk? You say it
is low risk, but it still risks breaking a build if a user has defined a
function with the same name.
On Wed, Aug 15, 2012 at 12:54 PM, Christian Maeder
christian.mae...@dfki.de wrote:
Well, Either was an adhoc choice and should be application specific.
Another h98 solution would be to keep the common part in a single
constructor:
data UserOrAppData = AppData | UserData UserId UTCTime
On Tue, Aug 14, 2012 at 8:44 AM, Michael Snoyman mich...@snoyman.com wrote:
An example that came up at work (with Yitzchak Gale, he probably has more
details) was essentially two different types of documents that shared a lot
of the same kinds of elements (tables, lists, paragraphs, etc) but
2012/8/14 Christian Maeder christian.mae...@dfki.de:
Why not use plain h98?
data UserAccessToken = UserAccessToken UserId AccessTokenData UTCTime
data AppAccessToken = AppAccessToken AccessTokenData
type AccessToken = Either UserAccessToken AppAccessToken
Convenience. It's better to
Hello!
I've managed to reduce your code to a much simpler test case (without
parsec) but I'm still not sure why this is happening:
{-# LANGUAGE MultiParamTypeClasses, FlexibleContexts #-}
data D m
= D { bar1 :: P m ()
, bar2 :: P m ()
}
data P m c = P
class S m c where
foo ::
Here's an even smaller one:
{-# LANGUAGE MultiParamTypeClasses, FlexibleContexts #-}
data D m = D { bar :: P m () }
data P m c = P
class S m c where
foo :: S m () = P m ()
foo = undefined
emptyDef :: S m () = D m
emptyDef = D foo
haskellStyle :: S m () = D m
haskellStyle = emptyDef { bar =
On Sat, Aug 4, 2012 at 3:30 PM, Andrey Chudnov achud...@gmail.com wrote:
Hello. What are the best practices in deprecating packages on Hackage? I've
seen packages marked DEPRECATED in the synopsis field on Hackage, and one
could add GHC deprecated pragmas for every module, but is that the best
On Mon, Jul 16, 2012 at 12:33 PM, Vo Minh Thu not...@gmail.com wrote:
It seems like the infered type (and thus bounds) is different when you
force the result to be a Color or not. Just give explicit type
signatures and conversion functions.
Actually, just *always* give explicit type
Em 15/07/2012 18:38, Albert Y. C. Lai tre...@vex.net escreveu:
On 12-07-10 11:35 PM, Brandon Allbery wrote:
Quoth the Fine Manual (8.2.1.1. Using your own main()
http://www.haskell.org/ghc/docs/latest/html/users_guide/ffi-ghc.html#using-own-main
):
There can be multiple calls to
Hackage links for anyone as lazy as myself =).
http://hackage.haskell.org/package/lens-family-core
http://hackage.haskell.org/package/lens-family
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Fri, Jul 6, 2012 at 2:11 PM, Sebastián Krynski skryn...@gmail.com wrote:
As I was using predicates (a - bool) , it appeared the need for combining
them with a boolean operator (bool - bool - bool) in order to get a new
predicate
combining the previous two. So I wrote my function
On Thu, Jul 5, 2012 at 12:21 PM, Christopher Done chrisd...@gmail.com wrote:
I like \case as is proposed. It seems the least controversial one and
there's curry (\case ) for two-args, but even that seems a rare case.
For what it's worth, I like the idea of omission being partiality, as
in
(English message follows after the break.)
Olá!
Estamos procurando um estagiário para trabalhar conosco em São Paulo
capital. Nós somos uma startup apaixonada por Haskell com uma boa
participação na comunidade e grandes projetos e desafios!
Se você está interessado, basta me mandar um e-mail
On Mon, May 21, 2012 at 7:18 PM, Jeremy Shaw jer...@n-heptane.com wrote:
I hope to do a full comparison of reform vs digestive-functors 0.3 vs
yesod forms in a few weeks.
That would be awesome! Just sayin' =).
Cheers,
--
Felipe.
___
Haskell
On Mon, May 21, 2012 at 7:18 PM, Jeremy Shaw jer...@n-heptane.com wrote:
I hope to do a full comparison of reform vs digestive-functors 0.3 vs
yesod forms in a few weeks.
That would be awesome! Just sayin' =).
Cheers,
--
Felipe.
___
Haskell-Cafe
Truly amazing! I wonder it would fare with larger repositories. =)
Cheers,
--
Felipe – enviado do meu Galaxy Tab.
Em 12/05/2012 09:52, Sönke Hahn sh...@cs.tu-berlin.de escreveu:
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest
On Tue, May 8, 2012 at 2:36 PM, MigMit miguelim...@yandex.ru wrote:
Hi café, a quick question.
Is there a somewhat standard class like this:
class Something c where
unit :: c () ()
pair :: c x y - c u v - c (x, u) (y, v)
?
I'm using it heavily in my current project, but I don't
On Wed, May 2, 2012 at 2:41 PM, Wojciech Jedynak wjedy...@gmail.com wrote:
In formal grammar it should be Sugoi Haskell tanoshiku WO manabou! -
this WO is a particle identifying the object and this omission is
normal in colloquial, spoken Japanese.
My basic Japanase is very rusty, but
Hello!
I'm sorry if this is a dumb question, I was just reading the API docs,
but: what happens if one by one I add all edges of a non-planar graph
using addEdge? Are there any sanity checks that would tell me sorry,
but your graph isn't planar, or would it just give me wrong answers?
Cheers,
On Tue, Apr 17, 2012 at 1:59 PM, Andres Löh andres.l...@googlemail.com wrote:
* Completely new modular dependency solver (default in most cases)
Great! =D
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
That looks great, Adam, thanks for sharing! I've been using
watir-webdriver but ruby tends to be a lot more painful to use than
Haskell (even though I use ruby only for the tests!). Looking forward
to see what I can do with your package =).
Cheers,
--
Felipe.
On Sun, Apr 8, 2012 at 2:47 AM, Bryan O'Sullivan b...@serpentine.com wrote:
I fixed the too-much-inlining bug tonight. As a bonus, Text literals are now
decoded straight from GHC's packed encoding, without an intermediate step
through String.
Generated code now looks like this at -O and
On Wed, Mar 28, 2012 at 5:52 PM, dag.odenh...@gmail.com
dag.odenh...@gmail.com wrote:
Wait, what?
Perhaps they were assigned the task of updating haskell-src-exts code
to support Haskell2010? =)
--
Felipe.
___
Haskell mailing list
On Wed, Mar 28, 2012 at 5:52 PM, dag.odenh...@gmail.com
dag.odenh...@gmail.com wrote:
Wait, what?
Perhaps they were assigned the task of updating haskell-src-exts code
to support Haskell2010? =)
--
Felipe.
___
Haskell-Cafe mailing list
Nice package!
An idea for sourceVector is to use the streaming interface [1]. It
would be nice if GHC could fuse the array with sourceVector, avoiding
to produce the array in the first place, but I'm not going to hold my
breath =).
Cheers,
[1]
On Thu, Mar 22, 2012 at 8:03 PM, Jared Hance jaredha...@gmail.com wrote:
I looked over it and decided to simply go with head/tail (not sure why I
used the index thing... head/tail is so much more functional). That
should still get some fusion benefit, right, since it all uses streams
under the
import Control.Applicative
f, g :: Float - Float
f x = x + 1
g x = 2 * x
h = (+) $ f * g
Cheers, =)
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Mar 16, 2012 at 9:23 AM, Christopher Svanefalk
christopher.svanef...@gmail.com wrote:
Are there any problems which cannot be solved a side effect-free language
(such as Haskell)? In other words, are there problems that would explicitly
demand semantics that can only be provided by a
Hello!
tl;dr: text package's pack function is creating huge chunks of code everywhere.
Michael Snoyman and I have been trying to nail the performance
problems of persistent's Template Haskell code -- GHC was taking a lot
of memory and CPU time to compile these. What we found out is that
the
{-# LANGUAGE MultiParamTypeClasses #-}
class Intersectable a b where
intersectsWith :: a - b - Bool
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Feb 16, 2012 at 12:56 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
2) build-dependency
I need to repeat all build-dependency of a library section to
a test suite section. Specifying the library itself to
build-dependency of a test suite section does not work.
This violates the DRY
On Thu, Feb 16, 2012 at 7:24 AM, Kazu Yamamoto k...@iij.ad.jp wrote:
Do you mean that if we separate directories for src and test,
build-depends of test-suite works, and if we don't separate, it does
not work?
If we have separate directories, then you can build-depends:
own-package. This
Hello, everyone!
I'm pleased to finally announce the fb package, a Haskell-only package
that provides bindings to Facebook's API. This package is sponsored
by my employer, which will soon enough be able to become the copyright
holder of all of our open source contributions.
Your package uses TMChans which AFAIK are unbounded. That means that
if the writer is faster than the reader, then everything will be kept
into memory. This means that using TMChans you may no longer say that
your program uses a constant amount of memory. Actually, you lose a
lot of your space
[Redirecting to haskell-cafe]
Congrats on your first release!
While I haven't looked into your package in more depth, I'd suggest
taking a look at http-conduit [1]. While I don't know of any
benchmarks, it should be faster or at least as fast the HTTP package.
It's also used by many people
On Sun, Feb 5, 2012 at 6:18 PM, Vesa Kaihlavirta vpkai...@gmail.com wrote:
So now I'm not so certain anymore about dropping it. We could again
wait for a while until HP catches up (it should be relatively fast
this time, since 7.4 is supposedly a real stable release) or just drop
it and go to
On Fri, Feb 3, 2012 at 1:38 PM, yi huang yi.codepla...@gmail.com wrote:
Since Sink works in a CPS fashion, by which i mean every step it return a
new push close pair, i think it can be used multiple time.
Actually, this is exactly why it *can't* be used multiple times.
Cheers!
--
Felipe.
On Fri, Feb 3, 2012 at 2:22 PM, Andres Löh andres.l...@googlemail.com wrote:
A controlled way of ignoring version constraints (mainly upper bounds,
actually) is certainly on my TODO list for the new solver. The main
issue to work out is a good way how to control the disabled bounds via
the
2012/2/1 Ertugrul Söylemez e...@ertes.de:
Hello there,
I have tried to implement a simple echo server using the network-conduit
library version 0.2.1. This is the code:
module Main where
import Data.Conduit
import Data.Conduit.Network
main :: IO ()
main = runTCPServer
On Tue, Jan 31, 2012 at 6:05 AM, Marc Weber marco-owe...@gmx.de wrote:
I didn't say that I tried your code. I gave enumerator package a try
counting lines which I expected to behave similar to conduits
because both serve a similar purpose.
Then I hit the the sourceFile returns chunked lines
On Thu, Jan 26, 2012 at 11:42 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
- Fast enough: the streaming interface achieves 12 MiB/s for parsing,
which is pretty nice considering that there are some known overheads
on its implementation.
I've just released biostockholm 0.2.1 which
On Tue, Jan 31, 2012 at 1:36 PM, Marc Weber marco-owe...@gmx.de wrote:
Adding a \state - (the way Felipe Lessa told me) make is work and
it runs in about 20sec and that although some conduit overhead is likely
to take place.
Just out of curiosity: did you use conduit 0.1 or 0.2?
Cheers! =)
On Tue, Jan 31, 2012 at 9:36 PM, Thomas DuBuisson
thomas.dubuis...@gmail.com wrote:
Release 0.9 Changes:
* Crypto.Classes now exports 'Data.Serialize.encode'
* AsymCipher now has proper fundeps
* cpolysArr is no longer one big line
Also:
* MacKey has phantom types.
This seems to be the
On Mon, Jan 30, 2012 at 6:21 AM, Herbert Valerio Riedel h...@gnu.org wrote:
On Sun, 2012-01-29 at 23:47 +0100, Marc Weber wrote:
So maybe also the JSON parsing library kept too
many unevaluated things in memory. So I could start either writing my
own JSON parsing library (being more strict)
On Mon, Jan 30, 2012 at 2:12 PM, Marc Weber marco-owe...@gmx.de wrote:
@ Felipe Almeida Lessa (suggesting conduits and atto parsec)
I mentioned that I already tried it. Counting lines only was a lot slower than
counting lines and parsing JSON using PHP.
Then please take a deeper look into my
On Mon, Jan 30, 2012 at 4:46 PM, Johannes Waldmann
waldm...@imn.htwk-leipzig.de wrote:
Thanks - which zero? (there are two of them.)
You should not change the deriveSafeCopy of your old data type. The
only allowed change is renaming your data type (see below). You
should increment the version
1 - 100 of 320 matches
Mail list logo