HPCC-12633 Improve contention cost in splitter

In cases where the consumers keep pace and are waiting on the
produce side of the splitter, the cost of waiting was costly.
The change here, introduces a callback mechanism into the shared
write ahead, such that the producer [optionally] only triggers
the readers that there is something to consumer per page flush.
In the memory variety of the shared writer which blocks when it
is far enough ahead, the producer will write (and page) as fast
as possible on a async thread, and block when full.
All of this savs the cosumers, entering crits, waiting on
semaphores and waking up and re-entering crits etc. on a per row
basis when they are consuming quickly.

Signed-off-by: Jake Smith <jake.smith@lexisnexis.com>
So the readahead could hit an exception, but fired on an output(s) early, which may never have otherwise got to (e.g. because of CHOOSEN)

It should not fire the exception, until the output has exhausted the records, i.e. up to the point the exception was recorded.

This isn't a new issue, I'll open a separate JIRA to address it. See : HPCC-12685