How about this?

Do a preprocess.  Set up array two and start shifting it as I explained.
Each time you do a shift, do an XFOOT.  This will get you the bit count.
Do a MOVEA to get the bit pattern, then add the pattern and bit count to
a list.

What kind of list depends on the number of entries.  You might be able
to use an array for small numbers; I'm not sure what the max on DIM is.
Remember that the number of entries required is the (2 ^ (number of
values)), and that number goes up quick.  Personally, I think you could
probably use a data file instead, because you could preload it.  100
values would require about a million entries, each about 100 bytes long
(plus the bit count). 

Then, process the list based on the bit count.

It's a thought.

Joe


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2022 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.