2018-11-05 07:12:52 +03:00
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, // adapted from http://asmjs.org/spec/latest/
|
2018-10-25 07:17:05 +03:00
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
2018-11-05 07:12:52 +03:00
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k | 1;
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l | 2;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
for( // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n | 7) < (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o | 8); // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9) | 10){
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n >> 11]);
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
2018-11-05 07:12:52 +03:00
|
|
|
return +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
2018-11-05 07:12:52 +03:00
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k | 12;
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l | 13;
|
|
|
|
return +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k) | 14));
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
|
|
|
return {
|
2018-11-05 07:12:52 +03:00
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p
|
2018-10-25 07:17:05 +03:00
|
|
|
};
|
|
|
|
}
|
2018-11-05 07:12:52 +03:00
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
2018-10-25 07:17:05 +03:00
|
|
|
function q(b, c, d) {
|
2018-11-05 07:12:52 +03:00
|
|
|
var e = b.f.e;
|
|
|
|
var g = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k | 15;
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l | 16;
|
|
|
|
var // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
for( // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n | 21) < (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o | 22); // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23) | 24){
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n >> 25]);
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
2018-11-05 07:12:52 +03:00
|
|
|
return +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
2018-11-05 07:12:52 +03:00
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k | 26;
|
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l | 27;
|
|
|
|
return +// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, l) / +((// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, l) / +((l - // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, l) / +((l - k) | 28));
|
2018-10-25 07:17:05 +03:00
|
|
|
}
|
|
|
|
return {
|
2018-11-05 07:12:52 +03:00
|
|
|
// adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, l) / +((l - k)|28));
|
|
|
|
}
|
|
|
|
return { p: // adapted from http://asmjs.org/spec/latest/
|
|
|
|
function a(b, c, d) {
|
|
|
|
"use asm";
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|1;
|
|
|
|
l = l|2;
|
|
|
|
var m = 0.0, n = 3, o = 4;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 5, o = l << 6; (n|7) < (o|8); n = (n + 9)|10) {
|
|
|
|
m = m + +g(h[n>>11]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|12;
|
|
|
|
l = l|13;
|
|
|
|
return +e(+j(k, l) / +((l - k)|14));
|
|
|
|
}
|
|
|
|
return { p: p };
|
|
|
|
}
|
|
|
|
function q(b, c, d) {
|
|
|
|
var e = b.f.e;
|
|
|
|
var g = b.f.g;
|
|
|
|
var h = new b.i(d);
|
|
|
|
function j(k, l) {
|
|
|
|
k = k|15;
|
|
|
|
l = l|16;
|
|
|
|
var m = 0.0, n = 17, o = 18;
|
|
|
|
// asm.js forces byte addressing of the heap by requiring shifting by 3
|
|
|
|
for (n = k << 19, o = l << 20; (n|21) < (o|22); n = (n + 23)|24) {
|
|
|
|
m = m + +g(h[n>>25]);
|
|
|
|
}
|
|
|
|
return +m;
|
|
|
|
}
|
|
|
|
function p(k, l) {
|
|
|
|
k = k|26;
|
|
|
|
l = l|27;
|
|
|
|
return +e(+j(k, l) / +((l - k)|28));
|
|
|
|
}
|
|
|
|
return { p: p
|
2018-10-25 07:17:05 +03:00
|
|
|
};
|
|
|
|
}
|