net.sf.cpsolver.coursett.model
Class Student
java.lang.Object
net.sf.cpsolver.coursett.model.Student
- All Implemented Interfaces:
- Comparable<Student>
public class Student
- extends Object
- implements Comparable<Student>
Student.
- Version:
- CourseTT 1.2 (University Course Timetabling)
Copyright (C) 2006 - 2010 Tomas Muller
muller@unitime.org
http://muller.unitime.org
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not see
http://www.gnu.org/licenses/.
USE_DISTANCE_CACHE
public static boolean USE_DISTANCE_CACHE
Student
public Student(Long studentId)
addOffering
public void addOffering(Long offeringId,
double weight,
Double priority)
addOffering
public void addOffering(Long offeringId,
double weight)
getOfferingsMap
public Map<Long,Double> getOfferingsMap()
getOfferings
public Set<Long> getOfferings()
hasOffering
public boolean hasOffering(Long offeringId)
getInstructor
public InstructorConstraint getInstructor()
setInstructor
public void setInstructor(InstructorConstraint instructor)
getPriority
public Double getPriority(Long offeringId)
- Priority of an offering (for the student). Null if not used, or between
zero (no priority) and one (highest priority)
getPriority
public Double getPriority(Configuration configuration)
getPriority
public Double getPriority(Lecture lecture)
getConflictingPriorty
public Double getConflictingPriorty(Lecture l1,
Lecture l2)
getOfferingWeight
public double getOfferingWeight(Configuration configuration)
getOfferingWeight
public double getOfferingWeight(Long offeringId)
canUnenroll
public boolean canUnenroll(Lecture lecture)
canEnroll
public boolean canEnroll(Lecture lecture)
addCanNotEnroll
public void addCanNotEnroll(Lecture lecture)
addCanNotEnroll
public void addCanNotEnroll(Long offeringId,
Collection<Lecture> lectures)
canNotEnrollSections
public Map<Long,Set<Lecture>> canNotEnrollSections()
addLecture
public void addLecture(Lecture lecture)
removeLecture
public void removeLecture(Lecture lecture)
getLectures
public Set<Lecture> getLectures()
addConfiguration
public void addConfiguration(Configuration config)
removeConfiguration
public void removeConfiguration(Configuration config)
getConfigurations
public Set<Configuration> getConfigurations()
getId
public Long getId()
getDistance
public double getDistance(Student student)
clearDistanceCache
public void clearDistanceCache()
toString
public String toString()
- Overrides:
toString
in class Object
hashCode
public int hashCode()
- Overrides:
hashCode
in class Object
compareTo
public int compareTo(Student s)
- Specified by:
compareTo
in interface Comparable<Student>
equals
public boolean equals(Object o)
- Overrides:
equals
in class Object
addCommitedPlacement
public void addCommitedPlacement(Placement placement)
getCommitedPlacements
public Set<Placement> getCommitedPlacements()
conflictPlacements
public Set<Placement> conflictPlacements(Placement placement)
countConflictPlacements
public int countConflictPlacements(Placement placement)
getJenrlWeight
public double getJenrlWeight(Lecture l1,
Lecture l2)
avg
public double avg(double w1,
double w2)
getAcademicArea
public String getAcademicArea()
setAcademicArea
public void setAcademicArea(String acadArea)
getAcademicClassification
public String getAcademicClassification()
setAcademicClassification
public void setAcademicClassification(String acadClasf)
getMajor
public String getMajor()
setMajor
public void setMajor(String major)
getCurriculum
public String getCurriculum()
setCurriculum
public void setCurriculum(String curriculum)
Copyright © 2014 UniTime LLC. All Rights Reserved.