Modifier and Type | Method and Description |
---|---|
IGraph<URI> |
DefaultResolutionContext.getGraph() |
IGraph<URI> |
IResolutionContext.getGraph()
The graph of dependencies.
|
Modifier and Type | Method and Description |
---|---|
protected DefaultResolutionContext |
ThreadedModelResolver.createContext(com.google.common.eventbus.EventBus eventBus,
IGraph<URI> aGraph)
For testing purposes, this method is protected.
|
void |
ThreadedModelResolver.setGraph(IGraph<URI> graph)
Setter for the URI Graph istance.
|
Constructor and Description |
---|
DefaultResolutionContext(com.google.common.eventbus.EventBus eventBus,
IGraph<URI> graph,
DependencyGraphUpdater<URI> graphUpdater,
ResourceComputationScheduler<URI> scheduler,
ModelResourceListener modelResourceListener) |
DependencyGraphUpdater(IGraph<T> graph,
com.google.common.eventbus.EventBus eventBus)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
static IGraph<Diff> |
MergeDependenciesUtil.mapDifferences(Collection<Diff> differences,
IMerger.Registry mergerRegistry,
boolean mergeRightToLeft,
MergeMode mergeMode)
This will map the given differences in a dependency graph, enabling EMF Compare to differentiate what
can be safely merged from what cannot.
|
static IGraph<Diff> |
MergeDependenciesUtil.mapDifferences(Comparison comparison,
IMerger.Registry mergerRegistry,
boolean mergeRightToLeft,
MergeMode mergeMode)
This will map all the differences from the given comparison in a dependency graph, enabling EMF Compare
to differentiate what can be safely merged from what cannot.
|
Modifier and Type | Class and Description |
---|---|
class |
Graph<E>
This structure will be used to maintain a undirected graph of elements.
|
Modifier and Type | Method and Description |
---|---|
static <E> ReadOnlyGraph<E> |
ReadOnlyGraph.toReadOnlyGraph(IGraph<E> graph)
Convert a graph to a read-only graph.
|
Modifier and Type | Method and Description |
---|---|
void |
IGraphConsumer.setGraph(IGraph<URI> graph)
Set the graph to be used by this consumer.
|
Copyright (c) 2006, 2015 Obeo and others. All rights reserved.