testsimpleloopchecker.java

Mandarax是一个规则引擎的纯Java实现。它支持多类型的事实和基于反映的规则

/*
 * Copyright (C) 1999-2004 <A href="http://www-ist.massey.ac.nz/JBDietrich" target="_top">Jens Dietrich</a>
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
package test.org.mandarax.reference;


import java.util.List;
import java.util.Vector;

import org.mandarax.reference.DefaultLoopCheckingAlgorithm;

/**
 * An abstract test case class to test the simple loop checker.
 * Note that we do not check sequences of clauses but sequences of objects (strings).
 * @author <A href="http://www-ist.massey.ac.nz/JBDietrich" target="_top">Jens Dietrich</A>
 * @version 3.4 <7 March 05>
 * @since 1.3
 */
public abstract class TestSimpleLoopChecker extends MandaraxTestCase {

    /**
     * Constructor.
     */
    public TestSimpleLoopChecker() {
        super ("testLoopChecker");
    }

    /**
     * Get a description of this test case.
     * @return a descriptive string
     */
    public String getDescription() {
        return "test case " + getClass ().getName ();
    }

    /**
     * Get the max pattern length.
     * @return a value
     */
    public abstract int getMaxPatternLength();

    /**
     * Get the min recurrence number.
     * @return a value
     */
    public abstract int getMinRecurrenceNumber();

    /**
     * Get the number of steps without checks.
     * @return a value
     */
    public abstract int getNumberOfStepsWithoutCheck();

    /**
     * Get a sequence of objects to be tested.
     * @return a list
     */
    public abstract List getSequence();

    /**
     * merge a list n times with itself
     * @return a new list
     * @param list a list
     * @param times indicates how often the list should be merged with itself
     */
    protected List merge(List list, int times) {
        List newList = new Vector (list.size () * times);

        for(int i = 0; i < times; i++) {
            newList.addAll (list);
        }

        return newList;
    }

    /**
     * Indicates whether the loop checker should detect an infinite loop.
     * @return a boolean
     */
    public abstract boolean shouldDetectLoop();

    /**
     * Run the test.
     */
    public void testLoopChecker() {
        LOG_TEST.info ("Start Testcase " + getClass ().getName ()
                       + " , test method: " + "testLoopChecker()");

        DefaultLoopCheckingAlgorithm lc =
            new DefaultLoopCheckingAlgorithm (
                getMaxPatternLength (), getMinRecurrenceNumber (),
                getNumberOfStepsWithoutCheck ());

        assertTrue (shouldDetectLoop () == lc.isInfiniteLoop (getSequence ()));
        LOG_TEST.info ("Finish Testcase " + getClass ().getName ()
                       + " , test method: " + "testLoopChecker()");
    }
}