Re^2: Performance of hash and array inserts

[eyepopslikeamosquito]

An extremely(!) incomplete list of reflexive rambling responses to “memory related” posts:

• Re: Perl memory limit - Windows64 strawberry perl (2021, anony)
• Re: Perl Memory problem ... (2020)
• Re: PL_strtab/SHAREKEYS and copy-on-write leak (2018)
• Re: Internally, how do for() and while() differ? (2015)
• Re: Sys::Ramdisk as regular user on Linux (2015)
• Re: Useful number of childs revisited (2015)
• RAM: It isn't free . . . (2015)
• Re^5: RAM: It isn't free . . . (over-commit allocation -v- actual use) (2015)
• Re: RAM: It isn't free . . . (2015) - infamous Good sir, no matter how many times you throw garbage in my face response to himself :)
• Re: Bidirectional lookup algorithm? (Updated: further info.) (2015)
• Re^2: How to reslove this memory issue (2014)
• Re: "Just use a hash": An overworked mantra? (2011, Buk responds)
• Re: Compare 2 very large arrays of long strings as elements (2011 - thrashing plus SQLite)

Update: ... and the reflexive rambling responses continue ...

• Reaped: Re: Performance of hash and array inserts (Oct 11 2021, ten days after his earlier rambling response got reaped - did he forget he replied already?)
• Reaped: Re: Performance of hash and array inserts (and another reply to this thread, also quickly reaped)

References Added Later

• can I change hash keys or values directly (2021 - note choroba reply and long discussion between Marshall and LanX)