CN117130752A - Data processing method and device and electronic equipment - Google Patents

Abstract

The embodiment of the invention discloses a data processing method, a data processing device and electronic equipment. One embodiment of the method comprises the following steps: displaying an application flow on a flow editing interface of an application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps; responsive to an end node adding operation for the first processing node, adding a first end node at a flow position indicated by the first processing node; and responding to the information adding operation aiming at the first ending node, acquiring first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of an application corresponding to an application flow to the first ending node. Thus, a new data processing mode is provided.

Description

Data processing method and device and electronic equipment

Technical Field

The disclosure relates to the field of computer technology, and in particular, to a data processing method, a data processing device and electronic equipment.

Background

With the development of computers, users can implement various functions using electronic devices. For example, a user may obtain a service through an electronic device.

In some scenarios, the Service (Xaas) is a behavior that serves capabilities. In an application platform, i.e., a service system, an infrastructure or platform associated with the application development flow may be provided, such as a flow diagram for an application may be edited in a canvas provided by the system.

Disclosure of Invention

This disclosure is provided in part to introduce concepts in a simplified form that are further described below in the detailed description. This disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

In a first aspect, an embodiment of the present disclosure provides a data processing method, including: displaying an application flow on a flow editing interface of an application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps; responsive to an end node adding operation for the first processing node, adding a first end node at a flow position indicated by the first processing node; and responding to the information adding operation aiming at the first ending node, acquiring first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of an application corresponding to an application flow to the first ending node.

In a second aspect, embodiments of the present disclosure provide a data processing apparatus, including: the display unit is used for displaying an application flow on the flow editing interface of the application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps; an adding unit, configured to add a first end node at a flow position indicated by the first processing node in response to an end node adding operation for the first processing node; the binding unit is used for responding to the information adding operation aiming at the first ending node, obtaining the first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of the application corresponding to the application flow from the application to the first ending node.

In a third aspect, an embodiment of the present disclosure provides a data processing method, including: executing an application flow in an application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node; and in response to execution of the application flow to the end node, displaying at least part of the end information bound by the end node.

In a fourth aspect, an embodiment of the present disclosure provides a data processing apparatus, including: the execution module is used for executing the application flow in the application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node; and the display module is used for responding to the execution of the application flow to the ending node and displaying at least part of ending information bound by the ending node.

In a fifth aspect, embodiments of the present disclosure provide an electronic device, including: one or more processors; storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the data processing method as described in the first aspect.

In a sixth aspect, embodiments of the present disclosure provide a computer readable medium having stored thereon a computer program which, when executed by a processor, implements the steps of the data processing method according to the first aspect.

The data processing method, the data processing device and the electronic equipment provided by the embodiment of the disclosure display an application flow including a first processing node at an application flow writing node, add an end node to the application flow at the first processing node in response to an end node adding operation, and add first end information to the first end node in response to an information adding operation, wherein the first end information can be used for describing an execution result of the application flow appointed to the first end node. Therefore, the flow state can be defined according to the business logic corresponding to the application flow, and the development efficiency is improved.

Drawings

The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.

FIG. 1 is a flow chart of one embodiment of a data processing method according to the present disclosure;

2A, 2B, 2C, 2D are schematic diagrams of one application scenario of a data processing method according to the present disclosure;

FIG. 3A is a flow chart of one embodiment of a data processing method according to the present disclosure;

FIG. 3B is a schematic diagram of one application scenario of a data processing method according to the present disclosure;

FIG. 3C is a schematic diagram of one application scenario of a data processing method according to the present disclosure;

FIG. 4 is a schematic diagram of a structure of one embodiment of a data processing apparatus according to the present disclosure;

FIG. 5 is a schematic diagram of a structure of one embodiment of a data processing apparatus according to the present disclosure;

FIG. 6 is an exemplary system architecture in which a data processing method of one embodiment of the present disclosure may be applied;

fig. 7 is a schematic view of a basic structure of an electronic device provided according to an embodiment of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure have been shown in the accompanying drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order and/or performed in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

