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.
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.