INNER CODE UNIT · JavaScript

r

lh3/yak · misc/test-qv.js:71

var r = a[max_q][1] / a[max_q][0];

var f = 0.00008;
var b = [];
b[0] = [a[0][0], a[0][1]];
b[1] = [a[1][0], a[1][1]];
for (var i = 2; i < a.length; ++i) {
	if (i <= max_q) {
		var y = (r * a[i][0] - a[i][1]) / (r - f);
		var z = a[i][0] - y;
		if (z < 0) z = 0;
		b[i] = [z, r * z];
	} else b[i] = [a[i][0], a[i][1]];
	//print(i, a[i][0], a[i][1], b[i][0].toFixed(0), b[i][1].toFixed(0));
}

var min_cnt = max_cnt, min_q = max_q;
for (var i = max_q; i >= 2; --i)

View source record →