Uses of Class
graphql.schema.diffing.Vertex

Packages that use Vertex

Package	Description
graphql.schema.diffing
graphql.schema.diffing.ana

Uses of Vertex in graphql.schema.diffing

Fields in graphql.schema.diffing declared as Vertex

Modifier and Type	Field	Description
private Vertex	Edge.from
private Vertex	EditOperation.sourceVertex
private Vertex	EditOperation.targetVertex
private Vertex	Edge.to

Fields in graphql.schema.diffing with type parameters of type Vertex

Modifier and Type	Field	Description
java.util.Set<Vertex>	PossibleMappingsCalculator.PossibleMappings.allIsolatedSource
java.util.Set<Vertex>	PossibleMappingsCalculator.PossibleMappings.allIsolatedTarget
java.util.List<Vertex>	DiffImpl.MappingEntry.availableTargetVertices	These are the available vertices, relative to the parent mapping.
com.google.common.collect.Table<java.util.List<java.lang.String>,java.util.Set<Vertex>,java.util.Set<Vertex>>	PossibleMappingsCalculator.PossibleMappings.contexts
com.google.common.collect.Table<java.util.List<java.lang.String>,java.util.Set<Vertex>,java.util.Set<Vertex>>	PossibleMappingsCalculator.PossibleMappings.contexts
private java.util.Map<java.lang.String,Vertex>	SchemaGraph.directivesByName
private com.google.common.collect.Table<Vertex,Vertex,Edge>	SchemaGraph.edgesByDirection
private com.google.common.collect.Table<Vertex,Vertex,Edge>	SchemaGraph.edgesByDirection
private com.google.common.collect.Table<Vertex,Vertex,Edge>	SchemaGraph.edgesByInverseDirection
private com.google.common.collect.Table<Vertex,Vertex,Edge>	SchemaGraph.edgesByInverseDirection
private com.google.common.collect.BiMap<Vertex,Vertex>	Mapping.fixedMappings
private com.google.common.collect.BiMap<Vertex,Vertex>	Mapping.fixedMappings
com.google.common.collect.BiMap<Vertex,Vertex>	PossibleMappingsCalculator.PossibleMappings.fixedOneToOneMappings
com.google.common.collect.BiMap<Vertex,Vertex>	PossibleMappingsCalculator.PossibleMappings.fixedOneToOneMappings
java.util.List<Vertex>	PossibleMappingsCalculator.PossibleMappings.fixedOneToOneSources
java.util.List<Vertex>	PossibleMappingsCalculator.PossibleMappings.fixedOneToOneTargets
private java.util.Map<Vertex,Vertex>	Mapping.fixedParentRestrictions
private java.util.Map<Vertex,Vertex>	Mapping.fixedParentRestrictions
private java.util.List<Vertex>	Mapping.fixedSourceList
private java.util.List<Vertex>	Mapping.fixedTargetList
private com.google.common.collect.BiMap<Vertex,Vertex>	Mapping.map
private com.google.common.collect.BiMap<Vertex,Vertex>	Mapping.map
com.google.common.collect.Multimap<Vertex,Vertex>	PossibleMappingsCalculator.PossibleMappings.possibleMappings
com.google.common.collect.Multimap<Vertex,Vertex>	PossibleMappingsCalculator.PossibleMappings.possibleMappings
private java.util.List<Vertex>	Mapping.sourceList
private java.util.List<Vertex>	Mapping.targetList
private java.util.Map<java.lang.String,Vertex>	SchemaGraph.typesByName
private com.google.common.collect.Multimap<java.lang.String,Vertex>	SchemaGraph.typeToVertices
private java.util.List<Vertex>	SchemaGraph.vertices

Methods in graphql.schema.diffing that return Vertex

