package org.mandarax.reference;

/*
 * Copyright (C) 1999-2004 <a href="mailto:mandarax@jbdietrich.com">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
 */
import org.mandarax.kernel.Clause;
import org.mandarax.kernel.SelectionPolicy;

/**
 * Simple selection policy - just use the converse order of the
 * negative literals of the goal.
 * @author <A HREF="mailto:mandarax@jbdietrich.com">Jens Dietrich</A>
 * @version 3.3.1 <9 August 2004>
 * @since 1.1
 */
public final class RightMostSelectionPolicy implements SelectionPolicy {

	/**
	 * Return an array of integers specifying in which order the inference engine
	 * should attempt to unify the literals with the candidate.
	 * @return int[] the indices
	 * @param goal the goal
	 * @param appliedClause the clause that should be used to prove the goal
	 */
	public int[] getOrderedPositions(Clause goal, Clause appliedClause) {
		int   l         = goal.getNegativeLiterals ().size ();
		int[] positions = new int[l];

		for(int i = 0; i < l; i++) {
			positions[l - (i + 1)] = i;
		}

		return positions;
	}
}
