LÖVE

Code: Select all

//in index.html
var input="input"; var inputIdx=-1;
var Module = {
print: function(sout) { console.log('lua stdout: ' + sout) },
//[...]
preRun : [function() {
 function stdin() {
  ++inputIdx;
  if(inputIdx>input.length)
   return 0;
  return input[inputIdx].charCodeAt(0);
 }

Code: Select all

-- in main.lua
function love.load(arg)
 io.stdout:setvbuf("no")
 io.stdin:setvbuf("no")
 
 io.stdin:write("output")
 sinp=io.stdin:read(1)
 while sinp~=nil do
  sinp=io.stdin:read(1) end
end

Code: Select all

//in index.html
var Module = {
 TOTAL_MEMORY:100000000, // 100MBs

Code: Select all

-- in main.lua
function bit_xor(a,b)
    local p,c=1,0
    while a>0 and b>0 do
        local ra,rb=a%2,b%2
        if ra~=rb then c=c+p end
        a,b,p=(a-ra)/2,(b-rb)/2,p*2
    end
    if a<b then a=b end
    while a>0 do
        local ra=a%2
        if ra>0 then c=c+p end
        a,p=(a-ra)/2,p*2
    end
    return c
end
function bit_or(a,b)
    local p,c=1,0
    while a+b>0 do
        local ra,rb=a%2,b%2
        if ra+rb>0 then c=c+p end
        a,b,p=(a-ra)/2,(b-rb)/2,p*2
    end
    return c
end
function bit_not(n)
    local p,c=1,0
    while n>0 do
        local r=n%2
        if r<1 then c=c+p end
        n,p=(n-r)/2,p*2
    end
    return c
end
function bit_and(a,b)
    local p,c=1,0
    while a>0 and b>0 do
        local ra,rb=a%2,b%2
        if ra+rb>1 then c=c+p end
        a,b,p=(a-ra)/2,(b-rb)/2,p*2
    end
    return c
end
function bit_lshift(a,n)
  return bit_and(a*2^n,4095)
end
function bit_lshift32(a,n)
  return bit_and(a*2^n,4294967295)
end
function bit_rshift(a,n)
  return math.floor(a/2^n)
end
function bit_bits(x)
    local powers={
        nil,nil,nil,nil,
        nil,nil,nil,nil,
        nil,nil,nil,nil,
        nil,nil,nil,nil,
    }
    local i,n=1,0
    while x~=0 do
        local r=x%2
        if r==1 then
            x,n=x-1,n+1
            powers[n]=i
        end
        x,i=x/2,2*i
    end
end
function bit_sum32(a,b)
return bit_and(a+b,4294967295)
end