In XFA SOM Expressions, there’s a “..” syntax that might actually do what you want. You can use this in conjunction with resolveNode(). See “Selecting Descendants At Any Level”, page 103, in the XFA Specification Version 3.0 (though this syntax has been supported in XFA for a long time now).

Wondering if you can point me in the right direction (or take up my cause with the XFA/XTG team).

The resolveNode() method has one of two behaviors:

xfa.resolveNode(somExpression) will start at the root node and search downwards through the xfa tree to find the node matching somExpression.

myStartNode.resolvenode(somExpression) will start at myStartNode and search UP through the xfa tree.

It would be very useful to extend the resolveNode function to allow the search to begin at myStartNode, and search DOWN through it’s children.

I realize this could be accomplished by using .nodes, and recursively iterating through all children while doing a comparison by Name, but I imagine that a built-in resolveNode function would be far quicker than this approach for large forms (would also help if resolveNodes is also covered, as a custom solution to that with .nodes would require each match to be stored to an array, and could get messy).

Has this been covered before by anyone? Any chance of seeing this in the next XFA version?

Thanks