| | |
| | | }}; |
| | | |
| | | public static final List<Integer> MERGE_STA_NO_TWO = new ArrayList<Integer>() {{ |
| | | add(116);add(117); |
| | | add(113);add(123);add(114);add(1142); |
| | | }}; |
| | | |
| | | public static final List<Integer> MERGE_STA_NO_THREE = new ArrayList<Integer>() {{ |
| | | add(116);add(117); |
| | | add(107);add(118);add(108);add(119); |
| | | }}; |
| | | |
| | | public static final List<Integer> MERGE_STA_NO_FOUR = new ArrayList<Integer>() {{ |
| | | add(116);add(117); |
| | | add(110);add(120);add(111);add(121); |
| | | }}; |
| | | |
| | | public static final List<Integer> MERGE_STA_NO_FIVE = new ArrayList<Integer>() {{ |
| | | add(113);add(123);add(114);add(1142); |
| | | }}; |
| | | |
| | | // 正序 |
| | |
| | | }}; |
| | | // 反序 |
| | | public static final List<Integer> TRACK_POSITION_REVERSE_SEQUENCE = new ArrayList<Integer>() {{ |
| | | add(117);add(116);add(1142);add(114);add(113);add(123);add(121);add(111);add(120);add(110);add(119);add(108);add(107);add(118);add(105);add(104);add(122);add(102);add(101); |
| | | add(117);add(116);add(1142);add(114);add(123);add(113);add(121);add(111);add(120);add(110);add(119);add(108);add(118);add(107);add(105);add(122);add(104);add(102);add(101); |
| | | }}; |
| | | |
| | | public static String zerofill(String msg, Integer count){ |
| | |
| | | * 获取最远站点 |
| | | * */ |
| | | public static Integer RouteIndexFarMas(Integer a,Integer b,Integer c,Integer d){ |
| | | int ia = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(a); |
| | | int ib = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(b); |
| | | int ic = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(c); |
| | | int id = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(d); |
| | | if (id==0){ |
| | | if (ia>ib){ |
| | | if (ia>ic){ |
| | | return a; |
| | | }else { |
| | | return c; |
| | | } |
| | | }else { |
| | | if (ib>ic){ |
| | | return b; |
| | | }else { |
| | | return c; |
| | | } |
| | | } |
| | | }else { |
| | | if (ia<ib){ |
| | | if (ia<ic){ |
| | | return a; |
| | | }else { |
| | | return c; |
| | | } |
| | | }else { |
| | | if (ib<ic){ |
| | | return b; |
| | | }else { |
| | | return c; |
| | | } |
| | | } |
| | | } |
| | | } |
| | | |
| | | /* |
| | | * 获取最远站点 |
| | | * a:当前位置 |
| | | * b:开始位置 |
| | | * c:结束位置 |
| | | * d:锁开始位置 |
| | | * */ |
| | | public static Integer RouteIndexFarMasNew(Integer a,Integer b,Integer c,Integer d){ |
| | | int ia = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(a); |
| | | int ib = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(b); |
| | | int ic = TRACK_POSITION_POSITIVE_SEQUENCE.indexOf(c); |
| | |
| | | case 28: |
| | | return 116; |
| | | default: |
| | | return 0; |
| | | return 1142; |
| | | } |
| | | } |
| | | |
| | | public static short RgvPosStaTwo(Short posId){ |
| | | switch (posId.intValue()){ |
| | | case 1: |
| | | case 2: |
| | | return 116; |
| | | case 2: |
| | | return 1142; |
| | | case 3: |
| | | case 4: |
| | | return 114; |
| | |
| | | case 28: |
| | | return 104; |
| | | default: |
| | | return 0; |
| | | return 104; |
| | | } |
| | | } |
| | | |