/*

 * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code 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 General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 */

package metaspace.stressHierarchy.common.generateHierarchy;

import java.util.LinkedList;

import java.util.List;

public class TreeDescriptor {

    public List<NodeDescriptor> nodeDescriptorList = new LinkedList<NodeDescriptor>();

    public void addNode(int level, int index, int parentIndex, String className) {

        NodeDescriptor node = new NodeDescriptor();

        node.className = className;

        node.level = level;

        node.index = index;

        node.parentIndex = parentIndex;

        nodeDescriptorList.add(node);

    }

}