001package org.cpsolver.studentsct.heuristics.studentord;
002
003import org.cpsolver.ifs.util.DataProperties;
004import org.cpsolver.studentsct.model.CourseRequest;
005import org.cpsolver.studentsct.model.Student;
006
007/**
008 * Return the given set of students in an order of student priority, and
009 * when of the same priority of average course request
010 * time stamp {@link CourseRequest#getTimeStamp()}. If the time stamp
011 * is the same (or not set), fall back to the number of choices
012 * (student with fewer choices first).
013 * 
014 * @author  Tomáš Müller
015 * @version StudentSct 1.3 (Student Sectioning)<br>
016 *          Copyright (C) 2007 - 2021 Tomáš Müller<br>
017 *          <a href="mailto:muller@unitime.org">muller@unitime.org</a><br>
018 *          <a href="http://muller.unitime.org">http://muller.unitime.org</a><br>
019 * <br>
020 *          This library is free software; you can redistribute it and/or modify
021 *          it under the terms of the GNU Lesser General Public License as
022 *          published by the Free Software Foundation; either version 3 of the
023 *          License, or (at your option) any later version. <br>
024 * <br>
025 *          This library is distributed in the hope that it will be useful, but
026 *          WITHOUT ANY WARRANTY; without even the implied warranty of
027 *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
028 *          Lesser General Public License for more details. <br>
029 * <br>
030 *          You should have received a copy of the GNU Lesser General Public
031 *          License along with this library; if not see
032 *          <a href='http://www.gnu.org/licenses/'>http://www.gnu.org/licenses/</a>.
033 */
034public class StudentByPriorityRequestDate extends StudentByRequestDate {
035    
036    public StudentByPriorityRequestDate(DataProperties config) {
037        super(config);
038    }
039
040    @Override
041    public int compare(Student s1, Student s2) {
042        if (s1.getPriority() != s2.getPriority()) return (s1.getPriority().ordinal() < s2.getPriority().ordinal() ? -1 : 1);
043        return super.compare(s1, s2);
044    }
045}