Modifier and Type	Class and Description
public static class	FixedDAG.Builder<U>
public static interface	FixedDAG.Nodes<U>

Modifier and Type	Field and Description
private final BinaryMatrix	edgeMatrix Record Component accessed by edgeMatrix(). the edge matrix.
private final FixedDAG.Nodes<T>	nodes Record Component accessed by nodes(). the node container

Access	Constructor and Description
public	FixedDAG(BinaryMatrix edgeMatrix, FixedDAG.Nodes<T> nodes)

Method Summary

Modifier and Type	Method and Description
public static <U> FixedDAG.Builder<U>	build()
public static <U> FixedDAG<U>	create(Collection<DirectedEdge<U>> edges, List<U> nodes)
pack-priv static <U> FixedDAG<U>	create(Collection<DirectedEdge<U>> edges, FixedDAG.Nodes<U> nodes)
public void	dump(Consumer<String> sink)
public void	dumpToStdout()
public BinaryMatrix	edgeMatrix() Record Component getter of edgeMatrix. Record Component the edge matrix.
public final boolean	equals(Object o) Implements abstract java.lang.Record.equals. Indicates whether some other object is "equal to" this one.
public List<T>	getAllHeadsOf(T node)
private List<T>	getAllNodesOf(T node, boolean heads)
public List<T>	getAllTailsOf(T node)
public List<T>	Returns: the list of nodes that are heads of the edges sharing the same tail, which is the given node getHeadsOf(T a node node) Gets the list of nodes that are heads of the edges sharing the same tail, which is the given node.
pack-priv static Stream<BinaryMatrix.Cursor>	getIncomingEdges(int node, BinaryMatrix edgeMatrix)
public List<T>	Returns: the list of nodes without incoming edges getNoIncomingEdges() Get the list of nodes without incoming edges.
pack-priv static IntStream	getNoIncomingEdges(BinaryMatrix edgeMatrix)
public List<T>	Returns: the list of nodes without outgoing edges getNoOutgoingEdges() Get the list of nodes without outgoing edges.
pack-priv static IntStream	getNoOutgoingEdges(BinaryMatrix edgeMatrix)
pack-priv static Stream<BinaryMatrix.Cursor>	getOutgoingEdges(int node, BinaryMatrix edgeMatrix)
public List<T>	Returns: the list of nodes that are tails of the edges sharing the same head, which is the given node getTailsOf(T a node node) Gets the list of nodes that are tails of the edges sharing the same head, which is the given node.
public final int	hashCode() Implements abstract java.lang.Record.hashCode. Returns a hash code value for the record.
private static boolean	isCyclic(BinaryMatrix edgeMatrix, Consumer<Integer> topologicalOrderAccumulator)
public FixedDAG.Nodes<T>	nodes() Record Component getter of nodes. Record Component the node container
public List<T>	Returns: topologically ordered nodes of this graph topologicalSort() Returns topologically ordered nodes of this graph.
public final String	toString() Implements abstract java.lang.Record.toString. Returns a string representation of the record.
pack-priv static void	traverseNodes(int nodeIndex, BinaryMatrix edgeMatrix, boolean heads, Function<Integer, Boolean> nodeAccumulator)

Field Detail

edgeMatrix	back to summary
private final BinaryMatrix edgeMatrix Record Component accessed by edgeMatrix(). the edge matrix. [i,j] addresses an edge, where 'i' is the index of the head node of the edge in the node container and 'j' is the index of the tail node of the edge in the node container

edgeMatrix

back to summary

private final BinaryMatrix edgeMatrix

Record Component accessed by edgeMatrix().

the edge matrix. [i,j] addresses an edge, where 'i' is the index of the head node of the edge in the node container and 'j' is the index of the tail node of the edge in the node container

nodes	back to summary
private final FixedDAG.Nodes<T> nodes Record Component accessed by nodes(). the node container

nodes

back to summary

private final FixedDAG.Nodes<T> nodes

Record Component accessed by nodes().

the node container

Constructor Detail

FixedDAG	back to summary
public FixedDAG(BinaryMatrix edgeMatrix, FixedDAG.Nodes<T> nodes)

Method Detail

build	back to summary
public static <U> FixedDAG.Builder<U> build()

create	back to summary
public static <U> FixedDAG<U> create(Collection<DirectedEdge<U>> edges, List<U> nodes)

create	back to summary
pack-priv static <U> FixedDAG<U> create(Collection<DirectedEdge<U>> edges, FixedDAG.Nodes<U> nodes)

dump	back to summary
public void dump(Consumer<String> sink)

dumpToStdout	back to summary
public void dumpToStdout()

