CN111190660A - Method and system for optimizing process automation based on bidirectional linked list model - Google Patents
Method and system for optimizing process automation based on bidirectional linked list model Download PDFInfo
- Publication number
- CN111190660A CN111190660A CN201911404699.7A CN201911404699A CN111190660A CN 111190660 A CN111190660 A CN 111190660A CN 201911404699 A CN201911404699 A CN 201911404699A CN 111190660 A CN111190660 A CN 111190660A
- Authority
- CN
- China
- Prior art keywords
- linked list
- doubly
- operation action
- script file
- node
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 230000002457 bidirectional effect Effects 0.000 title claims abstract description 25
- 238000004801 process automation Methods 0.000 title claims abstract description 21
- 230000009471 action Effects 0.000 claims abstract description 73
- 238000013515 script Methods 0.000 claims abstract description 72
- 238000004590 computer program Methods 0.000 claims description 10
- 238000010276 construction Methods 0.000 claims description 3
- 239000002243 precursor Substances 0.000 claims description 3
- 230000008569 process Effects 0.000 claims description 3
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000010420 art technique Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010516 chain-walking reaction Methods 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000013386 optimize process Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Stored Programmes (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a system for optimizing process automation based on a doubly-linked list model, which comprises the steps of constructing a doubly-linked list model with a plurality of storage units; establishing a bidirectional linked list through a bidirectional linked list model according to the script file; traversing and searching a priority execution path in the double-linked list, obtaining an unexecuted double-linked list, and executing an operation action instruction in the unexecuted double-linked list so as to optimize the running efficiency and speed of the script; because the operation is carried out through the unified linked list model structure, the compatibility and the recognition rate of software are improved, the stability is enhanced, the operation speed of the script is accelerated, the recognition rate is improved by the structure of the chain operation script, errors exist, and the script complexity is reduced.
Description
Technical Field
The disclosure relates to the technical field of RPA (resilient packet Access) process automation and automatic program execution, in particular to a method and a system for optimizing process automation based on a doubly linked list model.
Background
In actual work, the same operation needs to be repeatedly carried out many times, so that human resources are greatly wasted, and manual control is needed. In the prior art, script-driven software such as a key sprite, auto. js, a touch sprite and the like records a keyboard and mouse operation function according to a script written by a user, and almost any action which can be completed manually can be realized through script recording. These prior art techniques suffer from the following drawbacks: because some are based on identifying pictures, colors and coordinates, compatibility to mobile equipment or terminal equipment with different resolutions is not good, in addition, the script running speed is slow, the identification rate has errors, the stability is poor, the script writing is complex, the use threshold is large, and the compatibility to other software is poor.
Disclosure of Invention
The invention provides a method and a system for optimizing process automation based on a doubly-linked list model, which are characterized in that a doubly-linked list model with a plurality of storage units is constructed; establishing a bidirectional linked list through a bidirectional linked list model according to the script file; and traversing and searching a priority execution path in the double linked list, obtaining an unexecuted double linked list, and executing an operation action instruction in the unexecuted double linked list so as to optimize the running efficiency and speed of the script.
The purpose of the present disclosure is to provide a method and a system for optimizing process automation based on a doubly linked list model, which specifically include the following steps:
s100: recording the operation track and the trigger event as script files;
s200: constructing a two-way linked list model with N +1 storage units, wherein N is the repeated number of the operation action instructions which are repeated most in the script file;
s300: establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
s400: traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
s500: and executing the operation action instruction in the unexecuted doubly linked list.
Further, the operation command is a command for controlling a computer to perform operation.
Further, in S100, the script file is a combination of a series of instructions for controlling the computer to perform operation, operation and action, in which certain logic branches and the like can be implemented; the script file is a character command arranged according to the sequence, and when the script file is executed, the script file is translated into instructions which can be recognized by a machine one by an interpreter of the system and is executed according to the sequence of the program; the meaning of recording as a script file is that the script file is sequentially stored according to the operation track of manual operation and the sequence of the operation action instructions of the trigger event.
Further, in S200, the method for constructing a doubly linked list model with N +1 storage units includes:
step S210, a structure body is newly built, and the members of the structure body comprise: 1 storage unit for storing operation action instructions is used as an instruction storage unit, and N storage units for storing index numbers of operation action sequences are used as an index storage unit, a precursor pointer and a successor pointer;
step S220, a structure pointer is newly created, and initially, the pointer is empty and is used for pointing to the structure.
Further, in S300, the method for establishing the doubly linked list through the doubly linked list model according to the script file includes:
step S310, if the operation action command in the script file is the 1 st command, a structural body is newly built, the operation action command in the script file is stored in a command storage unit, the index number of the operation action sequence is stored in an index storage unit, and the 1 st command is stored in the index storage unit as 1;
step S320, if the operation action instruction in the script file is not the 1 st instruction, traversing all the structural bodies in the doubly linked list through the structural body pointer, and if the structural body with the instruction in the instruction storage unit and the operation action instruction being the same is found, storing the index number of the operation action sequence in the idle index storage unit of the structural body;
step S330, if the operation action command in the script file is not the 1 st command, traversing all the structural bodies in the doubly linked list through the structural body pointers, if the structural body with the command in the command storage unit and the operation action command being the same is not found, newly building a structural body, storing the operation action command in the script file in the command storage unit, storing the index number of the operation action sequence in the index storage unit, pointing the predecessor pointer to the previous structural body, and pointing the successor pointer of the previous structural body to the current structural body;
and step S340, iteratively executing the steps S320 to S330 until all the operation action instructions in the script file are traversed, thereby generating a doubly linked list with the structure body as a node.
Further, in S400, the method for traversing and searching the preferential execution path in the doubly linked list and obtaining the unexecuted doubly linked list includes:
step S410, traverse the doubly linked list, if the node vkE.g. V, V is all node set in the bidirectional linked list, k is the number of nodes in the bidirectional linked list, and at the node ViTo node vjOn the traversal path of (1), i and j are both 1 to kIncreasing positive integer, comparison dijAnd dik+dkjIf d is a value ofij>dik+dkjThen let dij＝dik+dkj，dijIs the node v of the current searchiTo node vjOf the index storage unit number in the nodes of the experienced doubly linked list, dikAnd dkjThe same process is carried out;
step S420, repeating step S410, and finally searching all nodes vkWhen d is greater thanijIs exactly node viTo node vjThe priority execution path of (1);
step S430, traversing the search node v according to the priority execution pathiTo node vjThe index number values of the storage operation action sequence in the index storage unit number are sorted from small to large;
step S440, according to the sorting of the index number values from small to large, the nodes v are sequentially executediTo node vjAll the operation action instructions in the system are operated;
step S450, after the execution is finished, deleting the node v from the doubly linked listiTo node vjAll nodes of (a) get an unexecuted doubly linked list.
Further, in S500, the method for executing the operation action instruction in the unexecuted doubly linked list includes:
step S510, index number values of storage operation action sequences in index storage unit numbers in the traversing retrieval double linked list are sorted from small to large;
and step S520, sequentially executing all operation action instructions in the doubly linked list according to the sorting of the index number values from small to large.
The invention also provides a system for optimizing process automation based on the doubly linked list model, which comprises the following steps: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the script recording unit is used for recording the operation track and the trigger event into a script file;
the model building unit is used for building a doubly linked list model with N +1 storage units;
the linked list construction unit is used for establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
the priority execution unit is used for traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
and the complete execution unit is used for executing the operation action instruction in the unexecuted doubly linked list.
The beneficial effect of this disclosure does: the invention discloses a method for optimizing process automation based on a bidirectional linked list model, which improves the compatibility and recognition rate of software, enhances the stability, accelerates the running speed of scripts because of running through a uniform linked list model structure, improves the recognition rate by the structure of a chain running script, has errors and reduces the complexity of the script.
Drawings
The foregoing and other features of the present disclosure will become more apparent from the detailed description of the embodiments shown in conjunction with the drawings in which like reference characters designate the same or similar elements throughout the several views, and it is apparent that the drawings in the following description are merely some examples of the present disclosure and that other drawings may be derived therefrom by those skilled in the art without the benefit of any inventive faculty, and in which:
FIG. 1 is a flow diagram illustrating a method for optimizing flow automation based on a doubly linked list model according to the present disclosure;
fig. 2 illustrates a system for optimizing process automation based on a doubly linked list model according to an embodiment of the present disclosure.
Detailed Description
The conception, specific structure and technical effects of the present disclosure will be clearly and completely described below in conjunction with the embodiments and the accompanying drawings to fully understand the objects, aspects and effects of the present disclosure. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
Fig. 1 is a flow chart illustrating a method for optimizing process automation based on a doubly linked list model according to the present disclosure, and the method according to an embodiment of the present disclosure is described below with reference to fig. 1.
The present disclosure provides a method for optimizing process automation based on a doubly-linked list model, which specifically includes the following steps:
s100: recording the operation track and the trigger event as script files;
s200: constructing a two-way linked list model with N +1 storage units, wherein N is the repeated number of the operation action instructions which are repeated most in the script file, namely the operation action instructions which are operated most frequently in the script file are found firstly, and N is the operation times of the operation action instructions;
s300: establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
s400: traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
s500: and executing the operation action instruction in the unexecuted doubly linked list.
Further, in S100, the script file is a combination of a series of instructions for controlling the computer to perform operation, operation and action, in which certain logic branches and the like can be implemented; the script file is a character command arranged according to the sequence, and when the script file is executed, the script file is translated into instructions which can be recognized by a machine one by an interpreter of the system and is executed according to the sequence of the program; the meaning of recording as a script file is that the script file is sequentially stored according to the operation track of manual operation and the sequence of the operation action instructions of the trigger event.
Further, in S200, the method for constructing a doubly linked list model with N +1 storage units includes:
step S210, a structure body is newly built, and the members of the structure body comprise: 1 storage unit for storing operation action instructions is used as an instruction storage unit, and N storage units for storing index numbers of operation action sequences are used as an index storage unit, a precursor pointer and a successor pointer;
step S220, a structure pointer is newly created, and initially, the pointer is empty and is used for pointing to the structure.
Further, in S300, the method for establishing the doubly linked list through the doubly linked list model according to the script file includes:
step S310, if the operation action command in the script file is the 1 st command, a structural body is newly built, the operation action command in the script file is stored in a command storage unit, the index number of the operation action sequence is stored in an index storage unit, and the 1 st command is stored in the index storage unit as 1;
step S320, if the operation action instruction in the script file is not the 1 st instruction, traversing all the structural bodies in the doubly linked list through the structural body pointer, and if the structural body with the instruction in the instruction storage unit and the operation action instruction being the same is found, storing the index number of the operation action sequence in the idle index storage unit of the structural body;
step S330, if the operation action command in the script file is not the 1 st command, traversing all the structural bodies in the doubly linked list through the structural body pointers, if the structural body with the command in the command storage unit and the operation action command being the same is not found, newly building a structural body, storing the operation action command in the script file in the command storage unit, storing the index number of the operation action sequence in the index storage unit, pointing the predecessor pointer to the previous structural body, and pointing the successor pointer of the previous structural body to the current structural body;
and step S340, iteratively executing the steps S320 to S330 until all the operation action instructions in the script file are traversed, thereby generating a doubly linked list with the structure body as a node.
Further, in S400, the method for traversing and searching the preferential execution path in the doubly linked list and obtaining the unexecuted doubly linked list includes:
step S410, traverse the doubly linked list, if the node vkE.g. V, V is all node set in the bidirectional linked list, k is the number of nodes in the bidirectional linked list, and at the node ViTo node vjI and j are positive integers increasing from 1 to k, and d is comparedijAnd dik+dkjIf d is a value ofij>dik+dkjThen let dij＝dik+dkj，dijIs the node v of the current searchiTo node vjOf the index storage unit number in the nodes of the experienced doubly linked list, dikAnd dkjThe same process is carried out;
step S420, repeating step S410, and finally searching all nodes vkWhen d is greater thanijIs exactly node viTo node vjThe priority execution path of (1);
step S430, traversing the search node v according to the priority execution pathiTo node vjThe index number values of the storage operation action sequence in the index storage unit number are sorted from small to large;
step S440, according to the sorting of the index number values from small to large, the nodes v are sequentially executediTo node vjAll the operation action instructions in the system are operated;
step S450, after the execution is finished, deleting the node v from the doubly linked listiTo node vjAll nodes of (a) get an unexecuted doubly linked list.
Further, in S500, the method for executing the operation action instruction in the unexecuted doubly linked list includes:
step S510, index number values of storage operation action sequences in index storage unit numbers in the traversing retrieval double linked list are sorted from small to large;
and step S520, sequentially executing all operation action instructions in the doubly linked list according to the sorting of the index number values from small to large.
The system for optimizing flow automation based on a doubly-linked list model provided by the embodiment of the present disclosure is a system structure diagram for optimizing flow automation based on a doubly-linked list model as shown in fig. 2, and the system for optimizing flow automation based on a doubly-linked list model of the embodiment includes: a processor, a memory, and a computer program stored in the memory and executable on the processor, the processor implementing the steps in one of the above-described embodiments of a system for optimizing flow automation based on a doubly linked list model when executing the computer program.
The system comprises: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the script recording unit is used for recording the operation track and the trigger event into a script file;
the model building unit is used for building a doubly linked list model with N +1 storage units;
the linked list construction unit is used for establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
the priority execution unit is used for traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
and the complete execution unit is used for executing the operation action instruction in the unexecuted doubly linked list.
The system for optimizing process automation based on the doubly-linked list model can be operated in computing equipment such as desktop computers, notebooks, palm computers and cloud servers. The system operable to optimize process automation based on the doubly linked list model may include, but is not limited to, a processor, a memory. Those skilled in the art will appreciate that the illustrated example is merely illustrative of a system for optimizing flow automation based on a doubly-linked list model and does not constitute a limitation of a system for optimizing flow automation based on a doubly-linked list model, and may include more or less components than proportional, or some components in combination, or different components, for example, the system for optimizing flow automation based on a doubly-linked list model may also include input output devices, network access devices, buses, and the like. The processor may be a Central Processing Unit (CPU), other general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component, or the like. The general processor can be a microprocessor or the processor can be any conventional processor, and the processor is a control center of the system operation system based on the doubly-linked list model optimization flow automation, and various interfaces and lines are used for connecting all parts of the whole system operable system based on the doubly-linked list model optimization flow automation.
The memory may be configured to store the computer programs and/or modules, and the processor may be configured to implement the various functions of the system for optimizing process automation based on a doubly linked list model by running or executing the computer programs and/or modules stored in the memory and invoking data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the cellular phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
While the present disclosure has been described in considerable detail and with particular reference to a few illustrative embodiments thereof, it is not intended to be limited to any such details or embodiments or any particular embodiments, but it is to be construed as effectively covering the intended scope of the disclosure by providing a broad, potential interpretation of such claims in view of the prior art with reference to the appended claims. Furthermore, the foregoing describes the disclosure in terms of embodiments foreseen by the inventor for which an enabling description was available, notwithstanding that insubstantial modifications of the disclosure, not presently foreseen, may nonetheless represent equivalent modifications thereto.
Claims (7)
1. A method for optimizing process automation based on a doubly linked list model, the method comprising the steps of:
s100: recording the operation track and the trigger event as script files;
s200: constructing a two-way linked list model with N +1 storage units;
s300: establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
s400: traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
s500: and executing the operation action instruction in the unexecuted doubly linked list.
2. The method for optimizing process automation based on the doubly-linked list model as claimed in claim 1, wherein in S100, the script file is a combination of a series of commands for controlling a computer to perform operation actions; the script file is a character command arranged according to the sequence, and when the script file is executed, the script file is translated into instructions which can be recognized by a machine one by an interpreter of the system and is executed according to the sequence of the program; the meaning of recording as a script file is that the script file is sequentially stored according to the operation track of manual operation and the sequence of the operation action instructions of the trigger event.
3. The method for optimizing process automation based on doubly linked list model as claimed in claim 1, wherein in S200, the method for constructing a doubly linked list model with N +1 storage units comprises:
step S210, a structure body is newly built, and the members of the structure body comprise: 1 storage unit for storing operation action instructions is used as an instruction storage unit, and N storage units for storing index numbers of operation action sequences are used as an index storage unit, a precursor pointer and a successor pointer;
step S220, a structure pointer is newly created, and initially, the pointer is empty and is used for pointing to the structure.
4. The method for optimizing process automation based on the doubly linked list model as claimed in claim 1, wherein in S300, the method for building the doubly linked list through the doubly linked list model according to the script file is as follows:
step S310, if the operation action command in the script file is the 1 st command, a structural body is newly built, the operation action command in the script file is stored in a command storage unit, the index number of the operation action sequence is stored in an index storage unit, and the 1 st command is stored in the index storage unit as 1;
step S320, if the operation action instruction in the script file is not the 1 st instruction, traversing all the structural bodies in the doubly linked list through the structural body pointer, and if the structural body with the instruction in the instruction storage unit and the operation action instruction being the same is found, storing the index number of the operation action sequence in the idle index storage unit of the structural body;
step S330, if the operation action command in the script file is not the 1 st command, traversing all the structural bodies in the doubly linked list through the structural body pointers, if the structural body with the command in the command storage unit and the operation action command being the same is not found, newly building a structural body, storing the operation action command in the script file in the command storage unit, storing the index number of the operation action sequence in the index storage unit, pointing the predecessor pointer to the previous structural body, and pointing the successor pointer of the previous structural body to the current structural body;
and step S340, iteratively executing the steps S320 to S330 until all the operation action instructions in the script file are traversed, thereby generating a doubly linked list with the structure body as a node.
5. The method for optimizing process automation based on doubly-linked list model as claimed in claim 1, wherein in S400, the method for traversing to find the prior execution path in the doubly-linked list and obtain the unexecuted doubly-linked list is as follows:
step S410, traverse the doubly linked list, if the node vkE.g. V, V is all node set in the bidirectional linked list, k is the number of nodes in the bidirectional linked list, and at the node ViTo node vjI and j are positive integers increasing from 1 to k, and d is comparedijAnd dik+dkjIf d is a value ofij>dik+dkjThen let dij＝dik+dkj，dijIs the node v of the current searchiTo node vjOf the index storage unit number in the nodes of the experienced doubly linked list, dikAnd dkjThe same process is carried out;
step S420, repeating step S410, and finally searching all nodes vkWhen d is greater thanijIs exactly node viTo node vjThe priority execution path of (1);
step S430, traversing the search node v according to the priority execution pathiTo node vjThe index number values of the storage operation action sequence in the index storage unit number are sorted from small to large;
step S440, according to the sorting of the index number values from small to large, the nodes v are sequentially executediTo node vjAll the operation action instructions in the system are operated;
step S450, after the execution is finished, deleting the node v from the doubly linked listiTo node vjAll nodes of (a) get an unexecuted doubly linked list.
6. The method for optimizing process automation based on doubly-linked list model as claimed in claim 1, wherein in S500, the method for executing the operation action command in the unexecuted doubly-linked list is as follows:
step S510, index number values of storage operation action sequences in index storage unit numbers in the traversing retrieval double linked list are sorted from small to large;
and step S520, sequentially executing all operation action instructions in the doubly linked list according to the sorting of the index number values from small to large.
7. A system for optimizing process automation based on a doubly linked list model, the system comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, the processor executing the computer program to run in the units of the following system:
the script recording unit is used for recording the operation track and the trigger event into a script file;
the model building unit is used for building a doubly linked list model with N +1 storage units;
the linked list construction unit is used for establishing a bidirectional linked list through a bidirectional linked list model according to the script file;
the priority execution unit is used for traversing and searching a priority execution path in the double linked list and obtaining an unexecuted double linked list;
and the complete execution unit is used for executing the operation action instruction in the unexecuted doubly linked list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911404699.7A CN111190660B (en) | 2019-12-31 | 2019-12-31 | Method and system for optimizing process automation based on doubly linked list model |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911404699.7A CN111190660B (en) | 2019-12-31 | 2019-12-31 | Method and system for optimizing process automation based on doubly linked list model |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111190660A true CN111190660A (en) | 2020-05-22 |
| CN111190660B CN111190660B (en) | 2023-12-01 |
Family
ID=70707908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911404699.7A Active CN111190660B (en) | 2019-12-31 | 2019-12-31 | Method and system for optimizing process automation based on doubly linked list model |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111190660B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112181854A (en) * | 2020-10-30 | 2021-01-05 | 重庆农村商业银行股份有限公司 | Method, device, equipment and storage medium for generating flow automation script |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140012963A1 (en) * | 2012-07-03 | 2014-01-09 | Skyfire Labs, Inc. | Linked List Scripting Engine |
| CN106776318A (en) * | 2016-12-15 | 2017-05-31 | 北京蓝海讯通科技股份有限公司 | A kind of test script method for recording and system |
| CN108255544A (en) * | 2018-01-12 | 2018-07-06 | 武汉智博创享科技股份有限公司 | The method that Android SQLite databases create or upgrade script batch performs |
| CN109684223A (en) * | 2018-12-28 | 2019-04-26 | 河南思维轨道交通技术研究院有限公司 | A kind of test script automation of link method, storage medium |
-
2019
- 2019-12-31 CN CN201911404699.7A patent/CN111190660B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140012963A1 (en) * | 2012-07-03 | 2014-01-09 | Skyfire Labs, Inc. | Linked List Scripting Engine |
| CN106776318A (en) * | 2016-12-15 | 2017-05-31 | 北京蓝海讯通科技股份有限公司 | A kind of test script method for recording and system |
| CN108255544A (en) * | 2018-01-12 | 2018-07-06 | 武汉智博创享科技股份有限公司 | The method that Android SQLite databases create or upgrade script batch performs |
| CN109684223A (en) * | 2018-12-28 | 2019-04-26 | 河南思维轨道交通技术研究院有限公司 | A kind of test script automation of link method, storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112181854A (en) * | 2020-10-30 | 2021-01-05 | 重庆农村商业银行股份有限公司 | Method, device, equipment and storage medium for generating flow automation script |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111190660B (en) | 2023-12-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111582477B (en) | Training method and device for neural network model | |
| CN111813517B (en) | Task queue allocation method and device, computer equipment and medium | |
| CN108536584B (en) | Automatic testing method based on Sikuli | |
| CN111027703A (en) | Quantum line query method and device, storage medium and electronic device | |
| CN111190660A (en) | Method and system for optimizing process automation based on bidirectional linked list model | |
| US10083127B2 (en) | Self-ordering buffer | |
| CN114757112A (en) | Motor parameter design method and system based on Hui wolf algorithm | |
| US20220148015A1 (en) | Determining patterns within a string sequence of user actions | |
| CN111698210A (en) | Cloud mobile phone handle data processing method and system and storage medium | |
| US10146409B2 (en) | Computerized dynamic splitting of interaction across multiple content | |
| CN108763381A (en) | Divide table method and apparatus based on consistency hash algorithm | |
| US10423693B2 (en) | Parallel processing using a bottom up approach | |
| CN113779321A (en) | Electronic whiteboard file saving method and device, electronic whiteboard and storage medium | |
| CN111028598A (en) | Virtual experiment guidance method and system based on operation behavior information | |
| CN111062790A (en) | Data analysis method and system based on enterprise internal audit result | |
| US11080258B2 (en) | Table generation based on scripts for existing tables | |
| CN117671459B (en) | Guided RPA artificial intelligence deep learning method and system | |
| CN115292194B (en) | Method for debugging flow, electronic equipment and computer readable storage medium | |
| CN112466291B (en) | Language model training method and device and electronic equipment | |
| CN111667004B (en) | Data generation method, device, equipment and storage medium | |
| CN116931885A (en) | Relationship diagram generation method, device, equipment and storage medium | |
| CN113792047A (en) | Method and device for mapping object and dictionary | |
| CN117971378A (en) | Workflow execution method, workflow execution device, electronic equipment and storage medium | |
| CN116778521A (en) | Drawing member identification method, electronic equipment and storage medium | |
| Robat | Introduction to software history |
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 |