Having some experience commiting to back-end and middle-end of certain popular programming language compilers - it's not always so simple. The length of the code doesn't necessarily map to the length of machine code. It's a good rule of thumb, but it might not apply in this case.

These loops are idiomatic and easy to identify by SSA optimization rules.

There's a comment somewhere here that says it's the fastest solution. I haven't really built it with that in mind, but if it is, I bet it's because it's easy for the runtime/compiler to apply optimizations and vectorize the loops.

Just looking at them they seem ripe for some optimized SIMD bit magic implementation.

It's to simulate the API's of existing real-world HTTP routers. In the end, a router is returning a string to a HTTP server.

Maybe? At least the loop idioms are easy to pick up by the compiler middle-end.

See:

https://www.codewars.com/kata/reviews/529bf0e9bdf765717900000b/groups/586412254e2b97b090000296?utm_campaign=solution_comment_owner&utm_medium=email&utm_source=notifications#620ba4f48e75780024281aca

Thanks!

The compiler should be smart enough to get rid of them, but the boolean logic operations should be simplified.
Using bool for a variable name might not be the best practice. Using the bool variable at all seems pointless.

Done. Thanks.

Feel free to propose a better one.

My advice would be to look at the test cases and think hard about how to make them pass.

Accepted :)

Nice :)

Thanks :)

I actually wrote them by hand... It doesn't take that long to be honest.

Fixed.

Fixed.

Fixed.