001package net.sf.cpsolver.studentsct.heuristics.studentord;
002
003import net.sf.cpsolver.ifs.util.DataProperties;
004import net.sf.cpsolver.studentsct.model.Student;
005
006/**
007 * Return the given set of students in an order of average number of choices of
008 * each student (students with more choices first), however, real student are
009 * before last-like students. By default, the order is reversed (students with
010 * less choices first).
011 * 
012 * @version StudentSct 1.2 (Student Sectioning)<br>
013 *          Copyright (C) 2007 - 2010 Tomáš Müller<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 */
031public class StudentChoiceRealFirstOrder extends StudentChoiceOrder {
032
033    public StudentChoiceRealFirstOrder(DataProperties config) {
034        super(config);
035    }
036
037    public StudentChoiceRealFirstOrder() {
038        super(new DataProperties());
039        setReverse(true);
040    }
041
042    @Override
043    public int compare(Student s1, Student s2) {
044        if (s1.isDummy()) {
045            if (!s2.isDummy())
046                return 1;
047        } else if (s2.isDummy())
048            return -1;
049        return super.compare(s1, s2);
050    }
051
052}