negative modulo (v9)

Revision 9 of this benchmark created by Paul on

Preparation HTML

<script>
function mmod1(n, m) {
	return ((m % n) + n) % n;
}

function mmod2(n, m) {
	return ((m + n) % n);
}

var n = 123;
</script>

Test runner

Ready to run.

Testing in
TestOps/sec
modulo prototype
mmod1(n,26);
ready
no double modulo
mmod2(n, 26);
ready

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.