com.github.dmgcodevil.jmspy.graph.Node Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of jmspy-core Show documentation
Library to record method invocations
There is a newer version: 1.2.1
package com.github.dmgcodevil.jmspy.graph;

import com.github.dmgcodevil.jmspy.proxy.JMethod;
import com.github.dmgcodevil.jmspy.proxy.JType;
import com.google.common.base.MoreObjects;
import com.google.common.base.Objects;
import com.google.common.base.Predicate;
import com.google.common.base.Verify;
import com.google.common.collect.Iterables;
import org.apache.commons.lang3.StringUtils;

import java.io.Serializable;
import java.util.HashSet;
import java.util.Set;

/**
 * Node in {@link InvocationGraph} is a vertex in graph that has outgoing edges to other nodes in a graph.
 * A node has id and type that also can be used to identify a node in a graph i.e. used for navigation and comparison logic.
 * 
 *
 * @author dmgcodevil
 */
public class Node implements Serializable {

    private static final long serialVersionUID = 5483570738425483697L;

    private String id;

    private JType type;

    private Set outgoingEdges = new HashSet<>();

    public String getId() {
        return id;
    }

    public void setId(String id) {
        this.id = id;
    }

    public JType getType() {
        return type;
    }

    public void setType(JType type) {
        this.type = type;
    }

    public Set getOutgoingEdges() {
        return outgoingEdges;
    }

    public void setOutgoingEdges(Set outgoingEdges) {
        this.outgoingEdges = outgoingEdges;
    }

    public void addOutgoingEdge(Edge edge) {
        outgoingEdges.add(edge);
    }

    public synchronized Node findById(final String _id) {
        if (_id == null) {
            return null;
        }
        if (StringUtils.equals(this.id, _id)) {
            return this;
        }
        for (Edge edge : outgoingEdges) {
            if (edge.getTo() != null) {

                Node n = edge.getTo().findById(_id);
                if (n != null) {
                    return n;
                }
            }

        }
        return null;
    }

    public synchronized Edge getEdge(Node parent, final JMethod jMethod) {
        Verify.verifyNotNull(jMethod, "jMethod cannot be null");
        return Iterables.tryFind(parent.getOutgoingEdges(), new Predicate() {
            @Override
            public boolean apply(Edge input) {
                return input != null && input.getMethod().equals(jMethod);
            }
        }).orNull();
    }

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

        Node that = (Node) o;

        return Objects.equal(this.id, that.id) &&
                Objects.equal(this.type, that.type);
    }

    @Override
    public int hashCode() {
        return Objects.hashCode(id, type);
    }

    @Override
    public String toString() {
        return MoreObjects.toStringHelper(this)
                .add("id", id)
                .add("type", type)
                .toString();
    }
}