CN111522601A - Back-end operation method and system for flexibly configuring multiple component tasks - Google Patents
Back-end operation method and system for flexibly configuring multiple component tasks Download PDFInfo
- Publication number
- CN111522601A CN111522601A CN202010321904.XA CN202010321904A CN111522601A CN 111522601 A CN111522601 A CN 111522601A CN 202010321904 A CN202010321904 A CN 202010321904A CN 111522601 A CN111522601 A CN 111522601A
- Authority
- CN
- China
- Prior art keywords
- component
- components
- operating
- type
- execution
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000006870 function Effects 0.000 description 24
- 230000000712 assembly Effects 0.000 description 20
- 238000000429 assembly Methods 0.000 description 20
- 230000009286 beneficial effect Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000011017 operating method Methods 0.000 description 1
- 230000003287 optical effect Effects 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/445—Program loading or initiating
- G06F9/44505—Configuring for program initiating, e.g. using registry, configuration files
- G06F9/4451—User profiles; Roaming
-
- 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/445—Program loading or initiating
- G06F9/44521—Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
- G06F9/44526—Plug-ins; Add-ons
Abstract
The invention discloses a back-end operation method and a back-end operation system for flexibly configuring a plurality of component tasks, and relates to the field of file processing. The method comprises the following steps: s1, acquiring a front-end configuration file; s2, finding a starting node of the front-end configuration file, finding all components behind the starting node, and executing sequence and task configuration logic of each component; s3, determining the type of each component; and S4, according to the execution sequence, starting from the first component, operating the function of each component according to the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all the components finish operating. The method and the device are suitable for file processing, can solve the problem that flexible configuration among the components cannot be realized, and achieve the effects that the system has stronger logicality and different modules are not required to be adopted during calling.
Description
Technical Field
The invention relates to the field of file processing, in particular to a back-end operation method and a back-end operation system for flexibly configuring a plurality of component tasks.
Background
The data integration platform originally takes a single function as a task, when a scene is complex, the configured task incidence relation is too complex, the logic judgment between the components cannot be realized, the flexible configuration between the components cannot be realized, and different modules are required to realize different functions when different components are called, so that the time and the labor are too long.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a back-end operation method and system for flexibly configuring multiple component tasks, aiming at the defects of the prior art.
The technical scheme for solving the technical problems is as follows: a back-end execution method for flexibly configuring a plurality of component tasks, comprising:
s1, acquiring a front-end configuration file;
s2, finding a starting node of the front-end configuration file, finding all components behind the starting node, and executing sequence and task configuration logic of each component;
s3, determining the type of each component;
and S4, according to the execution sequence, starting from the first component, operating the function of each component according to the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all the components finish operating.
The invention has the beneficial effects that: the goal of flexibly configuring a plurality of assemblies is realized by operating the assemblies according to the types of the assemblies, the inherent logics among the assemblies are convenient to identify through analysis, the assemblies can be operated more flexibly through configuring the logics, different functions can be realized without calling different modules, and time and labor are saved.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, determining the type of each component specifically includes:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
The beneficial effect of adopting the further scheme is that: the expandability of the whole system can be improved by calling the factory interface, and meanwhile, the development workload can be reduced.
Further, determining the next running component according to the running result and the task configuration logic of each component, specifically:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
The beneficial effect of adopting the further scheme is that: the system logicalization is realized, the running sequence can be accurately judged, and running disorder is avoided.
Further, after all the components are operated, the method further comprises the following steps:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
Another technical solution of the present invention for solving the above technical problems is as follows: the method comprises the following steps:
the acquisition module is used for acquiring a front-end configuration file;
the searching module is used for searching a starting node of the front-end configuration file, finding all components behind the starting node, and the execution sequence and task configuration logic of each component;
the analysis module is used for determining the type of each component;
and the ending module is used for operating the function of each component from the first component according to the execution sequence and the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all the components finish operating.
Adopt the beneficial effect of above-mentioned scheme: the goal of flexibly configuring a plurality of assemblies is realized by operating the assemblies according to the types of the assemblies, the inherent logics among the assemblies are convenient to identify through analysis, the assemblies can be operated more flexibly through configuring the logics, different functions can be realized without calling different modules, and time and labor are saved.
Further, the parsing module is specifically configured to:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
The beneficial effect of adopting the further scheme is as follows: the expandability of the whole system can be improved by calling the factory interface, and meanwhile, the development workload can be reduced.
Further, determining the next running component according to the running result and the task configuration logic of each component, specifically:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
The beneficial effect of adopting the further scheme is as follows: the system logicalization is realized, the running sequence can be accurately judged, and running disorder is avoided.
Further, the ending module is further configured to:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
Advantages of additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
FIG. 1 is a schematic flow chart diagram provided by an embodiment of a backend operating method for flexibly configuring a plurality of component tasks according to the present invention;
FIG. 2 is a block diagram of a back-end operating system for flexibly configuring tasks of a plurality of components according to an embodiment of the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth to illustrate, but are not to be construed to limit the scope of the invention.
As shown in fig. 1, a flowchart provided by an embodiment of a back-end operation method for flexibly configuring a plurality of component tasks includes:
s1, acquiring a front-end configuration file;
s2, finding the starting node of the front-end configuration file, finding all the components behind the starting node, and the execution sequence and task configuration logic of each component;
s3, determining the type of each component;
and S4, according to the execution sequence, starting from the first component, operating the function of each component according to the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all components finish operating.
The goal of flexibly configuring a plurality of assemblies is realized by operating the assemblies according to the types of the assemblies, the inherent logics among the assemblies are convenient to identify through analysis, the assemblies can be operated more flexibly through configuring the logics, different functions can be realized without calling different modules, and time and labor are saved.
It should be noted that the start node is: in the process of task execution, it is necessary to specify from which position to start executing a task, a special component called a start node is customized in the platform, the node has no actual service, and only specifies to start running from the node, and specific functions need to be arranged behind the start node, and the specific implementation may refer to the following embodiments: analyzing partial codes of an xml file, converting xml contents into variables in java, acquiring a component array through the analyzed xml file, circulating component data, finding a component with plugin equal to start in the component data, namely a starting node, finding a first component after the starting node, calling a recursion method, judging logic between the component and a next component by executing a return state of the first component, if a component needing to be operated exists after the component, calling the recursion method again by taking the component to be operated as a parameter until no subsequent component needing to be operated exists, regarding the task as the task operation end, taking the state of the last component as a task state, exiting the recursion method, returning to the execution state, writing an operation result of the task into a database through the operation degree of a rear end, and displaying the execution condition of the task on a front end page.
Preferably, in any of the above embodiments, the type of each component is determined, specifically:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
The expandability of the whole system can be improved by calling the factory interface, and meanwhile, the development workload can be reduced.
It should be noted that in the programming language, the function Func (Typea, … …) directly or indirectly calls the function itself, and the function is called a recursive function, which is characterized by: the function definition directly or indirectly calls the function, so that a condition which can terminate recursive calling is necessarily existed, otherwise infinite recursion is caused, the characteristics of the function definition are that whether the function is a basic element of the recursive function is judged, and the plant class specifically comprises: the factory mode is a mode of replacing new operation with a factory method, the factory mode is widely used in the well-known Jive forum, the factory mode is everywhere visible in a Java program system, because the factory mode is equivalent to new for creating instance objects, so that instance objects are often generated according to Class, for example, A a ═ new a () factory mode is also used for creating instance objects, so that in the future new, multiple eyes are needed to see whether the factory mode can be considered for use, and although doing so, some more work is possible, but greater expandability and least development workload are brought to the system.
Preferably, in any of the above embodiments, determining a next running component according to the running result and the task configuration logic of each component specifically includes:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
The system logicalization is realized, the running sequence can be accurately judged, and running disorder is avoided.
Preferably, in any of the above embodiments, until all the components are operated, the method further includes:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
As shown in FIG. 2, a structural framework diagram provided by an embodiment of a back-end operating system for flexibly configuring a plurality of component tasks comprises:
the obtaining module 100 is configured to obtain a front-end configuration file;
the searching module 200 is used for searching a starting node of a front-end configuration file, finding all components behind the starting node, and an execution sequence and task configuration logic of each component;
a parsing module 300 for determining a type of each component;
the ending module 400 is configured to start from the first component according to the execution sequence, run the function of each component according to the type of each component, and determine a next running component according to the running result and the task configuration logic of each component until all components are completely run.
The goal of flexibly configuring a plurality of assemblies is realized by operating the assemblies according to the types of the assemblies, the inherent logics among the assemblies are convenient to identify through analysis, the assemblies can be operated more flexibly through configuring the logics, different functions can be realized without calling different modules, and time and labor are saved.
Preferably, in any of the above embodiments, the parsing module is specifically configured to:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
The expandability of the whole system can be improved by calling the factory interface, and meanwhile, the development workload can be reduced.
Preferably, in any of the above embodiments, determining a next running component according to the running result and the task configuration logic of each component specifically includes:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
The system logicalization is realized, the running sequence can be accurately judged, and running disorder is avoided.
Preferably, in any embodiment above, the ending module is further configured to:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
It is understood that some or all of the alternative embodiments described above may be included in some embodiments.
It should be noted that the above embodiments are product embodiments corresponding to the previous method embodiments, and for the description of each optional implementation in the product embodiments, reference may be made to corresponding descriptions in the above method embodiments, and details are not described here again.
The above method, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention essentially or partially contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. A back-end execution method for flexibly configuring tasks of a plurality of components, comprising:
s1, acquiring a front-end configuration file;
s2, finding a starting node of the front-end configuration file, finding all components behind the starting node, and executing sequence and task configuration logic of each component;
s3, determining the type of each component;
and S4, according to the execution sequence, starting from the first component, operating the function of each component according to the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all the components finish operating.
2. The back-end operation method for flexibly configuring tasks of a plurality of components according to claim 1, wherein the determining the type of each component specifically comprises:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
3. The backend operation method for flexibly configuring tasks of a plurality of components according to claim 1, wherein a next operating component is determined according to an operation result and task configuration logic of each component, and specifically:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
4. A backend operation method for flexibly configuring tasks of a plurality of components according to any one of claims 1 to 3, further comprising, until all the components are operated:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
5. A back-end runtime system for flexibly configuring tasks of a plurality of components, comprising: the acquisition module is used for acquiring a front-end configuration file;
the searching module is used for searching a starting node of the front-end configuration file, finding all components behind the starting node, and the execution sequence and task configuration logic of each component;
the analysis module is used for determining the type of each component;
and the ending module is used for operating the function of each component from the first component according to the execution sequence and the type of each component, and determining the next operating component according to the operation result and the task configuration logic of each component until all the components finish operating.
6. The back-end operating system for flexibly configuring tasks of a plurality of components of claim 5, wherein the parsing module is specifically configured to:
and calling a recursive method to analyze the type of each component, and calling a factory class interface to instantiate the analyzed type of each component.
7. The back-end operating system for flexibly configuring tasks of a plurality of components according to claim 5, wherein the next operating component is determined according to the operating result and the task configuration logic of each component, specifically:
and judging whether a next operation component exists according to the operation result and the task configuration logic of the component, if so, continuing to execute the function of the next operation component, and if not, finishing the operation of the component.
8. A back-end execution system for flexibly configuring tasks of a plurality of components according to any one of claims 5 to 7, wherein the completion module is further configured to:
and taking the execution result displayed after the last execution in all the components is finished as the final task state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010321904.XA CN111522601A (en) | 2020-04-22 | 2020-04-22 | Back-end operation method and system for flexibly configuring multiple component tasks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010321904.XA CN111522601A (en) | 2020-04-22 | 2020-04-22 | Back-end operation method and system for flexibly configuring multiple component tasks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111522601A true CN111522601A (en) | 2020-08-11 |
Family
ID=71910451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010321904.XA Pending CN111522601A (en) | 2020-04-22 | 2020-04-22 | Back-end operation method and system for flexibly configuring multiple component tasks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111522601A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968307A (en) * | 2012-11-29 | 2013-03-13 | 中国传媒大学 | Java-based web development middleware |
| CN103713902A (en) * | 2013-12-26 | 2014-04-09 | Tcl集团股份有限公司 | Method and system for BOA compiling based on Android system |
| CN104360905A (en) * | 2014-10-29 | 2015-02-18 | 中国建设银行股份有限公司 | Self-adaptive control method and self-adaptive control device applied to IT (Information Technology) system |
| CN104484204A (en) * | 2014-12-12 | 2015-04-01 | 北京国双科技有限公司 | Method and device for task running |
| CN106201878A (en) * | 2016-07-08 | 2016-12-07 | 百度在线网络技术（北京）有限公司 | The execution method and apparatus of test program |
| CN106502720A (en) * | 2016-09-26 | 2017-03-15 | 海尔优家智能科技（北京）有限公司 | A kind of data processing method and device |
| CN106775906A (en) * | 2016-11-22 | 2017-05-31 | 武汉斗鱼网络科技有限公司 | Business flow processing method and device |
| CN106775617A (en) * | 2016-11-09 | 2017-05-31 | 深圳市中润四方信息技术有限公司 | The service logic collocation method and configuration system of a kind of application software |
| CN110708202A (en) * | 2019-10-15 | 2020-01-17 | 深圳前海微众银行股份有限公司 | Configuration method, device and equipment of plug-in node and storage medium |
-
2020
- 2020-04-22 CN CN202010321904.XA patent/CN111522601A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102968307A (en) * | 2012-11-29 | 2013-03-13 | 中国传媒大学 | Java-based web development middleware |
| CN103713902A (en) * | 2013-12-26 | 2014-04-09 | Tcl集团股份有限公司 | Method and system for BOA compiling based on Android system |
| CN104360905A (en) * | 2014-10-29 | 2015-02-18 | 中国建设银行股份有限公司 | Self-adaptive control method and self-adaptive control device applied to IT (Information Technology) system |
| CN104484204A (en) * | 2014-12-12 | 2015-04-01 | 北京国双科技有限公司 | Method and device for task running |
| CN106201878A (en) * | 2016-07-08 | 2016-12-07 | 百度在线网络技术（北京）有限公司 | The execution method and apparatus of test program |
| CN106502720A (en) * | 2016-09-26 | 2017-03-15 | 海尔优家智能科技（北京）有限公司 | A kind of data processing method and device |
| CN106775617A (en) * | 2016-11-09 | 2017-05-31 | 深圳市中润四方信息技术有限公司 | The service logic collocation method and configuration system of a kind of application software |
| CN106775906A (en) * | 2016-11-22 | 2017-05-31 | 武汉斗鱼网络科技有限公司 | Business flow processing method and device |
| CN110708202A (en) * | 2019-10-15 | 2020-01-17 | 深圳前海微众银行股份有限公司 | Configuration method, device and equipment of plug-in node and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112988782B (en) | Hive-supported interactive query method and device and storage medium | |
| CN103235759A (en) | Method and device for generating test cases | |
| CN106293891B (en) | Multidimensional investment index monitoring method | |
| CN112597014B (en) | Automatic test method and device based on data driving, medium and electronic equipment | |
| CN108089982B (en) | Test method, test device, electronic equipment and computer readable storage medium | |
| CN111597243A (en) | Data warehouse-based abstract data loading method and system | |
| CN110599341A (en) | Transaction calling method and system | |
| CN109063040B (en) | Client program data acquisition method and system | |
| US9081605B2 (en) | Conflicting sub-process identification method, apparatus and computer program | |
| CN113254350A (en) | Flink operation testing method, device, equipment and storage medium | |
| CN111767265B (en) | Data tilting method and system in connection operation and computer equipment | |
| CN111522601A (en) | Back-end operation method and system for flexibly configuring multiple component tasks | |
| CN117009222A (en) | Intelligent generation method for automobile electric control system test cases based on structural requirements | |
| CN109582572A (en) | A kind of judgement can management program enter the method for stabilization sub stage in being performed a plurality of times | |
| CN112130849A (en) | Automatic code generation method and device | |
| CN110990271A (en) | Code performance detection method, device, equipment and storage medium | |
| CN111274148A (en) | Method and device for detecting SQL code defects | |
| CN111401020A (en) | Interface loading method and system and computing equipment | |
| CN115687140B (en) | Test case writing method and system based on automatic test | |
| CN117421071B (en) | Visual package method and integrated system for plug-in service | |
| CN113918211B (en) | Method, device and equipment for executing industrial equipment object data model | |
| CN111459576B (en) | Data analysis processing system and model operation method | |
| CN117235160A (en) | Index center | |
| CN117195847A (en) | Report generation method and device | |
| CN117493361A (en) | Test data platform data pool operation method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200811 |