|There's more than one way to do things|
What I meant by that was that the subroutine should always return the same information - changing context should be lossless. Hence, an array vs. an iterator (or an arrayref). But, not an array vs. the first element.
I still think you are missing the point. The assumption is that in the latter case, that the routine must be calculating the entire array and then discarding most of the data in a scalar context. But that just isn't the case.
In the case of the each sub the routine can detect the scalar context and avoid a potentially costly determination of the value if the user only wants the key. That's a 50% or potentially much higher optimisation. And that for a sub that returns just a 2 element list:
For a sub like caller, if the user only wants the calling package name--which probably accounts for 90% of uses--then detecting scalar context to avoid walking a complex AST to gather the rest of the information that the user would only then discard, is again, a very useful optimisation. Think about something like Moose which needs to detect the caller package a lot, and how much more slowly it would run if caller went through the process of gathering all the 11 possible values, everytime the calling code just need the first.
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.