Back to index

fet  5.18.0
Public Member Functions | Public Attributes
ConstraintStudentsSetActivityTagMaxHoursContinuously Class Reference

#include <timeconstraint.h>

Inheritance diagram for ConstraintStudentsSetActivityTagMaxHoursContinuously:
Inheritance graph
[legend]
Collaboration diagram for ConstraintStudentsSetActivityTagMaxHoursContinuously:
Collaboration graph
[legend]

List of all members.

Public Member Functions

 ConstraintStudentsSetActivityTagMaxHoursContinuously ()
 ConstraintStudentsSetActivityTagMaxHoursContinuously (double wp, int maxnh, const QString &s, const QString &activityTag)
bool computeInternalStructure (QWidget *parent, Rules &r)
 Computes the internal structure for this constraint.
bool hasInactiveActivities (Rules &r)
QString getXmlDescription (Rules &r)
 Returns an XML description of this constraint.
QString getDescription (Rules &r)
 Returns a small description string for this constraint.
QString getDetailedDescription (Rules &r)
 Returns a detailed description string for this constraint.
double fitness (Solution &c, Rules &r, QList< double > &cl, QList< QString > &dl, QString *conflictsString=NULL)
 The function that calculates the fitness of a solution, according to this constraint.
bool isRelatedToActivity (Rules &r, Activity *a)
 Returns true if this constraint is related to this activity.
bool isRelatedToTeacher (Teacher *t)
 Returns true if this constraint is related to this teacher.
bool isRelatedToSubject (Subject *s)
 Returns true if this constraint is related to this subject.
bool isRelatedToActivityTag (ActivityTag *s)
 Returns true if this constraint is related to this activity tag.
bool isRelatedToStudentsSet (Rules &r, StudentsSet *s)
 Returns true if this constraint is related to this students set.
bool hasWrongDayOrHour (Rules &r)
bool canRepairWrongDayOrHour (Rules &r)
bool repairWrongDayOrHour (Rules &r)

Public Attributes

int maxHoursContinuously
QString students
 The students set name.
QString activityTagName
int activityTagIndex
QList< int > iSubgroupsList
 The number of subgroups.
QList< int > canonicalSubgroupsList
double weightPercentage
 The percentage weight of this constraint, 100% compulsory, 0% non-compulsory.
bool active
QString comments
int type
 Specifies the type of this constraint (using the above constants).

Detailed Description

Definition at line 1807 of file timeconstraint.h.


Constructor & Destructor Documentation

ConstraintStudentsSetActivityTagMaxHoursContinuously::ConstraintStudentsSetActivityTagMaxHoursContinuously ( double  wp,
int  maxnh,
const QString &  s,
const QString &  activityTag 
)

Definition at line 7941 of file timeconstraint.cpp.


Member Function Documentation

Implements TimeConstraint.

Definition at line 8234 of file timeconstraint.cpp.

{
       assert(hasWrongDayOrHour(r));
       
       return true;
}

Here is the call graph for this function:

Computes the internal structure for this constraint.

It returns false if the constraint is an activity related one and it depends on only inactive activities.

Implements TimeConstraint.

Definition at line 8014 of file timeconstraint.cpp.

{
       this->activityTagIndex=r.searchActivityTag(this->activityTagName);
       assert(this->activityTagIndex>=0);

       StudentsSet* ss=r.searchAugmentedStudentsSet(this->students);
       
       if(ss==NULL){
              QMessageBox::warning(parent, tr("FET warning"),
               tr("Constraint students set max hours continuously is wrong because it refers to inexistent students set."
               " Please correct it (removing it might be a solution). Please report potential bug. Constraint is:\n%1").arg(this->getDetailedDescription(r)));
               
              return false;
       }      

       assert(ss);

       this->iSubgroupsList.clear();
       if(ss->type==STUDENTS_SUBGROUP){
              int tmp;
              tmp=((StudentsSubgroup*)ss)->indexInInternalSubgroupsList;
              assert(tmp>=0);
              assert(tmp<r.nInternalSubgroups);
              if(!this->iSubgroupsList.contains(tmp))
                     this->iSubgroupsList.append(tmp);
       }
       else if(ss->type==STUDENTS_GROUP){
              StudentsGroup* stg=(StudentsGroup*)ss;
              for(int i=0; i<stg->subgroupsList.size(); i++){
                     StudentsSubgroup* sts=stg->subgroupsList[i];
                     int tmp;
                     tmp=sts->indexInInternalSubgroupsList;
                     assert(tmp>=0);
                     assert(tmp<r.nInternalSubgroups);
                     if(!this->iSubgroupsList.contains(tmp))
                            this->iSubgroupsList.append(tmp);
              }
       }
       else if(ss->type==STUDENTS_YEAR){
              StudentsYear* sty=(StudentsYear*)ss;
              for(int i=0; i<sty->groupsList.size(); i++){
                     StudentsGroup* stg=sty->groupsList[i];
                     for(int j=0; j<stg->subgroupsList.size(); j++){
                            StudentsSubgroup* sts=stg->subgroupsList[j];
                            int tmp;
                            tmp=sts->indexInInternalSubgroupsList;
                            assert(tmp>=0);
                            assert(tmp<r.nInternalSubgroups);
                            if(!this->iSubgroupsList.contains(tmp))
                                   this->iSubgroupsList.append(tmp);
                     }
              }
       }
       else
              assert(0);
              
       this->canonicalSubgroupsList.clear();
       foreach(int i, this->iSubgroupsList){
              bool found=false;
       
              StudentsSubgroup* sbg=r.internalSubgroupsList[i];
              foreach(int actIndex, sbg->activitiesForSubgroup){
                     if(r.internalActivitiesList[actIndex].iActivityTagsSet.contains(this->activityTagIndex)){
                            found=true;
                            break;
                     }
              }
              
              if(found)
                     this->canonicalSubgroupsList.append(i);
       }

              
       return true;
}

Here is the call graph for this function:

double ConstraintStudentsSetActivityTagMaxHoursContinuously::fitness ( Solution c,
Rules r,
QList< double > &  cl,
QList< QString > &  dl,
QString *  conflictsString = NULL 
) [virtual]

The function that calculates the fitness of a solution, according to this constraint.

We need the rules to compute this fitness factor. If conflictsString!=NULL, it will be initialized with a text explaining where this restriction is broken.

Implements TimeConstraint.

Definition at line 8091 of file timeconstraint.cpp.

