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

com.onevizion.uitest.api.vo.TreeNode Maven / Gradle / Ivy

The newest version!
package com.onevizion.uitest.api.vo;

import java.util.ArrayList;
import java.util.List;

public class TreeNode {

    private String name;
    private List nodes = new ArrayList<>();

    public TreeNode(String name) {
        this.name = name;
    }

    public void addNode(TreeNode treeNode){
        nodes.add(treeNode);
    }

    public String getName() {
        return name;
    }

    @Override
    public int hashCode() {
        final int prime = 31;
        int result = 1;
        result = prime * result + ((name == null) ? 0 : name.hashCode());
        result = prime * result + ((nodes == null) ? 0 : nodes.hashCode());
        return result;
    }

    @Override
    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }

        if (obj == null) {
            return false;
        }

        if (getClass() != obj.getClass()) {
            return false;
        }

        TreeNode other = (TreeNode) obj;
        if (name == null) {
            if (other.name != null) {
                return false;
            }
        } else if (!name.equals(other.name)) {
            return false;
        }

        if (nodes == null) {
            if (other.nodes != null) {
                return false;
            }
        } else if (!nodes.equals(other.nodes)) {
            return false;
        }

        return true;
    }

    @Override
    public String toString() {
        return toStringNode(0, this);
    }

    private String toStringNode(int level, TreeNode tree) {
        String indent = "    ";

        StringBuilder bld = new StringBuilder();
        bld.append(System.lineSeparator());

        for (int i = 0; i < level; i++) {
            bld.append(indent);
        }

        bld.append(tree.getName());
        for (TreeNode node : tree.nodes) {
            bld.append(toStringNode(level + 1, node));
        }

        return bld.toString();
    }

}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy