    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 * @version StudentSct 1.3 (Student Sectioning)<br>
    016 *          Copyright (C) 2007 - 2014 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 StudentRandomRealFirstOrder implements StudentOrder {
    035
    036    public StudentRandomRealFirstOrder(DataProperties config) {
    037    }
    038
    039    public StudentRandomRealFirstOrder() {
    040    }
    041
    042    /**
    043     * Return the given set of students in a random order, however, all real
    044     * students before last-like ({@link Student#isDummy()} is true) students.
    045     **/
    046    @Override
    047    public List<Student> order(List<Student> students) {
    048        List<Student> real = new ArrayList<Student>(students.size());
    049        List<Student> dummy = new ArrayList<Student>(students.size());
    050        for (Student student : students) {
    051            if (student.isDummy())
    052                dummy.add(student);
    053            else
    054                real.add(student);
    055        }
    056        Collections.shuffle(dummy);
    057        Collections.shuffle(real);
    058        dummy.addAll(real);
    059        return dummy;
    060    }
    061
    062}