ItemData.cpp 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250
  1. #include "ItemData/ItemData.h"
  2. #include "LHQLogAPI.h"
  3. ItemData::ItemData()
  4. {
  5. /* 创建8个List */
  6. for(int i = 0; i < 8; ++i)
  7. {
  8. QList<OneItem*>* list = new QList<OneItem*>;
  9. m_mapItem.insert(i, list);
  10. }
  11. }
  12. ItemData::~ItemData()
  13. {
  14. // for(auto it = m_mapItem.begin(); it != m_mapItem.end(); ++it)
  15. // {
  16. // for(auto it1 = it.value()->begin(); it1 != it.value()->end(); ++it1)
  17. // {
  18. // delete *it1;
  19. // }
  20. // it.value()->clear();
  21. // delete it.value();
  22. // }
  23. // m_mapItem.clear();
  24. }
  25. /* 添加一项计划 */
  26. void ItemData::addOneItem(int week, OneItem* item)
  27. {
  28. if(m_mapItem.find(week) == m_mapItem.end())
  29. {
  30. return;
  31. }
  32. m_mapItem[week]->append(item);
  33. }
  34. /* 删除一项计划 */
  35. void ItemData::deleteOneItem(int week, int num)
  36. {
  37. if(m_mapItem.find(week) == m_mapItem.end())
  38. {
  39. return;
  40. }
  41. auto list = m_mapItem[week];
  42. for(auto& it : *list)
  43. {
  44. if(it->getNum() == num)
  45. {
  46. auto tmpPtr = it;
  47. list->removeOne(it);
  48. delete tmpPtr;
  49. break;
  50. }
  51. }
  52. }
  53. /* 清空一天的计划 */
  54. void ItemData::clearOneDay(int week)
  55. {
  56. if(m_mapItem.find(week) == m_mapItem.end())
  57. {
  58. return;
  59. }
  60. auto list = m_mapItem[week];
  61. for(auto it = list->begin(); it != list->end(); ++it)
  62. {
  63. delete *it;
  64. }
  65. list->clear();
  66. }
  67. /* 清空所有的计划数据 */
  68. void ItemData::clearAllItem()
  69. {
  70. for(auto it = m_mapItem.begin(); it != m_mapItem.end(); ++it)
  71. {
  72. for(auto it1 = it.value()->begin(); it1 != it.value()->end(); ++it1)
  73. {
  74. delete *it1;
  75. }
  76. it.value()->clear();
  77. }
  78. }
  79. /* 查找有没有这个项 */
  80. bool ItemData::findItem(OneItem* item)
  81. {
  82. for(auto it = m_mapItem.begin(); it != m_mapItem.end(); ++it)
  83. {
  84. QList<OneItem*>* list = it.value();
  85. for(const auto& item1 : *list)
  86. {
  87. if(item1 == item)
  88. {
  89. return true;
  90. }
  91. }
  92. }
  93. return false;
  94. }
  95. /* 查找有没有这个项 */
  96. bool ItemData::findItem(int week, OneItem* item)
  97. {
  98. if(m_mapItem.find(week) == m_mapItem.end())
  99. {
  100. return false;
  101. }
  102. QList<OneItem*>* list = m_mapItem[week];
  103. for(const auto& it : *list)
  104. {
  105. if(it == item)
  106. {
  107. return true;
  108. }
  109. }
  110. return false;
  111. }
  112. /* 获取一天的容器 */
  113. QList<OneItem*>* ItemData::getOneDay(int week)
  114. {
  115. if(m_mapItem.find(week) == m_mapItem.end())
  116. {
  117. return nullptr;
  118. }
  119. return m_mapItem[week];
  120. }
  121. /* 新增判断是否有重复 */
  122. bool ItemData::judgeTimeRepetitionWithAdd(int weekDay, const QString& devName, const QTime& time)
  123. {
  124. /* 先查找周几对应的列表 */
  125. if(m_mapItem.find(weekDay) == m_mapItem.end())
  126. {
  127. return false;
  128. }
  129. auto list = m_mapItem[weekDay];
  130. for(const auto& it : *list)
  131. {
  132. if(it->getDevName() == devName)
  133. {
  134. if(it->getExecTime() == time)
  135. {
  136. return true;
  137. }
  138. }
  139. }
  140. /* 所有设备都判断完了,没有相同的 */
  141. return false;
  142. }
  143. bool ItemData::judgeDateTimeRepetitionWithAdd(int weekDay, const QString& devName, const QDate& date, const QTime& time)
  144. {
  145. /* 先查找周几对应的列表 */
  146. if(m_mapItem.find(weekDay) == m_mapItem.end())
  147. {
  148. return false;
  149. }
  150. auto list = m_mapItem[weekDay];
  151. for(const auto& it : *list)
  152. {
  153. if(it->getDevName() == devName)
  154. {
  155. if(it->getDate() == date)
  156. {
  157. if(it->getExecTime() == time)
  158. {
  159. return true;
  160. }
  161. }
  162. }
  163. }
  164. /* 所有设备都判断完了,没有相同的 */
  165. return false;
  166. }
  167. /* 判断已有的项修改时间后和其他项是否重复 */
  168. bool ItemData::judgeTimeRepetitionWithEdit(int weekDay, OneItem* item, const QTime& newTime)
  169. {
  170. if(m_mapItem.find(weekDay) == m_mapItem.end())
  171. {
  172. return false;
  173. }
  174. auto list = m_mapItem[weekDay];
  175. for(const auto& it : *list)
  176. {
  177. /* 先判断名称是否相等 */
  178. if(it->getDevName() == item->getDevName())
  179. {
  180. /* 判断是否是同一个项 */
  181. if(it->getUUID() == item->getUUID())
  182. {
  183. continue;
  184. }
  185. /* 判断时间是否相同 */
  186. if(it->getExecTime() == newTime)
  187. {
  188. return true;
  189. }
  190. }
  191. }
  192. /* 所有设备都判断完了 */
  193. return false;
  194. }
  195. /* 判断特殊日的已有项修改时间后和其他项是否重复 */
  196. bool ItemData::judgeDateTimeRepetitionWithEdit(int weekDay, OneItem* item, const QDate& newDate, const QTime& newTime)
  197. {
  198. if(m_mapItem.find(weekDay) == m_mapItem.end())
  199. {
  200. return false;
  201. }
  202. auto list = m_mapItem[weekDay];
  203. for(const auto& it : *list)
  204. {
  205. /* 先判断名称是否相等 */
  206. if(it->getDevName() == item->getDevName())
  207. {
  208. /* 判断是否是同一个项 */
  209. if(it->getUUID() == item->getUUID())
  210. {
  211. continue;
  212. }
  213. /* 判断日期是否相等 */
  214. if(it->getDate() == newDate)
  215. {
  216. /* 判断时间是否相同 */
  217. if(it->getExecTime() == newTime)
  218. {
  219. return true;
  220. }
  221. }
  222. }
  223. }
  224. /* 所有设备都判断完了 */
  225. return false;
  226. }