edgeMatrix	back to summary
public BinaryMatrix edgeMatrix() Record Component getter of edgeMatrix. Record Component the edge matrix. [i,j] addresses an edge, where 'i' is the index of the head node of the edge in the node container and 'j' is the index of the tail node of the edge in the node container

edgeMatrix

back to summary

public BinaryMatrix edgeMatrix()

Record Component getter of edgeMatrix.

Record Component: the edge matrix. [i,j] addresses an edge, where 'i' is the index of the head node of the edge in the node container and 'j' is the index of the tail node of the edge in the node container

equals back to summary

equals	back to summary
public final boolean equals(Object o) Implements abstract java.lang.Record.equals. Doc from java.lang.Record.equals. Indicates whether some other object is "equal to" this one. In addition to the general contract of `Object.equals`, record classes must further obey the invariant that when a record instance is "copied" by passing the result of the record component accessor methods to the canonical constructor, as follows: R copy = new R(r.c1(), r.c2(), ..., r.cn()); then it must be the case that `r.equals(copy)`.

public final boolean equals(Object o)

Implements abstract java.lang.Record.equals.

Doc from java.lang.Record.equals.

Indicates whether some other object is "equal to" this one. In addition to the general contract of Object.equals, record classes must further obey the invariant that when a record instance is "copied" by passing the result of the record component accessor methods to the canonical constructor, as follows:

    R copy = new R(r.c1(), r.c2(), ..., r.cn());

then it must be the case that r.equals(copy).

getAllHeadsOf	back to summary
public List<T> getAllHeadsOf(T node)

getAllNodesOf	back to summary
private List<T> getAllNodesOf(T node, boolean heads)

getAllTailsOf	back to summary
public List<T> getAllTailsOf(T node)

getHeadsOf back to summary

getHeadsOf	back to summary
public List<T> getHeadsOf(T node) Gets the list of nodes that are heads of the edges sharing the same tail, which is the given node. The returned list is ordered by the indexes of the nodes in the node container of this graph. Parameters node:T a node Returns:List<T> the list of nodes that are heads of the edges sharing the same tail, which is the given node See Also `Nodes`

public List<T> getHeadsOf(T node)

Gets the list of nodes that are heads of the edges sharing the same tail, which is the given node.

The returned list is ordered by the indexes of the nodes in the node container of this graph.

Parameters

node:T: a node

Returns:List<T>

the list of nodes that are heads of the edges sharing the same tail, which is the given node

See Also

Nodes

getIncomingEdges	back to summary
pack-priv static Stream<BinaryMatrix.Cursor> getIncomingEdges(int node, BinaryMatrix edgeMatrix)

getNoIncomingEdges	back to summary
public List<T> getNoIncomingEdges() Get the list of nodes without incoming edges. A node without incoming edges is a node that is not a head of any of the edges in the graph. The returned list is ordered by the indexes of the nodes in the node container of this graph. Returns:List<T> the list of nodes without incoming edges

getNoIncomingEdges

back to summary

public List<T> getNoIncomingEdges()

Get the list of nodes without incoming edges.

A node without incoming edges is a node that is not a head of any of the edges in the graph.

The returned list is ordered by the indexes of the nodes in the node container of this graph.

Returns:List<T>: the list of nodes without incoming edges

getNoIncomingEdges	back to summary
pack-priv static IntStream getNoIncomingEdges(BinaryMatrix edgeMatrix)

getNoOutgoingEdges	back to summary
public List<T> getNoOutgoingEdges() Get the list of nodes without outgoing edges. A node without outgoing edges is a node that is not a tail of any of the edges in the graph. The returned list is ordered by the indexes of the nodes in the node container of this graph. Returns:List<T> the list of nodes without outgoing edges

getNoOutgoingEdges

back to summary

public List<T> getNoOutgoingEdges()

Get the list of nodes without outgoing edges.

A node without outgoing edges is a node that is not a tail of any of the edges in the graph.

The returned list is ordered by the indexes of the nodes in the node container of this graph.

Returns:List<T>: the list of nodes without outgoing edges

getNoOutgoingEdges	back to summary
pack-priv static IntStream getNoOutgoingEdges(BinaryMatrix edgeMatrix)

getOutgoingEdges	back to summary
pack-priv static Stream<BinaryMatrix.Cursor> getOutgoingEdges(int node, BinaryMatrix edgeMatrix)

getTailsOf back to summary

getTailsOf	back to summary
public List<T> getTailsOf(T node) Gets the list of nodes that are tails of the edges sharing the same head, which is the given node. The returned list is ordered by the indexes of the nodes in the node container of this graph. Parameters node:T a node Returns:List<T> the list of nodes that are tails of the edges sharing the same head, which is the given node See Also `Nodes`

