//рекурсивная функция, реализующая первый алгоритм (перевод в двоичную СИ)
function I2B(i : word) : string;
begin
Result := '';
if i > 1
then Result := I2B(i div 2) + IntToStr(i mod 2) + Result
else Result := IntToStr(i) + Result;
end;

//и ее аналог на JASS
function I2B takes integer I returns string
local string Result=""
if (I > 1) then
set Result = I2B(I / 2) + I2S(ModuloInteger(I,2)) + Result
else
set Result = I2S(I) + Result
endif
return Result
endfunction

function I2B takes integer i returns string
local integer b
local string Result = ""
loop
    exitwhen i <= 0
    set b = i / 2
    set Result = I2S(i - b - b) + Result
    set i = b
endloop
return Result
endfunction

function B2I(s : string) : word;
var
  i,j : integer;
  step : word;
begin
Result := 0;
step := 1;
for i := Length(s) downto 1 do
  begin
  Result := Result + step*StrToInt(s[i]);
  step := step * 2;
  end;
end;

function B2I takes string s returns integer
local integer Result=0
local integer i=0
local integer step=0
local integer strlen=StringLength(s)
set i = strlen
set step = 1
loop
    exitwhen (i < 1)
    set Result = Result  +  step*S2I(SubStringBJ(s,i,i))    
    set i = i - 1
    set step = step * 2
endloop
return Result
endfunction

14 XOR 3 = 13
В данном случае 3 - ключ
В битовом эквиваленте
14 = 1110
3   = 0011
===========
Xor= 1101 = 13
3   = 0011
Xor= 1110 = 14

function BitwiseOperation takes string s1, string s2, integer operation returns string
local string Result=""
local integer i=0
local integer strlen1=StringLength(s1)
local integer strlen2=StringLength(s2)
local boolean operationresult=false

set i = 1
if (strlen1 > strlen2) then
    loop
        exitwhen (i > (strlen1 - strlen2))
        set s2 = "0" + s2
        set i = i + 1
    endloop
else
    loop
        exitwhen (i > (strlen2 - strlen1))
        set s1 = "0" + s1
        set i = i + 1
    endloop
endif

set i = 1
loop
    exitwhen(i > strlen1)
    if (operation==0) then
       set operationresult = ((SubStringBJ(s1,i,i)=="1") and (SubStringBJ(s2,i,i)=="1")) 
    elseif (operation==1) then
       set operationresult = ((SubStringBJ(s1,i,i)=="1") or (SubStringBJ(s2,i,i)=="1"))
    elseif (operation==2) then
       set operationresult = (SubStringBJ(s1,i,i) != SubStringBJ(s2,i,i))
    elseif (operation==3) then    
       set operationresult = (SubStringBJ(s1,i,i) == SubStringBJ(s2,i,i))
    elseif (operation==4) then 
       set operationresult = (SubStringBJ(s1,i,i) == "0")
    else
       set operationresult = false
    endif
    if operationresult then
        set Result = Result + "1"
    else
        set Result = Result + "0"
    endif
    set i = i + 1
endloop
return Result
endfunction

operation = 0 (And)
operation = 1 (Or)
operation = 2 (XOR)
operation = 3 (Eqv)
operation = 4 (Not)

function BitwiseAnd takes integer I, integer J returns integer
    return B2I(BitwiseOperation(I2B(I),I2B(J),0))
endfunction

function BitwiseOr takes integer I, integer J returns integer
    return B2I(BitwiseOperation(I2B(I),I2B(J),1))
endfunction

function BitwiseXOR takes integer I, integer J returns integer
    return B2I(BitwiseOperation(I2B(I),I2B(J),2))
endfunction

function BitwiseEQV takes integer I, integer J returns integer
    return B2I(BitwiseOperation(I2B(I),I2B(J),3))
endfunction

function BitwiseNot takes integer I, integer J returns integer
    return B2I(BitwiseOperation(I2B(I),"",4))
endfunction

function B2I takes string s returns integer
local integer Result=0
local integer i=0
local integer j=0
local integer step=0
local integer strlen=StringLength(s)
set i = 1
loop
    exitwhen (i > strlen)
    set step = 1
    set j = 1
    loop
        exitwhen (j > (i-1))
        set step = step * 2
        set j = j + 1
        endloop
    set Result = Result  +  step*S2I(SubStringBJ(s,strlen-i+1,strlen-i+1))    
    set i = i + 1
endloop
return Result
endfunction

function ModuloInteger takes integer dividend, integer divisor returns integer
    local integer modulus = dividend - (dividend / divisor) * divisor
    if (modulus < 0) then
        set modulus = modulus + divisor
    endif
    return modulus
endfunction

function B2I takes string s returns integer
local integer Result=0
local integer i=0
local integer step=0
local integer strlen=StringLength(s)
set i = strlen
set step = 1
loop
    exitwhen (i < 1)
    set Result = Result  +  step*S2I(SubStringBJ(s,i,i))    
    set i = i - 1
    set step = step * 2
endloop
return Result
endfunction

string I2fs(i)
{
 local integer b
local string s = ""
loop
exitwhen i <= 0
set b = i / 2
s = s + I2S(i - b - b)
set i = b
endloop
return s
}

loop
        exitwhen i > 200
        call TriggerSleepAction( 0.00 )
        set j = 0
        loop
            exitwhen j > 50
            call BitwiseXOR( 999999, 999999 )
            set j = j + 1
        endloop                
        set i = i + 1
    endloop

loop
        exitwhen i > 200
        call TriggerSleepAction( 0.00 )
        set j = 0
        loop
            exitwhen j > 200
            call BitwiseXOR( 999999, 999999 )
            set j = j + 1
        endloop                
        set i = i + 1
    endloop

function BitwiseXOR_Shell takes nothing returns nothing
    call BitwiseXOR( 999999, 999999 )
    set udg_Flag=true
endfunction

local trigger ttrigger=null
set ttrigger = CreateTrigger()
call TriggerAddAction( ttrigger, function BitwiseXOR_Shell )