Insertion and removal time for ruby datastructures

Has anyone ever analyzed the built-in ruby datastructures (array, hash,
set, etc.) for their insertion, removal, and look-up times? I regularly
use ruby to handle very large datasets, so this sort of information
would be quite useful to me. For example, in some cases, I would happily
go with a structure that had exponential insertion cost if it meant I
could get logarithmic look-up cost (rather than linear cost).

Has any work been done along these lines?

Also, It would be really great if this info were included as part of the
standard library.