The term "including" and variations thereof as used herein are intended to be open-ended, i.e., including, but not limited to. The term "based on" is based at least in part on. The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments. Related definitions of other terms will be given in the description below.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.

The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

In one or more embodiments of the present disclosure, a Service (Xaas) is a behavior that serves capabilities, by redefining the basic form of the capabilities to be characterized by the infrastructure, thereby reconstructing the boundaries of the capabilities, making them easy to use, provide, combine or extend. For example, platform as a service (PaaS), infrastructure as a service (IaaS), and software as a service (SaaS).

In one or more embodiments of the present disclosure, in the context of a point-of-care service (Xaas), and in particular in an application platform-of-service scenario (APaaS), a cloud computing form of an application software platform may be provided by a third party, primarily towards developers and programmers, that allows users to develop, run and manage their own applications without building and maintaining the infrastructure or platform typically associated with the process. In a platform services system, a flow diagram may be edited in a canvas that supports the manual addition of end nodes (which may also be referred to as end steps).

In one or more embodiments of the present disclosure, after the conditional branch adds the end node, the capability of different branches to end according to different service expectations may be implemented to configure end states, response codes, and response descriptions. Therefore, whether the ending states of different ending nodes succeed or fail can be defined, and the problem that a developer cannot define the flow state according to business logic is solved. The response codes and the response descriptions of different end nodes are defined, and the execution paths of the flow can be quickly identified in the log. In addition, the response code and the response description can be used for page configuration reference to provide a reference basis for page configuration; for example, the flow judges whether the operator is a service manager, if so, the operation of updating the client is performed, and a successful execution result is returned, if not, the execution failure is returned, and on the response description, the developer can refer to the response description customization because "the client data cannot be updated by a non-manager".

In one or more embodiments of the present disclosure, conditional branches may be automatically laid out and automatically truncated after conditional branches add end nodes on canvas layout. By means of automatic branch cutting, low-cost de-nesting canvas arrangement is achieved, the readability of the canvas is improved, and the operation cost of a user is reduced.

Referring to FIG. 1, a flow of one embodiment of a data processing method according to the present disclosure is shown. The data processing method as shown in fig. 1 comprises the following steps:

step 101, displaying the application flow on the application flow editing interface.

In this embodiment, the execution body (e.g., server and/or client) of the data processing method may display the application flow on the flow editing interface of the application.

Here, the application flow comprises a first processing node for adding processing steps.

Here, the application flow editing interface may be used to edit the application flow. The application flow may be a flow executed by the application. The application flow displayed by the application flow editing interface can be an application flow which is not edited or is edited. The application flow may correspond to an application; the application corresponding to the application flow may be an application that implements a function according to the flow indicated after the editing of the application flow is completed.

Alternatively, the flow editing interface of the application may be an interface provided by an application platform, i.e. an application system.

Here, the application flow may include at least one step. The application flow may also include a node at which a process step may be added to the application flow in response to the process step adding operation.

Step 102, in response to an end node adding operation for the first processing node, adding a first end node at a flow position indicated by the first processing node.

Here, the execution body may add the first end node at the flow position indicated by the first processing node in response to the end node addition operation.

The end node addition operation may include one operation or a series of operations.

The end node may also be referred to herein as an end step, indicating that the execution of the flow ends at this step (or node) to the end node.

The first processing node may be any node in the flow, which is not limited herein. The first processing node may be located anywhere in the flow. An application flow writer can add an end node to any node in the flow according to the need; to facilitate explanation of this process in this disclosure, a first processing node is used herein to represent a response end node add operation.

Here, the first end node may be added at a flow position indicated by the first node. It should be noted that, for convenience, the first end node is referred to herein as a first end node, and does not constitute a limitation on the end nodes, which may exist in the flow.

Step 103, in response to the information adding operation for the first end node, obtaining the first end information added by the information adding operation, and binding the first end information and the first end node.

Here, the first end information is used to indicate an execution result of the application corresponding to the application flow from executing to the first end node.

Here, the information adding operation may be used to add information for the first end node. The added information may be referred to as first end information. The added first end information may be displayed at the application flow authoring node in response to the adding the first end information. The first end information may include information about the first end node.

