Hi. I'm trying to estimate (forecast) perl memory requirements for storing simple lists (hashes) in memory.
If my lists use integers as keys and all values are either integers or simple scalar strings (of maximum size each), can the total memory size be estimated by simply factoring the total number of key=value pairs when considering the maximum byte size of each value? What other overhead is required for each list? Any links or discussion would be great. ~Will
