更新数据处理

CZT

2023-12-15 cb33d686a5e7893a01d7b96a38cc746bf7736720

 src/main/java/com/fzzy/async/fzzy40/impl/Fzzy40Sync1302.java

@@ -104,10 +104,10 @@
                api1302.setLszdw(fz40Grain.getTempMin() == null ? 0.00 : fz40Grain.getTempMin());

                //判断粮食最低温、平均温、最高温是否符合逻辑
                if(api1302.getLszdw() >= api1302.getLspjw()){
                if (api1302.getLszdw() >= api1302.getLspjw()) {
                    continue;
                }
                if(api1302.getLspjw() >= api1302.getLszgw()){
                if (api1302.getLspjw() >= api1302.getLszgw()) {
                    continue;
                }

@@ -115,12 +115,24 @@
                if (StringUtils.isEmpty(fz40Grain.getCableCir())) {
                    api1302.setLswdzjh(getTempPointList1(fz40Grain.getPoints(), fz40Grain.getCable()));
                    api1302.setLssdzjh(getHumPointList1(fz40Grain.getPoints(), fz40Grain.getCable()));
                    if(StringUtils.isEmpty(api1302.getLswdzjh())){
                        continue;
                    }
                    if(StringUtils.isEmpty(api1302.getLssdzjh())){
                        continue;
                    }
                } else {
                    api1302.setLswdzjh(getTempPointList2(fz40Grain.getPoints(), fz40Grain.getCable(), fz40Grain.getCableCir()));
                    api1302.setLssdzjh(getHumPointList2(fz40Grain.getPoints(), fz40Grain.getCable(), fz40Grain.getCableCir()));
                    if(StringUtils.isEmpty(api1302.getLswdzjh())){
                        continue;
                    }
                    if(StringUtils.isEmpty(api1302.getLssdzjh())){
                        continue;
                    }
                }

                api1302.setZhgxsj(fz40Grain.getReceiveDate());
                api1302.setZhgxsj(new Date());

                api1302.setBizId(fz40Grain.getBatchId());
                api1302.setKqdm(api1105.getKqdm());
@@ -156,6 +168,9 @@

        String[] points = point.split(",");
        String result = "";
        if (c * h * l > points.length) {
            return result;
        }
        for (int i = 1; i <= l; i++) {
            for (int j = 1; j <= h; j++) {
                for (int z = 1; z <= c; z++) {