001package org.cpsolver.studentsct.heuristics.studentord;
002
003import java.util.ArrayList;
004import java.util.Collections;
005import java.util.List;
006
007import org.cpsolver.ifs.util.DataProperties;
008import org.cpsolver.studentsct.model.Student;
009
010
011/**
012 * Return the given set of students in a random order, however, all real
013 * students before last-like students.
014 * 
015 * @author  Tomáš Müller
016 * @version StudentSct 1.3 (Student Sectioning)<br>
017 *          Copyright (C) 2007 - 2014 Tomáš Müller<br>
018 *          <a href="mailto:muller@unitime.org">muller@unitime.org</a><br>
019 *          <a href="http://muller.unitime.org">http://muller.unitime.org</a><br>
020 * <br>
021 *          This library is free software; you can redistribute it and/or modify
022 *          it under the terms of the GNU Lesser General Public License as
023 *          published by the Free Software Foundation; either version 3 of the
024 *          License, or (at your option) any later version. <br>
025 * <br>
026 *          This library is distributed in the hope that it will be useful, but
027 *          WITHOUT ANY WARRANTY; without even the implied warranty of
028 *          MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
029 *          Lesser General Public License for more details. <br>
030 * <br>
031 *          You should have received a copy of the GNU Lesser General Public
032 *          License along with this library; if not see
033 *          <a href='http://www.gnu.org/licenses/'>http://www.gnu.org/licenses/</a>.
034 */
035public class StudentRandomRealFirstOrder implements StudentOrder {
036
037    public StudentRandomRealFirstOrder(DataProperties config) {
038    }
039
040    public StudentRandomRealFirstOrder() {
041    }
042
043    /**
044     * Return the given set of students in a random order, however, all real
045     * students before last-like ({@link Student#isDummy()} is true) students.
046     **/
047    @Override
048    public List<Student> order(List<Student> students) {
049        List<Student> real = new ArrayList<Student>(students.size());
050        List<Student> dummy = new ArrayList<Student>(students.size());
051        for (Student student : students) {
052            if (student.isDummy())
053                dummy.add(student);
054            else
055                real.add(student);
056        }
057        Collections.shuffle(dummy);
058        Collections.shuffle(real);
059        dummy.addAll(real);
060        return dummy;
061    }
062
063}