Here, the first end information is used to indicate an execution result of the application designation to the first end node corresponding to the application flow. For example, the first end information may be customized as a first character, and different end nodes may correspond to different end information (e.g., customized as different characters). During a single run of the application, if the first end node, a first character may be identified for the execution path at this time; after the application runs multiple times, the execution paths can be clearly distinguished through different characters.

It should be noted that, in the data processing manner provided in the present disclosure, an application flow including a first processing node is displayed at an application flow writing node, and an end node is added to the application flow at the first processing node in response to an end node adding operation, and first end information is added to the first end node in response to an information adding operation, where the first end information may be used to describe an execution result of the application flow specified to the first end node. Therefore, the flow state can be defined according to the business logic corresponding to the application flow, and the development efficiency is improved.

In some implementations, after the application is run, a service manager can conveniently identify an execution path of the flow from the application running log, so that the management efficiency of the application is improved.

In some embodiments, the application flow includes a first conditional determination step, the first conditional determination step being coupled to at least two conditional branches.

Here, the first processing node is located at a first conditional branch of the at least two conditional branches and is adapted to add a subsequent processing step to the first conditional determination step.

By way of example, referring to FIG. 2A, an application flow may be displayed in canvas 201 in FIG. 2A. The application flow may include a first conditional decision step 202, a first conditional branch 203, a second conditional branch 204, a first processing node 205, a second processing node 206, a processing step 207, a second ending node 208. The first processing node 205 is located on a first conditional branch 203. The second processing node 206 is located on the second conditional branch 204. One processing step 207 of the first conditional decision step (i.e. the modify information step) may be located on the second conditional branch; when no processing step is added to the second processing node 206, the processing step 207 may be a subsequent processing step to the first condition judgment step. The second end node 208 may indicate the end of the application flow.

Therefore, by supporting the addition of the processing step on the conditional branch, the subsequent processing of the condition judgment step can be realized quickly, and the efficiency of generating the application flow is improved.

In some embodiments, the first end information includes execution state information. The execution state information may be used to indicate an execution state.

The execution state here includes the result type to which the execution result of the first end node belongs in the business logic of the application flow.

Here, the result type of the application flow execution may include whether the flow execution is logically successful or failed at the end of the flow execution; for example, login success or login failure, modification success or modification failure, success presentation or inability to presentation.

Thus, the problem that a developer cannot define a flow state according to business logic is solved.

In some embodiments, the execution status information includes success information and/or failure information.

Here, the first end information includes state description information corresponding to an execution state indicated by the execution state information.

The state description information may be used to describe the execution state in more detail. The specific content and form of the state description information can be set according to the actual application scene, and are not limited herein.

As an example, the first end information may include state description information corresponding to success information.

As an example, the first end information may include state description information corresponding to failure information.

As an example, referring to fig. 3C, fig. 3C shows that the first end information filled in by the first end node 209 may include execution status information, which may include success information (indicating a success typeface) and failure information (indicating a failure typeface).

Thus, the definition of execution success or execution failure on business logic can be realized. And, state description information corresponding to execution success is set, state description information corresponding to execution failure is set, so that the execution state is described in more detail, and the running process is described in more detail.

In some embodiments, the state description information may include a response code and response description information.

Here, the response code may include a preset character. The response description information may describe the execution state in text.

As an example, referring to fig. 2D, the first result information filled in 209 in the information filling interface of fig. 2D may include execution state information, a response code corresponding to the execution state information, and response description information corresponding to the execution state information. In fig. 2D, response description information corresponding to the failure state is shown (the selected failure state is shown in hatching). Alternatively, although not shown in the drawings, success information may be selected, and a response code and response description information may be configured for the success information.

Therefore, the corresponding response code can be set for the execution state of the first ending node, and the execution state can be conveniently determined according to the response code later. The specific meaning of the execution state can be checked conveniently by responding to the description information, so that the development efficiency is improved; and the response description information can be used as a reference basis of the configuration page, and the execution state of the steps is shown when the page runs by referring to the response description information.

