INNER CODE UNIT · JavaScript

y

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

		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)
	if (min_cnt > a[i][1]) min_cnt = a[i][1], min_q = i;

if (max_cnt - min_cnt + 1 < 5) throw("ERROR: not enough points");

var N = 2;
var x = [], y = [], cap = max_q;
if (max_q > min_q + 8) cap = min_q + 8;
for (var i = min_q; i < cap; ++i)

View source record →