CN116204171A

CN116204171A - Data processing method, device, equipment and storage medium

Info

Publication number: CN116204171A
Application number: CN202310126480.5A
Authority: CN
Inventors: 张丹丰
Original assignee: Agricultural Bank of China
Current assignee: Agricultural Bank of China
Priority date: 2023-02-01
Filing date: 2023-02-01
Publication date: 2023-06-02

Abstract

The invention discloses a data processing method, a device, equipment and a storage medium, and belongs to the technical field of data processing. The method comprises the following steps: determining at least one target graphic component from a graphic component library; determining a target component source code corresponding to the target graphic component according to the target graphic component based on the mapping relation between the graphic component and the code component; and determining an object code file according to at least one object graph component, and the object component source code and the object configuration code corresponding to the object graph component. By the technical scheme, the quick multiplexing and visual construction of programs, particularly Linux Shell programs, can be realized.

Description

Data processing method, device, equipment and storage medium

Technical Field

The present invention relates to the field of data processing technologies, and in particular, to a data processing method, apparatus, device, and storage medium.

Background

The Vue belongs to an emerging Java Script technical framework in the field of Web programming, is a representation of an MVVM (Model-View Model) mode, and is designed into a technical mode which can be applied layer by layer from bottom to top unlike other large frameworks, and the adaptation field spans a PC end and a mobile end, so that the current application range is quite wide. Shell script is an important programming language on Linux/Unix system, is executed by interpretation and is close to an operating system interface, and has a common application scene in the fields of system operation and maintenance, operation chain scheduling, enterprise-level service and the like by the characteristics of high efficiency, simplicity, easy maintenance and the like.

Shell script programming "entry is easy and difficult to advance", and has enough deep understanding of Linux/Unix even network programming to write high quality code, let alone industrial level implementation for specific business scenarios, which results in two common phenomena: firstly, shell programs with rich programming intelligence are often buried in systems, and excellent practical Shell programs between similar systems and between similar scenes cannot be mutually used or not and cannot be used for reference, so tragedy of re-inventing wheels often occurs. Secondly, various excellent realizations of Shell programs are scattered at corners of different programs, manuals, forums and the like, and the positioning of final useful information from the information retrieval of turnips as soon as possible is difficult, so that mutual reference and comparison of advantages and disadvantages of the programs are difficult, and even the rapid multiplexing of the programs and construction engineering under the condition of definite service targets are even the most basic joint debugging verification. Therefore, if the problem of how to effectively improve the Cheng Xufu application level and the quick development capability in the Shell script programming field can be solved, the technology is extremely important as small as the efficiency and quality of improving the technical output in the enterprise group and as large as providing a brand-new open source mutual assistance mode in the Linux/Unix Shell programming field.

Disclosure of Invention

The invention provides a data processing method, a device, equipment and a storage medium, which are used for realizing quick multiplexing and visual construction of programs, particularly Linux Shell programs.

According to an aspect of the present invention, there is provided a data processing method comprising:

determining at least one target graphic component from a graphic component library;

determining a target component source code corresponding to the target graphic component according to the target graphic component based on the mapping relation between the graphic component and the code component;

and determining an object code file according to at least one object graph component, and the object component source code and the object configuration code corresponding to the object graph component.

According to another aspect of the present invention, there is provided a data processing apparatus comprising:

a target graphic component determination module for determining at least one target graphic component from a graphic component library;

the target component source code determining module is used for determining target component source codes corresponding to the target graphic components according to the target graphic components based on the mapping relation between the graphic components and the code components;

and the object code file determining module is used for determining an object code file according to at least one object graphic component, and the object component source code and the object configuration code corresponding to the object graphic component.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the data processing method according to any one of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to execute a data processing method according to any one of the embodiments of the present invention.

