RE: Comments on XPath Filter 2.0 draft (2002-06-20)

Joseph,

> On Wednesday 10 July 2002 09:11 am, Gregor Karlinger wrote:
> > Fine again.
> 
> I tried to reflect these in [1], but I'm not sure if the 
> tweaks intended to 
> elide the previous second and third points -- Marlin later 
> said he wanted 
> the second point retained. So let me know if I got it right. 
> Also, what is 
> meant by "passed" below?

Please remove the third "+" point. It is is of no meaning any
more since the flag Z is computed for each node now.

Regards, Gregor

> 
> 
> 
> [1]http://www.w3.org/Signature/Drafts/xmldsig-filter2/Overview
> .html#sec-ProcModel
> $Revision: 1.20 $ on $Date: 2002/07/10 17:25:01 $ GMT by 
> $Author: reagle $
>     * Process each node in the input node-set document, 
> adding each node
>        to the output node-set F if a flag Z is true. The flag 
> is computed
>        as follows:
>           + Z is true if and only if the node is present in any
>             subtree-expanded union node-set and all subsequent
>             subtree-expanded intersect node-sets but no subsequent
>             subtree-expanded subtract node-sets, or false 
> otherwise. If
>             there are no subsequent intersect or subtract 
> node-sets, then
>             that part of the test is automatically passed.
>           + Presence in a subtree-expanded node-set can be efficiently
>             determined without actually expanding the 
> node-set, by simply
>             maintaining a stack or count that identifies whether any
>             nodes from that node-set are an ancestor of the node being
>             processed.
>           + The initial value of Z is irrelevant because it will be
>             automatically computed when the first document node is
>             processed.
> 
>    Implementers MAY further observe that, if this transform 
> is followed
>    by a canonicalization operation, the described filter 
> computation can
>    be efficiently commingled with the document-order canonicalization
>    processing.
> 
>