Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!spool.mu.edu!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!cs.umu.se!dvljrt
From: dvljrt@cs.umu.se (Joakim Rosqvist)
Newsgroups: comp.sys.amiga.programmer
Subject: Re: best way to reverse a bitplane?
Message-ID: <1991May2.095937.8287@cs.umu.se>
Date: 2 May 91 09:59:37 GMT
References: <1991Apr29.101302.1@atmo2.atmo.arizona.edu> <21107@cbmvax.commodore.com>
Sender: news@cs.umu.se (News Administrator)
Organization: Dep. of Info.Proc, Umea Univ., Sweden
Lines: 14

In article <21107@cbmvax.commodore.com> chrisg@cbmvax.commodore.com (Chris Green) writes:
>In article <1991Apr29.101302.1@atmo2.atmo.arizona.edu> leuthold@atmo2.atmo.arizona.edu writes:
>>What is the best way to reverse a bitplane?  A brute force method would be 
>>to reverse the bytes and then reverse the bits in each byte.  The only way I
>>can think of to reverse the bits in each byte is to mask each bit off then
>>shift it to its new place and add it to the new byte.  Is there a better way?
>
>
>	You want a 256 byte table for the bit reversal. A 64K table if you REALLY
>need it to be fast.
>|Chris Green - Graphics Software Engineer   - chrisg@commodore.COM      f

Make that a 128K table - you would be using 64K words!
/$DR.HEX$