Github user srowen commented on the issue:
https://github.com/apache/spark/pull/19180
Yeah it would be great if it were strictly faster. For < 7 bytes, the new
loop doesn't execute, so it doesn't matter, and it just proceeds with the old
loop, which should be the same. The only overhead I can see is getting the
offsets. What if you just short-circuited right after computing wordMax and
check `wordMax > 0`? then I don't see how it would be slower. It'd be simpler
too.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: reviews-unsubscr...@spark.apache.org
For additional commands, e-mail: reviews-h...@spark.apache.org
