CN111782201A - Method and device for realizing linkage of service codes and layout topological graph - Google Patents
Method and device for realizing linkage of service codes and layout topological graph Download PDFInfo
- Publication number
- CN111782201A CN111782201A CN202010605100.2A CN202010605100A CN111782201A CN 111782201 A CN111782201 A CN 111782201A CN 202010605100 A CN202010605100 A CN 202010605100A CN 111782201 A CN111782201 A CN 111782201A
- Authority
- CN
- China
- Prior art keywords
- logic
- arrangement
- service code
- code segment
- layout
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/34—Graphical or visual programming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/33—Intelligent editors
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method and a device for realizing linkage of service codes and a layout topological graph, wherein the method comprises the following steps: acquiring logic change information of arrangement logics corresponding to service code segments, wherein the service code comprises a plurality of service code segments, an arrangement topological graph corresponding to the service code comprises a plurality of arrangement logics, and each service code segment corresponds to at least one arrangement logic; starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic; and updating the layout topological graph according to the changed layout logic. The invention realizes the technical effect of quasi-real-time linkage of the service codes and the layout topological graph.
Description
Technical Field
The invention relates to the technical field of code development, in particular to a method and a device for realizing linkage of service codes and a layout topological graph.
Background
In recent years, the low code field has developed rapidly. The low-code is essentially a concept similar to 'le Gao building blocks', universal and reusable codes are formed into modular modules, and the modular modules are arranged into business applications in modes of graphics and the like, so that a business system is built under the condition that only a small amount of codes are written or the codes are not written. Briefly, low code development is the process of dragging and dropping modules of existing code into a workflow for orchestration to create applications. Because it can completely replace the traditional development method of manual coding application program, the developers with skilled skills can work more intelligently and more efficiently without being bound by repeated codes. Instead, they can focus their efforts on the business logic. Another way, as opposed to "low code" development, is to write thousands of lines of complex code and statements, which are then debugged. And the application program is developed by using low code and is constructed by using a visual mode, so that the development speed can be improved by nearly 10 times, and the value of a developer with skilled skills is maximized.
Currently, for visual logic layout, the industry can generally perform business logic layout by dragging a preset template component to form a layout topological graph. However, this method has a major disadvantage that when developers perform logic arrangement and then perform related modifications on automatically generated service codes, the adjustment of related arrangement logic cannot be fed back to the visual topological graph, which may cause inequivalence between the arranged topological graph and the actual service codes. Through analysis, it is found that a common way for describing a visualized topological graph in the industry is to store the topological graph as an xml, json and other configuration files, not actual code files. The topology description file is only effective for the layout engine and is not effective for the code logic, and when a developer modifies the code calling relation in a code writing mode (namely modifies the layout logic), the topology description file is not modified synchronously and in linkage.
In summary, there is no reasonable solution for quasi-real-time linkage between the layout topology (i.e. the code layout logic) and the actual service codes. Therefore, how to provide a new solution to solve the above technical problems is a technical problem to be solved in the art.
Disclosure of Invention
The invention provides a method and a device for realizing linkage of service codes and arrangement topological graphs, which aim to solve the technical problems in the background technology.
In order to achieve the above object, according to one aspect of the present invention, there is provided a method for implementing linkage of service codes and an arrangement topological graph, the method comprising:
acquiring logic change information of arrangement logics corresponding to service code segments, wherein the service code comprises a plurality of service code segments, an arrangement topological graph corresponding to the service code comprises a plurality of arrangement logics, and each service code segment corresponds to at least one arrangement logic;
starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic;
and updating the layout topological graph according to the changed layout logic.
Optionally, the method for implementing linkage of the service code and the layout topological graph further includes:
acquiring the arrangement logic change information of the arrangement topological graph, wherein the arrangement logic change information comprises at least one changed arrangement logic;
determining a business code segment corresponding to the changed editing logic;
and starting the corresponding arrangement logic processing module of the corresponding service code segment to modify the arrangement logic corresponding to the corresponding service code segment.
Optionally, after the modifying the corresponding orchestration logic of the corresponding service code segment, the method further includes:
verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the changed arrangement logic, and if so, confirming that the modification is successful.
Optionally, the service code fragment includes at least one data processing method, and the orchestration logic includes at least one data call relationship.
Optionally, the orchestration logic is arranged at the declaration of the corresponding service code segment.
In order to achieve the above object, according to another aspect of the present invention, there is provided an apparatus for implementing linkage of service codes and an arrangement topology, the apparatus comprising:
the service code scheduling system comprises a scheduling logic change message acquiring unit, a scheduling logic change message acquiring unit and a scheduling logic change message acquiring unit, wherein the scheduling logic change message acquiring unit is used for acquiring a logic change message of scheduling logic corresponding to a service code segment, the service code comprises a plurality of service code segments, a scheduling topological graph corresponding to the service code comprises a plurality of scheduling logics, and each service code segment corresponds to at least one scheduling logic;
the changed arrangement logic determining unit is used for starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic;
and the topological graph updating unit is used for updating the layout topological graph according to the changed layout logic.
Optionally, the apparatus for implementing linkage of service codes and layout topological graph further includes:
a topological diagram change information acquiring unit, configured to acquire arrangement logic change information of the arrangement topological diagram, where the arrangement logic change information includes at least one changed arrangement logic;
a service code segment determining unit, configured to determine a service code segment corresponding to the changed orchestration logic;
and the arrangement logic modification unit is used for starting an arrangement logic processing module corresponding to the corresponding service code segment to modify the arrangement logic corresponding to the corresponding service code segment.
Optionally, the apparatus for implementing linkage of service codes and layout topological graph further includes:
and the modification verification unit is used for verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the corresponding changed arrangement logic or not, and if so, the modification is confirmed to be successful.
To achieve the above object, according to another aspect of the present invention, there is also provided a computer device, including a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the method for linking the service codes and the layout topology when executing the computer program.
To achieve the above object, according to another aspect of the present invention, there is also provided a computer readable storage medium storing a computer program which, when executed in a computer processor, implements the steps in the above method for implementing linkage of service codes and layout topology.
The invention has the beneficial effects that: according to the method, the arrangement topological graph is divided into the plurality of arrangement logics, the service codes are divided into the plurality of service code segments, the service code segments correspond to the arrangement logics, when a user conducts arrangement logic modification on a certain service code segment, a logic change message can be quickly obtained, the changed arrangement logics are determined, the arrangement topological graph is updated according to the changed arrangement logics, the quasi-real-time linkage of the service codes and the arrangement topological graph is realized, and the technical problem that when developers conduct relevant modification on automatically generated service codes after logic arrangement is completed, the adjustment of relevant arrangement logics cannot be fed back to a visual topological graph in the prior art is solved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts. In the drawings:
FIG. 1 is a first flowchart of a method for implementing linkage of service codes and an arrangement topology according to an embodiment of the present invention;
FIG. 2 is a second flowchart of a method for implementing linkage of service codes and layout topology according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a process flow of quasi-real-time feedback to an arrangement topology after modification of arrangement logic according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a processing flow of quasi-real-time feedback to a service code segment after a topology map is modified according to an embodiment of the present invention;
FIG. 5 is a first block diagram of an apparatus for implementing linkage of service codes and an arrangement topology according to an embodiment of the present invention;
FIG. 6 is a second block diagram of an apparatus for implementing linkage of service codes and layout topology according to an embodiment of the present invention;
FIG. 7 is a schematic diagram of a computer apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the technical solutions of the present invention better understood, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
It should be noted that the terms "comprises" and "comprising," and any variations thereof, in the description and claims of the present invention and the above-described drawings, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It should be noted that the embodiments and features of the embodiments may be combined with each other without conflict. The present invention will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 is a first flowchart of a method for implementing linkage of service codes and an arrangement topological diagram according to an embodiment of the present invention, and as shown in fig. 1, in an embodiment of the present invention, the method for implementing linkage of service codes and an arrangement topological diagram according to the present invention includes steps S101 to S103.
Step S101, obtaining a logic change message of an arrangement logic corresponding to a service code segment, wherein the service code comprises a plurality of service code segments, an arrangement topological graph corresponding to the service code comprises a plurality of arrangement logics, and each service code segment corresponds to at least one arrangement logic.
In the prior art, service arrangement logics (namely arrangement topological graphs) and corresponding service codes are independent from each other, the service arrangement logics (namely arrangement topological graphs) are usually stored in independent configuration files such as xml and json, and the service arrangement logics and the json are split from each other, so that quasi-real-time linkage cannot be realized. The invention splits the service code into a plurality of service code segments, correspondingly splits the arrangement topological graph into a plurality of arrangement logics at the same time, and sets the arrangement logics at the corresponding service code segments, thereby being beneficial to realizing the decoupling of the service code segments and the arrangement logics.
In the embodiment of the invention, each service code segment comprises at least one data processing method, and each editing logic comprises at least one data calling relation. In the embodiment of the invention, each service code fragment can be understood as a method (namely a data processing method), each method only concerns the service logic of the method, and mutual calling among the methods is realized by arranging the logic instead of directly writing and calling the code.
In an alternative embodiment of the invention, the orchestration logic is located at the declaration of the corresponding business code segment. In the optional embodiment of the invention, the editing logic is marked at the declaration position of the corresponding service code segment, and the service code segment is written in the method body, so that the editing logic and the service code can be effectively decoupled. Examples are as follows: @ next step ("method 3")
@exception step(“exceptionMethod1”)
Public void method2(){
Dosomething；
}
In the above example, @ next step ("method 3"), @ exception step ("exception method 1") is the orchestration logic. The method body is the content of a method (service code fragment), the inside of { } is the method body, and the specific service code fragment is recorded in the inside.
The embodiment of the invention adopts a declarative method to put the arrangement logic and the corresponding service code segments together, thereby being beneficial to the quasi-real-time linkage of the arrangement topological graph and the service codes. The editing logic and the corresponding service code segments are put together, so that the editing logic can be modified in a concurrent mode, and the efficiency of updating the editing topological graph is improved.
Fig. 3 is a schematic view of a processing flow of quasi-real-time feedback to an arrangement topological graph after the arrangement logic is modified according to an embodiment of the present invention, as shown in fig. 3, in the embodiment of the present invention, an analysis and processing work of the arrangement logic is distributed to an arrangement logic processing module by an arrangement logic scheduling module according to a load balancing policy. The editing logic processing module analyzes and processes editing logic in the service code segment in the own responsibility range, and stores the analysis or processing result into the editing logic information cache, so as to realize higher read-write efficiency.
In the embodiment shown in fig. 3, when the orchestration logic in any service code segment changes, a logic change message is sent to the message middleware through a monitoring mechanism, so that asynchronous decoupling of code storage and orchestration information processing is realized. And then the scheduling message processing module asynchronously consumes the logic change message from the message middleware, identifies the changed service code segment and transmits the logic change message to the scheduling logic scheduling module. The arrangement logic processing module corresponding to the service code segment scheduled to change by the arrangement logic scheduling module processes the arrangement logic of the incremental change, and the processing efficiency is improved.
And step S102, starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic.
In the embodiment shown in fig. 3, the scheduling logic processing module analyzes the scheduling logic in the changed service code segment under the scheduling of the scheduling logic scheduling module to obtain the changed scheduling logic.
And step S103, updating the layout topological graph according to the changed layout logic.
In the embodiment shown in FIG. 3, the orchestration logic processing module stores the changed orchestration logic in the orchestration logic information cache. And the layout topology analysis module reads the changed layout logic from the layout logic information cache according to a preset time interval (preferably 2 seconds), analyzes the relation between a point and a line corresponding to the changed layout logic (namely the data call relation corresponding to the method), and returns the point and the line to the layout topology rendering module according to a preset format, so that the layout topology rendering module can make an updated layout topology.
It can be seen from the above embodiments that, in the present invention, by splitting the layout topology into a plurality of layout logics, splitting the service code into a plurality of service code segments, and corresponding the service code segments to the layout logics, when a user performs layout logic modification on a certain service code segment, a logic change message can be quickly obtained, and the changed layout logics are determined, so as to update the layout topology according to the changed layout logics, thereby implementing quasi-real-time linkage of the service code and the layout topology, and solving the technical problem that adjustment of related layout logics cannot be fed back to the visualized topology when developers perform related modification on automatically generated service codes after logic layout.
Fig. 2 is a second flowchart of a method for implementing linkage of service codes and layout topology according to an embodiment of the present invention, and as shown in fig. 2, in an embodiment of the present invention, the method for implementing linkage of service codes and layout topology further includes steps S201 to S203.
Step S201, obtaining the layout logic change information of the layout topology, where the layout logic change information includes at least one changed layout logic.
Fig. 4 is a schematic view of a processing flow of quasi-real-time feedback to service code segments after layout topology modification according to an embodiment of the present invention, as shown in fig. 4, in an embodiment of the present invention, for the layout logic modification performed from the layout topology, the layout logic change information of the layout topology is sent to a layout topology analysis module through a monitoring mechanism of a layout topology monitoring module, the layout topology analysis module analyzes the layout logic change information to obtain changed layout logic (i.e., changed layout logic), determines a service code segment corresponding to the changed layout logic according to a corresponding relationship between the layout logic and the service code segment, and finally stores the changed layout logic in a layout logic information cache.
Step S202, determining the business code segment corresponding to the changed editing logic.
Step S203, the corresponding arrangement logic processing module of the corresponding service code segment is started to modify the arrangement logic corresponding to the corresponding service code segment.
In the embodiment of the invention, the arrangement logic processing module modifies the arrangement logic corresponding to the service code segment according to the changed arrangement logic.
In the embodiment shown in fig. 4, the orchestration logic scheduling module subscribes the information of the theme from the orchestration logic information cache, and if there is an altered orchestration logic, the orchestration logic processing module corresponding to the corresponding service code segment is called to perform orchestration logic modification processing, and the orchestration logic processing module modifies the orchestration logic in the corresponding service code segment into the altered orchestration logic.
In an optional embodiment of the present invention, after step S203, the method for implementing linkage of service codes and layout topology further includes:
verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the changed arrangement logic, and if so, confirming that the modification is successful.
In the embodiment of the present invention, after the editing logic processing module modifies the editing logic corresponding to the service code segment, a logic change message generated by the modification is stored in the message middleware and is fed back to the editing logic processing module according to the flow of fig. 4, so as to determine whether the editing logic change is implemented in the service code segment. If the confirmation fails, the scheduling information is retransmitted by the scheduling logic scheduling module. When the retry number exceeds the threshold value, alarm information can be sent for manual intervention, and the problem of inconsistency between the topology and the code is prevented.
It can be seen from the above embodiments that the declarative code logic arrangement adopted by the invention is closer to the habit of developers, and the arrangement logic is directly dispersed in the service code segment. The developer can arrange the service logic code in a visual mode, and the service code can be generated in real time after arrangement. When scenes such as code inspection and the like are carried out, if the arrangement logic is found to need to be adjusted, the arrangement logic can be directly modified in a code mode and can be fed back to the arrangement topology in a quasi-real-time mode. The topological graph is consistent with the actual code logic, and the research and development efficiency is improved.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than presented herein.
Based on the same inventive concept, the embodiment of the present invention further provides a device for implementing linkage between a service code and an arrangement topological graph, which can be used to implement the method for implementing linkage between a service code and an arrangement topological graph described in the foregoing embodiment, as described in the following embodiment. Because the principle of the device for realizing the linkage of the service codes and the layout topological graph for solving the problems is similar to the method for realizing the linkage of the service codes and the layout topological graph, the embodiment of the device for realizing the linkage of the service codes and the layout topological graph can refer to the embodiment of the method for realizing the linkage of the service codes and the layout topological graph, and repeated parts are not repeated. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 5 is a first structural block diagram of an apparatus for implementing linkage between service codes and layout topology according to an embodiment of the present invention, and as shown in fig. 5, the apparatus for implementing linkage between service codes and layout topology according to an embodiment of the present invention includes: an editing logic change message acquiring unit 1, a changed editing logic determining unit 2 and a topological graph updating unit 3.
The service code scheduling system comprises a scheduling logic change message acquiring unit 1, configured to acquire a logic change message of scheduling logic corresponding to a service code segment, where the service code includes multiple service code segments, a scheduling topology map corresponding to the service code includes multiple scheduling logics, and each service code segment corresponds to at least one scheduling logic.
And the changed arrangement logic determining unit 2 is used for starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic.
And the topological graph updating unit 3 is used for updating the layout topological graph according to the changed layout logic.
Fig. 6 is a second structural block diagram of the apparatus for implementing linkage between service codes and layout topology according to the embodiment of the present invention, and as shown in fig. 6, the apparatus for implementing linkage between service codes and layout topology according to the embodiment of the present invention further includes: a topological diagram change information acquisition unit 4, a service code segment determination unit 5 and an orchestration logic modification unit 6.
A topology map change information obtaining unit 4, configured to obtain arrangement logic change information of the arrangement topology map, where the arrangement logic change information includes at least one changed arrangement logic.
And a service code segment determining unit 5, configured to determine a service code segment corresponding to the changed orchestration logic.
And the arrangement logic modification unit 6 is used for starting the arrangement logic processing module corresponding to the corresponding service code segment to modify the arrangement logic corresponding to the corresponding service code segment.
In an embodiment of the present invention, the apparatus for implementing linkage of service codes and layout topological graphs further includes:
and the modification verification unit is used for verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the corresponding changed arrangement logic or not, and if so, the modification is confirmed to be successful.
To achieve the above object, according to another aspect of the present application, there is also provided a computer apparatus. As shown in fig. 7, the computer device comprises a memory, a processor, a communication interface and a communication bus, wherein a computer program that can be run on the processor is stored in the memory, and the steps of the method of the above embodiment are realized when the processor executes the computer program.
The processor may be a Central Processing Unit (CPU). The Processor may also be other general purpose processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components, or a combination thereof.
The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs, non-transitory computer executable programs, and units, such as the corresponding program units in the above-described method embodiments of the present invention. The processor executes various functional applications of the processor and the processing of the work data by executing the non-transitory software programs, instructions and modules stored in the memory, that is, the method in the above method embodiment is realized.
The memory may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function; the storage data area may store data created by the processor, and the like. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory located remotely from the processor, and such remote memory may be coupled to the processor via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The one or more units are stored in the memory and when executed by the processor perform the method of the above embodiments.
The specific details of the computer device may be understood by referring to the corresponding related descriptions and effects in the above embodiments, and are not described herein again.
To achieve the above object, according to another aspect of the present application, there is also provided a computer-readable storage medium storing a computer program which, when executed in a computer processor, implements the steps in the above method for implementing linkage of service codes and layout topology. It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic Disk, an optical Disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a Flash Memory (Flash Memory), a Hard Disk (Hard Disk Drive, abbreviated as HDD) or a Solid State Drive (SSD), etc.; the storage medium may also comprise a combination of memories of the kind described above.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and they may alternatively be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, or fabricated separately as individual integrated circuit modules, or fabricated as a single integrated circuit module from multiple modules or steps. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (12)
1. A method for realizing linkage of service codes and arranging topological graphs is characterized by comprising the following steps:
acquiring logic change information of arrangement logics corresponding to service code segments, wherein the service code comprises a plurality of service code segments, an arrangement topological graph corresponding to the service code comprises a plurality of arrangement logics, and each service code segment corresponds to at least one arrangement logic;
starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic;
and updating the layout topological graph according to the changed layout logic.
2. The method for linking service codes with layout topological graph according to claim 1, further comprising:
acquiring the arrangement logic change information of the arrangement topological graph, wherein the arrangement logic change information comprises at least one changed arrangement logic;
determining a business code segment corresponding to the changed editing logic;
and starting the corresponding arrangement logic processing module of the corresponding service code segment to modify the arrangement logic corresponding to the corresponding service code segment.
3. The method for linking service codes with layout topological graphs according to claim 2, wherein after modifying the layout logic corresponding to the corresponding service code segment, the method further comprises:
verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the changed arrangement logic, and if so, confirming that the modification is successful.
4. The method of claim 1, wherein said service code segment comprises at least one data processing method and said layout logic comprises at least one data call relationship.
5. The method of claim 1, wherein the orchestration logic is located at the declaration of the corresponding service code segment.
6. An apparatus for implementing linkage of service codes and arranging topological graph, comprising:
the service code scheduling system comprises a scheduling logic change message acquiring unit, a scheduling logic change message acquiring unit and a scheduling logic change message acquiring unit, wherein the scheduling logic change message acquiring unit is used for acquiring a logic change message of scheduling logic corresponding to a service code segment, the service code comprises a plurality of service code segments, a scheduling topological graph corresponding to the service code comprises a plurality of scheduling logics, and each service code segment corresponds to at least one scheduling logic;
the changed arrangement logic determining unit is used for starting an arrangement logic processing module corresponding to the service code segment according to the logic change message to analyze the arrangement logic to obtain the changed arrangement logic;
and the topological graph updating unit is used for updating the layout topological graph according to the changed layout logic.
7. The apparatus for linking service codes with layout topology according to claim 6, further comprising:
a topological diagram change information acquiring unit, configured to acquire arrangement logic change information of the arrangement topological diagram, where the arrangement logic change information includes at least one changed arrangement logic;
a service code segment determining unit, configured to determine a service code segment corresponding to the changed orchestration logic;
and the arrangement logic modification unit is used for starting an arrangement logic processing module corresponding to the corresponding service code segment to modify the arrangement logic corresponding to the corresponding service code segment.
8. The apparatus for linking service codes with layout topology according to claim 7, further comprising:
and the modification verification unit is used for verifying whether the modified arrangement logic corresponding to the corresponding service code segment is consistent with the corresponding changed arrangement logic or not, and if so, the modification is confirmed to be successful.
9. The apparatus for implementing linkage of service code and orchestration topology graph according to claim 6, wherein the service code segment comprises at least one data processing method, and the orchestration logic comprises at least one data call relation.
10. The apparatus for implementing linkage of service code and orchestration topology according to claim 6, wherein the orchestration logic is located at the declaration of the corresponding service code segment.
11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of any of claims 1 to 5 when executing the computer program.
12. A computer-readable storage medium, in which a computer program is stored which, when executed in a computer processor, implements the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010605100.2A CN111782201B (en) | 2020-06-29 | 2020-06-29 | Method and device for realizing linkage of service codes and topology map arrangement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010605100.2A CN111782201B (en) | 2020-06-29 | 2020-06-29 | Method and device for realizing linkage of service codes and topology map arrangement |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111782201A true CN111782201A (en) | 2020-10-16 |
| CN111782201B CN111782201B (en) | 2023-07-07 |
Family
ID=72760310
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010605100.2A Active CN111782201B (en) | 2020-06-29 | 2020-06-29 | Method and device for realizing linkage of service codes and topology map arrangement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111782201B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112394962A (en) * | 2020-11-27 | 2021-02-23 | 中国银联股份有限公司 | Service execution method, service logic updating method and device |
| CN113282318A (en) * | 2021-05-21 | 2021-08-20 | 中国邮政储蓄银行股份有限公司 | Service implementation method and device |
| CN116107549A (en) * | 2023-04-13 | 2023-05-12 | 成都新希望金融信息有限公司 | Logic arrangement and change service logic processing method, system and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180302335A1 (en) * | 2017-04-18 | 2018-10-18 | International Business Machines Corporation | Orchestrating computing resources between different computing environments |
| CN109324793A (en) * | 2018-10-24 | 2019-02-12 | 北京奇虎科技有限公司 | Support the processing system and method for algorithm assembly |
| CN110958170A (en) * | 2019-11-25 | 2020-04-03 | 中国联合网络通信集团有限公司 | Network interconnection method and device |
-
2020
- 2020-06-29 CN CN202010605100.2A patent/CN111782201B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180302335A1 (en) * | 2017-04-18 | 2018-10-18 | International Business Machines Corporation | Orchestrating computing resources between different computing environments |
| CN109324793A (en) * | 2018-10-24 | 2019-02-12 | 北京奇虎科技有限公司 | Support the processing system and method for algorithm assembly |
| CN110958170A (en) * | 2019-11-25 | 2020-04-03 | 中国联合网络通信集团有限公司 | Network interconnection method and device |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112394962A (en) * | 2020-11-27 | 2021-02-23 | 中国银联股份有限公司 | Service execution method, service logic updating method and device |
| CN112394962B (en) * | 2020-11-27 | 2024-01-26 | 中国银联股份有限公司 | Service execution method, service logic updating method and device |
| CN113282318A (en) * | 2021-05-21 | 2021-08-20 | 中国邮政储蓄银行股份有限公司 | Service implementation method and device |
| CN116107549A (en) * | 2023-04-13 | 2023-05-12 | 成都新希望金融信息有限公司 | Logic arrangement and change service logic processing method, system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111782201B (en) | 2023-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20190155805A1 (en) | Historical data replay utilizing a computer system | |
| CN111782201B (en) | Method and device for realizing linkage of service codes and topology map arrangement | |
| CN108280023B (en) | Task execution method and device and server | |
| Neamtiu et al. | Cloud software upgrades: Challenges and opportunities | |
| US20200089594A1 (en) | Artificial intelligence for load testing | |
| CN102902558A (en) | Project script file updating system and method as well as script file merging method and device | |
| EP3215947B1 (en) | Application testing | |
| Ibryam et al. | Kubernetes Patterns | |
| Van Der Weide et al. | Versioning for end-to-end machine learning pipelines | |
| US8214245B2 (en) | Method and system for synchronizing inclusive decision branches | |
| CN111026568A (en) | Data and task relation construction method and device, computer equipment and storage medium | |
| CN108491195A (en) | Equipment controls page generation method and system | |
| Nagar et al. | Automated parameterized verification of CRDTs | |
| US20230325181A1 (en) | Code Analysis Method and Related Device | |
| Stevens | Connecting software build with maintaining consistency between models: towards sound, optimal, and flexible building from megamodels | |
| US20190155628A1 (en) | Method for opening up data and functions of terminal application based on reconstruction technology | |
| Tannir | Optimizing Hadoop for MapReduce | |
| CN116226112A (en) | Data cleaning method and device, storage medium and electronic equipment | |
| DE102020108281A1 (en) | PROCEDURES AND DEVICES FOR RECOMMENDING INSTRUCTION ADAPTATIONS TO IMPROVE COMPUTING PERFORMANCE | |
| Seybold et al. | Experiences of models@ run-time with EMF and CDO | |
| Atkinson et al. | On-the-fly emendation of multi-level models | |
| EP3907602A1 (en) | Trustworthy application integration | |
| CN111309297B (en) | Script development system and method | |
| Mogk | A Programming Paradigm for Reliable Applications in a Decentralized Setting | |
| US10949327B2 (en) | Manipulation of complex variables in orchestration applications |
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 |