On Thu, 2007-02-01 at 10:47 +0300, Bulat Ziganshin wrote:
> Hello Duncan,
>
> Thursday, February 1, 2007, 3:39:16 AM, you wrote:
>
> >> > Can anyone see a real serialisation use case that needs a monad for the
> >> > serialisation side? I'd thought I had an example, but I was wrong.
> >>
> >> my
Hello Duncan,
Thursday, February 1, 2007, 3:39:16 AM, you wrote:
>> > Can anyone see a real serialisation use case that needs a monad for the
>> > serialisation side? I'd thought I had an example, but I was wrong.
>>
>> my program, FreeArc, has its own compression level on top of
>> serializing
On Wed, 2007-01-31 at 14:38 +0300, Bulat Ziganshin wrote:
> Hello Duncan,
>
> Tuesday, January 30, 2007, 1:22:58 PM, you wrote:
>
> > Can anyone see a real serialisation use case that needs a monad for the
> > serialisation side? I'd thought I had an example, but I was wrong.
>
> my program, Fr
Hello Duncan,
Tuesday, January 30, 2007, 1:22:58 PM, you wrote:
> Can anyone see a real serialisation use case that needs a monad for the
> serialisation side? I'd thought I had an example, but I was wrong.
my program, FreeArc, has its own compression level on top of
serializing - i.e. data seri
On Tue, Jan 30, 2007 at 10:22:58AM +, Duncan Coutts wrote:
> Ross, you need to make a monoid transformer library (at least reader and
> state) and campaign for ++ to be redefined as mappend, then everyone
> will want to use it since it'll be so neat and convenient! :-)
Reader is already there.
On Tue, Jan 30, 2007 at 10:22:58AM +, Duncan Coutts wrote:
> I was about to say that for the more complicated binary serialisation
> formats (eg GHC's .hi format) people need monads with state, like string
> pools etc, but actually now that I think about it, that can be done with
> a monoid too
On Tue, Jan 30, 2007 at 09:38:26AM +, Ross Paterson wrote:
> On Tue, Jan 30, 2007 at 09:52:01AM +1100, Donald Bruce Stewart wrote:
> > ross:
> > > why do you need a Put monad, which always seems to have
> > > the argument type ()? Monoids really are underappreciated.
> >
> > For the syntax, a
On Tue, 2007-01-30 at 09:38 +, Ross Paterson wrote:
> On Tue, Jan 30, 2007 at 09:52:01AM +1100, Donald Bruce Stewart wrote:
> > ross:
> > > why do you need a Put monad, which always seems to have
> > > the argument type ()? Monoids really are underappreciated.
> >
> > For the syntax, and So t
On Tue, Jan 30, 2007 at 09:52:01AM +1100, Donald Bruce Stewart wrote:
> ross:
> > why do you need a Put monad, which always seems to have
> > the argument type ()? Monoids really are underappreciated.
>
> For the syntax, and So that people can directly port their code from
> NewBinary. (The inst
Hi Conrad,
If the data header stores the alignment/size/endianness, then there's
no reason for the data to be unportable. The normal get* instances
(not get*host) could suffice for reading.
That requires the stream to have a header. Which means that any
arbitrary slice within the ByteString is
On 28/01/07, Donald Bruce Stewart <[EMAIL PROTECTED]> wrote:
I've added raw primitives for:
{put,get}Wordhost
{put,get}Word16host
{put,get}Word32host
{put,get}Word64host
which do unaligned, host-sized, host-endian packing of data.
Writing is some 15% faster for Words, a bit le
tomasz.zielonka:
> On Tue, Jan 30, 2007 at 09:52:01AM +1100, Donald Bruce Stewart wrote:
> > For the syntax, and So that people can directly port their code from
> > NewBinary.
> > (The instances are basically unchanged).
> >
> > newtype PutM a = Put { unPut :: (a, Builder) }
> > type Put
On Tue, Jan 30, 2007 at 09:52:01AM +1100, Donald Bruce Stewart wrote:
> For the syntax, and So that people can directly port their code from
> NewBinary.
> (The instances are basically unchanged).
>
> newtype PutM a = Put { unPut :: (a, Builder) }
> type Put = PutM ()
>
> It is always ()
ross:
> On Fri, Jan 26, 2007 at 01:51:01PM +1100, Donald Bruce Stewart wrote:
> >
> > Binary: high performance, pure binary serialisation for Haskell
> > --
> >
> > The Binary Strike Team is pleased to announce the
On Jan 29, 2007, at 16:38 , Ross Paterson wrote:
On Fri, Jan 26, 2007 at 01:51:01PM +1100, Donald Bruce Stewart wrote:
Binary: high performance, pure binary serialisation for
Haskell
-
-
The Binary Strike T
On Fri, Jan 26, 2007 at 01:51:01PM +1100, Donald Bruce Stewart wrote:
>
> Binary: high performance, pure binary serialisation for Haskell
> --
>
> The Binary Strike Team is pleased to announce the release of a new,
dons:
> lemming:
> >
> > On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
> >
> > > lemming:
> > > >
> > > > On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
> > > >
> > > > >
> > > > > Binary: high performance, pure binary serialisation for
> > > > > Haskell
> > > > >
> > > > >
lemming:
>
> On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
>
> > lemming:
> > >
> > > On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
> > >
> > > >
> > > > Binary: high performance, pure binary serialisation for Haskell
> > > >
> > > >
On Sat, 2007-01-27 at 19:11 +0100, Henning Thielemann wrote:
> On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
> > The underlying Get and Put monads support explicit endian writes and
> > reads, which you can add to your instances explicitly:
> >
> > http://www.cse.unsw.edu.au/~dons/binary/D
On Sat, 27 Jan 2007, Donald Bruce Stewart wrote:
> lemming:
> >
> > On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
> >
> > >
> > > Binary: high performance, pure binary serialisation for Haskell
> > >
> > > --
Donald Bruce Stewart wrote:
> lemming:
>> On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
>>
>>> Binary: high performance, pure binary serialisation for Haskell
>>> --
>>>
>>> The Binary Strike Team is pleased to ann
john:
> On Fri, Jan 26, 2007 at 04:42:48PM +0100, Tomasz Zielonka wrote:
> > I also have to use a specific serialisation format. I guess we could
> > both simply use putWord8, but then we'll probably lose most of the
> > benefits of using the library.
> >
> > Perhaps we could think about introduci
tomasz.zielonka:
> On Fri, Jan 26, 2007 at 04:31:28PM +0100, Henning Thielemann wrote:
> > On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
> >
> > >
> > > Binary: high performance, pure binary serialisation for Haskell
> > >
> > > ---
lemming:
>
> On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
>
> >
> > Binary: high performance, pure binary serialisation for Haskell
> > --
> >
> > The Binary Strike Team is pleased to announce the release of a
On Fri, Jan 26, 2007 at 04:42:48PM +0100, Tomasz Zielonka wrote:
> I also have to use a specific serialisation format. I guess we could
> both simply use putWord8, but then we'll probably lose most of the
> benefits of using the library.
>
> Perhaps we could think about introducing some "encoding
On Fri, Jan 26, 2007 at 04:31:28PM +0100, Henning Thielemann wrote:
> On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
>
> >
> > Binary: high performance, pure binary serialisation for Haskell
> > --
> >
> > The Bi
On Fri, 26 Jan 2007, Donald Bruce Stewart wrote:
>
> Binary: high performance, pure binary serialisation for Haskell
> --
>
> The Binary Strike Team is pleased to announce the release of a new,
> pure, efficient b
Behalf Of Donald
| Bruce Stewart
| Sent: 26 January 2007 02:51
| To: haskell@haskell.org
| Cc: haskell-cafe@haskell.org
| Subject: [Haskell-cafe] ANNOUNCE: binary: high performance, pure binary
serialisation
|
|
| Binary: high performance, pure binary serialisation for Haskell
Binary: high performance, pure binary serialisation for Haskell
--
The Binary Strike Team is pleased to announce the release of a new,
pure, efficient binary serialisation library for Haskell, now available
from Hac
29 matches
Mail list logo
