// Copyright 2018 The Bazel Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package com.google.devtools.build.lib.query2.output;
import com.google.common.collect.HashMultimap;
import com.google.common.collect.SetMultimap;
import com.google.devtools.build.lib.cmdline.Label;
import com.google.devtools.build.lib.graph.Digraph;
import com.google.devtools.build.lib.graph.Node;
import com.google.devtools.build.lib.packages.Attribute;
import com.google.devtools.build.lib.packages.BuildType;
import com.google.devtools.build.lib.packages.RawAttributeMapper;
import com.google.devtools.build.lib.packages.Rule;
import com.google.devtools.build.lib.packages.Target;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Optional;
import java.util.Set;
/**
* Utility class to hold all conditional edges in a graph. Allows easy look-up of all conditions
* between two nodes.
*/
public class ConditionalEdges {
// Map containing all the conditions for all the conditional edges in a graph.
private HashMap<
Label /* src node */, SetMultimap>
map;
public ConditionalEdges() {}
/** Builds ConditionalEdges from given graph. */
public ConditionalEdges(Digraph graph) {
this.map = new HashMap<>();
for (Node node : graph.getNodes()) {
Rule rule = node.getLabel().getAssociatedRule();
if (rule == null) {
// rule is null for source files and package groups. Skip them.
continue;
}
SetMultimap