/*
 * 
 * Copyright Matt Palmer 2011, All rights reserved.
 * 
 * This code is licensed under a standard 3-clause BSD license:
 * 
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 * 
 *  * Redistributions of source code must retain the above copyright notice, 
 *    this list of conditions and the following disclaimer.
 * 
 *  * Redistributions in binary form must reproduce the above copyright notice, 
 *    this list of conditions and the following disclaimer in the documentation 
 *    and/or other materials provided with the distribution.
 * 
 *  * The names of its contributors may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *  
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 * POSSIBILITY OF SUCH DAMAGE.
 * 
 * 
 */
package net.domesdaybook.automata.base;

import java.util.ArrayList;
import java.util.IdentityHashMap;
import java.util.List;
import java.util.Map;
import net.domesdaybook.automata.Automata;
import net.domesdaybook.automata.Automata;
import net.domesdaybook.automata.State;
import net.domesdaybook.automata.State;
import net.domesdaybook.automata.walker.StateChildWalker;
import net.domesdaybook.automata.walker.Step;
import net.domesdaybook.automata.walker.StepAction;
import net.domesdaybook.object.DeepCopy;

/**
 *
 * @author Matt Palmer
 */
public class BaseAutomata<T> implements Automata<T>{

    protected final State<T> initialState;
    
    public BaseAutomata(final State<T> initialState) {
        this.initialState = initialState;
    }

    
    public State<T> getInitialState() {
        return initialState;
    }

    
    public List<State<T>> getFinalStates() {
        final List<State<T>> finalStates = new ArrayList<State<T>>();
        final StepAction findFinalStates = new StepAction() {
            @Override
            public void take(final Step step) {
                if (step.currentState.isFinal()) {
                    finalStates.add(step.currentState);
                }
            }
        };
        StateChildWalker.walkAutomata(initialState, findFinalStates);
        return finalStates;
    }
    

    public Automata<T> deepCopy() {
        final Map<DeepCopy, DeepCopy> oldToNew = new IdentityHashMap<DeepCopy, DeepCopy>();
        return deepCopy(oldToNew);
    }
    
    
    public Automata<T> deepCopy(Map<DeepCopy, DeepCopy> oldToNewObjects) {
        return new BaseAutomata(initialState.deepCopy(oldToNewObjects));
    }
    
}

@@ -1818,91 +1818,8 @@
 ta;%0A
-import net.domesdaybook.automata.Automata;%0Aimport net.domesdaybook.automata.State;%0A
 impo
@@ -1854,16 +1854,16 @@
 .State;%0A
+
 import n
@@ -2154,22 +2154,16 @@
 otected 
-final 
 State%3CT%3E
@@ -2178,24 +2178,73 @@
 State;%0A    %0A
+    %0A    public BaseAutomata() %7B%0A    %7D%0A    %0A    %0A
     public B
@@ -2376,24 +2376,24 @@
 alState() %7B%0A
-
         retu
@@ -2406,32 +2406,153 @@
 tialState;%0A    %7D
+%0A    %0A    %0A    public void setInitialState(final State%3CT%3E initialState) %7B%0A        this.initialState = initialState;%0A    %7D
 %0A%0A    %0A    publi

Allow changing initial state, and constructing with a null initial state. The states themselves are mutable in any case, and it simplifies creating subclasses of automata in some circumstances. It does open the possibility of a null pointer exception if an automata is created without an initial state.