You say a short cutting grep has less overhead then List::Util::first() ?
That's strange, can you show a benchmark?
Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!
In reply to Re^3: Shortcutting grep in boolean context
by LanX
in thread Shortcutting grep in boolean context
by perlancar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |