pascal.taie.util.graph.MergedNode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of tai-e Show documentation

An easy-to-learn/use static analysis framework for Java

The newest version!

/*
 * Tai-e: A Static Analysis Framework for Java
 *
 * Copyright (C) 2022 Tian Tan 
 * Copyright (C) 2022 Yue Li 
 *
 * This file is part of Tai-e.
 *
 * Tai-e is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tai-e is distributed in the hope that it will be useful,but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
 * Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with Tai-e. If not, see .
 */

package pascal.taie.util.graph;

import pascal.taie.util.collection.Sets;

import java.util.Collection;
import java.util.List;
import java.util.Set;

/**
 * Represents a node in {@link MergedSCCGraph}, where each node
 * corresponds to a SCC.
 *
 * @param  type of nodes
 */
public class MergedNode {

    private final List nodes;

    private final Set> preds = Sets.newHybridSet();

    private final Set> succs = Sets.newHybridSet();

    MergedNode(Collection nodes) {
        assert !nodes.isEmpty();
        this.nodes = List.copyOf(nodes);
    }

    void addPred(MergedNode pred) {
        preds.add(pred);
    }

    Set> getPreds() {
        return preds;
    }

    void addSucc(MergedNode succ) {
        succs.add(succ);
    }

    Set> getSuccs() {
        return succs;
    }

    public List getNodes() {
        return nodes;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) {
            return true;
        }
        if (o == null || getClass() != o.getClass()) {
            return false;
        }
        MergedNode that = (MergedNode) o;
        return nodes.equals(that.nodes);
    }

    @Override
    public int hashCode() {
        return nodes.hashCode();
    }

    @Override
    public String toString() {
        return "MergedNode" + nodes;
    }
}