|
Many common sort() operations using a simple inlined block are now optimized for faster
performance.
Certain operations in the RHS of assignment statements have been optimized to directly set
the lexical variable on the LHS, eliminating redundant copying overheads.
Minor changes in how subroutine calls are handled internally provide marginal improvements
in performance.
The hash values returned by delete(), each(), values() and hashes in a list context are the
actual values in the hash, instead of copies. This results in significantly better
performance, because it eliminates needless copying in most situations.
|
|
