Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!unixhub!slacvm!harm
From: HARM@SLACVM.SLAC.STANFORD.EDU
Newsgroups: comp.lang.c
Subject: Re: Divide and C
Message-ID: <91088.100120HARM@SLACVM.SLAC.STANFORD.EDU>
Date: 29 Mar 91 18:01:20 GMT
References: <1991Mar27.185804.7221@uunet.uu.net> <639@taumet.com>
 <1991Mar29.163422.14672@uunet.uu.net>
Organization: Stanford Linear Accelerator Center
Lines: 23

An unportable but fun way;
         waste some space to make your storage 2i X 2j
         use the binary representation of the index
                 clip it between 2j and 2(j+1) with mask
                 shift upper to byte boundary and evaluate
both numbers determined by shift and mask. Kept in registers
could be pretty quick. if dimensions are under 256X256 it
could even maintain a great deal of portability.

       Would have sent to you directly but !'s are confusing to my
mailer.







       For that which has spewn forth, blame not my company, my university,
nor my country.  'Tis my own thoughts bubbled over's all.  Blame most
properly the oversugaring of coffee by me.
                                               Jim Harm
                            SLACVM.SLAC.STANFORD.EDU