It occurs to me that the in-place algorithms are not getting credited for their in-placeness, since they are all returning values and thus waste time making copies of the data.
Some of these can probably be sped up further just by not returning anything since they change $s1 directly as the OP suggested.
In reply to Re^4: Challenge: CPU-optimized byte-wise or-equals (for a meter of beer)
by SuicideJunkie
in thread Challenge: CPU-optimized byte-wise or-equals (for a meter of beer)
by dragonchild
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |