The idea is to partition the input file into n partitions for n processes,
Perhaps you can explain how this schema will allow "I'm looking for pairs ie A1:A2, B1:B2 etc. Each member of the pair can exist anywhere in the file. "?
In reply to Re^2: Is this a job for a fork?
by BrowserUk
in thread Is this a job for a fork?
by richardwfrancis
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |