package prm4j;

import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;

import prm4j.api.Alphabet;
/*
 * Copyright (c) 2012 Mateusz Parzonka, Eric Bodden
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 * Mateusz Parzonka - initial API and implementation
 */
import prm4j.api.MatchHandler1;
import prm4j.api.Parameter;
import prm4j.api.Symbol;
import prm4j.api.Symbol1;
import prm4j.api.Symbol2;
import prm4j.api.fsm.FSM;
import prm4j.api.fsm.FSMState;

/**
 * Provides utilities for testing.
 */
public abstract class AbstractTest {

    @SuppressWarnings("rawtypes")
    public static class FSM_unsafeMapIterator {

	public final Alphabet alphabet = new Alphabet();

	public final Parameter<Map> m = alphabet.createParameter("m", Map.class);
	public final Parameter<Collection> c = alphabet.createParameter("c", Collection.class);
	public final Parameter<Iterator> i = alphabet.createParameter("i", Iterator.class);

	public final Symbol2<Map, Collection> createColl = alphabet.createSymbol2("createColl", m, c);
	public final Symbol2<Collection, Iterator> createIter = alphabet.createSymbol2("createIter", c, i);
	public final Symbol1<Map> updateMap = alphabet.createSymbol1("updateMap", m);
	public final Symbol1<Iterator> useIter = alphabet.createSymbol1("useIter", i);

	public final FSM<Void> fsm = new FSM<Void>(alphabet);

	public final FSMState<Void> initial = fsm.createInitialState();
	public final FSMState<Void> s1 = fsm.createState();
	public final FSMState<Void> s2 = fsm.createState();
	public final FSMState<Void> s3 = fsm.createState();
	public final FSMState<Void> error = fsm.createFinalState(new MatchHandler1<Iterator>(i) {
	    @Override
	    public void handleMatch(Iterator obj1) {

	    }
	});

	public FSM_unsafeMapIterator() {
	    initial.addTransition(createColl, s1);
	    s1.addTransition(updateMap, s1);
	    s1.addTransition(createIter, s2);
	    s2.addTransition(useIter, s2);
	    s2.addTransition(updateMap, s3);
	    s3.addTransition(updateMap, s3);
	    s3.addTransition(useIter, error);
	}

    }

    /**
     * Downcast SymbolN to Symbol.
     *
     * @param values
     * @return
     */
    public static Set<Symbol> asSet(Symbol... values) {
	Set<Symbol> set = new HashSet<Symbol>();
	for (Symbol s : values) {
	    set.add(s);
	}
	return set;
    }

}

@@ -1,174 +1,4 @@
-package prm4j;%0A%0Aimport java.util.Collection;%0Aimport java.util.HashSet;%0Aimport java.util.Iterator;%0Aimport java.util.Map;%0Aimport java.util.Set;%0A%0Aimport prm4j.api.Alphabet;%0A
 /*%0A 
@@ -371,16 +371,186 @@
 ion%0A */%0A
+package prm4j;%0A%0Aimport java.util.Collection;%0Aimport java.util.HashSet;%0Aimport java.util.Iterator;%0Aimport java.util.Map;%0Aimport java.util.Set;%0A%0Aimport prm4j.api.Alphabet;%0A
 import p

Reorder comments