Modifier and Type	Method	Description
Vertex	SchemaGraph.getAppliedDirectiveContainerForAppliedDirective(Vertex appliedDirective)
Vertex	SchemaGraph.getAppliedDirectiveForAppliedArgument(Vertex appliedArgument)
Vertex	SchemaGraph.getDirective(java.lang.String name)
Vertex	SchemaGraph.getEnumForEnumValue(Vertex enumValue)
Vertex	SchemaGraph.getFieldOrDirectiveForArgument(Vertex argument)
Vertex	SchemaGraph.getFieldsContainerForField(Vertex field)
Vertex	Edge.getFrom()
Vertex	SchemaGraph.getInputObjectForInputField(Vertex inputField)
Vertex	Mapping.getParentRestriction(Vertex v)
Vertex	SchemaGraph.getSingleAdjacentInverseVertex(Vertex input)	Gets the one inverse adjacent edge to the input and gets the other vertex.
Vertex	Mapping.getSource(int i)
Vertex	Mapping.getSource(Vertex target)
Vertex	EditOperation.getSourceVertex()
Vertex	Mapping.getTarget(int i)
Vertex	Mapping.getTarget(Vertex source)
Vertex	EditOperation.getTargetVertex()
Vertex	Edge.getTo()
Vertex	SchemaGraph.getType(java.lang.String name)
private Vertex	SchemaGraphFactory.newArgument(GraphQLArgument graphQLArgument, SchemaGraph schemaGraph, boolean isIntrospectionNode)
private Vertex	SchemaGraphFactory.newField(GraphQLFieldDefinition graphQLFieldDefinition, SchemaGraph schemaGraph, boolean isIntrospectionNode)
private Vertex	SchemaGraphFactory.newInputField(GraphQLInputObjectField inputField, SchemaGraph schemaGraph, boolean isIntrospectionNode)
static Vertex	Vertex.newIsolatedNode(java.lang.String debugName)

Methods in graphql.schema.diffing that return types with arguments of type Vertex

Modifier and Type	Method	Description
java.util.List<Vertex>	SchemaGraph.addIsolatedVertices(int count, java.lang.String debugPrefix)
java.util.Optional<Vertex>	SchemaGraph.findTargetVertex(Vertex from, java.util.function.Predicate<Vertex> vertexPredicate)
java.util.List<Vertex>	SchemaGraph.getAdjacentVertices(Vertex from)
java.util.List<Vertex>	SchemaGraph.getAdjacentVertices(Vertex from, java.util.function.Predicate<Vertex> predicate)
java.util.List<Vertex>	SchemaGraph.getAdjacentVerticesInverse(Vertex to)
java.util.List<Vertex>	SchemaGraph.getAdjacentVerticesInverse(Vertex to, java.util.function.Predicate<Vertex> predicate)
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions()
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions()
private java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions(SchemaGraph sourceGraph, java.util.List<Vertex> fixedSourceVertices, java.util.Map<Vertex,Vertex> fixedOneToOneMappings)	This computes the initial set of parent restrictions based on the fixed portion of the mapping.
private java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions(SchemaGraph sourceGraph, java.util.List<Vertex> fixedSourceVertices, java.util.Map<Vertex,Vertex> fixedOneToOneMappings)	This computes the initial set of parent restrictions based on the fixed portion of the mapping.
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictionsInverse(java.util.Map<Vertex,Vertex> fixedOneToOneMappingsInverted)
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictionsInverse(java.util.Map<Vertex,Vertex> fixedOneToOneMappingsInverted)
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.
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.
java.util.List<Vertex>	SchemaGraph.getVertices()
com.google.common.collect.Multimap<java.lang.String,Vertex>	SchemaGraph.getVerticesByType()
java.util.Collection<Vertex>	SchemaGraph.getVerticesByType(java.lang.String type)
static java.util.Set<Vertex>	Vertex.newIsolatedNodes(int count, java.lang.String debugName)

Methods in graphql.schema.diffing with parameters of type Vertex

