Filters non-standard relationships that are incoming to the given XML element.
Filters non-standard relationships of the given type that are incoming to the given XML element.
Filters the non-standard relationship paths that are incoming to the given XML element and whose relationships are of the given type.
Filters the non-standard relationship paths that are incoming to the given XML element and whose relationships are of the given type. Only relationship paths for which all (non-empty) "tails" pass the predicate are accepted by the filter! The relationship paths are as long as possible, but on encountering a cycle in a path it stops growing.
Filters non-standard relationships that are outgoing from the given XML element.
Filters non-standard relationships of the given type that are outgoing from the given XML element.
Filters the non-standard relationship paths that are outgoing from the given XML element and whose relationships are of the given type.
Filters the non-standard relationship paths that are outgoing from the given XML element and whose relationships are of the given type. Only relationship paths for which all (non-empty) "inits" pass the predicate are accepted by the filter! The relationship paths are as long as possible, but on encountering a cycle in a path it stops growing.
Finds all non-standard relationships that are incoming to the given XML element.
Finds all non-standard relationships of the given type that are incoming to the given XML element.
Finds all non-standard relationships that are outgoing from the given XML element.
Finds all non-standard relationships of the given type that are outgoing from the given XML element.
Purely abstract trait offering a non-standard relationship query API.
Implementations should make sure that looking up relationships by source XML fragment key is fast.
Implementations may be strict or lenient in enforced requirements on the relationship container.
For some of the graph theory terms used, see http://artint.info/html/ArtInt_50.html.