v1
1/15/2024 by sdlkfslkdf -00
Setup HTML - click to add setup HTML
Setup JS - click to add setup JavaScript
delete caserun single casemove downdrag and drop case


ready



function bitRev7(n) {

	// 8-bit rev bithack
	n = ((n & 0b10101010) >> 1) | ((n & 0b01010101) << 1);
	n = ((n & 0b11001100) >> 2) | ((n & 0b00110011) << 2);
	n = ((n & 0b11110000) >> 4) | ((n & 0b00001111) << 4);

	return n >> 1; // shift off 0th bit (giving us a 7-bit rev overall)
}
let ans = 0;
for (let i = 0; i < (1 << 7); i++) {
	ans = ans ^ bitRev7(i);
}
delete caserun single casemove updrag and drop case


ready



function bitRev7(n) {
	return parseInt(n.toString(2).split("").reverse().join("").padEnd(7, "0"), 2);
}
let ans = 0;
for (let i = 0; i < (1 << 7); i++) {
	ans = ans ^ bitRev7(i);
} 
Test Case - click to add another test case
Teardown JS - click to add teardown JavaScript
Output (DOM) - click to monitor output (DOM) while test is running
RUN