Uses of Class
graphql.schema.diffing.Mapping
-
Packages that use Mapping Package Description graphql.schema.diffing graphql.schema.diffing.ana -
-
Uses of Mapping in graphql.schema.diffing
Fields in graphql.schema.diffing declared as Mapping Modifier and Type Field Description Mapping
DiffImpl.OptimalEdit. mapping
(package private) Mapping
DiffImpl.MappingEntry. partialMapping
Methods in graphql.schema.diffing that return Mapping Modifier and Type Method Description Mapping
Mapping. copy()
Mapping
Mapping. copyMappingWithLastElementRemoved()
Mapping
Mapping. extendMapping(Vertex source, Vertex target)
Mapping
Mapping. invert()
static Mapping
Mapping. newMapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList)
Methods in graphql.schema.diffing with parameters of type Mapping Modifier and Type Method Description static int
EditorialCostForMapping. baseEditorialCostForMapping(Mapping mapping, SchemaGraph sourceGraph, SchemaGraph targetGraph)
static int
EditorialCostForMapping. baseEditorialCostForMapping(Mapping mapping, SchemaGraph sourceGraph, SchemaGraph targetGraph, java.util.List<EditOperation> editOperationsResult)
Gets the "editorial cost for mapping" for the base mapping.private int
DiffImpl. calcAnchoredVerticesCost(Vertex v, Vertex u, Mapping partialMapping)
private double
DiffImpl. calcLowerBoundMappingCost(Vertex v, Vertex u, Mapping partialMapping, java.util.Map<Vertex,java.lang.Double> isolatedVerticesCache, java.util.Map<Vertex,Vertex> nonFixedParentRestrictions)
lower bound mapping cost between for v -> u in respect to a partial mapping.private double
DiffImpl. calcLowerBoundMappingCostForIsolated(Vertex vertex, Mapping partialMapping, boolean sourceOrTarget)
Simplified lower bound calc if the source/target vertex is isolatedprivate void
DiffImpl. calculateRestOfChildren(java.util.List<Vertex> availableTargetVertices, HungarianAlgorithm hungarianAlgorithm, double[][] costMatrixCopy, double editorialCostForMapping, Mapping partialMapping, Vertex v_i, int upperBound, int level, java.util.concurrent.LinkedBlockingQueue<DiffImpl.MappingEntry> siblings)
(package private) DiffImpl.OptimalEdit
DiffImpl. diffImpl(Mapping startMapping, java.util.List<Vertex> allSources, java.util.List<Vertex> allTargets, java.util.concurrent.atomic.AtomicInteger algoIterationCount)
static int
EditorialCostForMapping. editorialCostForMapping(int baseCost, Mapping mapping, SchemaGraph sourceGraph, SchemaGraph targetGraph)
Calculates the "editorial cost for mapping" for the non-fixed targets in aMapping
.private void
DiffImpl. expandMappingAndUpdateOptimalMapping(int fixedEditorialCost, int level, DiffImpl.OptimalEdit optimalEdit, java.util.List<Vertex> allSources, Mapping toExpand, int[] assignments, java.util.List<Vertex> availableTargetVertices, double lowerBoundCost)
Extend the partial mapping to a full mapping according to the optimal matching (hungarian algo result) and update the optimal edit if we found a better one.java.util.Map<Vertex,Vertex>
PossibleMappingsCalculator. getNonFixedParentRestrictions(SchemaGraph sourceGraph, SchemaGraph targetGraph, Mapping mapping)
This computes the initial set of parent restrictions based on the given non-fixed mapping.private void
DiffImpl. updateOptimalEdit(DiffImpl.OptimalEdit optimalEdit, int newGed, Mapping mapping)
Constructors in graphql.schema.diffing with parameters of type Mapping Constructor Description MappingEntry(Mapping partialMapping, int level, double lowerBoundCost)
OptimalEdit(SchemaGraph completeSourceGraph, SchemaGraph completeTargetGraph, Mapping mapping, int ged)
-
Uses of Mapping in graphql.schema.diffing.ana
Methods in graphql.schema.diffing.ana with parameters of type Mapping Modifier and Type Method Description EditOperationAnalysisResult
EditOperationAnalyzer. analyzeEdits(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. argumentTypeOrDefaultValueChanged(EditOperation editOperation, Mapping mapping)
private boolean
EditOperationAnalyzer. doesArgumentChangeMakeSense(Vertex oldArgument, Vertex newArgument, Mapping mapping)
Sometimes the diffing algorithm will give us an argument change when the argument container changed i.e.private EditOperation
EditOperationAnalyzer. findDeletedEdge(Vertex targetVertexFrom, java.util.List<EditOperation> editOperations, Mapping mapping, java.util.function.Predicate<Edge> edgePredicate)
private void
EditOperationAnalyzer. handleAppliedDirectives(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. handleArgumentChange(EditOperation editOperation, Mapping mapping)
private void
EditOperationAnalyzer. handleArgumentChanges(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. handleEnumValuesChanges(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. handleImplementsChanges(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. handleTypeChanges(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. handleUnionMemberChanges(java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. typeEdgeChanged(EditOperation editOperation, Mapping mapping)
private void
EditOperationAnalyzer. typeEdgeInserted(EditOperation editOperation, java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. typeEdgeInsertedForArgument(EditOperation editOperation, java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. typeEdgeInsertedForField(EditOperation editOperation, java.util.List<EditOperation> editOperations, Mapping mapping)
private void
EditOperationAnalyzer. typeEdgeInsertedForInputField(EditOperation editOperation, java.util.List<EditOperation> editOperations, Mapping mapping)
-