According to the technical scheme, at least one target graphic component is determined from the graphic component library, then, based on the mapping relation between the graphic component and the code component, the target component source code corresponding to the target graphic component is determined according to the target graphic component, and further, the target code file is determined according to at least one target graphic component, the target component source code corresponding to the target graphic component and the target configuration code. According to the technical scheme, the rapid multiplexing and visual construction of programs, particularly Shell programs, can be realized, and further the realization efficiency of large-scale programming of the code multiplexing level in the field of Linux Shell programming is greatly improved.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1A is a flow chart of a data processing method according to a first embodiment of the present invention;

FIG. 1B is a simplified diagram of a command sequence model according to a first embodiment of the present invention;

FIG. 1C is a general architecture diagram of a data processing method according to a first embodiment of the present invention;

FIG. 2A is a flow chart of a data processing method according to a second embodiment of the present invention;

FIG. 2B is a schematic diagram of an object code file generation process according to a second embodiment of the present invention;

FIG. 3 is a schematic diagram of a data processing apparatus according to a third embodiment of the present invention;

fig. 4 is a schematic structural diagram of an electronic device implementing a data processing method according to an embodiment of the present invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "candidate," "target," and the like in the description and claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise 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.

In addition, it should be noted that, in the technical solution of the present invention, the processes of collection, storage, use, processing, transmission, provision, disclosure, etc. of the related graphic components, shell components, etc. all conform to the regulations of the related laws and regulations, and do not violate the public welfare.

In a typical enterprise application scenario, namely a data analysis type application scenario, because database access, multi-data source interoperation, file operation and cross-system communication are frequent, maintainability requirements on data tables, fields, indexes and data and communication are high, if high-level languages such as Java, C and the like are adopted, huge development and operation costs are paid, but shell scripts can be easily qualified.

Through the continuous development of nearly half century, although Shell forms sh, ksh, bash, csh, tcsh and other types and realization styles, the basic specifications and programming ideas are always the same, and the Linux/Unix operating system has good universality and strong vitality in nature today.

Example 1

Fig. 1A is a flowchart of a data processing method according to a first embodiment of the present invention. The embodiment is applicable to the situations involving data analysis type applications in the fields of system operation and maintenance, job chain scheduling, enterprise-level service and the like, and is particularly applicable to how to realize quick multiplexing of Shell programs.

Alternatively, the Linux Shell program has typical structural characteristics, and branches, loops, and judges that there is a fixed pattern, and the processing of data flows between different commands, and complex functions can be encapsulated by declaration methods, such as the schematic diagram of the command sequence simplified model shown in fig. 1B. If each command sequence in fig. 1B is abstracted into code segment components of a specific Shell program, each code segment adopts the unification of pipeline "|", the code segment components are represented by block components with unique identifiers and corresponding attributes, and branches, judgment and data flow of a program structure correspond to graphs, arrow lines and judgment of the previous graph respectively, so that the sequence arrangement and docking process of the Shell program code segments can be flexibly configured by means of the visual dragging function of the vue front-end component, and finally the formed flow chart is actually the execution flow of the Shell program.

The general architecture of the present invention is shown in FIG. 1C, where the web component library includes various graphic components. The user can drag the graphic component from the web component library, design and construct engineering, and set parameters; and then, analyzing the components to obtain code files, performing standardability check on the code files, and then debugging, distributing and running.

As shown in fig. 1A, the data processing method of the present embodiment may include:

s110, determining at least one target graphic component from the graphic component library.

In this embodiment, the graphic component library refers to a database for storing the visualized components corresponding to the Shell program modules, i.e., the front-end components. It should be noted that each graphic component in the graphic component library corresponds to one Shell component uniformly. The graphic component may be a Vue visualization component including, but not limited to, component identification, component type, corresponding source code identification, parameter conventions, and requirement descriptions; further, whether to customize the component, whether to process the component, the type of the component, the constraint condition of the component, etc. can be included. Shell components refer to encapsulated Shell program modules, including, but not limited to, code module identification, parameter conventions and requirements, shell source code, and the like.

In addition, it should be noted that the graphic component is characterized by using a plurality of specific values, and the Shell component description reflects the characteristic information and the search key words of the program code segment. Therefore, the graphic component search can be performed in the front-end visual interface, and the keyword search of Shell source codes and the fuzzy search of code fragments can be performed.

