Re: Is there an easy way to scan for bits?

even if one uses the table version, one would
want a program to generate the table values.

From: Steve Richter <srichter@AutoCoder.com>
> I like the idea of writing a pgm to generate this code.
>
> From: "Leif Svalgaard" <leif@leif.org>
> > true, but it will only have to be done once, will never
> > have to be maintained, and can to a generated by a
> > program that takes the codes as input.
> >
> > From: Steve Richter <srichter@AutoCoder.com>
> > > I agree the Leif binary tree method would run the fastest, but if the
> > > psuedocode that follows represents it correctly, I think it will be a
> > coding
> > > rats nest.
> > >
> > > If Bit_0 is On
> > >     If Bit_1 is On
> > >         If Bit_2 is On
> > >             If Bit_3 is On
> > >                 Result = 7
> > >             Else
> > >                 Result = 6
> > >             End
> > >         Else
> > >             If Bit_3 is On
> > >             Else
> > >                 Result = 5
> > >             End
> > >         End
> > >
> > > From: "Harry Williams" <planesmart@teleteam.com>
> > > > 0111 = 2
> > > > 1000 = 3
> > > > 1011 = 4
> > > > 1100 = 5
> > > > 1110 = 6
> > > > 1111 = 7
> >