https://www.w3.org/Bugs/Public/show_bug.cgi?id=29153 --- Comment #6 from Michael Kay <mike@saxonica.com> --- I don't see a problem with lookahead and accumulators. Process A does the lookahead, that is: repeat { read node N write node N-1 } Process B reads the output of Process A Process A knows whether the node it has just passed to Process B is the last in the sequence Process B evaluates the accumulators. -- You are receiving this mail because: You are the QA Contact for the bug.Received on Wednesday, 30 September 2015 09:21:26 UTC
This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:57:56 UTC