On 08-Feb-2001, John Meacham [EMAIL PROTECTED] wrote:
A nice advantage of using my mid-level routines is that there are very
little requirements placed on 'Byte' as a type, this means that as long
as to the outside world you only read in 8 bit values and spit 8 bit
values out you can
Marcin 'Qrczak' Kowalczyk wrote:
| IMHO it looks nicer to have Byte in function names, so
| there can be such type synonym too.
Style Warning!
Why do many people when designing libraries not make full
use of the Haskell module system? Instead of
writeByte
readByte
(or so), one could
Style Warning! ... writeByte - Byte.write
Yes yes yes please!
Often, if someone writes identifiersWithSuffix,
the suffix actually carries a type information or a module information,
and the programmer should use the type resp. module system
of the language to express that.
Should this also
Marcin 'Qrczak' Kowalczyk schrieb folgendes am Tue, Feb 06, 2001 at 12:54:29PM +0100:
On Tue, 6 Feb 2001, Olaf Chitil wrote:
I just see one problem with John's proposal: the type Byte.
type Byte = Word8
I would prefer
type Octet = Word8
to emphasise that the functions really uses 8
2001 6:25 AM
Subject: Re: binary files in haskell
Johannes Waldmann wrote:
| Should this also apply to names in the standard
| library? like Monad (filterM, zipWithM ,..) I mean,
| theoretically yes, but is it feasible to change it?
Obviously, these functions should have been call
How about this slightly more general interface, which works
with the new
FFI libraries, and is trivial to implement on top of the
primitives in
GHC's IOExts:
hPut :: Storable a = Handle - a - IO ()
hGet :: Storable a = Handle - IO a
What about endianess? In
There is actually NO way with haskell 98 to portably read and write
binary files. and many libraries which provide this feature are
inherently non portable, (they assume a Haskell Char = C char = byte)
which is not necisarily the case. I wrote up a proposal for a binary
file IO mechanism to be
Malcolm In fact, Binary allows you to process the data directly
Malcolm from the disk rather than hauling it all into memory.
Malcolm This eliminates start-up time altogether. What's more,
Malcolm provided the file is used read-only, you can use pure
Malcolm lazy
"Malcolm" == Malcolm Wallace [EMAIL PROTECTED] writes:
Malcolm In fact, Binary allows you to process the data directly
Malcolm from the disk rather than hauling it all into memory.
Malcolm This eliminates start-up time altogether. What's more,
Malcolm provided the file is used
If the representation is simple enough, you might consider accessing
the database via C ...
Of course, Binary or Native would be easier, but the start-up time
for a large database might be a problem.
In fact, Binary allows you to process the data directly from the disk
rather than hauling
Alex Ferguson and (earlier) Yoshihiko Ichikawa ask for clarification of
the intent of the discussion on binary I/O.
It might help if I outline the capabilities of the Binary library
(currently available only for nhc13, but as Simon PJ notes, if you want
it in ghc/hugs, ask him).
1. Reading
Real world example: development tools process a large geometric data set to
build a run-time optimized BSP tree with precalculated lighting and
collision information. The user application will not modify this data, but
it will have to load it dynamically without slowing down a 30Hz
Alex Ferguson wrote:
Tony Davie:
And anyway didn't this start out about how to do I/O on binary data.
To be honest, I'm not sure this discussion does necessarily address
the original query:
Steve Roggenkamp:
I would like to use Haskell for several larger scale projects, but I
On Wed, 25 Feb 1998, Jerzy Karczmarczuk wrote:
: PS. Could somebody inform me what is the current status of
: multi-parametric classes? Concretely (for example) I would
: like to construct a generic Universal Parser
:
: type Uparser a c = [c] - [(a,[c])]
:
: which consumes any stream and
Tim writes:
I noticed the tracer stuff on the nhc web-site. It looks very much
like a declarative-debugger, although that term never appeared in the
documentation I read. Will it in fact be a declarative-debugger ?
Debugging is certainly one of the applications of a tracer. I'm not
sure
On Wed, 25 Feb 1998, Jerzy Karczmarczuk wrote:
Compete in the space of professional production quality languages?
I am sorry, but if one day the Haskell, or any other language creators
decide to include *everything* into their language, it will be The End
of it.
Yes that comment went too
The discussion about heap dumps, binary persistent objects, etc.
continues.
S. Alexander Jacobson:
Java comes with a serialization mechanism that allows the user to save
and load all objects ...
Object databases, like PSE, provide caching and indirection facilities
...
Relational
Tim Barbour writes
"Tony" == Tony Davie [EMAIL PROTECTED] writes:
Tony This has well know disadvantages. Simon has already pointed
Tony out that it's not relocatable. It's also limited to the size
Tony of virtual memory and takes up that amount of space even
Tony though most of
"Tony" == Tony Davie [EMAIL PROTECTED] writes:
Tony This has well know disadvantages. Simon has already pointed
Tony out that it's not relocatable. It's also limited to the size
Tony of virtual memory and takes up that amount of space even
Tony though most of it may not be used.
The debate about heavy or light-weight saving sounds a lot like the debate
in traditional programming languages of how users should implement
persistent state.
Java comes with a serialization mechanism that allows the user to save
and load all objects reachable from a particular object root. It
I would like to use Haskell for several larger scale projects, but I
can't figure out how to read and write binary data. It does not appear
that the language supports binary files. Am I missing something?
Colin Runciman and his Merrie Men are working on writing
Haskell values into binary
--MimeMultipartBoundary
Content-Type: text/plain; charset="us-ascii"
This thread and particularly the following passage:
"If I understand this right, you're suggesting essentially dumping
out part of the Haskell heap to a file."
reminds me very strongly of APL, where dumping the
"Steve" == Steve Roggenkamp [EMAIL PROTECTED] writes:
Steve I would like to use Haskell for several larger scale
Steve projects, but I can't figure out how to read and write
Steve binary data. It does not appear that the language supports
Steve binary files. Am I missing something?
Sorry for interruption, but I feel this thread of discussion
includes four different aspects of `binary' data:
1. Reading and writing binary data in a prescribed format.
Typical examples are image data in GIF, TIFF, Sun Raster etc,
and user-account statistics files used in Unix.
This thread and particularly the following passage:
"If I understand this right, you're suggesting essentially dumping
out part of the Haskell heap to a file."
reminds me very strongly of APL, where dumping the current state of
the system into a binary file that you can later reload (and
--MimeMultipartBoundary
Content-Type: text/plain; charset="us-ascii"
Tony Davie wrote:
This has well know disadvantages. Simon has already pointed out that
it's not relocatable.
How is it done in APL and in other systems that do it (SmallTalk
and some LISP systems, according to another
"Steve" == Steve Roggenkamp [EMAIL PROTECTED] writes:
Steve I would like to use Haskell for several larger scale
Steve projects, but I can't figure out how to read and write
Steve binary data. It does not appear that the language supports
Steve binary files. Am I missing
Timothy Robin BARBOUR [EMAIL PROTECTED] writes:
There is another way one might proceed. Why not just use a
memory-mapped file (mmap) to make the data persistent in-place ? This
would be a way of getting efficient persistence of (almost) any
Haskell data structure without any code-writing and
Phil Trinder asked:
Do any Haskell implementations support Binary files?
At York we have a version of nhc13 which supports, amongst other things,
binary file I/O. We hope to release it to the world fairly soon.
We have confirmed that binary files enable a faster data transfer rate
than the
29 matches
Mail list logo