Modifier and Type	Method	Description
void	Mapping.add(Vertex source, Vertex target)
void	SchemaGraph.addDirective(java.lang.String name, Vertex vertex)
void	SchemaGraph.addType(java.lang.String name, Vertex vertex)
void	SchemaGraph.addVertex(Vertex vertex)
int	SchemaGraph.adjacentEdgesAndInverseCount(Vertex fromAndTo)
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 isolated
private 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)
static EditOperation	EditOperation.changeVertex(java.lang.String description, Vertex sourceVertex, Vertex targetVertex)
boolean	Mapping.contains(Vertex vertex, boolean sourceOrTarget)
boolean	Mapping.containsSource(Vertex sourceVertex)
boolean	Mapping.containsTarget(Vertex targetVertex)
private void	SchemaGraphFactory.createAppliedDirectives(Vertex from, java.util.List<GraphQLDirective> appliedDirectives, SchemaGraph schemaGraph)
static EditOperation	EditOperation.deleteVertex(java.lang.String description, Vertex sourceVertex, Vertex targetVertex)
Mapping	Mapping.extendMapping(Vertex source, Vertex target)
boolean	PossibleMappingsCalculator.VertexContextSegment.filter(Vertex vertex, SchemaGraph schemaGraph)
java.util.Optional<Vertex>	SchemaGraph.findTargetVertex(Vertex from, java.util.function.Predicate<Vertex> vertexPredicate)
java.util.List<Edge>	SchemaGraph.getAdjacentEdges(Vertex from, java.util.function.Predicate<Vertex> predicate)
java.lang.Iterable<Edge>	SchemaGraph.getAdjacentEdgesAndInverseNonCopy(Vertex fromAndTo)
java.util.List<Edge>	SchemaGraph.getAdjacentEdgesInverse(Vertex to, java.util.function.Predicate<Vertex> predicate)
java.util.List<Edge>	SchemaGraph.getAdjacentEdgesInverseCopied(Vertex to)
java.util.Collection<Edge>	SchemaGraph.getAdjacentEdgesInverseNonCopy(Vertex to)
java.util.Collection<Edge>	SchemaGraph.getAdjacentEdgesNonCopy(Vertex from)
java.util.List<Vertex>	SchemaGraph.getAdjacentVertices(Vertex from)
java.util.List<Vertex>	SchemaGraph.getAdjacentVertices(Vertex from, java.util.function.Predicate<Vertex> predicate)
java.util.List<Vertex>	SchemaGraph.getAdjacentVerticesInverse(Vertex to)
java.util.List<Vertex>	SchemaGraph.getAdjacentVerticesInverse(Vertex to, java.util.function.Predicate<Vertex> predicate)
java.util.List<Edge>	SchemaGraph.getAllAdjacentEdges(java.util.List<Vertex> fromList, Vertex to)
Vertex	SchemaGraph.getAppliedDirectiveContainerForAppliedDirective(Vertex appliedDirective)
Vertex	SchemaGraph.getAppliedDirectiveForAppliedArgument(Vertex appliedArgument)
int	SchemaGraph.getAppliedDirectiveIndex(Vertex appliedDirective)
@Nullable Edge	SchemaGraph.getEdge(Vertex from, Vertex to)
@Nullable Edge	SchemaGraph.getEdgeOrInverse(Vertex from, Vertex to)
Vertex	SchemaGraph.getEnumForEnumValue(Vertex enumValue)
Vertex	SchemaGraph.getFieldOrDirectiveForArgument(Vertex argument)
Vertex	SchemaGraph.getFieldsContainerForField(Vertex field)
Vertex	SchemaGraph.getInputObjectForInputField(Vertex inputField)
Vertex	Mapping.getParentRestriction(Vertex v)
Edge	SchemaGraph.getSingleAdjacentEdge(Vertex from, java.util.function.Predicate<Edge> predicate)
Vertex	SchemaGraph.getSingleAdjacentInverseVertex(Vertex input)	Gets the one inverse adjacent edge to the input and gets the other vertex.
Vertex	Mapping.getSource(Vertex target)
Vertex	Mapping.getTarget(Vertex source)
private void	SchemaGraphFactory.handleArgument(Vertex argumentVertex, GraphQLArgument graphQLArgument, SchemaGraph schemaGraph)
private void	SchemaGraphFactory.handleDirective(Vertex directive, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleField(Vertex fieldVertex, GraphQLFieldDefinition fieldDefinition, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleInputField(Vertex inputFieldVertex, GraphQLInputObjectField inputField, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleInputObject(Vertex inputObject, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleInterfaceVertex(Vertex interfaceVertex, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleObjectVertex(Vertex objectVertex, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
private void	SchemaGraphFactory.handleUnion(Vertex unionVertex, SchemaGraph schemaGraph, GraphQLSchema graphQLSchema)
static boolean	PossibleMappingsCalculator.hasChildrenRestrictions(Vertex vertex)
boolean	Mapping.hasParentRestriction(Vertex v)
static boolean	PossibleMappingsCalculator.hasParentRestrictions(Vertex vertex)
abstract java.lang.String	PossibleMappingsCalculator.VertexContextSegment.idForVertex(Vertex vertex, SchemaGraph schemaGraph)
static EditOperation	EditOperation.insertVertex(java.lang.String description, Vertex sourceVertex, Vertex targetVertex)
boolean	Vertex.isEqualTo(Vertex other)
boolean	PossibleMappingsCalculator.PossibleMappings.mappingPossible(Vertex sourceVertex, Vertex targetVertex)
void	Edge.setFrom(Vertex from)
void	Edge.setTo(Vertex to)

Method parameters in graphql.schema.diffing with type arguments of type Vertex

Modifier and Type	Method	Description
private void	DiffImpl.addChildToQueue(int fixedEditorialCost, DiffImpl.MappingEntry parentEntry, java.util.PriorityQueue<DiffImpl.MappingEntry> queue, DiffImpl.OptimalEdit optimalEdit, java.util.List<Vertex> allSources, java.util.List<Vertex> allTargets)
private void	DiffImpl.addSiblingToQueue(int fixedEditorialCost, int level, java.util.PriorityQueue<DiffImpl.MappingEntry> queue, DiffImpl.OptimalEdit optimalEdit, java.util.List<Vertex> allSources, java.util.List<Vertex> allTargets, DiffImpl.MappingEntry mappingEntry)
void	SchemaGraph.addVertices(java.util.Collection<Vertex> vertices)
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 void	PossibleMappingsCalculator.calcPossibleMappingImpl(java.util.Collection<Vertex> currentSourceVertices, java.util.Collection<Vertex> currentTargetVertices, java.util.List<java.lang.String> contextId, int contextIx, java.util.List<PossibleMappingsCalculator.VertexContextSegment> contexts, java.util.Set<Vertex> usedSourceVertices, java.util.Set<Vertex> usedTargetVertices, java.lang.String typeNameForDebug)	calc for the provided context
private void	PossibleMappingsCalculator.calcPossibleMappingImpl(java.util.Collection<Vertex> currentSourceVertices, java.util.Collection<Vertex> currentTargetVertices, java.util.List<java.lang.String> contextId, int contextIx, java.util.List<PossibleMappingsCalculator.VertexContextSegment> contexts, java.util.Set<Vertex> usedSourceVertices, java.util.Set<Vertex> usedTargetVertices, java.lang.String typeNameForDebug)	calc for the provided context
private 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)
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.Optional<Vertex>	SchemaGraph.findTargetVertex(Vertex from, java.util.function.Predicate<Vertex> vertexPredicate)
void	Mapping.forEachNonFixedSourceAndTarget(java.util.function.BiConsumer<? super Vertex,? super Vertex> consumer)
void	Mapping.forEachNonFixedSourceAndTarget(java.util.function.BiConsumer<? super Vertex,? super Vertex> consumer)
void	Mapping.forEachNonFixedTarget(java.util.function.Consumer<? super Vertex> action)
void	Mapping.forEachTarget(java.util.function.Consumer<? super Vertex> action)
java.util.List<Edge>	SchemaGraph.getAdjacentEdges(Vertex from, java.util.function.Predicate<Vertex> predicate)
java.util.List<Edge>	SchemaGraph.getAdjacentEdgesInverse(Vertex to, java.util.function.Predicate<Vertex> predicate)
java.util.List<Vertex>	SchemaGraph.getAdjacentVertices(Vertex from, java.util.function.Predicate<Vertex> predicate)
java.util.List<Vertex>	SchemaGraph.getAdjacentVerticesInverse(Vertex to, java.util.function.Predicate<Vertex> predicate)
java.util.List<Edge>	SchemaGraph.getAllAdjacentEdges(java.util.List<Vertex> fromList, Vertex to)
private java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions(SchemaGraph sourceGraph, java.util.List<Vertex> fixedSourceVertices, java.util.Map<Vertex,Vertex> fixedOneToOneMappings)	This computes the initial set of parent restrictions based on the fixed portion of the mapping.
private java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions(SchemaGraph sourceGraph, java.util.List<Vertex> fixedSourceVertices, java.util.Map<Vertex,Vertex> fixedOneToOneMappings)	This computes the initial set of parent restrictions based on the fixed portion of the mapping.
private java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictions(SchemaGraph sourceGraph, java.util.List<Vertex> fixedSourceVertices, java.util.Map<Vertex,Vertex> fixedOneToOneMappings)	This computes the initial set of parent restrictions based on the fixed portion of the mapping.
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictionsInverse(java.util.Map<Vertex,Vertex> fixedOneToOneMappingsInverted)
java.util.Map<Vertex,Vertex>	PossibleMappingsCalculator.getFixedParentRestrictionsInverse(java.util.Map<Vertex,Vertex> fixedOneToOneMappingsInverted)
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)
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)
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)
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)
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)
void	PossibleMappingsCalculator.PossibleMappings.putPossibleMappings(java.util.List<java.lang.String> contextId, java.util.Collection<Vertex> sourceVertices, java.util.Collection<Vertex> targetVertices, java.lang.String typeName)
void	SchemaGraph.setVertices(java.util.List<Vertex> vertices)
private void	SchemaDiffing.sortVertices(java.util.List<Vertex> vertices, SchemaGraph schemaGraph, PossibleMappingsCalculator.PossibleMappings possibleMappings)