Alternatively, at least one candidate graphic component may be determined from a library of graphic components; at least one target graphical component is determined from the at least one candidate graphical component in response to a processing operation on the candidate graphical component. Wherein the processing operation comprises at least one of: click operation, drag operation, and move operation.

The candidate graphic components refer to graphic components displayed in a front-end visual interface, and can be graphic components displayed in groups or a set number of graphic components with the front using frequency of the components.

Specifically, at least one candidate graphic component may be determined from a graphic component library based on a preset rule, for example, at least one candidate graphic component may be determined from the graphic component library in response to a search operation of a user on a certain type of graphic component at a front-end visual interface; at least one target graphical component may then be determined from the at least one candidate graphical component in response to a processing operation of the candidate graphical component by the user in the front-end visualization interface. For example, a candidate graphical component may be treated as a target graphical component in response to a user's click on that candidate graphical component in the front-end visualization interface. For another example, a candidate graphical component may be treated as a target graphical component in response to a user's drag operation on the candidate graphical component in the front-end visualization interface. For another example, a candidate graphical component may also be used as a target graphical component in response to a user moving the candidate graphical component in the front-end visualization interface.

It will be appreciated that the target graphic assembly can be determined by simple manipulation of the candidate graphic assembly, and the target graphic assembly can be intuitively and intuitively determined.

S120, determining a target component source code corresponding to the target graphic component according to the target graphic component based on the mapping relation between the graphic component and the code component.

In this embodiment, the mapping relationship between the graphic component and the code component refers to a one-to-one correspondence relationship between the graphic component and the code component, for example, may be a correspondence relationship between a graphic component identifier and a code component identifier; wherein the code component may be a Shell component; the graphic component is a front-end visualization graphic.

Specifically, the code component corresponding to the target graphic component may be determined based on the mapping relationship between the graphic component and the code component according to the graphic component identifier of the target graphic component as an index, and then the source code of the target component may be determined according to the code component.

S130, determining an object code file according to at least one object graphic component, and the object component source code and the object configuration code corresponding to the object graphic component.

In this embodiment, the target configuration code refers to parameter data and data conversion information configured based on the service requirement.

Specifically, a logical relationship between at least one target graphic component may be determined, and then, based on the logical relationship between at least one target graphic component, a logical relationship between target component source codes corresponding to each target graphic component may be sequentially determined, and target configuration codes corresponding to each target component source code may be respectively filled in to generate a target code file.

According to the technical scheme, at least one target graphic component is determined from the graphic component library, then, based on the mapping relation between the graphic component and the code component, the target component source code corresponding to the target graphic component is determined according to the target graphic component, and further, the target code file is determined according to the at least one target graphic component, the target component source code corresponding to the target graphic component and the target configuration code. According to the technical scheme, the rapid multiplexing and visual construction of programs, particularly Shell programs, can be realized, and further the realization efficiency of large-scale programming of the code multiplexing level in the field of Linux Shell programming is greatly improved.

Example two

FIG. 2A is a flow chart of a data processing method according to a second embodiment of the present invention; fig. 2B is a schematic diagram of an object code file generating process according to a second embodiment of the present invention. The present embodiment provides an alternative scheme for further optimizing "determining the object code file according to at least one object graphic component and the object component source code and the object configuration code corresponding to the object graphic component" based on the above embodiments. As shown in fig. 2A, the data processing method of the present embodiment may include:

s210, determining at least one target graphic component from the graphic component library.

S220, determining target component source codes corresponding to the target graphic components according to the target graphic components based on the mapping relation between the graphic components and the code components.

S230, responding to configuration operation of at least one target graphic component, and determining topological relation among different target graphic components.

In this embodiment, the configuration operation refers to an operation of configuring the position adjustment and the logical relationship of the target graphic component.

Specifically, the position adjustment operation of at least one target graphic component can be responded, namely, the front-to-back sequence among the target graphic components is adjusted; furthermore, program framework elements such as judgment, branching and circulation structures can be added based on business requirements so as to finally determine the topological relation among different target graphic components.

