public class DesugaringGraph
extends java.lang.Object
It is built by combining DesugaringData, local desugaring dependencies, for all paths
that are relevant. Once all data is added, for a path, a dependent set of paths can be calculated
by traversing the graph in the following way:
| Modifier and Type | Field and Description |
|---|---|
static DesugaringGraph |
EMPTY |
| Modifier and Type | Method and Description |
|---|---|
java.util.Set<java.nio.file.Path> |
getDependenciesPaths(java.nio.file.Path path)
Returns a set of paths the given path is depending on.
|
java.util.Set<java.nio.file.Path> |
getDependentPaths(java.nio.file.Path path)
Returns a set of paths that should be additionally processed, based on the changed input
path.
|
void |
update(java.util.Collection<DesugaringData> data)
Initializes or updates the graph with the new data.
|
@NonNull public static final DesugaringGraph EMPTY
public void update(@NonNull
java.util.Collection<DesugaringData> data)
@NonNull
public java.util.Set<java.nio.file.Path> getDependenciesPaths(@NonNull
java.nio.file.Path path)
@NonNull
public java.util.Set<java.nio.file.Path> getDependentPaths(@NonNull
java.nio.file.Path path)