Constructors in graphql.schema.diffing with parameters of type Vertex

Constructor	Description
Edge(Vertex from, Vertex to)
Edge(Vertex from, Vertex to, java.lang.String label)
EditOperation(EditOperation.Operation operation, java.lang.String description, Vertex sourceVertex, Vertex targetVertex, Edge sourceEdge, Edge targetEdge)

Constructor parameters in graphql.schema.diffing with type arguments of type Vertex

Constructor	Description
Mapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList, com.google.common.collect.BiMap<Vertex,Vertex> map, java.util.List<Vertex> sourceList, java.util.List<Vertex> targetList)
Mapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList, com.google.common.collect.BiMap<Vertex,Vertex> map, java.util.List<Vertex> sourceList, java.util.List<Vertex> targetList)
Mapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList, com.google.common.collect.BiMap<Vertex,Vertex> map, java.util.List<Vertex> sourceList, java.util.List<Vertex> targetList)
Mapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList, com.google.common.collect.BiMap<Vertex,Vertex> map, java.util.List<Vertex> sourceList, java.util.List<Vertex> targetList)
Mapping(java.util.Map<Vertex,Vertex> fixedParentRestrictions, com.google.common.collect.BiMap<Vertex,Vertex> fixedMappings, java.util.List<Vertex> fixedSourceList, java.util.List<Vertex> fixedTargetList, com.google.common.collect.BiMap<Vertex,Vertex> map, java.util.List<Vertex> sourceList, java.util.List<Vertex> targetList)
SchemaGraph(java.util.List<Vertex> vertices, java.util.List<Edge> edges, com.google.common.collect.Table<Vertex,Vertex,Edge> edgeByVertexPair)
SchemaGraph(java.util.List<Vertex> vertices, java.util.List<Edge> edges, com.google.common.collect.Table<Vertex,Vertex,Edge> edgeByVertexPair)
SchemaGraph(java.util.List<Vertex> vertices, java.util.List<Edge> edges, com.google.common.collect.Table<Vertex,Vertex,Edge> edgeByVertexPair)

Uses of Vertex in graphql.schema.diffing.ana

Methods in graphql.schema.diffing.ana with parameters of type Vertex

Modifier and Type	Method	Description
private void	EditOperationAnalyzer.appliedDirectiveAddedToArgument(Vertex appliedDirective, Vertex container)
private void	EditOperationAnalyzer.appliedDirectiveAddedToField(Vertex appliedDirective, Vertex container)
private void	EditOperationAnalyzer.appliedDirectiveDeletedFromArgument(Vertex appliedDirective, Vertex container)
private void	EditOperationAnalyzer.appliedDirectiveDeletedFromField(Vertex appliedDirective, Vertex container)
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)