As I am developing a low level CHIP-8 interpreter, mapping opcodes to functions efficiently has become a main focus, so I decided to add a ton of function tests to the previous function enumerator. To try a specific test, Enter its name as a string into the answer box. The number of times a random opcode (1 to 16) is successfully mapped using the given method after SEARCH SECONDS seconds have passed will be displayed as Score. Tests were done to each method, and results can be found in a comment inside. Some takeaways: . The broadcast and wait block is faster with screen refresh . Binary is faster than linear conditionals . Using if statements and breaking (Stop This Script) is faster than using an if-else statement . Dynamically applying conditionals is slightly faster than reading a predefined bit table . The Repeat block is faster than the If block for breaking/control if the conditional is a number (like from a predefined bit table), but they are about the same speed when the conditional is a boolean (dynamic) . Fastest is Binary Break Dynamic or Binary Repeat Dynamic Extra note: the less than / greater than blocks are significantly slower on compiled Turbowarp compared to equals, which interestingly seems to make Linear Else / Linear Break the fastest method for this test when compiling.
