Shouldn't smartmatch outrun string interpolation at that task?
I'd say probably not. Smartmatch is as generic as possible and without knowing the implementation details my expectation would be that the more generic method would be slower. Anyway, since smartmatch is experimental I wouldn't be using it in code intended to be stable. YMMV.
And which methods are fastest to accomplish comparison?
That will almost certainly depend on your corpus. If your arrays differ in the first element then any iterative comparison will beat a whole-array one hands down, for example. As usual, the way to be sure is to benchmark against representative sample data.
In reply to Re: Speed of comparison of two one-dimensional arrays
by hippo
in thread Speed of comparison of two one-dimensional arrays
by rsFalse
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |