Example #1
0
 /**
  * Creates an edge between an import definition and its source usage.
  *
  * @param importDefinitionVertex The import definition.
  * @param sourceUsageVertex The source usage.
  * @param beginAST The AST element representing the first element of the import definition.
  * @param endAST The AST element representing the last element of the import definition.
  */
 public void attach(
     ImportDefinition importDefinitionVertex,
     SourceUsage sourceUsageVertex,
     AST beginAST,
     AST endAST) {
   IsExternalDeclarationIn isExternalDeclarationInEdge =
       programGraph.createIsExternalDeclarationIn(importDefinitionVertex, sourceUsageVertex);
   Utilities.fillEdgeAttributesFromASTDifference(isExternalDeclarationInEdge, beginAST, endAST);
 }
Example #2
0
 /**
  * Creates an edge between a qualified name and an import definition.
  *
  * @param qualifiedNameVertex The qualified name of the import.
  * @param importDefinitionVertex The import definition.
  * @param beginAST The AST element representing the first element of the qualified name.
  * @param endAST The AST element representing the last element of the qualified name.
  */
 public void attach(
     QualifiedName qualifiedNameVertex,
     ImportDefinition importDefinitionVertex,
     AST beginAST,
     AST endAST) {
   IsImportedTypeOf isImportedTypeOfEdge =
       programGraph.createIsImportedTypeOf(qualifiedNameVertex, importDefinitionVertex);
   Utilities.fillEdgeAttributesFromASTDifference(isImportedTypeOfEdge, beginAST, endAST);
 }
Example #3
0
 /**
  * Creates a vertex for an import definition.
  *
  * @param qualifiedNameVertex The qualified name of the import.
  * @param beginAST The AST element representing the first element of the qualified name.
  * @param endAST The AST element representing the last element of the qualified name.
  * @return The created vertex.
  */
 public ImportDefinition createImportDefinition(
     QualifiedName qualifiedNameVertex, AST beginAST, AST endAST) {
   ImportDefinition importDefinitionVertex;
   String fullyQualifiedName = qualifiedNameVertex.get_fullyQualifiedName();
   if (fullyQualifiedName.endsWith("*")) {
     PackageImportDefinition packageImportDefinitionVertex =
         programGraph.createPackageImportDefinition();
     // packageImportVertex.setFullyQualifiedName(
     // fullyQualifiedName.substring( 0, fullyQualifiedName.length() - 2
     // ) ); //cuts of ".*"
     importDefinitionVertex = packageImportDefinitionVertex;
   } else {
     ClassImportDefinition classImportDefinitionVertex =
         programGraph.createClassImportDefinition();
     // classImportVertex.setFullyQualifiedName( fullyQualifiedName );
     importDefinitionVertex = classImportDefinitionVertex;
   }
   IsImportedTypeOf isImportedTypeOfEdge =
       programGraph.createIsImportedTypeOf(qualifiedNameVertex, importDefinitionVertex);
   Utilities.fillEdgeAttributesFromASTDifference(isImportedTypeOfEdge, beginAST, endAST);
   return importDefinitionVertex;
 }