From: mfb@mbunix.mitre.org (Michael F Brenner)
Subject: Re: Help!! Writing binary bit by bit
Date: 1997/04/21
Date: 1997-04-21T00:00:00+00:00 [thread overview]
Message-ID: <5jfvp4$lrj@top.mitre.org> (raw)
In-Reply-To: dewar.861363672@merv
RD said: > Huffman coding ... the result needs to be built in memory, not
> written out a bit at a time.
What? Once the tree is built, the logical model for outputting the code is
a bit at a time output. The same for pcx, jpeg, tiff, dvi, pk, zip, and
many other compression, graphics, encoding, or binary file formats.
There is nothing wrong with having a straight-forward way to take this
logical bit-at-a-time output concept and showing how to do it efficiently
in Ada-95. Unfortunately, it appears, that you must write your own
buffering scheme in a non-portable manner, to do this. If anyone has
ideas how to do this portably, I am interested.
next prev parent reply other threads:[~1997-04-21 0:00 UTC|newest]
Thread overview: 5+ messages / expand[flat|nested] mbox.gz Atom feed top
[not found] <5j0vh0$2d1$3@cathedral.cerc.wvu.edu>
1997-04-16 0:00 ` Help!! Writing binary bit by bit Gautier
1997-04-16 0:00 ` Larry Kilgallen
1997-04-18 0:00 ` Robert Dewar
1997-04-21 0:00 ` Michael F Brenner [this message]
1997-04-23 0:00 ` Robert Dewar
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox