checkperiodfunc.cpp 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  1. #include "checkperiodfunc.h"
  2. #include "spdlog/spdlog.h"
  3. /**
  4. * @brief 周查重函数
  5. *
  6. * @param planList 需要查重的列表
  7. * @param plan 目标计划
  8. * @param isExcludeSelf 是否排除自身
  9. * @return true
  10. * @return false
  11. */
  12. bool isWeekPlanDuplicate(const QList<OnePlan_t>& planList, const OnePlan_t& plan)
  13. {
  14. bool isConflict = false;
  15. for(const auto& it : planList)
  16. {
  17. /* info结束时间小于开始时间,或者info开始时间大于结束时间,就不冲突 */
  18. bool isLess = weekTimeIsGerater(it.weekType, it.timeStart, plan.weekType, plan.timeEnd);
  19. bool isGreater = weekTimeIsGerater(plan.weekType, plan.timeStart, it.weekType, it.timeEnd);
  20. if(isLess || isGreater)
  21. {
  22. /* 时间不冲突 */
  23. continue;
  24. }
  25. isConflict = true; /* 时间冲突 */
  26. break;
  27. }
  28. return isConflict;
  29. }
  30. /* 查重函数重载,排除一个计划 */
  31. bool isWeekPlanDuplicate(const QList<OnePlan_t>& planList, const OnePlan_t& plan, const OnePlan_t& excludePlan)
  32. {
  33. QList<OnePlan_t> list = planList;
  34. /* 排除自身 */
  35. for(int i = 0; i < list.size(); ++i)
  36. {
  37. // SPDLOG_DEBUG("{}, {}-{} 与 {}, {}-{}",
  38. // static_cast<int>(list[i].weekType), list[i].timeStart.toString("hh:mm:ss").toStdString(), list[i].timeEnd.toString("hh:mm:ss").toStdString(),
  39. // static_cast<int>(excludePlan.weekType), excludePlan.timeStart.toString("hh:mm:ss").toStdString(), excludePlan.timeEnd.toString("hh:mm:ss").toStdString());
  40. if(list[i].weekType == excludePlan.weekType &&
  41. list[i].timeStart == excludePlan.timeStart && list[i].timeEnd == excludePlan.timeEnd)
  42. {
  43. list.removeAt(i);
  44. break;
  45. }
  46. }
  47. return isWeekPlanDuplicate(list, plan);
  48. }
  49. /**
  50. * @brief 日期查重函数
  51. *
  52. * @param planList
  53. * @param plan
  54. * @param isExcludeSelf
  55. * @return true
  56. * @return false
  57. */
  58. bool isDatePlanDuplicate(const QList<OnePlan_t>& planList, const OnePlan_t& plan)
  59. {
  60. bool isConflict = false;
  61. for(const auto& it : planList)
  62. {
  63. /* info结束时间小于开始时间,或者info开始时间大于结束时间,就不冲突 */
  64. bool isLess = dateTimeIsGerater(it.date, it.timeStart, plan.date, plan.timeEnd);
  65. bool isGreater = dateTimeIsGerater(plan.date, plan.timeStart, it.date, it.timeEnd);
  66. if(isLess || isGreater)
  67. {
  68. /* 时间不冲突 */
  69. continue;
  70. }
  71. isConflict = true; /* 时间冲突 */
  72. break;
  73. }
  74. return isConflict;
  75. }
  76. /* 日期查重,重载版,排除一个日期计划 */
  77. bool isDatePlanDuplicate(const QList<OnePlan_t>& planList, const OnePlan_t& plan, const OnePlan_t& excludePlan)
  78. {
  79. QList<OnePlan_t> list = planList;
  80. /* 排除自身 */
  81. for(int i = 0; i < list.size(); ++i)
  82. {
  83. if(list[i].date == excludePlan.date &&
  84. list[i].timeStart == excludePlan.timeStart && list[i].timeEnd == excludePlan.timeEnd)
  85. {
  86. list.removeAt(i);
  87. break;
  88. }
  89. }
  90. return isDatePlanDuplicate(list, plan);
  91. }
  92. /* 周时间1大于周时间2 */
  93. bool weekTimeIsGerater(const eWeekType& week1, const QTime& time1,
  94. const eWeekType& week2, const QTime& time2)
  95. {
  96. /* 先比较日期 */
  97. if(week1 > week2)
  98. {
  99. return true;
  100. }
  101. else if(week1 == week2)
  102. {
  103. /* 日期相同,比较时间 */
  104. if(time1 > time2)
  105. {
  106. return true;
  107. }else
  108. {
  109. return false;
  110. }
  111. }
  112. return false;
  113. }
  114. /* 日期1大于日期2 */
  115. bool dateTimeIsGerater(const QDate& date1, const QTime& time1,
  116. const QDate& date2, const QTime& time2)
  117. {
  118. /* 先比较日期 */
  119. if(date1 > date2)
  120. {
  121. return true;
  122. }
  123. else if(date1 == date2)
  124. {
  125. /* 日期相同,比较时间 */
  126. if(time1 > time2)
  127. {
  128. return true;
  129. }else
  130. {
  131. return false;
  132. }
  133. }
  134. return false;
  135. }