/*
 *     Dungeons Guide - The most intelligent Hypixel Skyblock Dungeons Mod
 *     Copyright (C) 2021  cyoung06
 *
 *     This program is free software: you can redistribute it and/or modify
 *     it under the terms of the GNU Affero General Public License as published
 *     by the Free Software Foundation, either version 3 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 Affero General Public License for more details.
 *
 *     You should have received a copy of the GNU Affero General Public License
 *     along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

package kr.syeyoung.dungeonsguide.dungeon.actions.tree;

import kr.syeyoung.dungeonsguide.dungeon.actions.Action;
import kr.syeyoung.dungeonsguide.dungeon.actions.ActionRoot;
import kr.syeyoung.dungeonsguide.dungeon.roomfinder.DungeonRoom;
import lombok.Data;
import lombok.EqualsAndHashCode;

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

@Data
public class ActionTree implements Cloneable {
    @EqualsAndHashCode.Exclude
    private Set<ActionTree> parent;
    private Action current;
    private Set<ActionTree> children;

    @Override
    public int hashCode() { return current == null ? 0 : current.hashCode(); }


    public static ActionTree buildActionTree(Set<Action> actions, DungeonRoom dungeonRoom) {
        ActionRoot root = new ActionRoot();
        root.setPreRequisite(actions);
        ActionTree tree = new ActionTree();
        tree.setParent(new HashSet<ActionTree>());
        tree.setCurrent(root);
        HashSet<ActionTree> set = new HashSet();
        for (Action action : actions) {
            set.add(buildActionTree(tree, action, dungeonRoom, new HashMap<Action, ActionTree>()));
        }
        tree.setChildren(set);
        return tree;
    }
    public static ActionTree buildActionTree(Action actions, DungeonRoom dungeonRoom) {
        return buildActionTree(null, actions, dungeonRoom, new HashMap<Action, ActionTree>());
    }



    private static ActionTree buildActionTree(ActionTree parent, Action action, DungeonRoom dungeonRoom, Map<Action, ActionTree> alreadyBuilt) {
        if (action == null) return null;
        if (alreadyBuilt.containsKey(action))  {
            ActionTree tree = alreadyBuilt.get(action);
            tree.getParent().add(parent);
            return tree;
        }

        ActionTree tree = new ActionTree();
        alreadyBuilt.put(action, tree);
        tree.setParent(new HashSet<ActionTree>());
        if (parent != null)
            tree.getParent().add(parent);
        tree.setCurrent(action);
        HashSet<ActionTree> set = new HashSet();
        for (Action action2 : action.getPreRequisites(dungeonRoom)) {
            set.add(buildActionTree(tree, action2, dungeonRoom, alreadyBuilt));
        }
        tree.setChildren(set);
        return tree;
    }
}