From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,bb308d1c28007ccb
X-Google-Attributes: gid103376,public
From: mfb@mbunix.mitre.org (Michael F Brenner)
Subject: Re: Help!! Writing binary bit by bit
Date: 1997/04/21
Message-ID: <5jfvp4$lrj@top.mitre.org>#1/1
X-Deja-AN: 236372391
References: <5j0vh0$2d1$3@cathedral.cerc.wvu.edu> <dewar.861363672@merv>
Organization: The MITRE Corporation, Bedford Mass.
Newsgroups: comp.lang.ada
Date: 1997-04-21T00:00:00+00:00
List-Id: <comp.lang.ada>


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.