CN112540812A - Node skipping method and device, storage medium and electronic device - Google Patents
Node skipping method and device, storage medium and electronic device Download PDFInfo
- Publication number
- CN112540812A CN112540812A CN202011517995.0A CN202011517995A CN112540812A CN 112540812 A CN112540812 A CN 112540812A CN 202011517995 A CN202011517995 A CN 202011517995A CN 112540812 A CN112540812 A CN 112540812A
- Authority
- CN
- China
- Prior art keywords
- node
- current task
- instance
- task node
- execution flow
- 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 112
- 230000009191 jumping Effects 0.000 claims abstract description 56
- 230000008569 process Effects 0.000 claims abstract description 38
- 230000015654 memory Effects 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 4
- 230000009969 flowable effect Effects 0.000 abstract description 10
- 238000010586 diagram Methods 0.000 description 10
- 238000012545 processing Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 8
- 230000002159 abnormal effect Effects 0.000 description 6
- 230000005540 biological transmission Effects 0.000 description 6
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012550 audit Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000010295 mobile communication Methods 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
- G06F9/4482—Procedural
- G06F9/4484—Executing subprograms
-
- 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
- G06F9/4488—Object-oriented
- G06F9/449—Object-oriented method invocation or resolution
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application discloses a node skipping method and device, a storage medium and an electronic device. Wherein, the method comprises the following steps: determining a current task node and a target node of the current task node; calling a corresponding execution flow instance according to the state of the current task node, and jumping from the current task node to the target node, wherein by adopting the scheme, any node jumping of the flowable flow can be realized, and after the flow jumps, the normal operation of the flow is not influenced; the method is compatible with any type of BPMN active nodes without problems or manual debugging, and can solve the technical problem that the operation of introducing the jump node in the process is complex.
Description
Technical Field
The application relates to the field of internet, in particular to a node jumping method and device, a storage medium and an electronic device.
Background
flowable is a Java workflow open source framework launched in 2017 for managing processes based on BPMN (process modeling and labeling) specifications.
In the flowable workflow framework, the design and the flow of the flow chart need to meet the specification of BPMN, and the flow nodes cannot flow to the flow nodes without line segment direction. In the daily flow chart, each node needs a refute function to refute the current flow node to the previous node, the applicant node or any node. When a node is added to the process, a developer needs to implement the rejection function of the node, when the number of nodes is increased, the amount of development required by the developer is increased, the process diagram becomes more and more complex, and the line segment in the process is complicated.
Under special conditions, a certain process needs to jump to a certain node from a current process node, so that an intermediate link is omitted, and quick signing and reviewing are realized. On the road with the informationized realization, the problem bug on the system flow can not be avoided, when the system monitors that the flow is abnormal, the flow skipping mode is directly skipped to the abnormal processing node, and the administrator is informed to process, so that the effect of timely processing the flow abnormity is achieved.
Aiming at the problem that the operation of introducing the jump node in the process is complex, an effective solution is not provided at present.
Disclosure of Invention
The embodiment of the application provides a node jumping method and device, a storage medium and an electronic device, so as to at least solve the technical problem that the operation of introducing a jumping node in a flow is complex.
According to an aspect of an embodiment of the present application, a node hopping method is provided, including: determining a current task node and a target node of the current task node; and calling a corresponding execution flow instance according to the state of the current task node, and jumping to the target node from the current task node.
Optionally, when a corresponding execution flow instance is called according to the state of the current task node, the top-level execution flow instance of the main flow of the current task node is called under the condition that the current task node is in the main flow; and under the condition that the current task node is in the sub-flow, calling a corresponding execution flow instance according to the jumping condition of the sub-flow.
Optionally, when the corresponding execution flow instance is called according to the skip condition of the sub-flow, under the condition that the sub-flow is an internal skip, the corresponding execution flow instance is called according to the judgment result of whether the current task node is a multi-instance node; and under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located.
Optionally, when the corresponding execution flow instance is called according to the judgment result of whether the current task node is the multi-instance node, the top-level execution flow instance of the multi-instance node is called under the condition that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, when the corresponding execution flow instance is called according to the process in which the target node is located, under the condition that the target node is in the main process, the corresponding execution flow instance is called according to a judgment result of whether the current task node is a multi-instance node; and under the condition that the target node is in the sub-process, calling a top-level sub-process execution flow instance of the current task node.
Optionally, when the corresponding execution flow instance is called according to the determination result of whether the current task node is the multi-instance node, the top-level execution flow instance of the multi-instance node is called under the condition that the current task node is the multi-instance node.
Optionally, when the corresponding execution flow instance is called according to the judgment result of whether the current task node is the multi-instance node, the execution flow instance of the current task node is called under the condition that the current task node is not the multi-instance node.
According to another aspect of the embodiments of the present application, there is also provided a node jumping device, including: the determining unit is used for determining a current task node and a target node of the current task node; and the jumping unit is used for calling the corresponding execution flow instance according to the state of the current task node and jumping from the current task node to the target node.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to the state of the current task node, call a main flow top-level execution flow instance of the current task node when the current task node is in the main flow; and under the condition that the current task node is in the sub-flow, calling a corresponding execution flow instance according to the jumping condition of the sub-flow.
Optionally, the jumping unit is further configured to, when a corresponding execution stream instance is called according to a jumping condition of a sub-flow, call a corresponding execution stream instance according to a determination result of whether a current task node is a multi-instance node when the sub-flow is an internal jump; and under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call a top-level execution flow instance of the multi-instance node in a case that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to the process in which the target node is located, call the corresponding execution flow instance according to a determination result of whether the current task node is a multi-instance node when the target node is in the main process; and under the condition that the target node is in the sub-process, calling a top-level sub-process execution flow instance of the current task node.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call a top-level execution flow instance of the multi-instance node in a case that the current task node is the multi-instance node.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call the execution flow instance of the current task node when the current task node is not the multi-instance node.
According to another aspect of the embodiments of the present application, there is also provided a storage medium including a stored program which, when executed, performs the above-described method.
According to another aspect of the embodiments of the present application, there is also provided an electronic device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the above method through the computer program.
In the embodiment of the application, a current task node and a target node of the current task node are determined; calling a corresponding execution flow instance according to the state of the current task node, and jumping from the current task node to the target node, wherein by adopting the scheme, any node jumping of the flowable flow can be realized, and after the flow jumps, the normal operation of the flow is not influenced; the method is compatible with any type of BPMN active nodes without problems or manual debugging, and can solve the technical problem that the operation of introducing the jump node in the process is complex.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow chart of an alternative node hopping method according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an alternative node flow according to an embodiment of the present application;
FIG. 3 is a schematic diagram of an alternative node hopping scheme according to an embodiment of the present application;
FIG. 4 is a schematic diagram of an alternative node hopping apparatus according to an embodiment of the present application;
and
fig. 5 is a block diagram of a terminal according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all 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 application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, 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.
The development of a scheme based on free jump is particularly important, and according to one aspect of the embodiments of the present application, an embodiment of a node jump method is provided. Fig. 1 is a flowchart of an optional node hopping method according to an embodiment of the present application, and as shown in fig. 1, the method may include the following steps:
and step S1, determining the current task node and the target node of the current task node.
In step S2, a corresponding execution flow instance is called according to the state of the current task node (e.g. whether it is in the main flow or the sub-flow), and a jump is made from the current task node to the target node, where the flow instance is equivalent to the program code indicating "jump from the current task node to the target node", and by executing this program code, a jump from the current task node to the target node can be realized.
Optionally, when a corresponding execution flow instance is called according to the state of the current task node, the top-level execution flow instance of the main flow of the current task node is called under the condition that the current task node is in the main flow; and under the condition that the current task node is in the sub-flow, calling a corresponding execution flow instance according to the jumping condition of the sub-flow.
Optionally, when the corresponding execution flow instance is called according to the skip condition of the sub-flow, under the condition that the sub-flow is an internal skip, the corresponding execution flow instance is called according to the judgment result of whether the current task node is a multi-instance node; and under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located.
Optionally, when the corresponding execution flow instance is called according to the judgment result of whether the current task node is the multi-instance node, the top-level execution flow instance of the multi-instance node is called under the condition that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, when the corresponding execution flow instance is called according to the process in which the target node is located, under the condition that the target node is in the main process, the corresponding execution flow instance is called according to a judgment result of whether the current task node is a multi-instance node; and under the condition that the target node is in the sub-process, calling a top-level sub-process execution flow instance of the current task node.
Optionally, when the corresponding execution flow instance is called according to the determination result of whether the current task node is the multi-instance node, the top-level execution flow instance of the multi-instance node is called under the condition that the current task node is the multi-instance node.
Optionally, when the corresponding execution flow instance is called according to the judgment result of whether the current task node is the multi-instance node, the execution flow instance of the current task node is called under the condition that the current task node is not the multi-instance node.
Through the steps, the current task node and the target node of the current task node are determined; calling a corresponding execution flow instance according to the state of the current task node, and jumping from the current task node to the target node, wherein by adopting the scheme, any node jumping of the flowable flow can be realized, and after the flow jumps, the normal operation of the flow is not influenced; the method is compatible with any type of BPMN active nodes without problems or manual debugging, and can solve the technical problem that the operation of introducing the jump node in the process is complex.
By adopting the scheme, the refuting and skipping of all nodes of the flow can be realized through the flowable arbitrary flow node skipping interface. As an alternative example, the technical solution of the present application is further described below with reference to specific embodiments.
In fig. 2, a material application, a material inspection, a processing node 1, a processing node 2, a processing node 3, and a material audit, wherein 6 nodes are common user nodes (UserTask); wherein, the sub-process of reporting the wrong materials is a multi-instance sub-process (Parallel sub-process), and finally, the sub-process of processing the materials is a common sub-process (sub-process). This type of flow diagram is involved in enterprise business, so the flow hopping functionality needs to be compatible with flow diagrams that contain any type of activity.
FIG. 3 is the logic to implement the flowable jump:
s10, acquiring a task instance node and a target node in the process of the flowable, acquiring a task instance to be skipped, and acquiring a process node according to the task instance; and acquiring a target node to be jumped to.
S20, it is determined whether the node where the current task is located is inside the main flow (i.e., the outermost flow node) or the sub-flow.
And S30, the current task node is in the main flow, and the top-level execution flow instance of the current main flow is obtained.
And S40, judging whether the current task node is in the sub-process, and whether the target node to be jumped to is jumped inside the current sub-process or jumped outside the current sub-process.
And S50, judging whether the current task node is a multi-instance node.
S60, acquiring the top-level execution flow instance of the current multi-instance task node.
And S70, acquiring a parent execution flow instance of the current task node.
S80, whether the target node is in the sub-process or not is judged by jumping from the inside of the sub-process to the outside.
And S90, the target node is in the main flow, and whether the current task node is a multi-instance node is judged.
S100, acquiring a top-level execution flow instance of the current multi-instance task node.
S110, acquiring the execution flow instance of the current node.
And S120, the target node is positioned in the sub-process, and the top-level execution flow example of the current task node under the sub-process is obtained.
S130, calling a method in flowable interface Runtimes service, transmitting a flow execution flow instance to be jumped and a target node, and finally executing the jump.
Through any jump function, a universal flow refund function interface can be realized, all flow nodes are adapted, the refund function does not need to be repeatedly developed, the development efficiency is improved, and the operation and maintenance cost is reduced; through the arbitrary skip function, the intermediate link of the process can be saved, the process can skip to the designated node, and the quick approval effect can be realized; the general arbitrary skip function can monitor the abnormal condition of the process, and when the abnormal condition occurs, the process node can be forcibly skipped to the abnormal processing node and sent to the administrator to process the abnormal condition of the process in time.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method according to the embodiments of the present application.
According to another aspect of the embodiment of the present application, there is also provided a node hopping apparatus for implementing the node hopping method. Fig. 4 is a schematic diagram of an alternative node jump apparatus according to an embodiment of the present application, and as shown in fig. 4, the apparatus may include:
a determining unit 41, configured to determine a current task node and a target node of the current task node; and a jumping unit 43, configured to call a corresponding execution stream instance according to the state of the current task node, and jump from the current task node to the target node.
It should be noted that the determining unit 41 in this embodiment may be configured to execute step S1 in this embodiment, and the jumping unit 43 in this embodiment may be configured to execute step S2 in this embodiment.
Determining a current task node and a target node of the current task node through the modules; calling a corresponding execution flow instance according to the state of the current task node, and jumping from the current task node to the target node, wherein by adopting the scheme, any node jumping of the flowable flow can be realized, and after the flow jumps, the normal operation of the flow is not influenced; the method is compatible with any type of BPMN active nodes without problems or manual debugging, and can solve the technical problem that the operation of introducing the jump node in the process is complex.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to the state of the current task node, call a main flow top-level execution flow instance of the current task node when the current task node is in the main flow; and under the condition that the current task node is in the sub-flow, calling a corresponding execution flow instance according to the jumping condition of the sub-flow.
Optionally, the jumping unit is further configured to, when a corresponding execution stream instance is called according to a jumping condition of a sub-flow, call a corresponding execution stream instance according to a determination result of whether a current task node is a multi-instance node when the sub-flow is an internal jump; and under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call a top-level execution flow instance of the multi-instance node in a case that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to the process in which the target node is located, call the corresponding execution flow instance according to a determination result of whether the current task node is a multi-instance node when the target node is in the main process; and under the condition that the target node is in the sub-process, calling a top-level sub-process execution flow instance of the current task node.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call a top-level execution flow instance of the multi-instance node in a case that the current task node is the multi-instance node.
Optionally, the jumping unit is further configured to, when a corresponding execution flow instance is called according to a determination result of whether the current task node is a multi-instance node, call the execution flow instance of the current task node when the current task node is not the multi-instance node.
It should be noted here that the modules described above are the same as the examples and application scenarios implemented by the corresponding steps, but are not limited to the disclosure of the above embodiments. It should be noted that the modules as a part of the apparatus may run in a corresponding hardware environment, and may be implemented by software, or may be implemented by hardware, where the hardware environment includes a network environment.
According to another aspect of the embodiment of the present application, a server or a terminal for implementing the hopping method of the node is also provided.
Fig. 5 is a block diagram of a terminal according to an embodiment of the present application, and as shown in fig. 5, the terminal may include: one or more processors 201 (only one shown), memory 203, and transmission means 205, as shown in fig. 5, the terminal may further comprise an input-output device 207.
The memory 203 may be configured to store software programs and modules, such as program instructions/modules corresponding to the node jump method and apparatus in the embodiment of the present application, and the processor 201 executes various functional applications and data processing by running the software programs and modules stored in the memory 203, that is, implements the node jump method described above. The memory 203 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 203 may further include memory located remotely from the processor 201, which may be connected to the terminal over 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 transmission device 205 is used for receiving or sending data via a network, and can also be used for data transmission between a processor and a memory. Examples of the network may include a wired network and a wireless network. In one example, the transmission device 205 includes a Network adapter (NIC) that can be connected to a router via a Network cable and other Network devices to communicate with the internet or a local area Network. In one example, the transmission device 205 is a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
Wherein the memory 203 is specifically used for storing application programs.
The processor 201 may call the application stored in the memory 203 via the transmission means 205 to perform the following steps:
determining a current task node and a target node of the current task node; and calling a corresponding execution flow instance according to the state of the current task node, and jumping to the target node from the current task node.
The processor 201 is further configured to perform the following steps:
when calling a corresponding execution flow instance according to the state of the current task node, calling a main flow top-level execution flow instance of the current task node under the condition that the current task node is in a main flow; under the condition that the current task node is in the sub-process, calling a corresponding execution flow instance according to the jumping condition of the sub-process;
when calling a corresponding execution flow instance according to the jumping condition of a sub-flow, calling the corresponding execution flow instance according to the judgment result of whether a current task node is a multi-instance node or not under the condition that the sub-flow is internal jumping; under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located;
when calling a corresponding execution flow instance according to the judgment result of whether the current task node is the multi-instance node, calling a top-level execution flow instance of the multi-instance node under the condition that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
It can be understood by those skilled in the art that the structure shown in fig. 5 is only an illustration, and the terminal may be a terminal device such as a smart phone (e.g., an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, and a Mobile Internet Device (MID), a PAD, etc. Fig. 5 is a diagram illustrating a structure of the electronic device. For example, the terminal may also include more or fewer components (e.g., network interfaces, display devices, etc.) than shown in FIG. 5, or have a different configuration than shown in FIG. 5.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by a program instructing hardware associated with the terminal device, where the program may be stored in a computer-readable storage medium, and the storage medium may include: flash disks, Read-Only memories (ROMs), Random Access Memories (RAMs), magnetic or optical disks, and the like.
Embodiments of the present application also provide a storage medium. Alternatively, in this embodiment, the storage medium may be used to execute a program code of a node jump method.
Optionally, in this embodiment, the storage medium may be located on at least one of a plurality of network devices in a network shown in the above embodiment.
Optionally, in this embodiment, the storage medium is configured to store program code for performing the following steps:
determining a current task node and a target node of the current task node; and calling a corresponding execution flow instance according to the state of the current task node, and jumping to the target node from the current task node.
Optionally, the storage medium is further arranged to store program code for performing the steps of:
when calling a corresponding execution flow instance according to the state of the current task node, calling a main flow top-level execution flow instance of the current task node under the condition that the current task node is in a main flow; under the condition that the current task node is in the sub-process, calling a corresponding execution flow instance according to the jumping condition of the sub-process;
when calling a corresponding execution flow instance according to the jumping condition of a sub-flow, calling the corresponding execution flow instance according to the judgment result of whether a current task node is a multi-instance node or not under the condition that the sub-flow is internal jumping; under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located;
when calling a corresponding execution flow instance according to the judgment result of whether the current task node is the multi-instance node, calling a top-level execution flow instance of the multi-instance node under the condition that the current task node is the multi-instance node; in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments, and this embodiment is not described herein again.
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic or optical disk, and other various media capable of storing program codes.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
The integrated unit in the above embodiments, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in the above computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or a part of or all or part of the technical solution contributing to the prior art may be embodied in the form of a software product stored in a storage medium, and including instructions for causing one or more computer devices (which may be personal computers, servers, network devices, or the like) to execute all or part of the steps of the method described in the embodiments of the present application.
In the above embodiments of the present application, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed client may be implemented in other manners. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, units or modules, and may be in an electrical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The foregoing is only a preferred embodiment of the present application and it should be noted that those skilled in the art can make several improvements and modifications without departing from the principle of the present application, and these improvements and modifications should also be considered as the protection scope of the present application.
Claims (10)
1. A node jump method is characterized by comprising the following steps:
determining a current task node and a target node of the current task node;
and calling a corresponding execution flow instance according to the state of the current task node, and jumping to the target node from the current task node.
2. The method of claim 1, wherein invoking the corresponding execution flow instance according to the state of the current task node comprises at least one of:
under the condition that the current task node is in the main flow, calling a main flow top-layer execution flow instance of the current task node;
and under the condition that the current task node is in the sub-flow, calling a corresponding execution flow instance according to the jumping condition of the sub-flow.
3. The method of claim 2, wherein invoking the corresponding execution flow instance according to the jump condition of the sub-flow comprises:
under the condition that the sub-process is internal jumping, calling a corresponding execution flow instance according to the judgment result of whether the current task node is a multi-instance node;
and under the condition that the sub-process is external jumping, calling a corresponding execution flow instance according to the process where the target node is located.
4. The method of claim 3, wherein invoking the corresponding execution flow instance according to the determination of whether the current task node is a multi-instance node comprises:
calling a top-level execution flow instance of the multi-instance node under the condition that the current task node is the multi-instance node;
in the event that the current task node is not a multi-instance node, a parent execution flow instance of the current task node is invoked.
5. The method of claim 3, wherein the invoking the corresponding execution flow instance according to the flow in which the target node is located comprises:
under the condition that the target node is in the main flow, calling a corresponding execution flow instance according to a judgment result of whether the current task node is a multi-instance node;
and under the condition that the target node is in the sub-process, calling a top-level sub-process execution flow instance of the current task node.
6. The method of claim 5, wherein invoking the corresponding execution flow instance according to the determination of whether the current task node is a multi-instance node comprises:
in the case that the current task node is a multi-instance node, a top-level execution flow instance of the multi-instance node is invoked.
7. The method of claim 5, wherein invoking the corresponding execution flow instance according to the determination of whether the current task node is a multi-instance node comprises:
and in the case that the current task node is not the multi-instance node, calling the execution flow instance of the current task node.
8. A node jump apparatus, comprising:
the determining unit is used for determining a current task node and a target node of the current task node;
and the jumping unit is used for calling the corresponding execution flow instance according to the state of the current task node and jumping from the current task node to the target node.
9. A storage medium, characterized in that the storage medium comprises a stored program, wherein the program when executed performs the method of any of the preceding claims 1 to 7.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor executes the method of any of the preceding claims 1 to 7 by means of the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011517995.0A CN112540812B (en) | 2020-12-21 | 2020-12-21 | Node jump method and device, storage medium and electronic device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011517995.0A CN112540812B (en) | 2020-12-21 | 2020-12-21 | Node jump method and device, storage medium and electronic device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112540812A true CN112540812A (en) | 2021-03-23 |
| CN112540812B CN112540812B (en) | 2023-07-25 |
Family
ID=75019240
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011517995.0A Active CN112540812B (en) | 2020-12-21 | 2020-12-21 | Node jump method and device, storage medium and electronic device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112540812B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100122251A1 (en) * | 2008-11-13 | 2010-05-13 | International Business Machines Corporation | Realizing jumps in an executing process instance |
| CN109670664A (en) * | 2018-09-11 | 2019-04-23 | 深圳平安财富宝投资咨询有限公司 | Flow implementation method, user equipment, storage medium and device based on workflow |
| CN109684057A (en) * | 2018-12-11 | 2019-04-26 | 咪咕文化科技有限公司 | Task processing method and device and storage medium |
| CN110147986A (en) * | 2019-05-21 | 2019-08-20 | 天津卡达克数据有限公司 | Flow node jump method, device, server and storage medium |
| CN110517018A (en) * | 2019-08-26 | 2019-11-29 | 深圳前海环融联易信息科技服务有限公司 | A kind of any jump method of node based on activiti workflow and device |
-
2020
- 2020-12-21 CN CN202011517995.0A patent/CN112540812B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100122251A1 (en) * | 2008-11-13 | 2010-05-13 | International Business Machines Corporation | Realizing jumps in an executing process instance |
| CN109670664A (en) * | 2018-09-11 | 2019-04-23 | 深圳平安财富宝投资咨询有限公司 | Flow implementation method, user equipment, storage medium and device based on workflow |
| CN109684057A (en) * | 2018-12-11 | 2019-04-26 | 咪咕文化科技有限公司 | Task processing method and device and storage medium |
| CN110147986A (en) * | 2019-05-21 | 2019-08-20 | 天津卡达克数据有限公司 | Flow node jump method, device, server and storage medium |
| CN110517018A (en) * | 2019-08-26 | 2019-11-29 | 深圳前海环融联易信息科技服务有限公司 | A kind of any jump method of node based on activiti workflow and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112540812B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11815991B2 (en) | Systems and methods to reprogram mobile devices including a cross-matrix controller to port connection | |
| JP6900531B2 (en) | Systems, methods, equipment, and computer program products for providing mobile device support services | |
| WO2020027954A1 (en) | Implementation of compliance settings by a mobile device for compliance with a configuration scenario | |
| MX2014012024A (en) | System, method, apparatus, and computer program product for providing mobile device support services. | |
| US10901830B2 (en) | Electronic checklist | |
| CN108228444B (en) | Test method and device | |
| US8850398B1 (en) | Automated testing of application programs from an application program ecosystem | |
| CN111008026A (en) | Cluster management method, device and system | |
| CN112181677A (en) | Service processing method and device, storage medium and electronic device | |
| CN111147600B (en) | Service execution method and terminal under cluster environment | |
| CN107526584B (en) | Data access method and device | |
| CN113885971A (en) | State management method and device based on self-adaptive platform system | |
| CN112540812A (en) | Node skipping method and device, storage medium and electronic device | |
| US10291498B1 (en) | Mobile communication device diagnostic client and error remediation sharing | |
| CN111131198B (en) | Updating method and device for network security policy configuration | |
| CN107678928B (en) | Application program processing method and server | |
| US20130165099A1 (en) | Enhanced System and Method for Custom Programming of Large Groups of Phones Without Requiring Additional Equipment | |
| CN114157725A (en) | Equipment linkage method and device, server, electronic equipment and storage medium | |
| US20160379124A1 (en) | System and method of proactive self-care for electronic devices | |
| CN114546842A (en) | Interface test method and device, storage medium and electronic equipment | |
| CN112783451A (en) | Time-consuming abnormity analysis method and system based on interceptor and storage medium | |
| CN110609781A (en) | Interface test method, device and storage medium | |
| CN110286936A (en) | Hot restorative procedure, device, electronic equipment and storage medium | |
| US20110153648A1 (en) | Dynamic tasking-masking server and method for dynamically configuring adaptive agents for persistent query of mobile apparatus | |
| CN113434399B (en) | Service node log processing method and device, storage medium and electronic 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |