TreasureTreeNode.java

Go to the documentation of this file.

/*
 * Gridarta MMORPG map editor for Crossfire, Daimonin and similar games.
 * Copyright (C) 2000-2023 The Gridarta Developers.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 for more details.
 *
 * You should have received a copy of the GNU General Public License along
 * with this program; if not, write to the Free Software Foundation, Inc.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */
 
package net.sf.gridarta.model.treasurelist;
 
import java.util.List;
import javax.swing.tree.DefaultMutableTreeNode;
import javax.swing.tree.MutableTreeNode;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
 
public class TreasureTreeNode extends DefaultMutableTreeNode {
 
    private static final long serialVersionUID = 1L;
 
    @NotNull
    private final TreasureObj content;
 
    public TreasureTreeNode(@NotNull final TreasureObj content) {
        this.content = content;
    }
 
    @NotNull
    public MutableTreeNode getClone(final boolean processSecondLinking, @Nullable final List<TreasureTreeNode> needSecondLink) {
        // clone this object
        final TreasureTreeNode clone = new TreasureTreeNode(content);
 
        // also clone all children nodes and link them properly
        for (int i = 0; i < getChildCount(); i++) {
            final TreasureTreeNode treasureTreeNode = (TreasureTreeNode) getChildAt(i);
            clone.add(treasureTreeNode.getClone(processSecondLinking, needSecondLink));
        }
 
        // if this is a list without children it will need second linking
        if (!processSecondLinking && content.isTreasureList() && !content.getName().equalsIgnoreCase("NONE") && !content.hasLoop()) {
            // this is a list, let's see if there are children
            boolean hasChildren = false; // true when this list has real children
            for (int i = 0; i < getChildCount(); i++) {
                final TreasureTreeNode treasureTreeNode = (TreasureTreeNode) getChildAt(i);
                if (treasureTreeNode.content.isRealChild()) {
                    hasChildren = true; // found a real child
                    break;
                }
            }
            if (!hasChildren) {
                // this is a list with nothing but YES/NO in it, needs linking
                assert needSecondLink != null;
                needSecondLink.add(clone);
            }
        }
 
        return clone;
    }
 
    @NotNull
    @Override
    public String toString() {
        return content.toString();
    }
 
    @NotNull
    public TreasureObj getTreasureObj() {
        return content;
    }
 
    public void recalculateChances() {
        if (!(content instanceof TreasureListTreasureObj)) {
            return;
        }
 
        final TreasureListTreasureObj treasureListTreasureObj = (TreasureListTreasureObj) content;
        if (treasureListTreasureObj.getListType() != TreasureListTreasureObjType.ONE) {
            return;
        }
 
        int sumChances = 0;
 
        // calculate the sum of all chances
        for (int i = 0; i < getChildCount(); i++) {
            final TreasureTreeNode treasureTreeNode = (TreasureTreeNode) getChildAt(i);
            sumChances += treasureTreeNode.content.initChance();
        }
 
        final double corrector = 100.0 / sumChances;
 
        // now apply the correcting factor to all chances
        for (int i = 0; i < getChildCount(); i++) {
            final TreasureTreeNode treasureTreeNode = (TreasureTreeNode) getChildAt(i);
            treasureTreeNode.content.correctChance(corrector);
        }
    }
 
}