[SOLVED] BitAND() and multiple choice settings without the limitation.

[guinness]

For UDF's with multiple choice settings I use the following >>

Global $Flag = 1 + 2 ; Settings 1 and 2 are to be used.
If BitAND($Flag, 1) Then ConsoleWrite("1 >> Example Setting 1." & @CRLF)
If BitAND($Flag, 2) Then ConsoleWrite("2 >> Example Setting 2." & @CRLF)
If BitAND($Flag, 4) Then ConsoleWrite("4 >> Example Setting 3." & @CRLF)
If BitAND($Flag, 8) Then ConsoleWrite("8 >> Example Setting 4." & @CRLF)
If BitAND($Flag, 16) Then ConsoleWrite("16 >> Example Setting 5." & @CRLF)

But this has a limitation because of multiplying everytime. So what would be the best way if I wanted 200 settings? For example I have an Array populated with 200 items, if a user selects 1 + 2 + 67 then it will only output these three items! If anyone knows this would be much appreciated.

Something along these lines >>

Global $Flag = 1 + 2 ; Settings 1 and 2 are to be used.
If BitAND($Flag, 1) Then ConsoleWrite("1 >> Example Setting 1." & @CRLF)
If BitAND($Flag, 2) Then ConsoleWrite("2 >> Example Setting 2." & @CRLF)
If BitAND($Flag, 3) Then ConsoleWrite("4 >> Example Setting 3." & @CRLF)
If BitAND($Flag, 4) Then ConsoleWrite("8 >> Example Setting 4." & @CRLF)
If BitAND($Flag, 5) Then ConsoleWrite("16 >> Example Setting 5." & @CRLF)

Note: I hit Enter a little early so was in a rush to update the post.

Edited February 26, 2011 by guinness

[hannes08]

Hi guinnes,

what about looping with 2^x?

like:

For $i = 0 To 100
If BitAND($Flag, 2^$i) Then ConsoleWrite(2^$i & " >> Example Setting " & $i & " ." & @CRLF)
Next

Maybe I didn't get it right...

Regards,

Hannes

[guinness]

Thanks ever so much for the quick reply. It's at least on the right track

Example >>

I am using the above Function by GeoSOFT as an example in case people wonder why I am crazy using an Array with 283 elements .GetDetailsOf has up to 283 values that can be returned most of which are blank. I would like to improve this Function by calling _FileGetDetails($Filename, 12 + 30 + 98) so the Output/Return would be an Array with 3 elements containing the Values of Index 12, 30 & 98. If _FileGetDetails($Filename, 12 + 30 + 98 , 78, 54) was called then this would Output/Return an Array with 5 elements containing those elements. With BitAND()

_BitAND_Flags(283) ; See it Stop at 4611686018427387904!

Func _BitAND_Flags($iFlags = 1)
    Local $iFlagCount = 1
    For $A = 1 To $iFlags
        ConsoleWrite('If BitAND($Flag, ' & $iFlagCount & ') Then ConsoleWrite("' & $iFlagCount & ' >> Example" & @CRLF)' & @CRLF)
        $iFlagCount *= 2
    Next
EndFunc   ;==>_BitAND_Flags

[KaFu]

Had the same issues in SMF too, now I use a Flag array for this ...

Global $aFlags[10]
$aFlags[0] = UBound($aFlags) -1
$aFlags[1] = 1
$aFlags[6] = 1
$aFlags[8] = 1
for $i = 1 to $aFlags[0]
    if $aFlags[$i] then
        ConsoleWrite("Flag " & $i & " is set." & @crlf)
    Else
        ConsoleWrite("Flag " & $i & " is NOT set." & @crlf)
    endif
Next

[guinness]

OK, thanks KaFu. I will use this in the future Thanks.

[PsaltyDS]

I am using the above Function by GeoSOFT as an example in case people wonder why I am crazy using an Array with 283 elements .GetDetailsOf has up to 283 values that can be returned most of which are blank. I would like to improve this Function by calling _FileGetDetails($Filename, 12 + 30 + 98) so the Output/Return would be an Array with 3 elements containing the Values of Index 12, 30 & 98. If _FileGetDetails($Filename, 12 + 30 + 98 , 78, 54) was called then this would Output/Return an Array with 5 elements containing those elements. With BitAND()

That simply won't work. If you add together those numbers, how do you know in the resulting value if the caller wanted index 12, or indexes 8+4? Adding them together only works that way if each value is exactly 2^n, where n is the bit number you wanted.

If you want to pass bit-mapped Boolean flags for 283 items you need a binary that long (or an array, as KaFu mentioned). The AutoIt bit-wise functions only accept a 32-bit value. So you are stuck with nine of them in an array anyway to cover all the possible combinations, or breaking a 283-bit binary into 32-bit words in your function before performing the bit-wise operations.

[guinness]

Thanks PsaltyDS. In some roundabout way I am happy it can't be done because I thought it couldn't, but you know the saying if you don't ask you don't get