// rdschedruleslist.cpp // // A class for handling the scheduling rules for rdlogmanager/edit clocks // // (C) Copyright 2005 Stefan Gabriel // (C) Copyright 2019 Fred Gleason // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License version 2 as // published by the Free Software Foundation. // // This program 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 General Public License for more details. // // You should have received a copy of the GNU General Public // License along with this program; if not, write to the Free Software // Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. // #include #include "rdclock.h" #include "rddb.h" #include "rdescape_string.h" #include "rdschedruleslist.h" RDSchedRulesList::RDSchedRulesList(QString clockname,RDConfig *config) { QString sql; RDSqlQuery *q; RDSqlQuery *q1; sql=QString().sprintf("select CODE,DESCRIPTION from SCHED_CODES order by `CODE` asc"); q=new RDSqlQuery(sql); itemcounter=q->size(); sched_code = new QString[itemcounter]; max_row = new int[itemcounter]; min_wait = new int[itemcounter]; not_after = new QString[itemcounter]; or_after = new QString[itemcounter]; or_after_II = new QString[itemcounter]; description = new QString[itemcounter]; for (int i=0; inext(); sched_code[i] = q->value(0).toString(); description[i] = q->value(1).toString(); sql=QString("select ")+ "MAX_ROW,"+ // 00 "MIN_WAIT,"+ // 01 "NOT_AFTER,"+ // 02 "OR_AFTER,"+ // 03 "OR_AFTER_II "+ // 04 "from RULE_LINES where "+ "CLOCK_NAME=\""+RDEscapeString(clockname)+"\" && "+ "CODE=\""+RDEscapeString(sched_code[i])+"\""; q1=new RDSqlQuery(sql); if(q1->first()) { max_row[i] = q1->value(0).toInt(); min_wait[i] = q1->value(1).toInt(); not_after[i] = q1->value(2).toString(); or_after[i] = q1->value(3).toString(); or_after_II[i] = q1->value(4).toString(); } else { max_row[i] = 1; min_wait[i] = 0; not_after[i] = ""; or_after[i] = ""; or_after_II[i] = ""; } delete q1; } delete q; } RDSchedRulesList::~RDSchedRulesList() { delete []sched_code; delete []max_row; delete []min_wait; delete []not_after; delete []or_after; delete []or_after_II; delete []description; } void RDSchedRulesList::insertItem(int pos,int maxrow,int minwait,QString notafter,QString orafter,QString orafterii) { max_row[pos] = maxrow; min_wait[pos] = minwait; not_after[pos] = notafter; or_after[pos] = orafter; or_after_II[pos] = orafterii; } QString RDSchedRulesList::getItemSchedCode(int pos) { return sched_code[pos]; } int RDSchedRulesList::getItemMaxRow(int pos) { return max_row[pos]; } int RDSchedRulesList::getItemMinWait(int pos) { return min_wait[pos]; } QString RDSchedRulesList::getItemNotAfter(int pos) { return not_after[pos]; } QString RDSchedRulesList::getItemOrAfter(int pos) { return or_after[pos]; } QString RDSchedRulesList::getItemOrAfterII(int pos) { return or_after_II[pos]; } QString RDSchedRulesList::getItemDescription(int pos) { return description[pos]; } int RDSchedRulesList::getNumberOfItems(void) { return itemcounter; } void RDSchedRulesList::Save(QString clockname) { QString sql; sql=QString("delete from RULE_LINES where ")+ "CLOCK_NAME=\""+RDEscapeString(clockname)+"\""; RDSqlQuery::apply(sql); for (int i=0;i