001    package net.sf.cpsolver.coursett.criteria.placement;
002    
003    import java.util.Set;
004    
005    import net.sf.cpsolver.coursett.model.Placement;
006    
007    /**
008     * Count number of past assignments of a value. Avoid repetition by penalizing
009     * values that have been assigned too many times already. 
010     * <br>
011     * 
012     * @version CourseTT 1.2 (University Course Timetabling)<br>
013     *          Copyright (C) 2006 - 2011 Tomas Muller<br>
014     *          <a href="mailto:muller@unitime.org">muller@unitime.org</a><br>
015     *          <a href="http://muller.unitime.org">http://muller.unitime.org</a><br>
016     * <br>
017     *          This library is free software; you can redistribute it and/or modify
018     *          it under the terms of the GNU Lesser General Public License as
019     *          published by the Free Software Foundation; either version 3 of the
020     *          License, or (at your option) any later version. <br>
021     * <br>
022     *          This library is distributed in the hope that it will be useful, but
023     *          WITHOUT ANY WARRANTY; without even the implied warranty of
024     *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
025     *          Lesser General Public License for more details. <br>
026     * <br>
027     *          You should have received a copy of the GNU Lesser General Public
028     *          License along with this library; if not see
029     *          <a href='http://www.gnu.org/licenses/'>http://www.gnu.org/licenses/</a>.
030     */
031    public class AssignmentCount extends PlacementSelectionCriterion {
032        
033        @Override
034        public String getPlacementSelectionWeightName() {
035            return "Placement.NrAssignmentsWeight";
036        }
037    
038        @Override
039        public double getValue(Placement value, Set<Placement> conflicts) {
040            return value.countAssignments();
041        }
042    }