testsimpleloopchecker5.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;

/**
 * Loop checker test 1.
 * @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 class TestSimpleLoopChecker5 extends TestSimpleLoopChecker {

    /**
     * Constructor.
     */
    public TestSimpleLoopChecker5() {
        super ();
    }

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

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

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

    /**
     * Get a sequence of objects to be tested.
     * @return a list
     */
    public List getSequence() {
        String A = "a";
        String B = "b";
        String C = "c";
        Vector v = new Vector ();

        v.add (A);
        v.add (B);
        v.add (C);

        return merge (v, 20);
    }

    /**
     * Indicates whether the loop checker should detect an infinite loop.
     * returns false because the sequence is not long enough!
     * @return a boolean
     */
    public boolean shouldDetectLoop() {
        return false;
    }
}