{
       //if the matrices subgroupsMatrix and teachersMatrix are already calculated, do not calculate them again!
       if(!c.teachersMatrixReady || !c.subgroupsMatrixReady){
              c.teachersMatrixReady=true;
              c.subgroupsMatrixReady=true;
              subgroups_conflicts = c.getSubgroupsMatrix(r, subgroupsMatrix);
              teachers_conflicts = c.getTeachersMatrix(r, teachersMatrix);

              c.changedForMatrixCalculation=false;
       }

       int nbroken;

       nbroken=0;

       foreach(int i, this->canonicalSubgroupsList){
              StudentsSubgroup* sbg=r.internalSubgroupsList[i];
              int crtSubgroupTimetableActivityTag[MAX_DAYS_PER_WEEK][MAX_HOURS_PER_DAY];
              for(int d=0; d<r.nDaysPerWeek; d++)
                     for(int h=0; h<r.nHoursPerDay; h++)
                            crtSubgroupTimetableActivityTag[d][h]=-1;
              foreach(int ai, sbg->activitiesForSubgroup)if(c.times[ai]!=UNALLOCATED_TIME){
                     int d=c.times[ai]%r.nDaysPerWeek;
                     int h=c.times[ai]/r.nDaysPerWeek;
                     for(int dur=0; dur<r.internalActivitiesList[ai].duration; dur++){
                            assert(h+dur<r.nHoursPerDay);
                            assert(crtSubgroupTimetableActivityTag[d][h+dur]==-1);
                            if(r.internalActivitiesList[ai].iActivityTagsSet.contains(this->activityTagIndex))
                                   crtSubgroupTimetableActivityTag[d][h+dur]=this->activityTagIndex;
                     }
              }

              for(int d=0; d<r.nDaysPerWeek; d++){
                     int nc=0;
                     for(int h=0; h<r.nHoursPerDay; h++){
                            bool inc=false;
                            
                            if(crtSubgroupTimetableActivityTag[d][h]==this->activityTagIndex)
                                   inc=true;
                     
                            if(inc)
                                   nc++;
                            else{
                                   if(nc>this->maxHoursContinuously){
                                          nbroken++;

                                          if(conflictsString!=NULL){
                                                 QString s=(tr(
                                                  "Time constraint students set max %1 hours continuously broken for subgroup %2, on day %3, length=%4.")
                                                  .arg(CustomFETString::number(this->maxHoursContinuously))
                                                  .arg(r.internalSubgroupsList[i]->name)
                                                  .arg(r.daysOfTheWeek[d])
                                                  .arg(nc)
                                                  )
                                                  +
                                                  " "
                                                  +
                                                  (tr("This increases the conflicts total by %1").arg(CustomFETString::number(weightPercentage/100)));
                                                 
                                                 dl.append(s);
                                                 cl.append(weightPercentage/100);
                            
                                                 *conflictsString+= s+"\n";
                                          }
                                   }
                            
                                   nc=0;
                            }
                     }

                     if(nc>this->maxHoursContinuously){
                            nbroken++;

                            if(conflictsString!=NULL){
                                   QString s=(tr(
                                    "Time constraint students set max %1 hours continuously broken for subgroup %2, on day %3, length=%4.")
                                    .arg(CustomFETString::number(this->maxHoursContinuously))
                                    .arg(r.internalSubgroupsList[i]->name)
                                    .arg(r.daysOfTheWeek[d])
                                    .arg(nc)
                                    )
                                    +
                                    " "
                                    +
                                    (tr("This increases the conflicts total by %1").arg(CustomFETString::number(weightPercentage/100)));
                                                 
                                   dl.append(s);
                                   cl.append(weightPercentage/100);
                            
                                   *conflictsString+= s+"\n";
                            }
                     }
              }
       }

       if(weightPercentage==100)   
              assert(nbroken==0);
       return weightPercentage/100 * nbroken;
}

Here is the call graph for this function:

Returns a small description string for this constraint.

Implements TimeConstraint.

Definition at line 7971 of file timeconstraint.cpp.

{
       Q_UNUSED(r);

       QString begin=QString("");
       if(!active)
              begin="X - ";
              
       QString end=QString("");
       if(!comments.isEmpty())
              end=", "+tr("C: %1", "Comments").arg(comments);
              
       QString s;
       s+=tr("Students set %1 for activity tag %2 has max %3 hours continuously").arg(this->students).arg(this->activityTagName).arg(this->maxHoursContinuously);
       s+=", ";
       s+=tr("WP:%1\%", "Weight percentage").arg(CustomFETString::number(this->weightPercentage));

       return begin+s+end;
}

Here is the call graph for this function:

Returns a detailed description string for this constraint.

Implements TimeConstraint.

Definition at line 7991 of file timeconstraint.cpp.

{
       Q_UNUSED(r);

       QString s=tr("Time constraint");s+="\n";
       s+=tr("A students set, for an activity tag, must respect the maximum number of hours continuously"); s+="\n";
       s+=tr("Weight (percentage)=%1\%").arg(CustomFETString::number(this->weightPercentage));s+="\n";
       s+=tr("Students set=%1").arg(this->students);s+="\n";
       s+=tr("Activity tag=%1").arg(this->activityTagName);s+="\n";
       s+=tr("Maximum hours continuously=%1").arg(this->maxHoursContinuously);s+="\n";

       if(!active){
              s+=tr("Active=%1", "Refers to a constraint").arg(yesNoTranslated(active));
              s+="\n";
       }
       if(!comments.isEmpty()){
              s+=tr("Comments=%1").arg(comments);
              s+="\n";
       }

       return s;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Returns an XML description of this constraint.

Implements TimeConstraint.

Definition at line 7956 of file timeconstraint.cpp.

{
       Q_UNUSED(r);

       QString s="<ConstraintStudentsSetActivityTagMaxHoursContinuously>\n";
       s+="   <Weight_Percentage>"+CustomFETString::number(this->weightPercentage)+"</Weight_Percentage>\n";
       s+="   <Maximum_Hours_Continuously>"+CustomFETString::number(this->maxHoursContinuously)+"</Maximum_Hours_Continuously>\n";
       s+="   <Students>"+protect(this->students)+"</Students>\n";
       s+="   <Activity_Tag>"+protect(this->activityTagName)+"</Activity_Tag>\n";
       s+="   <Active>"+trueFalse(active)+"</Active>\n";
       s+="   <Comments>"+protect(comments)+"</Comments>\n";
       s+="</ConstraintStudentsSetActivityTagMaxHoursContinuously>\n";
       return s;
}

Here is the call graph for this function:

Implements TimeConstraint.

Definition at line 7950 of file timeconstraint.cpp.

{
       Q_UNUSED(r);
       return false;
}

Implements TimeConstraint.

Definition at line 8226 of file timeconstraint.cpp.

{
       if(maxHoursContinuously>r.nHoursPerDay)
              return true;
       
       return false;
}

Here is the caller graph for this function:

Returns true if this constraint is related to this activity.

Implements TimeConstraint.

Definition at line 8192 of file timeconstraint.cpp.

{
       Q_UNUSED(r);
       Q_UNUSED(a);

       return false;
}

Returns true if this constraint is related to this activity tag.

Implements TimeConstraint.

Definition at line 8214 of file timeconstraint.cpp.

{
       Q_UNUSED(s);

       return false;
}

Returns true if this constraint is related to this students set.

Implements TimeConstraint.

Definition at line 8221 of file timeconstraint.cpp.

{
       return r.setsShareStudents(this->students, s->name);
}

Here is the call graph for this function:

Returns true if this constraint is related to this subject.

Implements TimeConstraint.

Definition at line 8207 of file timeconstraint.cpp.

{
       Q_UNUSED(s);

       return false;
}

Returns true if this constraint is related to this teacher.

Implements TimeConstraint.

Definition at line 8200 of file timeconstraint.cpp.

{
       Q_UNUSED(t);

       return false;
}

Implements TimeConstraint.

Definition at line 8241 of file timeconstraint.cpp.

Here is the call graph for this function:


Member Data Documentation

bool TimeConstraint::active [inherited]

Definition at line 146 of file timeconstraint.h.

Definition at line 1822 of file timeconstraint.h.

Definition at line 1818 of file timeconstraint.h.

Definition at line 1835 of file timeconstraint.h.

QString TimeConstraint::comments [inherited]

Definition at line 148 of file timeconstraint.h.

The number of subgroups.

The subgroups

Definition at line 1833 of file timeconstraint.h.

Definition at line 1811 of file timeconstraint.h.

The students set name.

Definition at line 1816 of file timeconstraint.h.

int TimeConstraint::type [inherited]

Specifies the type of this constraint (using the above constants).

Definition at line 153 of file timeconstraint.h.

The percentage weight of this constraint, 100% compulsory, 0% non-compulsory.

Definition at line 144 of file timeconstraint.h.


The documentation for this class was generated from the following files: