Is there a good reference out there describing the complexity (run-time, space) of various Perl builtin functions and data structures? In particular, I'm wondering about shift, unshift, push, pop, substr, split, and join as well as the typical space requirements (per key or element) for perl arrays and hashes.