In some embodiments, the step 102 may include: in response to a trigger operation for the first processing node, displaying at least one candidate processing step option, wherein the at least one candidate processing step includes an end node option; in response to a first selection operation for the end node option, a first end node is added at the flow location.

As an example, the first processing node 205 in fig. 2A may be triggered (e.g., perform a click operation) and then a candidate processing step presentation interface 210 as shown in fig. 2B may be presented. In the candidate processing step presentation interface 210, conditional branching options (indicating conditional branching typeface), ending node options (indicating ending typeface), parallel branching options (indicating parallel branching typeface) may be presented. If the end node option is selected, a first end node 209 may be added at the flow location indicated by the first processing node and the area filled for the presentation of information in the first end node. The first end information may be filled in the information filling area of the first end node 209. If the collapse control 211 is triggered, some regions of the first end node 209 may be collapsed, exhibiting a pattern as shown by the second end node 208 shown in FIG. 2A.

Therefore, the end node can be used as a processing step, and the end node (namely the end node option) can be quickly selected in a selection interface of the processing step, so that the end node can be conveniently and quickly added. In addition, when the end node is added, the information filling interface is displayed, and the first end information aiming at the end node can be conveniently added.

In some embodiments, the at least two conditional branches are connected to a second end node.

In some embodiments, the method comprises: in response to the end node addition operation, the first conditional branch is disconnected from the second end node, and the first conditional branch establishes a connection with the first end node.

As an example, referring to fig. 2A, a first end of the first conditional branch 203 is connected to the first conditional determining step 202, and a first end of the second conditional branch 204 is connected to the first conditional determining step 202; a second end of the first conditional branch 203 is connected to a second end node 208 and a second end of the second conditional branch 204 is connected to the second end node 208.

As an example, if the end node option in fig. 2B is selected, the addition of a first end node (as shown in fig. 2C) may be implemented. Meanwhile, the second end of the first conditional branch 203 in the application flow may be automatically disconnected from the second end node 208, and the second end of the first conditional branch 204 may be automatically connected to the first end node.

Thus, after the conditional branch is added with the end node, the conditional branch can be automatically laid out, automatically cut off and connected with the end node. By means of automatic branch cutting, low-cost de-nesting canvas arrangement is achieved, the readability of the canvas is improved, and the operation cost of a user is reduced.

Referring to FIG. 3A, a flow of one embodiment of a data processing method according to the present disclosure is shown. The data processing method as shown in fig. 3A includes the steps of:

step 301, executing an application flow in an application running process corresponding to the application flow.

Here, the application flow includes an end node, where the end node is bound to end information, and the end information is used to indicate an execution result from the application corresponding to the application flow to the end node.

In response to execution of the application flow to the end node, at least a portion of the end information bound by the end node is displayed, step 302.

It is understood that the execution body of the application execution may include a client of the application. If the application flow is executed to the first end node, at least a portion of the content of the first end information may be displayed on the client.

As an example, the flow (e.g., the first condition judgment step of the application flow) judges whether the end user is a service manager, if so, performs an operation of updating data, and returns a result of execution success, if not, returns an execution failure, and the developer may refer to the response description customization because of "no authority" in terms of the failure cause description.

As an example, referring to fig. 3B, fig. 3B shows that a data table 304 (e.g., information of user a and user B, e.g., user a is male in gender and job number 111, e.g., user B is male in gender and job number 222) is displayed on an interface 303 of the terminal. If the login user of the terminal wishes to add the information of the user c, the first condition judgment step judges whether the login user is a service manager. If yes, adding the information of the user c into the data table; if not, the first end node is executed and at least part of the end information 203 of the first end node is displayed (i.e. no rights).

Therefore, the first ending information can be quoted in the running process, and the reason that the application flow is executed to the first ending node is prompted when the application runs, so that the information definition of the application is improved, and the use efficiency of the application is improved.

In some embodiments, the application flow includes a first condition determining step connected to at least two conditional branches, each of the at least two conditional branches being connected to an end node, respectively.

