public interface NodeGraphResolutionExtension extends GenericExtension
Modifier and Type | Interface and Description |
---|---|
static class |
NodeGraphResolutionExtension.AlgorithmMatch |
static class |
NodeGraphResolutionExtension.Direction |
static class |
NodeGraphResolutionExtension.ModelMatch |
Modifier and Type | Field and Description |
---|---|
static java.lang.String |
GET_INBOUND |
static java.lang.String |
GET_OUTBOUND |
getDescription, getName, getProvider, getVersion
static final java.lang.String GET_INBOUND
static final java.lang.String GET_OUTBOUND
void init(java.lang.String url)
url
- service url for REST service
This must be called after constructor to initialize servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationSourceOf(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model)
reference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationTargetOf(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model)
reference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationSourceOf(int depth, AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model)
int
- Depth of the graph to resolve 1 = 1 level, n = n levelsreference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationTargetOf(int depth, AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model)
int
- Depth of the graph to resolve 1 = 1 level, n = n levelsreference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationSourceOf(int depth, AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model, LocalNameList sources, NameAndValueList qualifiers)
int
- Depth of the graph to resolve 1 = 1 level, n = n levelsreference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.Iterator<ConceptReference> getConceptReferencesForTextSearchAndAssociationTargetOf(int depth, AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model, LocalNameList sources, NameAndValueList qualifiers)
int
- Depth of the graph to resolve 1 = 1 level, n = n levelsreference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.List<ResolvedConceptReference> getCandidateConceptReferencesForTextAndAssociation(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model, LocalNameList sources, NameAndValueList qualifiers)
reference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.List<ResolvedConceptReference> getCandidateConceptReferencesForTextAndAssociation(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, java.lang.String textMatch, NodeGraphResolutionExtension.AlgorithmMatch alg, NodeGraphResolutionExtension.ModelMatch model)
reference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querytextMatch
- Text for Lucene matchalg
- AlgorithmMatch type declarationmodel
- ModelMatch type declarationurl
- Service Url for Graph Servicejava.util.List<ConceptReference> getConceptReferenceListResolvedFromGraphForEntityCode(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, NodeGraphResolutionExtension.Direction direction, java.lang.String entityCode)
reference
- The minimal reference to the coding schemeassociationName
- The relation declaration for this querydirection
- target or source indicating in or out bound edgesentityCode
- Unique id used to define start vertex for graphurl
- Service Url for Graph Servicejava.util.List<ConceptReference> getConceptReferenceListResolvedFromGraphForEntityCode(AbsoluteCodingSchemeVersionReference reference, int depth, java.lang.String associationName, NodeGraphResolutionExtension.Direction direction, java.lang.String entityCode)
reference
- The minimal reference to the coding schemeint
- Depth of the graph to resolve 1 = 1 level, n = n levelsassociationName
- The relation declaration for this querydirection
- target or source indicating in or out bound edgesentityCode
- Unique id used to define start vertex for graphurl
- Service Url for Graph Servicejava.util.Iterator<ResolvedConceptReference> getResolvedConceptReferenceListResolvedFromGraphForEntityCode(AbsoluteCodingSchemeVersionReference reference, java.lang.String associationName, NodeGraphResolutionExtension.Direction direction, java.lang.String entityCode)
java.util.List<java.lang.String> getTerminologyGraphDatabaseList()
java.util.List<java.lang.String> getGraphsForCodingSchemeName(java.lang.String name)
name
- This must be a name either retrieved from the graph database list or normalized using the
name normalizing function in this interfacejava.lang.String getNormalizedDbNameForTermServiceIdentifiers(AbsoluteCodingSchemeVersionReference ref)
ref
- uri and version for a terminology in the LexEVS servicejava.util.List<ResolvedConceptReference> doGetResolvedConceptReferenceListResolvedFromGraphForEntityCode(AbsoluteCodingSchemeVersionReference reference, int depth, java.lang.String associationName, NodeGraphResolutionExtension.Direction direction, java.lang.String entityCode)
java.util.List<ResolvedConceptReference> getAssociatedConcepts(CodedNodeSet cns, NodeGraphResolutionExtension.Direction direction, int depth, NameAndValueList association)
cns
- This CodedNodeSet must have a set of restrictions appropriate for query building and fully ready to be resolved. Cannot be nulldirection
- incoming or outgoing edges will have to be designated by one of these Enumerations. Cannot be nulldepth
- This allows depth control of the query including resolving only neighbors or a full resolution if depth is known.
Entering -1 allows full resolution, 0 will return nullassociations
- The name or names of the edges in the graph. (Must exist as a supported association the code system).
Null returns all associations