#! /usr/bin/lua -- by Michael Anderson at -- https://stackoverflow.com/questions/8722620/comparing-two-index-tables-by-index-value-in-lua function recursive_compare(t1,t2) -- Use usual comparison first. if t1==t2 then return true end -- We only support non-default behavior for tables if (type(t1)~="table") then return false end -- They better have the same metatables local mt1 = getmetatable(t1) local mt2 = getmetatable(t2) if( not recursive_compare(mt1,mt2) ) then return false end -- Check each key-value pair -- We have to do this both ways in case we miss some. -- TODO: Could probably be smarter and not check those we've -- already checked though! for k1,v1 in pairs(t1) do local v2 = t2[k1] if( not recursive_compare(v1,v2) ) then return false end end for k2,v2 in pairs(t2) do local v1 = t1[k2] if( not recursive_compare(v1,v2) ) then return false end end return true end function genprimes(mx) local primesh = {} for i = 2, 3 do primesh[i] = true end for i = 6, mx, 6 do for j = i-1, i+1, 2 do if j <= mx then primesh[j]=true end end end local q={2,3,5,7} local p=table.remove(q,1) local mr=math.floor(math.sqrt(mx)) while p <= mr do if primesh[p] ~= nil then for i = p*p,mx,p do primesh[i] = nil end end if #q < 2 then table.insert(q,q[#q]+4) table.insert(q,q[#q]+2) end p=table.remove(q,1) end local primes = {} for k,v in pairs(primesh) do table.insert(primes,k) end table.sort(primes) return primes end function cuban1(mx) local o={} local p=genprimes(mx) local ps={} for k,v in pairs(p) do ps[v]=true end for y = 1, mx do local q=3*y*(y+1)+1 if q > mx then break end if ps[q] ~= nil then table.insert(o,q) end end return o end if recursive_compare(cuban1(1000), {7, 19, 37, 61, 127, 271, 331, 397, 547, 631, 919}) then io.write("Pass") else io.write("FAIL") end print("")