In some embodiments, the method may further comprise: receiving a first query instruction, wherein; responding to a first query instruction, and determining end information corresponding to an end node to which the first condition judging step is executed from historical data generated in the multiple running processes; and generating and displaying a first execution result corresponding to the first condition judgment step according to the determined end information of the first condition judgment step, wherein the first execution result comprises execution state information of the first condition judgment step executed for a plurality of times.

The first query instruction is configured to query an execution result of the first condition determining step in the multiple running process of the application corresponding to the application flow

It will be appreciated that the execution body of the application execution may include a terminal, at the client application execution interface.

The first execution result includes execution state information of the first condition judgment step executed a plurality of times.

The first query instruction is used for querying an execution result of the first condition judging step in the process of operating the application corresponding to the application flow for a plurality of times.

The mass terminal can run the application for a plurality of times, and the first condition judging step can be executed for a plurality of times in the process of running the application for a plurality of times. The execution path of the single first conditional determination step may be to execute the first conditional branch 203 or the second conditional branch 204. Executing the first conditional step multiple times may result in a large amount of data. Since each end node binds the end information, the end information corresponding to each execution end node can be obtained from the running log (including the history data generated in the running process) as the result information. And collecting and displaying result information of multiple runs.

As an example, the execution result of the multiple operations of the first condition judgment step may be displayed on the developer of the configuration page or the electronic device of the application operation manager. Referring to fig. 3C, 4 records each recording the execution-related information of the first condition judgment step are exemplarily shown in fig. 3C. The execution time of the 4 records was 2023.1.1. The execution state of the first record is successful, the response code is X, and the response is described as modification success. The execution states of the second record, the third record and the fourth record are failure, the response code is Y, and the response is described as unauthorized.

Therefore, under the condition that the result information is set for the first condition judging step, the running result of the application can be conveniently obtained in the running management process of the application, so that the running result of each time is simple and clear, a foundation is provided for managing and using the application data, and the management and use efficiency is improved.

With further reference to fig. 4, as an implementation of the method shown in the foregoing figures, the present disclosure provides an embodiment of a data processing apparatus, where the apparatus embodiment corresponds to the method embodiment shown in fig. 3A, and the apparatus may be specifically applied to various electronic devices.

As shown in fig. 4, the data processing apparatus of the present embodiment includes: an execution module 401 and a display module 402; the execution module is used for executing the application flow in the application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node; and the display module is used for responding to the execution of the application flow to the ending node and displaying at least part of ending information bound by the ending node.

In some embodiments, the application flow includes a first condition determining step connected to at least two conditional branches, each of the at least two conditional branches being connected to an end node, respectively.

In some embodiments, the apparatus is further to: receiving a first query instruction, wherein the first query instruction is used for querying an execution result of the first condition judgment step of an application corresponding to the application flow in a multi-time operation process; responding to a first query instruction, and determining end information corresponding to an end node to which the first condition judging step is executed from historical data generated in the multiple running processes; and generating and displaying a first execution result corresponding to the first condition judgment step according to the determined end information of the first condition judgment step, wherein the first execution result comprises execution state information of the first condition judgment step executed for a plurality of times.

In this embodiment, the specific processing and the technical effects brought by the execution module 401 and the display module 402 of the data processing apparatus may refer to the description of step 301 and step 302 in the corresponding embodiment of fig. 3A, which is not repeated herein.

With further reference to fig. 5, as an implementation of the method shown in the foregoing figures, the present disclosure provides an embodiment of a data processing apparatus, which corresponds to the method embodiment shown in fig. 1, and which is particularly applicable to various electronic devices.

As shown in fig. 5, the data processing apparatus of the present embodiment includes: a display unit 501, an adding unit 502, and a binding unit 503. The display unit is used for displaying an application flow on a flow editing interface of the application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps; an adding unit, configured to add a first end node at a flow position indicated by the first processing node in response to an end node adding operation for the first processing node; the binding unit is used for responding to the information adding operation aiming at the first ending node, obtaining the first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of the application corresponding to the application flow from the application to the first ending node.