public List<T> getTailsOf(T node)

Gets the list of nodes that are tails of the edges sharing the same head, which is the given node.

The returned list is ordered by the indexes of the nodes in the node container of this graph.

Parameters

node:T: a node

Returns:List<T>

the list of nodes that are tails of the edges sharing the same head, which is the given node

See Also

Nodes

hashCode back to summary

hashCode	back to summary
public final int hashCode() Implements abstract java.lang.Record.hashCode. Doc from java.lang.Record.hashCode. Returns a hash code value for the record. Obeys the general contract of `Object.hashCode`. For records, hashing behavior is constrained by the refined contract of `Record.equals`, so that any two records created from the same components must have the same hash code.

public final int hashCode()

Implements abstract java.lang.Record.hashCode.

Doc from java.lang.Record.hashCode.

Returns a hash code value for the record. Obeys the general contract of Object.hashCode. For records, hashing behavior is constrained by the refined contract of Record.equals, so that any two records created from the same components must have the same hash code.

isCyclic	back to summary
private static boolean isCyclic(BinaryMatrix edgeMatrix, Consumer<Integer> topologicalOrderAccumulator)

nodes	back to summary
public FixedDAG.Nodes<T> nodes() Record Component getter of nodes. Record Component the node container

nodes

back to summary

public FixedDAG.Nodes<T> nodes()

Record Component getter of nodes.

Record Component: the node container

topologicalSort	back to summary
public List<T> topologicalSort() Returns topologically ordered nodes of this graph. For every directed edge ("tail", "head") from "tail" to "head", "tail" comes before "head". Returns:List<T> topologically ordered nodes of this graph

topologicalSort

back to summary

public List<T> topologicalSort()

Returns topologically ordered nodes of this graph.

For every directed edge ("tail", "head") from "tail" to "head", "tail" comes before "head".

Returns:List<T>: topologically ordered nodes of this graph

toString back to summary

toString	back to summary
public final String toString() Implements abstract java.lang.Record.toString. Doc from java.lang.Record.toString. Returns a string representation of the record. In accordance with the general contract of `Object#toString()`, the `toString` method returns a string that "textually represents" this record. The result should be a concise but informative representation that is easy for a person to read. In addition to this general contract, record classes must further participate in the invariant that any two records which are equal must produce equal strings. This invariant is necessarily relaxed in the rare case where corresponding equal component values might fail to produce equal strings for themselves.

public final String toString()

Implements abstract java.lang.Record.toString.

Doc from java.lang.Record.toString.

Returns a string representation of the record. In accordance with the general contract of Object#toString(), the toString method returns a string that "textually represents" this record. The result should be a concise but informative representation that is easy for a person to read.

In addition to this general contract, record classes must further participate in the invariant that any two records which are equal must produce equal strings. This invariant is necessarily relaxed in the rare case where corresponding equal component values might fail to produce equal strings for themselves.

traverseNodes	back to summary
pack-priv static void traverseNodes(int nodeIndex, BinaryMatrix edgeMatrix, boolean heads, Function<Integer, Boolean> nodeAccumulator)

jdk.jpackage.internal.pipeline back to summary

public final Class FixedDAG.Builder<U>

Class Inheritance

extends Object

java.lang.Object
jdk.jpackage.internal.pipeline.FixedDAG.Builder

Field Summary

Modifier and Type	Field and Description
private final List<DirectedEdge<U>>	edges
private final List<U>	nodes

Constructor Summary

Access	Constructor and Description
public	Builder()

Method Summary

Modifier and Type	Method and Description
public FixedDAG.Builder<U>	addEdge(U tail, U head)
public FixedDAG.Builder<U>	addEdge(DirectedEdge<U> edge)
public FixedDAG.Builder<U>	addNode(U node)
public FixedDAG<U>	create()

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

Field Detail

edges	back to summary
private final List<DirectedEdge<U>> edges

nodes	back to summary
private final List<U> nodes

Constructor Detail

Builder	back to summary
public Builder()

Method Detail

addEdge	back to summary
public FixedDAG.Builder<U> addEdge(U tail, U head)

addEdge	back to summary
public FixedDAG.Builder<U> addEdge(DirectedEdge<U> edge)

addNode	back to summary
public FixedDAG.Builder<U> addNode(U node)

create	back to summary
public FixedDAG<U> create()

Modifier and Type	Method and Description
public U	get(int index)
public int	indexOf(U node)
public static <V> FixedDAG.Nodes<V>	ofList(List<V> list)
public int	size()

public final Record FixedDAG<T>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public final Class FixedDAG.Builder<U>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Interface FixedDAG.Nodes<U>

Method Summary

Method Detail