The program framework elements may be branches, judgments, data flows, loop structures, etc., and the corresponding graphic components may be special graphics (diamond), arrows, start and end symbols, etc.

S240, determining a target configuration code according to the attribute configuration information of the target graphic component.

In this embodiment, the attribute configuration information may be parameter information, data conversion information, and the like of the source code of the target component corresponding to the target graphic component.

Specifically, attribute configuration information of the target graphic assembly can be obtained in response to attribute configuration operation of the user on the target graphic assembly at the front-end visual interface, and then a target configuration code is generated according to the attribute configuration information of the target graphic assembly.

It can be understood that, based on the service requirement, attribute configuration is performed on the target graphic component, so that parameter docking is realized when the target graphic component and the target source code component are converted, and shell codes can be rapidly multiplexed at a module level.

S250, determining an object code file according to the topological relation among different object graph components, and the object component source codes and the object configuration codes corresponding to the object graph components.

Optionally, generating an object code framework according to the topological relation among different object graph components; and filling codes of the target code frame by using the target configuration codes and the target component source codes to obtain a target code file.

Specifically, generating an object code frame according to conditions of starting, ending, branching judgment nodes and the like in topological relations among different object graph components; traversing each node in the topological relation, namely each node in the target code frame, and replacing the node with the target component source code according to the mapping relation between the target graphic component corresponding to the node and the target component source code; and updating the code in the target code frame, namely the parameters in the source codes of all target components, by using the target configuration code until all nodes are traversed, and finally obtaining the target code file. In the node traversal process, node marking can be performed, and prompt information of the completion of node corresponding code generation is ejected from the front-end visual interface.

It will be appreciated that the present invention enables multiplexing and combining of module code, i.e., a "compilation" like process from a graph- > component relationship- > code, as illustrated in the object code file generation process schematic of fig. 2B. However, since all operations need to be performed based on the mapping modes in the database, the core of "compiling" is to modify Shell source code fragments (i.e. target component source codes) according to the attribute configuration (i.e. target configuration codes) of the interface graphic components, and then to perform code filling according to the target code frames.

Optionally, the candidate code file is determined according to the topological relation among different target graphic components, and the target component source codes and the target configuration codes corresponding to the target graphic components. Specifically, candidate code frames can be generated according to topological relations among different target graphic components; and replacing codes in the candidate code frames by adopting the target configuration codes and the target component source codes to obtain candidate code files.

And then, carrying out compliance verification on the candidate code file, and taking the candidate code file as an object code file when the verification is passed. Specifically, compliance verification may be performed on the candidate code file based on a preset compliance verification rule, and if the verification passes, the candidate code file is taken as the target code file. In case the verification fails, a modification hint is generated to redetermine the target configuration code, e.g. a check report may be constructed, a node modification hint information may be popped up at the front end visualization interface, etc.

It will be appreciated that by compliance checking the generated code file, the accuracy of the resulting code file may be ensured.

According to the technical scheme, at least one target graphic component is determined from the graphic component library, then, based on the mapping relation between the graphic component and the code component, the target component source code corresponding to the target graphic component is determined according to the target graphic component, further, the topological relation among different target graphic components is determined in response to the configuration operation of the at least one target graphic component, the target configuration code is determined according to the attribute configuration information of the target graphic component, and the target code file is determined according to the topological relation among different target graphic components, the target component source code corresponding to the target graphic component and the target configuration code. According to the technical scheme, through visual configuration of the target graphic assembly, the usable target code file can be obtained quickly, the preliminary joint debugging verification can be carried out without repeated coding on a development test environment, and the development efficiency is improved greatly.

Example III

Fig. 3 is a schematic structural diagram of a data processing apparatus according to a third embodiment of the present invention. The embodiment can be suitable for the situations related to data analysis type application in the fields of system operation and maintenance, job chain scheduling, enterprise-level service and the like, and is particularly suitable for realizing the quick multiplexing of Shell programs. The data processing means may be implemented in the form of hardware and/or software and may be integrated in an electronic device, such as a server, carrying data processing functions. As shown in fig. 3, the data processing apparatus of the present embodiment may include:

