All Downloads are FREE. Search and download functionalities are using the official Maven repository.

live.document.mavenplugin.networkgraph.GraphNode Maven / Gradle / Ivy

package live.document.mavenplugin.networkgraph;

public class GraphNode {
    private String id;
    private String name = "";
    private String hint = "";
    private long x;
    private long y;
    private String rw = "";
    private String group = "";
    //对叶子节点的调用树
    private String callTree = "";
    private String module = "";

    public GraphNode() {
    }

    public GraphNode(String id, String name, String hint, String rw, String group, String module) {
        this.id = id;
        this.name = name;
        this.hint = hint;
        this.rw = rw;
        this.group = group;
        this.module = module;
    }

    public String getId() {
        return id;
    }

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

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public String getRw() {
        return rw;
    }

    public void setRw(String rw) {
        this.rw = rw;
    }

    public String getGroup() {
        return group;
    }

    public void setGroup(String group) {
        this.group = group;
    }

    public long getX() {
        return x;
    }

    public void setX(long x) {
        this.x = x;
    }

    public long getY() {
        return y;
    }

    public void setY(long y) {
        this.y = y;
    }

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

        GraphNode graphNode = (GraphNode) o;

        if (!id.equals(graphNode.id)) return false;
        if (!name.equals(graphNode.name)) return false;
        if (!rw.equals(graphNode.rw)) return false;
        return group.equals(graphNode.group);
    }

    @Override
    public int hashCode() {
        int result = id.hashCode();
        result = 31 * result + name.hashCode();
        result = 31 * result + rw.hashCode();
        result = 31 * result + group.hashCode();
        return result;
    }

    public String getHint() {
        return hint;
    }

    public void setHint(String hint) {
        this.hint = hint;
    }

    public String getCallTree() {
        return callTree;
    }

    public void setCallTree(String callTree) {
        this.callTree = callTree;
    }

    public String getModule() {
        return module;
    }

    public void setModule(String module) {
        this.module = module;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy