/*******************************************************************************
 * Copyright (c) 2012-present Jakub Kováč, Jozef Brandýs, Katarína Kotrlová,
 * Pavol Lukča, Ladislav Pápay, Viktor Tomkovič, Tatiana Tóthová
 *
 * 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 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 ******************************************************************************/
package algvis.ds.trie;

import algvis.core.Algorithm;
import algvis.core.NodeColor;
import algvis.ui.view.REL;

public class TrieInsert extends Algorithm {
    private final Trie T;
    private String s;
    private TrieWordNode hw;

    public TrieInsert(Trie T, String s) {
        super(T.panel);
        this.T = T;
        this.s = s;
    }

    void beforeReturn() {
        removeFromScene(hw);
        T.clearExtraColor();
        addNote("done");
    }

    @Override
    public void runAlgorithm() {
        setHeader("trieinsert", s.substring(0, s.length() - 1));
        if (s.compareTo("$") == 0) {
            addNote("badword");
        }

        TrieNode v = T.getRoot();
        v.mark();
        addNote("trieinsertnote");
        addStep(v, REL.TOP, "trierootstart");
        pause();
        v.unmark();
        hw = new TrieWordNode(T, s);
        hw.setColor(NodeColor.INSERT);
        addToScene(hw);
        hw.goNextTo(v);

        while (s.compareTo("$") != 0) {
            final char ch = s.charAt(0);
            hw.setAndGoNextTo(s, v);
            TrieNode w = v.getChildWithCH(ch);
            if (w != null) {
                addStep(v, REL.TOP, "trieinsertwch", "" + ch);
            } else {
                addStep(v, REL.TOP, "trieinsertwoch", "" + ch);
                w = v.addChild(ch, hw.x, hw.y);
            }
            w.setColor(NodeColor.CACHED);
            T.reposition();
            pause();
            v = w;
            v.setColor(NodeColor.INSERT);
            T.reposition();
            s = s.substring(1);
        }
        hw.setAndGoNextTo(s, v);
        final TrieNode w = v.getChildWithCH('$');
        if (w == null) {
            addStep(v, REL.TOP, "trieinserteow");
        } else {
            addStep(v, REL.TOP, "trieinsertneow");
        }
        pause();
        v.setColor(NodeColor.NORMAL);
        v = v.addChild('$', hw.x, hw.y);
        T.reposition();
        hw.setAndGoNextTo(s, v);
        beforeReturn();
    }
}