Returns a map from source concepts to inter-concept relationships.
Returns a map from source concepts to inter-concept relationships. Must be fast in order for this trait to be fast.
Returns a map from target concepts to inter-concept relationships.
Returns a map from target concepts to inter-concept relationships. Must be fast in order for this trait to be fast.
Filters inter-concept relationships of the given type that are incoming to the given concept.
Filters inter-concept relationships of the given type that are incoming to the given concept.
Filters the longest inter-concept relationship paths that are incoming to the given concept and whose relationships are of the given type.
Filters the longest inter-concept relationship paths that are incoming to the given concept 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!
This is a very general method that is used to implement specific methods in more specific relationship query API traits.
It is also a dangerous method in that termination is not guaranteed, but may depend on the passed relationship path predicate. For safety, make sure that the predicate detects cycles and returns false on detecting them.
Calls filterLongestIncomingInterConceptRelationshipPaths, but adds cycle detection to the predicate.
Calls filterLongestIncomingInterConceptRelationshipPaths, but adds cycle detection to the predicate.
Filters the longest inter-concept relationship paths that are outgoing from the given concept and whose relationships are of the given type.
Filters the longest inter-concept relationship paths that are outgoing from the given concept 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!
This is a very general method that is used to implement specific methods in more specific relationship query API traits.
It is also a dangerous method in that termination is not guaranteed, but may depend on the passed relationship path predicate. For safety, make sure that the predicate detects cycles and returns false on detecting them.
Calls filterLongestOutgoingInterConceptRelationshipPaths, but adds cycle detection to the predicate.
Calls filterLongestOutgoingInterConceptRelationshipPaths, but adds cycle detection to the predicate.
Filters inter-concept relationships of the given type that are outgoing from the given concept.
Filters inter-concept relationships of the given type that are outgoing from the given concept.
Finds all "following" ("consecutive") inter-concept relationships of the given result type.
Finds all "following" ("consecutive") inter-concept relationships of the given result type.
Two relationships "follow" each other if method InterConceptRelationship.isFollowedBy
says so.
Note that for non-dimensional relationships this implies that the parameter and result relationship types must be the same, or else no relationships are returned.
This method is shorthand for:
filterOutgoingInterConceptRelationshipsOfType(relationship.targetConceptEName, resultRelationshipType) { rel =>
relationship.isFollowedBy(rel)
}
Finds all inter-concept relationships of the given type that are incoming to the given concept.
Finds all inter-concept relationships of the given type that are incoming to the given concept.
Finds all inter-concept relationships of the given type that are outgoing from the given concept.
Finds all inter-concept relationships of the given type that are outgoing from the given concept.
Partial implementation of
InterConceptRelationshipContainerApi
.