Commit 1bfd8439 authored by yanzg's avatar yanzg

修改公式和计算帮助类

parent 08a6baf7
...@@ -30,9 +30,12 @@ public class YzgMqProcedure implements InitializingBean { ...@@ -30,9 +30,12 @@ public class YzgMqProcedure implements InitializingBean {
* 默认100天延迟 * 默认100天延迟
*/ */
public static final TimeUnit[] YZG_MQ_SYSTEM_QUEUE_PLAN_TIME = new TimeUnit[]{ public static final TimeUnit[] YZG_MQ_SYSTEM_QUEUE_PLAN_TIME = new TimeUnit[]{
new TimeUnit("Second", 1000 * 8), new TimeUnit("Second", 1000),
new TimeUnit("Second:8", 1000 * 8),
new TimeUnit("Minute", 1000 * 60), new TimeUnit("Minute", 1000 * 60),
new TimeUnit("Hour", 1000 * 60 * 60) new TimeUnit("Minute:8", 1000 * 60 * 8),
new TimeUnit("Hour", 1000 * 60 * 60),
new TimeUnit("Hour:8", 1000 * 60 * 60 * 8)
}; };
/** /**
* 执行的消息队列 * 执行的消息队列
...@@ -80,14 +83,14 @@ public class YzgMqProcedure implements InitializingBean { ...@@ -80,14 +83,14 @@ public class YzgMqProcedure implements InitializingBean {
* @return * @return
*/ */
private TimeUnit getTimeUnit(long waitTime) { private TimeUnit getTimeUnit(long waitTime) {
TimeUnit timeUnit = YZG_MQ_SYSTEM_QUEUE_PLAN_TIME[0]; for (TimeUnit timeUnit : YZG_MQ_SYSTEM_QUEUE_PLAN_TIME) {
for (int i = YZG_MQ_SYSTEM_QUEUE_PLAN_TIME.length - 1; i >= 0; i--) { // 在时间范围内,则返回大于等待时间的队列
timeUnit = YZG_MQ_SYSTEM_QUEUE_PLAN_TIME[i]; if (timeUnit.unit >= waitTime) {
if (waitTime >= timeUnit.unit) { return timeUnit;
break;
} }
} }
return timeUnit; // 返回最大时间的队列
return YZG_MQ_SYSTEM_QUEUE_PLAN_TIME[YZG_MQ_SYSTEM_QUEUE_PLAN_TIME.length - 1];
} }
/** /**
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment