• Home
• org.metacsp
• meta-csp-framework
• 1.2.8
• source code
• WidestIntervalFirstValOH.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

org.metacsp.meta.TCSP.WidestIntervalFirstValOH Maven / Gradle / Ivy

/*******************************************************************************
 * Copyright (c) 2010-2013 Federico Pecora 
 * 
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 ******************************************************************************/
package org.metacsp.meta.TCSP;

import org.metacsp.framework.Constraint;
import org.metacsp.framework.ConstraintNetwork;
import org.metacsp.framework.ValueOrderingH;
import org.metacsp.multi.TCSP.DistanceConstraint;
import org.metacsp.time.APSPSolver;
import org.metacsp.time.SimpleDistanceConstraint;

public class WidestIntervalFirstValOH extends ValueOrderingH {

	@Override
	public int compare(ConstraintNetwork arg0, ConstraintNetwork arg1) {
		Constraint[] cons0 = arg0.getConstraints();
		Constraint[] cons1 = arg1.getConstraints();
		SimpleDistanceConstraint con0 = (SimpleDistanceConstraint)((DistanceConstraint)cons0[0]).getInternalConstraints()[0];
		SimpleDistanceConstraint con1 = (SimpleDistanceConstraint)((DistanceConstraint)cons1[0]).getInternalConstraints()[0];
		int min0 = 0, max0 = 0, min1 = 0, max1 = 0;
		if (con0.getMinimum() == APSPSolver.INF) min0 = Integer.MAX_VALUE;
		else min0 = (int)con0.getMinimum();
		if (con0.getMaximum() == APSPSolver.INF) max0 = Integer.MAX_VALUE;
		else max0 = (int)con0.getMaximum();
		if (con1.getMinimum() == APSPSolver.INF) min1 = Integer.MAX_VALUE;
		else min1 = (int)con1.getMinimum();
		if (con1.getMaximum() == APSPSolver.INF) max1 = Integer.MAX_VALUE;
		else max1 = (int)con1.getMaximum();
		int distance0 = Math.abs(max0-min0); 
		int distance1 = Math.abs(max1-min1);
		return distance0-distance1;
	}

}