Uses of Class
graphql.schema.diffing.DiffImpl.OptimalEdit
Packages that use DiffImpl.OptimalEdit
-
Uses of DiffImpl.OptimalEdit in graphql.schema.diffing
Methods in graphql.schema.diffing that return DiffImpl.OptimalEditModifier and TypeMethodDescriptionSchemaDiffing.diffGraphQLSchemaAllEdits
(GraphQLSchema graphQLSchema1, GraphQLSchema graphQLSchema2, AtomicInteger algoIterationCount) (package private) DiffImpl.OptimalEdit
DiffImpl.diffImpl
(Mapping startMapping, List<Vertex> allSources, List<Vertex> allTargets, AtomicInteger algoIterationCount) private DiffImpl.OptimalEdit
SchemaDiffing.diffImpl
(SchemaGraph sourceGraph, SchemaGraph targetGraph, AtomicInteger algoIterationCount) Methods in graphql.schema.diffing with parameters of type DiffImpl.OptimalEditModifier and TypeMethodDescriptionprivate void
DiffImpl.addChildToQueue
(int fixedEditorialCost, DiffImpl.MappingEntry parentEntry, PriorityQueue<DiffImpl.MappingEntry> queue, DiffImpl.OptimalEdit optimalEdit, List<Vertex> allSources, List<Vertex> allTargets) private void
DiffImpl.addSiblingToQueue
(int fixedEditorialCost, int level, PriorityQueue<DiffImpl.MappingEntry> queue, DiffImpl.OptimalEdit optimalEdit, List<Vertex> allSources, List<Vertex> allTargets, DiffImpl.MappingEntry mappingEntry) private void
DiffImpl.expandMappingAndUpdateOptimalMapping
(int fixedEditorialCost, int level, DiffImpl.OptimalEdit optimalEdit, List<Vertex> allSources, Mapping toExpand, int[] assignments, 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.private void
DiffImpl.updateOptimalEdit
(DiffImpl.OptimalEdit optimalEdit, int newGed, Mapping mapping)