首页 > 其他分享 >auo cpc

auo cpc

时间:2022-11-11 20:13:26浏览次数:41  
标签:11 13 09 cpc 12.922 Robot auo 2022

import re


def read_log(filePath):
    log = {}
    timeList = []
    contentList = []
    lastTime = None
    timeReg = r'((([0-9]{3}[1-9]|[0-9]{2}[1-9][0-9]{1}|[0-9]{1}[1-9][0-9]{2}|[1-9][0-9]{3})\/(((0[13578]|1[02])\/(0[1-9]|[12][0-9]|3[01]))|((0[469]|11)\/(0[1-9]|[12][0-9]|30))|(02-(0[1-9]|[1][0-9]|2[0-8]))))|((([0-9]{2})(0[48]|[2468][048]|[13579][26])|((0[48]|[2468][048]|[3579][26])00))-02-29))\s+([0-1]?[0-9]|2[0-3]):([0-5][0-9]):([0-5][0-9])'
    pattern = re.compile(timeReg)
    with open(filePath, 'r', encoding='utf-8') as f:
        lines = f.readlines()
        for line in lines:
            contentList.append(line)
            res = re.search(pattern, line)
            if res:
                currentTime = res.group()
                if lastTime is None:
                    lastTime = currentTime
                if lastTime != currentTime and lastTime is not None:
                    contentList.pop()
                    log[lastTime] = contentList
                    contentList.clear()
                    contentList.append(line)
                    lastTime = currentTime
    print('-------------')
    print(log)


if __name__ == '__main__':
    filePath = 'G:\EMA_v2\TerminalMessage\TerminalMessage.log-20221109-1.log'
    read_log(filePath)
    # res = {
    #     '2022/11/09 04:01:56':
    #         [
    #             "2022/11/09 13:17:12.922  The Command Completed Didn't Respond Within[180]Seconds.(13:15~13:12)\n",
    #             '请工程值班处理,Robot在[180]秒内,未及时回复动作结果给CPC,检查Robot状况\n',
    #             '若发生莫停,需手动切换CPC的Auto/Manual Mode [Repeat 5]\n',
    #             '2022/11/09 13:17:12.922  Robot Action1 Command Result Is NG\n',
    #             '2022/11/09 13:17:12.922  ANMOR100 Robot做动失败,确认Robot状况后做原点复归\n'],
    #     '2022/11/09 13:15:12':
    #         [
    #             "2022/11/09 13:17:12.922  The Command Completed Didn't Respond Within[180]Seconds.(13:15~13:12)\n",
    #             '请工程值班处理,Robot在[180]秒内,未及时回复动作结果给CPC,检查Robot状况\n',
    #             '若发生莫停,需手动切换CPC的Auto/Manual Mode [Repeat 5]\n',
    #             '2022/11/09 13:17:12.922  Robot Action1 Command Result Is NG\n',
    #             '2022/11/09 13:17:12.922  ANMOR100 Robot做动失败,确认Robot状况后做原点复归\n']
    # }


2022/11/09 04:01:56.533  [S2F21] Port [1] 被Host退卡 : Host Cancel : AUOpVerify NG[TE36408]:Equipment doe not match with equipment capability.
2022/11/09 13:15:12.266  The Command Completed Didn't Respond Within[180]Seconds.(13:15~13:12)
2022/11/09 13:15:12.266  请工程值班处理,Robot在[180]秒内,未及时回复动作结果给CPC,检查Robot状况
2022/11/09 13:15:12.266  若发生莫停,需手动切换CPC的Auto/Manual Mode
2022/11/09 13:17:12.922  The Command Completed Didn't Respond Within[180]Seconds.(13:15~13:12)
请工程值班处理,Robot在[180]秒内,未及时回复动作结果给CPC,检查Robot状况
若发生莫停,需手动切换CPC的Auto/Manual Mode [Repeat 5]
2022/11/09 13:17:12.922  Robot Action1 Command Result Is NG
2022/11/09 13:17:12.922  ANMOR100 Robot做动失败,确认Robot状况后做原点复归

标签:11,13,09,cpc,12.922,Robot,auo,2022
From: https://www.cnblogs.com/zhuoss/p/16881608.html

相关文章

  • 2022CCPC威海 D. Sternhalma(记忆化搜索/状压)
    题意大概是给定一个19个格子的六边形棋盘,每个位置有一个分数,每次操作可以拿走一个棋子(不得分)或者将当前棋子跳过相邻的一个棋子(得分为跳过的棋子所在位置的分数)且将跳过的......
  • 2022CCPC威海J. Eat, Sleep, Repeat(博弈/思维)
    题目大意是给定长度为n的数组a,两个人轮流从中选一个正数将其减1。且有k个限制形如\(limit_{x_i}=y_i\),即\(x_i\)在数组中最多出现\(y_i\)次。判负的情况为:数组全为0......
  • 2022 icpc 沈阳站 记录(非题解)
    赛前大概是赛前三周才突然知道拥有了比赛机会。赛前训练和vp频率很高,有一段时间cf上都是绿的。比赛的那一周只有一天没在vp,到了周六热身赛我人都有点麻木。(可能正赛也是......
  • The 2022 ICPC Asia Regionals Online Contest (II)
    一直没补,把之前的粘贴过来EAnInterestingSequence 为使数组和小,并且gcd=1,我们添加2,3,,找到第一个不整除k的质数,然后后面放2,3,判断先放2还是3JAGameaboutIncrea......
  • The 2020 ICPC Asia Shenyang Regional Programming Contest
    VP题目列表D.JourneytoUn'GoroF.KoboldsandCatacombsG.TheWitchwoodH.TheBoomsdayProjectI.RiseofShadowsJ.DescentofDragonsK.S......
  • 2022ICPC区域赛参后感悟
    第一次参加正式的大类赛事,在某种程度上挺激动的。我呢,可以说是刚步入竞赛一年,在此期间遇见了一些志同道合的朋友,最重要的是遇见了我的队友。开始前,我幻想过我们小队可以超......
  • 第 45 届国际大学生程序设计竞赛(ICPC)亚洲区域赛(昆明)
    比赛链接:https://ac.nowcoder.com/acm/contest/12548/H.HardCalculation思路:输出\(x\)+2020。代码:#include<bits/stdc++.h>usingnamespacestd;usingLL=l......
  • 45th ICPC昆明 C.Cities(区间dp)
    题目链接Description有n个点,每个点有自己的颜色(并且每种颜色出现次数不超过15次),每次操作可以把一段连续且颜色相同的点染成任意一种颜色,求把所有点染成相同颜色的最小操......
  • CCPC2022威海补题
    K看完题之后思路是很自然的:对于每个要求,就转化成对于l和r的限制。原本被题目解释干扰了,纠结了一下区间长度的限制觉得很复杂;后来发现只要l和r合法,区间长度就合法,所以对于1......
  • CCPC 2022 Weihai
    下饭场。中间有几个题因为很sb的原因卡了很久,罚时炸了,而且最后F调了40min没调出来,差两名Au。ADunai记参赛选手中有\(k\)个曾经夺得冠军,5个位置上的选手分别有......