|
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. ----- Original Message ----- From: Steve Richter <srichter@AutoCoder.com> To: <mi400@midrange.com> Sent: Thursday, December 20, 2001 9:21 PM Subject: Re: [MI400] Is there an easy way to scan for bits? > > 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
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.