This is the code that actually does the work for leafref predicates.

Dumb function that uses brute force to find a node with the given path.

If no nodes, return empty string.

Return a slice of strings containing the string-value for each node in <nodes>.

Return true (match) if filter matches target or filter is AllChildren Note that filter may be '<namespaceName>:*'.

If 2 nodes have the same NodeString then they are identical.

Generate a unique string representation of a node, in 'leafref' format, including all key values for list entries, and ending with a leaf or leaf-list value if the node is of those types.

Naive implementation is to simply loop through range of nodes and if not already in our return list, add them.

Takes root node and verifies at each level: - parent is correct - root is correct - children have correct parent - children have unique NodeString - no child is equal to another child - index is as expected.

Walk tree, calling workFn for each node, then children, recursively.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

The parser expects the lexer to return 0 on EOF.

This is the global wildcard, representing all child nodes regardless of module.

NodeRef: These allow Leafref-like objects be constructed and manipulated.

To isolate us from node types we may want to work with, we have our own interface.

PATHTYPE Useful to have this for manipulating paths.

TargetType - node type of the target to be matched Subtly different to MatchType as here we want to specify the type of our node explicitly whereas for MatchType we want to specify a set of types to be matched.