> This is very memory intensive.
Only for ones not familiar with awk.
It would make a lot of sense after you understand how awk works (as the article explains).
Only for ones not familiar with awk.
It would make a lot of sense after you understand how awk works (as the article explains).
Sois it memory intensive or not?
If the file is large, and mostly unique, then assume that a substantial portion of the file will be loaded into memory.
If this is larger than the amount of ram, then portions of the active array will be paged to the swap space, then will thrash the drive as each new line is read forcing a complete rescan of the array.
This is very handy for files that fit in available ram (and zram may help greatly), but it does not scale.
Since then, perl and php have also implemented associative arrays. All three can loop over the text index of such an array and produce the original value, which a (bijective) hash cannot do.