In this embodiment, the specific processes of the display unit 501, the adding unit 502 and the binding unit 503 of the data processing apparatus and the technical effects thereof may refer to the descriptions related to the steps 101, 102 and 103 in the corresponding embodiment of fig. 1, and are not repeated here.

In some embodiments, the application flow includes a first conditional determination step, the first conditional determination step being connected with at least two conditional branches; the first processing node is located at a first conditional branch of the at least two conditional branches and is adapted to add a subsequent processing step to the first conditional determination step.

In some embodiments, the first end information includes execution state information for indicating an execution state, where the execution state includes a result type to which an execution result of the first end node belongs on business logic of an application flow.

In some embodiments, the execution status information includes success information and/or failure information; the first end information includes state description information corresponding to an execution state indicated by the execution state information.

In some embodiments, the state description information includes a response code and response description information.

In some embodiments, the method further includes, in response to an end node addition operation for the first processing node, adding a first end node at a flow location indicated by the first processing node, including: in response to a trigger operation for the first processing node, displaying at least one candidate processing step option, wherein the at least one candidate processing step includes an end node option; in response to a first selection operation for the end node option, a first end node is added at the flow location.

In some embodiments, the at least two conditional branches are connected to a second end node; the method comprises the following steps: in response to the end node addition operation, the first conditional branch is disconnected from the second end node, and the first conditional branch establishes a connection with the first end node.

Referring to fig. 6, fig. 6 illustrates an exemplary system architecture in which a data processing method of an embodiment of the present disclosure may be applied.

As shown in fig. 6, the system architecture may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 is used as a medium to provide communication links between the terminal devices 601, 602, 603 and the server 605. The network 604 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The terminal devices 601, 602, 603 may interact with the server 605 via the network 604 to receive or send messages or the like. Various client applications, such as a web browser application, a search class application, a news information class application, may be installed on the terminal devices 601, 602, 603. The client application in the terminal device 601, 602, 603 may receive the instruction of the user and perform the corresponding function according to the instruction of the user, for example, adding the corresponding information in the information according to the instruction of the user.

The terminal devices 601, 602, 603 may be hardware or software. When the terminal devices 601, 602, 603 are hardware, they may be various electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablet computers, electronic book readers, MP3 players (Moving Picture Experts Group Audio Layer III, dynamic video expert compression standard audio plane 3), MP4 (Moving Picture Experts Group Audio Layer IV, dynamic video expert compression standard audio plane 4) players, laptop and desktop computers, and the like. When the terminal devices 601, 602, 603 are software, they can be installed in the above-listed electronic devices. Which may be implemented as multiple software or software modules (e.g., software or software modules for providing distributed services) or as a single software or software module. The present invention is not particularly limited herein.

The server 605 may be a server that provides various services, for example, receives information acquisition requests sent by the terminal devices 601, 602, 603, and acquires presentation information corresponding to the information acquisition requests in various ways according to the information acquisition requests. And related data showing the information is transmitted to the terminal devices 601, 602, 603.

It should be noted that, the data processing method provided by the embodiments of the present disclosure may be performed by the terminal device, and accordingly, the data processing apparatus may be provided in the terminal devices 601, 602, 603. In addition, the data processing method provided by the embodiment of the present disclosure may also be executed by the server 605, and accordingly, the data processing apparatus may be disposed in the server 605.

It should be understood that the number of terminal devices, networks and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

Referring now to fig. 7, a schematic diagram of an electronic device (e.g., a terminal device or server in fig. 6) suitable for use in implementing embodiments of the present disclosure is shown. The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 7 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.

As shown in fig. 7, the electronic device may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 701, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 702 or a program loaded from a storage means 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the electronic device 700 are also stored. The processing device 701, the ROM 702, and the RAM 703 are connected to each other through a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.

In general, the following devices may be connected to the I/O interface 705: input devices 706 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, and the like; an output device 707 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 708 including, for example, magnetic tape, hard disk, etc.; and a communication device 709. The communication means 709 may allow the electronic device to communicate with other devices wirelessly or by wire to exchange data. While fig. 7 shows an electronic device having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a non-transitory computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via communication device 709, or installed from storage 708, or installed from ROM 702. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing device 701.