a target graphic component determination module 310 for determining at least one target graphic component from a graphic component library;

the target component source code determining module 320 is configured to determine, according to the target graphic component, a target component source code corresponding to the target graphic component based on a mapping relationship between the graphic component and the code component;

the object code file determining module 330 is configured to determine an object code file according to at least one object graphic component, and the object component source code and the object configuration code corresponding to the object graphic component.

Optionally, the target graphic component determining module 310 is specifically configured to:

determining at least one candidate graphic component from a graphic component library;

at least one target graphical component is determined from the at least one candidate graphical component in response to a processing operation on the candidate graphical component.

Optionally, the object code file determination module 330 includes:

a topology relation determination unit for determining a topology relation between different target graphic components in response to a configuration operation on at least one target graphic component;

the target configuration code determining unit is used for determining and obtaining a target configuration code according to the attribute configuration information of the target graphic assembly;

and the object code file determining unit is used for determining an object code file according to the topological relation among different object graph components, and the object component source codes and the object configuration codes corresponding to the object graph components.

Optionally, the object code file determining unit is configured to:

generating an object code frame according to the topological relation among different object graph components;

and filling codes of the target code frame by using the target configuration codes and the target component source codes to obtain a target code file.

Optionally, the object code file determining unit is further configured to:

determining candidate code files according to topological relations among different target graphic components, and target component source codes and target configuration codes corresponding to the target graphic components;

and carrying out compliance verification on the candidate code file, and taking the candidate code file as an object code file under the condition that the verification is passed.

Optionally, the object code file determining unit is further configured to:

in the event that the verification fails, a modification hint is generated to redefine the target configuration code.

Optionally, the processing operation includes at least one of: click operation, drag operation, and move operation.

The data processing device provided by the embodiment of the invention can execute the data processing method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.

Example IV

FIG. 4 is a schematic diagram of an electronic device implementing a data processing method according to an embodiment of the present invention; fig. 4 shows a schematic diagram of the structure of an electronic device 10 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 4, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.

Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the various methods and processes described above, such as data processing methods.

In some embodiments, the data processing method may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as the storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. One or more of the steps of the data processing method described above may be performed when the computer program is loaded into RAM 13 and executed by processor 11. Alternatively, in other embodiments, the processor 11 may be configured to perform the data processing method in any other suitable way (e.g. by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage 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. Alternatively, the computer readable storage medium may be a machine readable signal medium. 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.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. A method of data processing, comprising:

2. The method of claim 1, wherein said determining at least one target graphic component from a graphic component library comprises:

at least one target graphical component is determined from at least one candidate graphical component in response to a processing operation on the candidate graphical component.

3. The method of claim 1, wherein determining the object code file according to the at least one object graphic component and the object component source code and the object configuration code corresponding to the object graphic component comprises:

determining a topological relationship between different target graphic components in response to a configuration operation on at least one target graphic component;

determining a target configuration code according to the attribute configuration information of the target graphic component;

and determining an object code file according to the topological relation among different object graph components, and the object component source codes and the object configuration codes corresponding to the object graph components.

4. The method according to claim 3, wherein determining the object code file according to the topological relation between different object graphic components and the object component source code and the object configuration code corresponding to the object graphic components comprises:

and filling codes of the target code frame by adopting the target configuration codes and the target component source codes to obtain a target code file.

5. The method according to claim 3, wherein determining the object code file according to the topological relation between different object graphic components and the object component source code and the object configuration code corresponding to the object graphic components comprises:

6. The method as recited in claim 5, further comprising:

7. The method of claim 2, wherein the processing operation comprises at least one of: click operation, drag operation, and move operation.

8. A data processing apparatus, comprising:

9. An electronic device, the electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein,,

the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the data processing method of any one of claims 1-7.

10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores computer instructions for causing a processor to implement the data processing method of any one of claims 1-7 when executed.