Avoid min/max crashes from mutating key functions

[zozo123]

Summary

• Snapshot min/max inputs before invoking user-provided key functions, matching the safe behavior sorted already gets from copying its iterable first.
• Add regression coverage for min, max, and sorted when the key function mutates the original list.
• Keep key comparison as a straight-line loop so checked Starlark exceptions propagate normally and no stream wrapper allocation is needed.

Fixes #30201

Test plan

• git diff --check
• Islo Linux x86_64 sandbox: bazelisk test --test_output=errors --test_filter=net.starlark.java.eval.MethodLibraryTest //src/test/java/net/starlark/java/eval:EvalTests

[google-cla]

Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA).

View this failed invocation of the CLA check for more information.

For the most up to date status, view the checks section at the bottom of the pull request.

[tetromino]

Thanks for the PR, but I'd prefer to avoid unnecessary copies; and I think the more "Starlarkic" solution would be to prohibit key from mutating the sequence. That fix is in review internally at https://bazel-review.googlesource.com/c/bazel/+/339590