On 01/24/2012 07:33 AM, Gregory Crosswhite wrote:
On 1/24/12 9:43 AM, Felipe Almeida Lessa wrote:
Use cereal [1], usually it's fast and easy enough.
Out of curiosity, is binary no longer the recommended standard for such things?
binary got only an interface for processing lazy bytestring.
ce
On 1/24/12 9:43 AM, Felipe Almeida Lessa wrote:
Use cereal [1], usually it's fast and easy enough.
Out of curiosity, is binary no longer the recommended standard for such
things?
Cheers,
Greg
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Jan 24, 2012 at 8:37 AM, Myles C. Maxfield
wrote:
> I have attached a patch to add a redirect chain to the Response datatype.
> Comments on this patch are very welcome.
I thought that this isn't necessary since a client wanting to track
all the redirects could just handle them manually by
I have attached a patch to add a redirect chain to the Response datatype.
Comments on this patch are very welcome.
I was originally going to include the entire Request object in the
redirection chain, but Request objects are parameterized with a type 'm',
so including a 'Request m' field would for
It's not as efficient for Maps, but you might want to look at the
swapper package:
http://hackage.haskell.org/package/swapper
It transfers Haskell data structures (any functors) directly to and from disk.
Tom
On 1/23/12, Krzysztof Skrzętnicki wrote:
> From my experience I can recommend msgpack
On Mon, Jan 23, 2012 at 09:06:52PM -0800, Ryan Ingram wrote:
> On Mon, Jan 23, 2012 at 8:05 PM, Daniel Fischer <
> daniel.is.fisc...@googlemail.com> wrote:
>
> > On Tuesday 24 January 2012, 04:39:03, Ryan Ingram wrote:
> > > At the end of that paste, I prove the three Haskell monad laws from the
>
Ilya Portnov wrote:
> For my current projects, i'd also like to have bindings to libvirt. I
> even started to write something for them, using c2hs. If someone is
> interested, i could put my current (very basic) code to, say, github…
+1
Erik
--
--
Ilya,
Yes please. Examining your code would go a long way toward
helping me with this project.
On Mon, Jan 23, 2012 at 9:26 PM, Ilya Portnov wrote:
> On 16 янв, 03:27, Michael Litchard wrote:
>> Due to the direction things are going at work, I have become
>> interested in Haskell bindings
Have you tried generating a free theorem for :-> ? (I haven't as I'm writing
from my phone)
24.01.2012, в 9:06, Ryan Ingram написал(а):
> On Mon, Jan 23, 2012 at 8:05 PM, Daniel Fischer
> wrote:
> On Tuesday 24 January 2012, 04:39:03, Ryan Ingram wrote:
> > At the end of that paste, I prove
On 16 янв, 03:27, Michael Litchard wrote:
> Due to the direction things are going at work, I have become
> interested in Haskell bindings forlibvirt. Noticed that this hasn't
> been done yet. I was wondering if this was due to lack of motivation,
> or if there were some difficult hurdles withlibvi
On Mon, Jan 23, 2012 at 8:05 PM, Daniel Fischer <
daniel.is.fisc...@googlemail.com> wrote:
> On Tuesday 24 January 2012, 04:39:03, Ryan Ingram wrote:
> > At the end of that paste, I prove the three Haskell monad laws from the
> > functor laws and "monoid"-ish versions of the monad laws, but my pro
There's a proposal at the moment to add support for TDNR to Haskell - to
leverage "the power of the dot" (e.g. for intellisense).
http://hackage.haskell.org/trac/haskell-prime/wiki/TypeDirectedNameResolution
I approve of the goal, but I'd like to suggest a different approach.
My basic idea is
On 2012-01-23 13.45.50 -0800, David Barbour wrote:
> If your classes are more like `interfaces`, you could use Typeclasses to
> model them. Otherwise, look into OOHaskell. But I think your program
> architecture will simply be different in idiomatic Haskell than in
> idiomatic C++.
If your OO is v
On Tuesday 24 January 2012, 04:39:03, Ryan Ingram wrote:
> At the end of that paste, I prove the three Haskell monad laws from the
> functor laws and "monoid"-ish versions of the monad laws, but my proofs
> all rely on a property of natural transformations that I'm not sure how
> to prove; given
>
I've been playing around with the relationship between monoids and monads
(see
http://www.jonmsterling.com/posts/2012-01-12-unifying-monoids-and-monads-with-polymorphic-kinds.htmland
http://blog.sigfpe.com/2008/11/from-monoids-to-monads.html), and I put
together my own implementation which I'm quit
On Sat, Jan 21, 2012 at 8:18 AM, Twan van Laarhoven wrote:
> Notice that there are lots of "miku-X" prefixes found. This is probably not
> what you want. What exactly do you want the algorithm to do? For example, ""
> is obviously a prefix of every string, but it is not very long. On the other
> h
>From my experience I can recommend msgpack (
http://hackage.haskell.org/package/msgpack) as being extremely fast. It
comes with optimized prepared instances for common data structures which is
very nice, because you don't have to roll your own version with library
like cereal (which is indeed very
On Mon, Jan 23, 2012 at 9:37 PM, Nick Rudnick
wrote:
> if you want to temporarily store haskell data in a file – do you have a
> special way to get it done efficiently?
>
> In an offline, standalone app, I am continuously reusing data volumes of
> about 200MB, representing Map like tables of a rat
Dear all,
if you want to temporarily store haskell data in a file – do you have a
special way to get it done efficiently?
In an offline, standalone app, I am continuously reusing data volumes of
about 200MB, representing Map like tables of a rather simple structure,
key: (Int,Int,Int)
value: [((
If you want a simple translation, use Word8 (from Data.Word) for the type
and use Data.Bits for operations on it just like in C++. This would offer
you storage efficiency (if stored as a strict field).
If you want idiomatic Haskell, constructor of the form:
data ObjectType = Object | Item | Con
Space leaks, time leaks, resource leaks, subtle divergence issues when
filtering lists, etc.
On Mon, Jan 23, 2012 at 11:57 AM, Jake McArthur wrote:
> On Mon, Jan 23, 2012 at 10:45 AM, David Barbour
> wrote:
> > the repeated failures of attempting to model stream processing with
> infinite
> > li
Thanks. This and previous email are answers to question I asked. But not
the answer to question I mean.
I'll describe the whole task, as Yves Parès suggested.
I'm trying to convert C++ code to Haskell. I have such hierarchy: class
Object, class Item : Object, class Container : Item. Another one ex
David Fox wrote:
> I try to create a workflow for this sort of thing. I create a package
> with a name like set-extra, with one module Data.Set.Extra and an
> alternative Data.Set module that exports both the old Data.Set and the
> symbols in Data.Set.Extra. Then I email the maintainers of the
>
Hi,
I don't know what you actually need, but if haskell-src-exts is an option,
it is quite a bit easier to use (definitely easier to understand for me!).
Especially when used together with Uniplate.
For example, for a given piece of AST one can get all the identifiers used
like so:
[ x | Ident x
On Mon, Jan 23, 2012 at 10:45 AM, David Barbour wrote:
> the repeated failures of attempting to model stream processing with infinite
> lists,
I'm curious about what failures you're talking about.
- Jake
___
Haskell-Cafe mailing list
Haskell-Cafe@hask
Hi,
I was wondering if anyone could tell me if it's possible to get an AST from the
ghc-api decorated with static-semantics?
In particular, I am interested in use and bind locations for all names in the
AST together with the module they are bound, etc.
Looking through the online docs, there do
Thanks for the reference. I base my opinion on my own observations - e.g.
the repeated failures of attempting to model stream processing with
infinite lists, the relative success of modeling exceptions explicitly with
monads compared to use of `fail` or SomeException, etc..
On Mon, Jan 23, 2012 at
On Sun, Jan 22, 2012 at 5:25 PM, David Barbour wrote:
> The laws for monads only apply to actual values and combinators of the monad
> algebra
You seem to argue that, even in a lazy language like Haskell,
equational laws should be considered only for values, as if they where
stated for a total l
Hello,
I update the OpenCL package with the last changes. The most important
thing, currently it fully implements OpenCL 1.0.
IMPORTANT, some functions change signature (e,g: clSetKernelArg, and
clCreateContext* )
Thanks all comments in the previous version, issues and pulls in github.
# Where
On Mon, Jan 23, 2012 at 1:20 PM, Aristid Breitkreuz
wrote:
> Rejecting cookies is not without precedent.
>
> If you must force cookie handling upon us, at least make it possible to
> selectively reject them.
>
> Aristid
If you turn off automatic redirects, then you won't have cookie
handling. I'd
Rejecting cookies is not without precedent.
If you must force cookie handling upon us, at least make it possible to
selectively reject them.
Aristid
Am 23.01.2012 08:44 schrieb "Michael Snoyman" :
> That's a violation of the spec. Having a server set a cookie and then
> "not really mean it" or s
Hi,
On 21.01.2012, at 21:20, Joey Hess wrote:
> My problem now is that as I start new projects, I want to have my haskell
> utility functions available, and copying them around is not ideal. So, put
> them on hackage. But where, exactly? It already has several grab bag utility
> libraries. The on
On 23 Jan 2012, at 07:01, Erik de Castro Lopo wrote:
>/tmp/hspec-0.9.04062/hspec-0.9.0/Setup.lhs:2:10:
>Could not find module `System'
>It is a member of the hidden package `haskell98-2.0.0.0'.
In ghc-7.2, you cannot use the haskell98 package in conjunction with the base
pac
> 2012/1/22 Данило Глинський
> What is natural Haskell representation of such enum?
>
> enum TypeMask
> {
>UNIT,
>GAMEOBJECT,
>
>CREATURE_OR_GAMEOBJECT = UNIT | GAMEOBJECT
> };
I don't think that definition makes any sense in C, because UNIT is 0, so UNIT
| GAMEOBJECT == GAMEOBJEC
34 matches
Mail list logo
