Thanks for paying attention to my doubts, perhaps I wasn't very clear. What I meant was total length of unique words i.e. hash keys. Would be roughly equal to size of output file, which is almost the same for both original test and parent node. I don't think it's worth the effort to create simulation with a few GB output file.
In reply to Re^4: Rosetta Code: Long List is Long
by Anonymous Monk
in thread Rosetta Code: Long List is Long
by eyepopslikeamosquito
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |