CN113946660B - Automatic Boolean variable checking method and system for offline data of train control center - Google Patents
Automatic Boolean variable checking method and system for offline data of train control center Download PDFInfo
- Publication number
- CN113946660B CN113946660B CN202111565603.2A CN202111565603A CN113946660B CN 113946660 B CN113946660 B CN 113946660B CN 202111565603 A CN202111565603 A CN 202111565603A CN 113946660 B CN113946660 B CN 113946660B
- Authority
- CN
- China
- Prior art keywords
- boolean variable
- boolean
- check
- file
- checked
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
- G06F16/3341—Query execution using boolean model
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
- G06F40/126—Character encoding
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- General Health & Medical Sciences (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a Boolean variable automatic checking method and a Boolean variable automatic checking system for offline data of a train control center, wherein the method comprises the following steps: defining an off-line data Boolean variable Chinese and English name comparison list; inputting a Boolean variable type to be checked according to a first input instruction; generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file; when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file; generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file; and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results. The technical problems that in the prior art, the manual checking process is complex, errors are prone to occurring, and checking efficiency is low are solved.
Description
Technical Field
The invention relates to the field of test schemes, in particular to a Boolean variable automatic checking method and system for off-line data of a train control center.
Background
The purpose of the Boolean variable check of the offline data of the train control center is to verify that the offline data file generated by the offline data generation tool and the Boolean file generated by the Boolean data generation tool have consistency, and the conventional test technology needs manual intervention in the whole process.
However, in the process of implementing the technical solution of the invention in the embodiment of the present application, it is found that the above-mentioned technology has at least the following technical problems:
the manual checking process in the prior art is complex, errors are easy to occur, and the checking efficiency is low.
Disclosure of Invention
The embodiment of the application provides a method and a system for automatically checking the Boolean variable of offline data of a train control center, solves the technical problems that in the prior art, the manual checking process is complicated, errors are easy to occur, and the checking efficiency is low, achieves the purpose of replacing manual checking by automatic checking of the Boolean variable, reduces the labor cost, avoids repeated operation in the manual checking process, reduces calculation errors caused by manual in the manual checking process, and further improves the technical effect of the checking efficiency.
In view of the above, the present invention has been developed to provide a method that overcomes, or at least partially solves, the above-mentioned problems.
In a first aspect, an embodiment of the present application provides an automatic boolean variable checking method for offline data of a train control center, where the method includes: defining an off-line data Boolean variable Chinese and English name comparison list; obtaining a first input instruction, and inputting a Boolean variable type to be checked according to the first input instruction; generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file; when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file; generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file; and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results.
On the other hand, the application also provides an automatic boolean variable checking system for offline data of a train control center, which comprises: the first definition unit is used for defining an off-line data Boolean variable Chinese and English name comparison list; the first input unit is used for obtaining a first input instruction and inputting the type of the Boolean variable to be checked according to the first input instruction; the first generating unit is used for generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file; the second generating unit is used for generating a first Boolean variable checking table according to the Boolean variable table to be checked and the first Boolean file when the Boolean variable table to be checked is not empty; a third generating unit configured to generate a second boolean variable check table based on the first boolean variable check table and a second boolean file; and the fourth generating unit is used for generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results.
In a third aspect, an embodiment of the present invention provides an electronic device, including a bus, a transceiver, a memory, a processor, and a computer program stored on the memory and executable on the processor, where the transceiver, the memory, and the processor are connected via the bus, and when the computer program is executed by the processor, the method for controlling output data includes any one of the steps described above.
In a fourth aspect, the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps in the method for controlling output data according to any one of the above.
One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages:
the contrast list of Chinese and English names of Boolean variables of the defined off-line data is adopted; obtaining a first input instruction, and inputting a Boolean variable type to be checked according to the first input instruction; generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file; when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file; generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file; and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises the technical scheme of check results. Therefore, the Boolean variable automatic check replaces manual check, the labor cost is reduced, repeated operation in the manual check process is avoided, calculation errors caused by manual work in the manual check process are reduced, and the check efficiency is improved.
The foregoing description is only an overview of the technical solutions of the present application, and the present application can be implemented according to the content of the description in order to make the technical means of the present application more clearly understood, and the following detailed description of the present application is given in order to make the above and other objects, features, and advantages of the present application more clearly understandable.
Drawings
Fig. 1 is a schematic flowchart of a method for automatically checking boolean variables of offline data of a train control center according to an embodiment of the present application;
fig. 2 is a schematic diagram illustrating positioning of a boolean variable automatic check tool according to an address in an offline data boolean variable automatic check method of a train control center according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an automatic boolean variable checking system for offline data of a train control center according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device for executing a method of controlling output data according to an embodiment of the present application.
Description of reference numerals: a first defining unit 11, a first input unit 12, a first generating unit 13, a second generating unit 14, a third generating unit 15, a fourth generating unit 16, a bus 1110, a processor 1120, a transceiver 1130, a bus interface 1140, a memory 1150, an operating system 1151, an application 1152 and a user interface 1160.
Detailed Description
In the description of the embodiments of the present invention, it should be apparent to those skilled in the art that the embodiments of the present invention can be embodied as methods, apparatuses, electronic devices, and computer-readable storage media. Thus, embodiments of the invention may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), a combination of hardware and software. Furthermore, in some embodiments, embodiments of the invention may also be embodied in the form of a computer program product in one or more computer-readable storage media having computer program code embodied in the medium.
The computer-readable storage media described above may take any combination of one or more computer-readable storage media. The computer-readable storage medium includes: an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of the computer-readable storage medium include: a portable computer diskette, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, a flash memory, an optical fiber, a compact disc read-only memory, an optical storage device, a magnetic storage device, or any combination thereof. In embodiments of the invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, device, or apparatus.
Summary of the application
The method, the device and the electronic equipment are described through the flow chart and/or the block diagram.
It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions. These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing apparatus to function in a particular manner. Thus, the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The embodiments of the present invention will be described below with reference to the drawings.
Example one
As shown in fig. 1, an embodiment of the present application provides an automatic boolean variable checking method for offline data of a train control center, where the method includes:
step S100: defining an off-line data Boolean variable Chinese and English name comparison list;
specifically, the purpose of the boolean variable check of the offline data of the train control center is to verify that the offline data file generated by the offline data generation tool and the boolean file generated by the boolean data generation tool have consistency, and the existing testing technology needs manual intervention in the whole process. Therefore, the application provides an automatic checking method for the Boolean variables of the offline data of the train control center, wherein the naming mode of the Boolean variables in the offline data file is Chinese, the naming mode of the Boolean variables in the Boolean file is English, and in order to establish the Chinese-English corresponding relation of the Boolean variable names, a checking basis is provided for an automatic checking tool for the Boolean variables, and an off-line data Boolean variable Chinese-English name comparison list needs to be manually defined. For example, the offline data boolean variable chinese-english name comparison list is shown in table 1 below, and includes column control center boolean variable chinese names and corresponding english names, so that subsequent checking is more convenient and efficient.
TABLE 1
Step S200: obtaining a first input instruction, and inputting a Boolean variable type to be checked according to the first input instruction;
step S300: generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file;
specifically, a boolean variable type to be checked is input according to the first input instruction, where the boolean variable type to be checked is each boolean variable type in table 1, such as a preceding normal station occupation state, a block partition idle state, a block partition fault occupation state, and the like. The first offline data file is an upper module offline data file LK2Info _ Up _ out.txt and a lower module offline data file LK2Info _ Down _ out.txt generated by an offline data generation tool of the column control center, and the processing of the upper module offline data file LK2Info _ Up _ out.txt and the lower module offline data file LK2Info _ Down _ out.txt in the test process is the same, so that the embodiment of the application only describes the upper module offline data file LK2Info _ Up _ out.txt, and the file describes each Boolean variable and the corresponding storage address. Inputting a boolean variable type to be checked, for example, inputting a boolean variable type "blocked partition occupation state" of this checking, then reading an LK2Info _ Up _ out.txt file, and generating the boolean variable table to be checked, as shown in table 2 below, where the table includes a sequence number, a boolean variable to be checked, and a corresponding storage address.
The table is generated specifically as follows: the Boolean variable automatic check tool searches the key word 'blocked partition occupation state' in the LK2Info _ Up _ out.txt file, and fills the 'blocked partition occupation state' into the 2 nd column of the table and fills the corresponding address into the 3 rd column of the table every time the key word is found.
TABLE 2
Step S400: when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file;
further, before generating the first boolean variable check table, step S400 in this embodiment of the present application further includes:
step S410: judging whether each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file or not;
step S420: and if each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file, generating the first Boolean variable check table.
Specifically, whether the boolean variable table to be checked is empty is judged, and when the boolean variable table to be checked is not empty, the boolean variable table to be checked and a first boolean file are read, wherein the first boolean file is a vpicaa.ads file and is generated by a boolean data generation tool of a column control center, and the vpicaa.ads file describes a conversion code corresponding to each storage address. Before generating the first Boolean variable check table, judging whether each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file, and if each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file, generating the first Boolean variable check table to ensure that each storage address in the Boolean variable table to be checked and the conversion code in the first Boolean file are in one-to-one correspondence. The first boolean variable check table is shown in table 3 below, and includes a serial number, a boolean variable to be checked, a corresponding memory address, and a corresponding transcoding.
The table is generated specifically as follows: and traversing each corresponding address in the Boolean variable table to be checked by the Boolean variable automatic checking tool, and splitting the Boolean variable table to be checked into a form of high n-1 bit and low 1 bit, wherein the high n-1 bit is positioned in the longitudinal direction of the VPICAA.ADS file, and the low 1 bit is positioned in the transverse direction of the VPICAA.ADS file. When determining the conversion code corresponding to the storage address in the vpica.ads file, the final conversion code can be obtained by firstly finding the highest bit of the conversion code according to the storage address, then counting 4 bytes ahead, and then reversing the size ends of the high and low bytes, which is a fixed calculation method. As 0x218480 in table 2, to be split into 218480=218480+0, 218480 in the longitudinal direction and 0 in the transverse direction, its location in the vpica a. ads file is as shown in fig. 2, the location result is A0, then 4 bytes are counted from A0 onward, i.e. a 0315003, then the 4 byte size end is reversed, i.e. 035031A0, and the space is removed, i.e. 035031A0, so the conversion code corresponding to address 0x218480 is 035031A0, which is filled in the 4 th column in table 3.
TABLE 3
Step S500: generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file;
further, before generating the second boolean variable check table, step S500 in the embodiment of the present application further includes:
step S510: judging whether each conversion code in the first Boolean variable check table can find the Boolean variable in the second Boolean file;
step S520: and if each conversion code in the first Boolean variable check table can find the Boolean variable in the second Boolean file, generating the second Boolean variable check table.
Specifically, the first boolean variable check table and a second boolean file are read, where the second boolean file is vpicaa.adsvar and is generated by a boolean data generation tool of the column control center, and the vpicaa.adsvar file describes boolean variables corresponding to each transform code. Before generating the second boolean variable check table, determining whether each transform code in the first boolean variable check table can find a boolean variable in the second boolean file, and if each transform code in the first boolean variable check table can find a boolean variable in the second boolean file, generating the second boolean variable check table to ensure that each transform code in the first boolean variable check table and the boolean variable in the second boolean file are in one-to-one correspondence. The second boolean variable check table is shown in table 4 below, which contains the serial number, the boolean variable to be checked, its corresponding storage address, its corresponding translation code, and the name of the boolean variable found in the vpica.
The table is generated specifically as follows: the boolean automatic check tool traverses each corresponding transform code in the first boolean check table, finds the corresponding boolean variable name in the vpica.adsvar file, such as the corresponding transform code 035031a0 in table 3, finds the corresponding boolean variable name HTX1LQG-ZCZY in the vpica.adsvar, and fills it in column 5 of table 4.
TABLE 4
Step S600: and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results.
Further, before generating the check result list, step S600 in this embodiment of the present application further includes:
step S610: judging whether each Boolean variable name in the second Boolean variable check table can find the Boolean variable in the off-line data Boolean variable Chinese and English name comparison list or not;
step S620: and if each Boolean variable name in the second Boolean variable check table can find the Boolean variable in the off-line data Boolean variable Chinese and English name comparison list, generating the check result list.
Specifically, the second boolean variable check table and the offline data boolean variable chinese and english name comparison list are read, and before the check result list is generated, it is determined whether each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list. If each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list, the check result list is generated, as shown in table 5 below, which contains a sequence number, a boolean variable to be checked, its corresponding storage address, its corresponding translation code, its boolean variable name found in the vpica.
For example, the table is generated specifically as follows: the boolean variable automatic check tool processes the second boolean variable check table, i.e. the 1 st row of data of table 4, first: taking out a Boolean variable to be checked in offline data, namely a 'blocked partition occupation state', reading a Chinese and English name comparison list of the Boolean variable of the offline data, searching an English name corresponding to the 'blocked partition occupation state', namely 'ZCZY', then taking out the name of VPICAA.ADSVAR Boolean variable in the 1 st row of the table 4, namely 'HTX 1 LQG-ZCZY', checking whether the 'HTX 1 LQG-ZCZY' contains a keyword 'ZCZY', if so, filling a Pass in the 6 th row of the table 5, if not, filling a Fail, then traversing each row of data of the second Boolean variable check table by a Boolean automatic check tool, and carrying out the same processing to generate a final check result list.
In the above-described embodiment, the required column control center offline data boolean variable automatic check may be implemented by inputting different boolean variable types to the boolean variable automatic check tool. The Boolean variable automatic check replaces manual check, labor cost is reduced, repeated operation in the manual check process is avoided, calculation errors caused by manual operation in the manual check process are reduced, and check efficiency is improved.
TABLE 5
Further, after determining whether each storage address in the to-be-checked boolean variable table can find a transform code in the first boolean file, step S410 in this embodiment of the present application further includes:
step S411: if each storage address in the Boolean variable table to be checked cannot find a conversion code in the first Boolean file, obtaining a conversion code-free storage address;
step S412: and marking the non-conversion coding storage address, and generating the first Boolean variable check table according to the marked Boolean variable table to be checked and the first Boolean file.
Specifically, whether each storage address in the to-be-checked boolean variable table can find a conversion code in the first boolean file is judged, if each storage address in the to-be-checked boolean variable table cannot find a conversion code in the first boolean file, that is, a vpica a.ads file, the storage address without the conversion code is marked, for example, red, and the first boolean variable check table is generated according to the marked to-be-checked boolean variable table and the first boolean file. The storage address without the conversion code is marked in time, the automatic check accuracy is high, the manual check error is avoided, and the check efficiency is improved.
Further, after determining whether each transcoding in the first boolean variable check table can find a boolean variable in the second boolean file, step S510 in this embodiment of the present application further includes:
step S511: if each conversion code in the first Boolean variable check table can not find a Boolean variable in the second Boolean file, obtaining a first invariant conversion code;
step S512: and marking the first invariant conversion code, and generating a second Boolean variable check table according to the marked first Boolean variable check table and the second Boolean file.
Specifically, before generating a second boolean variable check table, it is determined whether each transform code in the first boolean variable check table can find a boolean variable in the second boolean file, if each transform code in the first boolean variable check table cannot find a boolean variable in the second boolean file, that is, in the vpica a. The transformational codes without variables are marked in time, the automatic check accuracy is high, the manual check errors are avoided, and the check efficiency is improved.
Further, after determining whether each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list, step S610 in this embodiment of the present application further includes:
step S611: if the name of each Boolean variable in the second Boolean variable check table cannot find the Boolean variable in the offline data Boolean variable Chinese and English name comparison list, obtaining a second non-variable conversion code;
step S612: and marking the second invariant conversion code, and generating a check result list according to the marked second Boolean variable check list and the off-line data Boolean variable Chinese and English name check list.
Specifically, before the check result list is generated, it is determined whether each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list. And if each Boolean variable name in the second Boolean variable check table cannot find the Boolean variable in the off-line data Boolean variable Chinese and English name comparison list, marking the conversion code, such as marking the conversion code as yellow, and generating the check result list according to the marked second Boolean variable check table and the off-line data Boolean variable Chinese and English name comparison list. The conversion codes without variables are marked in time, the automatic check accuracy is high, the automatic check from reading of the input file, completion of the check process and output of the check result is completed by the Boolean variable automatic check tool, and the more the Boolean variables to be checked are, the more the check efficiency is improved.
To sum up, the method and the system for automatically checking the boolean variables of the offline data of the train control center provided by the embodiment of the present application have the following technical effects:
the contrast list of Chinese and English names of Boolean variables of the defined off-line data is adopted; obtaining a first input instruction, and inputting a Boolean variable type to be checked according to the first input instruction; generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file; when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file; generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file; and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises the technical scheme of check results. Therefore, the Boolean variable automatic check replaces manual check, the labor cost is reduced, repeated operation in the manual check process is avoided, calculation errors caused by manual work in the manual check process are reduced, and the check efficiency is improved.
Example two
Based on the same inventive concept as the boolean variable automatic check method for the offline data of the train control center in the foregoing embodiment, the present invention further provides an automatic check system for the boolean variable of the offline data of the train control center, as shown in fig. 3, where the system includes:
the first defining unit 11, the first defining unit 11 is configured to define an off-line data boolean variable chinese and english name comparison list;
the first input unit 12 is configured to obtain a first input instruction, and input a boolean variable type to be checked according to the first input instruction;
the first generating unit 13 is configured to generate a boolean variable table to be checked according to the boolean variable type to be checked and the first offline data file;
a second generating unit 14, where the second generating unit 14 is configured to generate a first boolean variable check table according to the boolean variable table to be checked and the first boolean file when the boolean variable table to be checked is not empty;
a third generating unit 15, where the third generating unit 15 is configured to generate a second boolean variable check table based on the first boolean variable check table and a second boolean file;
a fourth generating unit 16, where the fourth generating unit 16 is configured to generate a check result list according to the offline data boolean variable chinese and english name comparison list and the second boolean variable check list, where the check result list includes a check result.
Further, the system further comprises:
a first judging unit, configured to judge whether each storage address in the to-be-checked boolean variable table can find a transcoding in the first boolean file;
a fifth generating unit, configured to generate the first boolean variable check table if each storage address in the to-be-checked boolean variable table can find a translation code in the first boolean file.
Further, the system further comprises:
a first obtaining unit, configured to obtain a no-translation-code storage address if each storage address in the to-be-checked boolean variable table cannot find a translation code in the first boolean file;
a sixth generating unit, configured to mark the non-translation-coding storage address, and generate the first boolean variable check table according to the marked boolean variable table to be checked and the first boolean file.
Further, the system further comprises:
a second determining unit, configured to determine whether each transcoding in the first boolean variable check table can find a boolean variable in the second boolean file;
a seventh generating unit configured to generate the second boolean variable check table if each transcoding in the first boolean variable check table can find a boolean variable in the second boolean file.
Further, the system further comprises:
a second obtaining unit configured to obtain a first invariant transform coding if each transform coding in the first boolean variable check table cannot find a boolean variable in the second boolean file;
an eighth generating unit, configured to mark the first invariant transform coding, and generate the second boolean variable check table according to the marked first boolean variable check table and the second boolean file.
Further, the system further comprises:
a third judging unit, configured to judge whether each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list;
a ninth generating unit, configured to generate the check result list if each boolean variable name in the second boolean variable check table can find a boolean variable in the offline data boolean variable chinese and english name comparison list.
Further, the system further comprises:
a third obtaining unit, configured to obtain a second invariant transform coding if each boolean variable name in the second boolean variable check table cannot be found in the offline data boolean variable chinese and english name comparison list;
a tenth generating unit, configured to mark the second invariant transform coding, and generate the check result list according to the marked second boolean variable check list and the offline data boolean variable name comparison list.
Various changes and specific examples of the method for automatically checking the boolean variables of the offline data of the column control center in the first embodiment of fig. 1 are also applicable to the system for automatically checking the boolean variables of the offline data of the column control center in the present embodiment.
In addition, an embodiment of the present invention further provides an electronic device, which includes a bus, a transceiver, a memory, a processor, and a computer program stored in the memory and capable of running on the processor, where the transceiver, the memory, and the processor are connected via the bus, and when the computer program is executed by the processor, the processes of the method for controlling output data are implemented, and the same technical effects can be achieved, and are not described herein again to avoid repetition.
Exemplary electronic device
Specifically, referring to fig. 4, an embodiment of the present invention further provides an electronic device, which includes a bus 1110, a processor 1120, a transceiver 1130, a bus interface 1140, a memory 1150, and a user interface 1160.
In an embodiment of the present invention, the electronic device further includes: a computer program stored on the memory 1150 and executable on the processor 1120, the computer program, when executed by the processor 1120, implementing the various processes of the method embodiments of controlling output data described above.
A transceiver 1130 for receiving and transmitting data under the control of the processor 1120.
In embodiments of the invention in which a bus architecture (represented by bus 1110) is used, bus 1110 may include any number of interconnected buses and bridges, with bus 1110 connecting various circuits including one or more processors, represented by processor 1120, and memory, represented by memory 1150.
Processor 1120 may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits in hardware or instructions in software in a processor. The processor described above includes: general purpose processors, central processing units, network processors, digital signal processors, application specific integrated circuits, field programmable gate arrays, complex programmable logic devices, programmable logic arrays, micro-control units or other programmable logic devices, discrete gates, transistor logic devices, discrete hardware components. The various methods, steps and logic blocks disclosed in embodiments of the present invention may be implemented or performed. For example, the processor may be a single core processor or a multi-core processor, which may be integrated on a single chip or located on multiple different chips.
Processor 1120 may be a microprocessor or any conventional processor. The steps of the method disclosed in connection with the embodiments of the present invention may be performed directly by a hardware decoding processor, or may be performed by a combination of hardware and software modules in the decoding processor. The software modules may reside in random access memory, flash memory, read only memory, programmable read only memory, erasable programmable read only memory, registers, and the like, as is known in the art. The readable storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
The bus 1110 may also connect various other circuits such as peripherals, voltage regulators, or power management circuits to provide an interface between the bus 1110 and the transceiver 1130, as is well known in the art. Therefore, the embodiments of the present invention will not be further described.
The transceiver 1130 may be one element or may be multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other apparatus over a transmission medium. For example: the transceiver 1130 receives external data from other devices, and the transceiver 1130 transmits data processed by the processor 1120 to other devices. Depending on the nature of the computer device, a user interface 1160 may also be provided, such as: touch screen, physical keyboard, display, mouse, speaker, microphone, trackball, joystick, stylus.
It is to be appreciated that in embodiments of the invention, the memory 1150 may further include memory located remotely with respect to the processor 1120, which may be coupled to a server via a network. One or more portions of the above-described network may be an ad hoc network, an intranet, an extranet, a virtual private network, a local area network, a wireless local area network, a wide area network, a wireless wide area network, a metropolitan area network, the internet, a public switched telephone network, a plain old telephone service network, a cellular telephone network, a wireless fidelity network, and a combination of two or more of the above. For example, the cellular telephone network and the wireless network may be global mobile communications devices, code division multiple access devices, global microwave interconnect access devices, general packet radio service devices, wideband code division multiple access devices, long term evolution devices, LTE frequency division duplex devices, LTE time division duplex devices, long term evolution advanced devices, universal mobile communications devices, enhanced mobile broadband devices, mass machine type communications devices, ultra-reliable low-latency communications devices, and the like.
It is to be understood that the memory 1150 in embodiments of the present invention can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. Wherein the nonvolatile memory includes: read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, or flash memory.
The volatile memory includes: random access memory, which acts as an external cache. By way of example, and not limitation, many forms of RAM are available, such as: static random access memory, dynamic random access memory, synchronous dynamic random access memory, double data rate synchronous dynamic random access memory, enhanced synchronous dynamic random access memory, synchronous link dynamic random access memory, and direct memory bus random access memory. The memory 1150 of the electronic device described in the embodiments of the invention includes, but is not limited to, the above and any other suitable types of memory.
In an embodiment of the present invention, memory 1150 stores the following elements of operating system 1151 and application programs 1152: an executable module, a data structure, or a subset thereof, or an expanded set thereof.
Specifically, the operating system 1151 includes various device programs, such as: a framework layer, a core library layer, a driver layer, etc. for implementing various basic services and processing hardware-based tasks. Applications 1152 include various applications such as: media player, browser, used to realize various application services. A program implementing a method of an embodiment of the invention may be included in application program 1152. The application programs 1152 include: applets, objects, components, logic, data structures, and other computer device-executable instructions that perform particular tasks or implement particular abstract data types.
In addition, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the computer program implements each process of the above method for controlling output data, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here.
The above description is only a specific implementation of the embodiments of the present invention, but the scope of the embodiments of the present invention is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the embodiments of the present invention, and all such changes or substitutions should be covered by the scope of the embodiments of the present invention. Therefore, the protection scope of the embodiments of the present invention shall be subject to the protection scope of the claims.
Claims (10)
1. An automatic Boolean variable checking method for offline data of a train control center is characterized by comprising the following steps:
defining an off-line data Boolean variable Chinese and English name comparison list;
obtaining a first input instruction, and inputting a Boolean variable type to be checked according to the first input instruction;
generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file;
when the Boolean variable table to be checked is not empty, generating a first Boolean variable check table according to the Boolean variable table to be checked and a first Boolean file;
generating a second Boolean variable check table based on the first Boolean variable check table and a second Boolean file;
and generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results.
2. The method of claim 1, wherein prior to generating the first boolean variable check table, comprising:
judging whether each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file or not;
and if each storage address in the Boolean variable table to be checked can find a conversion code in the first Boolean file, generating the first Boolean variable check table.
3. The method of claim 2, wherein after determining whether each storage address in the to-be-checked boolean variable table can find a translation code in the first boolean file, the method comprises:
if each storage address in the Boolean variable table to be checked cannot find a conversion code in the first Boolean file, obtaining a conversion code-free storage address;
and marking the non-conversion coding storage address, and generating the first Boolean variable check table according to the marked Boolean variable table to be checked and the first Boolean file.
4. The method of claim 1, wherein prior to generating the second boolean variable check table, comprising:
judging whether each conversion code in the first Boolean variable check table can find the Boolean variable in the second Boolean file;
and if each conversion code in the first Boolean variable check table can find the Boolean variable in the second Boolean file, generating the second Boolean variable check table.
5. The method of claim 4, wherein said determining whether each transcoding in the first Boolean variable check table can find a Boolean variable in the second Boolean file comprises:
if each conversion code in the first Boolean variable check table can not find a Boolean variable in the second Boolean file, obtaining a first invariant conversion code;
and marking the first invariant conversion code, and generating a second Boolean variable check table according to the marked first Boolean variable check table and the second Boolean file.
6. The method of claim 1, wherein prior to generating the check result list, comprising:
judging whether each Boolean variable name in the second Boolean variable check table can find the Boolean variable in the off-line data Boolean variable Chinese and English name comparison list or not;
and if each Boolean variable name in the second Boolean variable check table can find the Boolean variable in the off-line data Boolean variable Chinese and English name comparison list, generating the check result list.
7. The method of claim 6, wherein the determining whether each Boolean variable name in the second Boolean variable check table can be found in the off-line data Boolean variable name lookup table comprises:
if the name of each Boolean variable in the second Boolean variable check table cannot find the Boolean variable in the offline data Boolean variable Chinese and English name comparison list, obtaining a second non-variable conversion code;
and marking the second invariant conversion code, and generating a check result list according to the marked second Boolean variable check list and the off-line data Boolean variable Chinese and English name check list.
8. An automatic Boolean variable checking system for offline data of a train control center is characterized by comprising:
the first definition unit is used for defining an off-line data Boolean variable Chinese and English name comparison list;
the first input unit is used for obtaining a first input instruction and inputting the type of the Boolean variable to be checked according to the first input instruction;
the first generating unit is used for generating a Boolean variable table to be checked according to the Boolean variable type to be checked and the first off-line data file;
the second generating unit is used for generating a first Boolean variable checking table according to the Boolean variable table to be checked and the first Boolean file when the Boolean variable table to be checked is not empty;
a third generating unit configured to generate a second boolean variable check table based on the first boolean variable check table and a second boolean file;
and the fourth generating unit is used for generating a check result list according to the off-line data Boolean variable Chinese and English name comparison list and the second Boolean variable check list, wherein the check result list comprises check results.
9. An electronic device for automatic boolean variable checking of offline data of a train control center, comprising a bus, a transceiver, a memory, a processor and a computer program stored on the memory and executable on the processor, the transceiver, the memory and the processor being connected via the bus, characterized in that the computer program implements the steps of the method according to any one of claims 1 to 7 when executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111565603.2A CN113946660B (en) | 2021-12-21 | 2021-12-21 | Automatic Boolean variable checking method and system for offline data of train control center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111565603.2A CN113946660B (en) | 2021-12-21 | 2021-12-21 | Automatic Boolean variable checking method and system for offline data of train control center |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113946660A CN113946660A (en) | 2022-01-18 |
| CN113946660B true CN113946660B (en) | 2022-03-15 |
Family
ID=79339414
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111565603.2A Active CN113946660B (en) | 2021-12-21 | 2021-12-21 | Automatic Boolean variable checking method and system for offline data of train control center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113946660B (en) |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112632909A (en) * | 2020-10-30 | 2021-04-09 | 中核核电运行管理有限公司 | Data object English coding method and device |
| CN112606880B (en) * | 2020-12-23 | 2022-08-26 | 卡斯柯信号有限公司 | Railway signal control method based on introduction of vehicle information in Boolean logic operation |
| CN113535461B (en) * | 2021-06-09 | 2023-10-24 | 卡斯柯信号(成都)有限公司 | Visual verification method for interlocking lower computer data based on configuration file |
| CN113761854A (en) * | 2021-08-27 | 2021-12-07 | 北京和利时系统工程有限公司 | Method and device for realizing train control data processing |
| CN113504774B (en) * | 2021-09-09 | 2021-12-24 | 卡斯柯信号(北京)有限公司 | Train control interlocking integration and dispatching centralized system interface data checking method and device |
| CN113835418B (en) * | 2021-11-29 | 2022-03-15 | 卡斯柯信号(北京)有限公司 | Method and system for reverse decoding and checking of coding information of railway train control trackside software |
-
2021
- 2021-12-21 CN CN202111565603.2A patent/CN113946660B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN113946660A (en) | 2022-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112632880B (en) | Compiling method for logic system design, electronic device, and storage medium | |
| CN103366411B (en) | For the method and apparatus by wireless network transmissions vehicle position data residual error | |
| CN112287569B (en) | Method, electronic device and storage medium for simulating logic system design | |
| CN110769002A (en) | LabVIEW-based message analysis method, system, electronic device and medium | |
| CN115757483A (en) | Automatic testing method and device, electronic equipment and storage medium | |
| CN113919254A (en) | Register transfer level signal mapping construction method, device, equipment and storage medium | |
| CN113946660B (en) | Automatic Boolean variable checking method and system for offline data of train control center | |
| CN105701294A (en) | Method and system for realizing complex project modification of chips | |
| CN116594922B (en) | Data access circuit, method and system-level chip | |
| CN113742221A (en) | Method for generating test case, electronic device and storage medium | |
| US9762285B1 (en) | Compression using mu-law approximation | |
| CN112257359B (en) | Debugging method, device, debugging system and storage medium for data waveform | |
| US11275683B2 (en) | Method, apparatus, device and computer-readable storage medium for storage management | |
| CN115293076A (en) | Method for generating circuit, electronic device and storage medium | |
| CN112232025B (en) | Character string storage method and device and electronic equipment | |
| CN109150198B (en) | Interleaving processing method and device for polarization code | |
| CN112395468A (en) | Number management method and device, electronic equipment and storage medium | |
| CN112015425A (en) | Data storage method, data reading device, electronic equipment and storage medium | |
| CN112257360B (en) | Debugging method, device, debugging system and storage medium for data waveform | |
| KR100546886B1 (en) | Apparatus measuring SoC efficiency and a method thereof | |
| CN116009792B (en) | Data reading and writing device and method in image processing and electronic equipment | |
| CN117667828B (en) | Network-on-chip integration method, device and storage medium | |
| CN113946727A (en) | List paging method and system for Elasticissearch | |
| US11855656B2 (en) | Detection circuit and detection method, electronic device, and computer-readable storage medium | |
| CN110619132B (en) | Method and apparatus for adaptive voltage scaling |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |