001 package net.sf.cpsolver.coursett.preference;
002
003 /**
004 * Min-max preference combination. <br>
005 * <ul>
006 * <li>If at least one preference is required -> required
007 * <li>If at least one preference is prohibited -> prohibited
008 * <li>If max>-min -> max
009 * <li>If -min>max -> min
010 * <li>Otherwise -> 0
011 * </ul>
012 *
013 * @version CourseTT 1.2 (University Course Timetabling)<br>
014 * Copyright (C) 2006 - 2010 Tomas Muller<br>
015 * <a href="mailto:muller@unitime.org">muller@unitime.org</a><br>
016 * <a href="http://muller.unitime.org">http://muller.unitime.org</a><br>
017 * <br>
018 * This library is free software; you can redistribute it and/or modify
019 * it under the terms of the GNU Lesser General Public License as
020 * published by the Free Software Foundation; either version 3 of the
021 * License, or (at your option) any later version. <br>
022 * <br>
023 * This library is distributed in the hope that it will be useful, but
024 * WITHOUT ANY WARRANTY; without even the implied warranty of
025 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
026 * Lesser General Public License for more details. <br>
027 * <br>
028 * You should have received a copy of the GNU Lesser General Public
029 * License along with this library; if not see
030 * <a href='http://www.gnu.org/licenses/'>http://www.gnu.org/licenses/</a>.
031 */
032 public class MinMaxPreferenceCombination extends PreferenceCombination {
033 int iPreferenceMin = 0;
034 int iPreferenceMax = 0;
035
036 @Override
037 public void addPreferenceInt(int intPref) {
038 super.addPreferenceInt(intPref);
039 iPreferenceMax = Math.max(iPreferenceMax, intPref);
040 iPreferenceMin = Math.min(iPreferenceMin, intPref);
041 }
042
043 @Override
044 public int getPreferenceInt() {
045 return (iPreferenceMax > -iPreferenceMin ? iPreferenceMax : -iPreferenceMin > iPreferenceMax ? iPreferenceMin
046 : iPreferenceMax);
047 }
048 }