APIdia Launch Partner

Top Description Inners Fields Constructors Methods

jdk.internal.module

public Class ModuleHashesBuilder

Class Inheritance

extends Object

java.lang.Object
jdk.internal.module.ModuleHashesBuilder

Imports

java.io.PrintStream, java.lang.module.Configuration, .ModuleReference, .ResolvedModule, java.util.ArrayDeque, .Collections, .Deque, .HashMap, .TreeMap, .HashSet, .Map, .Set, java.util.function.Consumer, java.util.stream.Stream

A Builder to compute ModuleHashes from a given configuration

Nested and Inner Type Summary

Modifier and Type	Class and Description
pack-priv static class	ModuleHashesBuilder.Graph<T>
private static class	ModuleHashesBuilder.TopoSorter<T> Topological sort

Field Summary

Modifier and Type	Field and Description
private final Configuration	configuration
private final Set<String>	hashModuleCandidates

Constructor Summary

Access	Constructor and Description
public	ModuleHashesBuilder(Configuration Configuration for building module hashes config, Set<String> the candidate modules to be hashed modules) Constructs a ModuleHashesBuilder that finds the packaged modules from the location of ModuleReference found from the given Configuration.

Method Summary

Modifier and Type	Method and Description
public Map<String, ModuleHashes>	computeHashes(Set<String> roots) Returns a map of a module M to ModuleHashes for the modules that depend upon M directly or indirectly.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

configuration	back to summary
private final Configuration configuration

hashModuleCandidates	back to summary
private final Set<String> hashModuleCandidates

Constructor Detail

ModuleHashesBuilder

back to summary

public ModuleHashesBuilder(Configuration config, Set<String> modules)

Constructs a ModuleHashesBuilder that finds the packaged modules from the location of ModuleReference found from the given Configuration.

Parameters

config:Configuration: Configuration for building module hashes
modules:Set<String>: the candidate modules to be hashed

Method Detail

computeHashes

back to summary

public Map<String, ModuleHashes> computeHashes(Set<String> roots)

Returns a map of a module M to ModuleHashes for the modules that depend upon M directly or indirectly. The key for each entry in the returned map is a module M that has no outgoing edges to any of the candidate modules to be hashed i.e. M is a leaf node in a connected subgraph containing M and other candidate modules from the module graph filtering the outgoing edges from M to non-candidate modules.

jdk.internal.module back to summary

pack-priv Class ModuleHashesBuilder.Graph<T>

Class Inheritance

extends Object

java.lang.Object
jdk.internal.module.ModuleHashesBuilder.Graph

Nested and Inner Type Summary

Modifier and Type	Class and Description
pack-priv static class	ModuleHashesBuilder.Graph.Builder<T>

Field Summary

Modifier and Type	Field and Description
private final Map<T, Set<T>>	edges
private final Set<T>	nodes

Constructor Summary

Access	Constructor and Description
public	Graph(Set<T> nodes, Map<T, Set<T>> edges)

Method Summary

Modifier and Type	Method and Description
public Set<T>	adjacentNodes(T u)
public boolean	contains(T u)
public Set<T>	dfs(T root) Returns all nodes reachable from the given root.
public Set<T>	dfs(Set<T> roots) Returns all nodes reachable from the given set of roots.
public Map<T, Set<T>>	edges()
public Set<T>	nodes()
public void	ordered(Consumer<T> action) Traverses this graph and performs the given action in topological order.
public Stream<T>	orderedNodes() Returns nodes sorted in topological order.
public void	printGraph(PrintStream out)
public void	reverse(Consumer<T> action) Traverses this graph and performs the given action in reverse topological order.
public ModuleHashesBuilder.Graph<T>	transpose() Returns a transposed graph from this graph.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

edges	back to summary
private final Map<T, Set<T>> edges

nodes	back to summary
private final Set<T> nodes

Constructor Detail

Graph	back to summary
public Graph(Set<T> nodes, Map<T, Set<T>> edges)

Method Detail

adjacentNodes	back to summary
public Set<T> adjacentNodes(T u)

contains	back to summary
public boolean contains(T u)

dfs	back to summary
public Set<T> dfs(T root) Returns all nodes reachable from the given root.

dfs	back to summary
public Set<T> dfs(Set<T> roots) Returns all nodes reachable from the given set of roots.

edges	back to summary
public Map<T, Set<T>> edges()

nodes	back to summary
public Set<T> nodes()

ordered	back to summary
public void ordered(Consumer<T> action) Traverses this graph and performs the given action in topological order.

orderedNodes	back to summary
public Stream<T> orderedNodes() Returns nodes sorted in topological order.

printGraph	back to summary
public void printGraph(PrintStream out)

reverse	back to summary
public void reverse(Consumer<T> action) Traverses this graph and performs the given action in reverse topological order.

transpose	back to summary
public ModuleHashesBuilder.Graph<T> transpose() Returns a transposed graph from this graph.

jdk.internal.module back to summary

pack-priv Class ModuleHashesBuilder.Graph.Builder<T>

Class Inheritance

extends Object

java.lang.Object
jdk.internal.module.ModuleHashesBuilder.Graph.Builder

Field Summary

Modifier and Type	Field and Description
pack-priv final Map<T, Set<T>>	edges
pack-priv final Set<T>	nodes

Constructor Summary

Access	Constructor and Description
pack-priv	Builder()

Method Summary

Modifier and Type	Method and Description
public void	addEdge(T u, T v)
public void	addNode(T node)
public ModuleHashesBuilder.Graph<T>	build()

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

edges	back to summary
pack-priv final Map<T, Set<T>> edges

nodes	back to summary
pack-priv final Set<T> nodes

Constructor Detail

Builder	back to summary
pack-priv Builder()

Method Detail

addEdge	back to summary
public void addEdge(T u, T v)

addNode	back to summary
public void addNode(T node)

build	back to summary
public ModuleHashesBuilder.Graph<T> build()

jdk.internal.module back to summary

private Class ModuleHashesBuilder.TopoSorter<T>

Class Inheritance

extends Object

java.lang.Object
jdk.internal.module.ModuleHashesBuilder.TopoSorter

Topological sort

Field Summary

Modifier and Type	Field and Description
pack-priv final ModuleHashesBuilder.Graph<T>	graph
pack-priv final Deque<T>	result

Constructor Summary

Access	Constructor and Description
pack-priv	TopoSorter(ModuleHashesBuilder.Graph<T> graph)

Method Summary

Modifier and Type	Method and Description
private Set<T>	children(T node)
public void	ordered(Consumer<T> action)
public void	reverse(Consumer<T> action)
private void	sort()
private void	visit(T node, Set<T> visited, Deque<T> stack)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

graph	back to summary
pack-priv final ModuleHashesBuilder.Graph<T> graph

result	back to summary
pack-priv final Deque<T> result

Constructor Detail

TopoSorter	back to summary
pack-priv TopoSorter(ModuleHashesBuilder.Graph<T> graph)

Method Detail

children	back to summary
private Set<T> children(T node)

ordered	back to summary
public void ordered(Consumer<T> action)

reverse	back to summary
public void reverse(Consumer<T> action)

sort	back to summary
private void sort()

visit	back to summary
private void visit(T node, Set<T> visited, Deque<T> stack)