com.facebook.buck.core.model.targetgraph

Class TargetGraph

java.lang.Object

com.facebook.buck.core.util.graph.DirectedAcyclicGraph<TargetNode<?>>

com.facebook.buck.core.model.targetgraph.TargetGraph

All Implemented Interfaces:

TraversableGraph<TargetNode<?>>

Direct Known Subclasses:

VersionedTargetGraph

public class TargetGraph
extends DirectedAcyclicGraph<TargetNode<?>>

Represents the graph of TargetNodes constructed by parsing the build files.

Field Summary

Fields

Modifier and Type	Field and Description
static TargetGraph	EMPTY

Constructor Summary

Constructors

Constructor and Description
TargetGraph(MutableDirectedGraph<TargetNode<?>> graph, com.google.common.collect.ImmutableMap<BuildTarget,TargetNode<?>> index)

Method Summary

Modifier and Type	Method and Description
boolean	equals(Object obj)
TargetNode<?>	get(BuildTarget target) Get a target from graph.
TargetNode<?>	get(BuildTarget target, DependencyStack dependencyStack) Get a target from graph
Iterable<TargetNode<?>>	getAll(Iterable<BuildTarget> targets)
Optional<TargetNode<?>>	getExactOptional(BuildTarget target) Returns the target node for the exact given target, if it exists in the graph.
protected TargetNode<?>	getInternal(BuildTarget target)
Optional<TargetNode<?>>	getOptional(BuildTarget target)
int	getSize()
<T> TargetGraph	getSubgraph(Iterable<? extends TargetNode<? extends T>> roots) Get the subgraph of the the current graph containing the passed in roots and all of their transitive dependencies as nodes.
int	hashCode()

Methods inherited from class com.facebook.buck.core.util.graph.DirectedAcyclicGraph

getIncomingNodesFor, getNodes, getNodesWithNoIncomingEdges, getNodesWithNoOutgoingEdges, getOutgoingEdges, getOutgoingNodesFor

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Field Detail

EMPTY

public static final TargetGraph EMPTY

Constructor Detail

TargetGraph

public TargetGraph(MutableDirectedGraph<TargetNode<?>> graph,
                   com.google.common.collect.ImmutableMap<BuildTarget,TargetNode<?>> index)

Method Detail

getInternal

@Nullable
protected TargetNode<?> getInternal(BuildTarget target)

getOptional

public Optional<TargetNode<?>> getOptional(BuildTarget target)

get

public TargetNode<?> get(BuildTarget target)

Get a target from graph. Use of get(BuildTarget, DependencyStack) is encouraged because it provides better diagnostics

get

public TargetNode<?> get(BuildTarget target,
                         DependencyStack dependencyStack)

Get a target from graph

getExactOptional

public Optional<TargetNode<?>> getExactOptional(BuildTarget target)

Returns the target node for the exact given target, if it exists in the graph.

If given a flavored target, and the target graph doesn't contain that flavored target, this method will always return null, unlike getOptional, which may return the node for a differently flavored target (VersionedTargetGraph#getInternal).

getAll

public Iterable<TargetNode<?>> getAll(Iterable<BuildTarget> targets)

equals

public boolean equals(Object obj)

Overrides:

equals in class DirectedAcyclicGraph<TargetNode<?>>

hashCode

public int hashCode()

Overrides:

hashCode in class DirectedAcyclicGraph<TargetNode<?>>

getSubgraph

public <T> TargetGraph getSubgraph(Iterable<? extends TargetNode<? extends T>> roots)

Get the subgraph of the the current graph containing the passed in roots and all of their transitive dependencies as nodes. Edges between the included nodes are preserved.

Parameters:

roots - An iterable containing the roots of the new subgraph.

Returns:

A subgraph of the current graph.

getSize

public int getSize()