It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: displaying an application flow on a flow editing interface of an application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps; responsive to an end node adding operation for the first processing node, adding a first end node at a flow position indicated by the first processing node; and responding to the information adding operation aiming at the first ending node, acquiring first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of an application corresponding to an application flow to the first ending node.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: executing an application flow in an application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node; and in response to execution of the application flow to the end node, displaying at least part of the end information bound by the end node.

Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including, but not limited to, an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The name of the element does not in any way constitute a limitation of the element itself, for example, the display element may also be described as "element of the display application flow".

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.

Claims (14)

1. A method of data processing, comprising:

displaying an application flow on a flow editing interface of an application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps;

responsive to an end node adding operation for the first processing node, adding a first end node at a flow position indicated by the first processing node;

and responding to the information adding operation aiming at the first ending node, acquiring first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of an application corresponding to an application flow to the first ending node.

2. The method according to claim 1, wherein the application flow comprises a first condition judgment step, the first condition judgment step being connected with at least two condition branches;

The first processing node is located at a first conditional branch of the at least two conditional branches and is adapted to add a subsequent processing step to the first conditional determination step.

3. The method of claim 1, wherein the first end information includes execution state information indicating an execution state, wherein the execution state includes a result type to which an execution result of the first end node belongs on business logic of an application flow.

4. A method according to claim 3, wherein the execution status information comprises success information and/or failure information;

the first end information includes state description information corresponding to an execution state indicated by the execution state information.

5. The method of claim 4, wherein the state description information includes a response code and response description information.

6. The method of claim 1, wherein the adding a first end node at a flow location indicated by the first processing node in response to an end node addition operation for the first processing node comprises:

in response to a trigger operation for the first processing node, displaying at least one candidate processing step option, wherein the at least one candidate processing step includes an end node option;

In response to a first selection operation for the end node option, a first end node is added at the flow location.

7. The method according to claim 2, wherein the at least two conditional branches are connected to a second end node; and

the method comprises the following steps:

in response to the end node addition operation, the first conditional branch is disconnected from the second end node, and the first conditional branch establishes a connection with the first end node.

8. A method of data processing, comprising:

executing an application flow in an application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node;

and in response to execution of the application flow to the end node, displaying at least part of the end information bound by the end node.

9. The method of claim 8, wherein the step of determining the position of the first electrode is performed,

the application flow comprises a first condition judging step, wherein the first condition judging step is connected with at least two condition branches, and each condition branch in the at least two condition branches is respectively connected with an ending node.

10. The method according to claim 9, wherein the method further comprises:

receiving a first query instruction, wherein the first query instruction is used for querying an execution result of the first condition judgment step of an application corresponding to the application flow in a multi-time operation process;

responding to a first query instruction, and determining end information corresponding to an end node to which the first condition judging step is executed from historical data generated in the multiple running processes;

and generating and displaying a first execution result corresponding to the first condition judgment step according to the determined end information of the first condition judgment step, wherein the first execution result comprises execution state information of the first condition judgment step executed for a plurality of times.

11. A data processing apparatus, comprising:

the display unit is used for displaying an application flow on the flow editing interface of the application, wherein the application flow comprises a first processing node, and the first processing node is used for adding processing steps;

an adding unit, configured to add a first end node at a flow position indicated by the first processing node in response to an end node adding operation for the first processing node;

The binding unit is used for responding to the information adding operation aiming at the first ending node, obtaining the first ending information added by the information adding operation, and binding the first ending information with the first ending node, wherein the first ending information is used for indicating an execution result of the application corresponding to the application flow to the first ending node.

12. A data processing apparatus, comprising:

the execution module is used for executing the application flow in the application running process corresponding to the application flow, wherein the application flow comprises an end node, the end node is bound with end information, and the end information is used for indicating an execution result from the application corresponding to the application flow to the end node;

and the display module is used for responding to the execution of the application flow to the ending node and displaying at least part of ending information bound by the ending node.

13. An electronic device, comprising:

one or more processors;

storage means for storing one or more programs,

when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-10.

14. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any one of claims 1-10.