Searched refs:activitiesIndicesLists (Results 1 – 3 of 3) sorted by relevance
8872 for(int i=0; i<catno->activitiesIndicesLists.count(); i++){ in computeActivitiesNotOverlapping()8873 const QList<int>& l1=catno->activitiesIndicesLists.at(i); in computeActivitiesNotOverlapping()8874 for(int j=0; j<catno->activitiesIndicesLists.count(); j++){ in computeActivitiesNotOverlapping()8876 const QList<int>& l2=catno->activitiesIndicesLists.at(j); in computeActivitiesNotOverlapping()12558 for(int i=0; i<catno->activitiesIndicesLists.count(); i++){ in computeActivitiesConflictingPercentage()12559 const QList<int>& l1=catno->activitiesIndicesLists.at(i); in computeActivitiesConflictingPercentage()12560 for(int j=0; j<catno->activitiesIndicesLists.count(); j++){ in computeActivitiesConflictingPercentage()12562 const QList<int>& l2=catno->activitiesIndicesLists.at(j); in computeActivitiesConflictingPercentage()
2656 activitiesIndicesLists.clear(); in computeInternalStructure()2661 activitiesIndicesLists.append(QList<int>()); in computeInternalStructure()2669 activitiesIndicesLists[i].append(ai); in computeInternalStructure()2673 assert(activitiesIndicesLists.count()==activityTagsIndices.count()); in computeInternalStructure()2676 if(activitiesIndicesLists.at(i).count()<1){ in computeInternalStructure()2771 for(int k1=1; k1<activitiesIndicesLists.count(); k1++){ in fitness()2772 const QList<int>& l1=activitiesIndicesLists.at(k1); in fitness()2774 const QList<int>& l2=activitiesIndicesLists.at(k2); in fitness()
692 QList<QList<int>> activitiesIndicesLists; variable