Data processing method and device, electronic equipment and storage medium
By determining the data to be merged for each editor and selecting the appropriate merging algorithm, the problem that multiple users cannot edit logical arrangement instances at the same time is solved, and the collaborative editing and editing efficiency of multiple editors is improved.
Patent Information
- Application Number
- CN202510008924.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-01-02
- Publication Date
- 2025-04-29
AI Technical Summary
The prior art cannot implement multiple users to edit logical arrangement instances at the same time, resulting in inefficient editing.
Data merging of multiple editors is achieved by determining the data to be merged for each editor and selecting a suitable merging algorithm (such as CRDT or OT algorithm) based on the number of editors and the complexity of the merged data.
It realizes collaborative editing of the same logical arrangement instance by multiple editors, improves editing efficiency, and reduces resource waste when merging is difficult, ensuring real-time performance when merging is difficult.
Smart Images

Figure CN119903034A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of electronic information technology, and more specifically, to a data processing method, device, electronic device and computer-readable storage medium. Background Art
[0002] Currently, users can edit existing logic arrangement instances based on their own needs to obtain required logic arrangement instances. For example, they can add content, delete content, and replace content in a logic arrangement instance for circuit fault analysis in a vehicle.
[0003] However, in the related art, only one user is allowed to edit the logic arrangement instance at a time, and multiple users cannot edit the logic arrangement instance at the same time. Therefore, a method is urgently needed to enable multiple users to edit the logic arrangement instance at the same time. Summary of the invention
[0004] The present application proposes a data processing method, device, electronic device and computer-readable storage medium to provide a means for multiple users to edit a logical arrangement instance at the same time.
[0005] In a first aspect, an embodiment of the present application provides a data processing method, the method comprising:
[0006] In response to multiple editors performing editing operations on the logical arrangement instance to be edited simultaneously, determining the data to be merged for each editor for the logical arrangement instance to be edited based on the editing operations of each editor;
[0007] Determining a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors;
[0008] The data to be merged of multiple editors are merged according to the target merging algorithm to obtain the data after editing of the logical arrangement instance to be edited.
[0009] In a second aspect, an embodiment of the present application further provides a data processing device, the device comprising:
[0010] A response module, configured to respond to the editing operations of multiple editors on the logical arrangement instance to be edited at the same time, and determine the data to be merged of each editor for the logical arrangement instance to be edited based on the editing operations of each editor;
[0011] A determination module, configured to determine a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors;
[0012] The merging module is used to merge the data to be merged of multiple editors according to the target merging algorithm to obtain the data after editing the logical arrangement instance to be edited.
[0013] In a third aspect, an embodiment of the present application further provides an electronic device, comprising: one or more processors; a memory; one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, and the one or more programs are configured to execute the above method.
[0014] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, which stores a program code executable by a processor, and when the program code is executed by the processor, the processor executes the above method.
[0015] The present application provides a data processing method, device, electronic device and computer-readable storage medium. In the present application, when multiple editors perform editing operations on a logical arrangement instance to be edited at the same time, the data to be merged of each editor is determined, and then a target merging algorithm is determined based on the number of editors of the multiple editors and / or the merging complexity of merging the data to be merged of the multiple editors, and then the data to be merged of the multiple editors are merged based on the target merging algorithm to obtain the edited data of the logical arrangement instance to be edited. As a result, multiple editors can edit the logical arrangement instance to be edited at the same time to obtain the edited data, which solves the problem in the related art that multiple editors cannot perform editing operations on the logical arrangement instance to be edited at the same time, realizes the collaborative editing of the same logical arrangement instance to be edited by multiple editors, and improves the editing efficiency of the logical arrangement instance to be edited.
[0016] Other features and advantages of the embodiments of the present application will be described in the subsequent description, and partly become apparent from the description, or can be understood by practicing the embodiments of the present application. The purposes and other advantages of the embodiments of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0017] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.
[0018] Figure 1 A flow chart of a data processing method proposed in an embodiment of the present application is shown.
[0019] Figure 2A schematic diagram of an editing interface of a logic arrangement instance to be edited in an embodiment of the present application is shown.
[0020] Figure 3 A schematic diagram of a data processing process in an embodiment of the present application is shown.
[0021] Figure 4 A structural block diagram of a data processing device proposed in one embodiment of the present application is shown.
[0022] Figure 5 A structural block diagram of an electronic device provided according to an embodiment of the present application is shown. DETAILED DESCRIPTION
[0023] In order to make those skilled in the art better understand the present application scheme, the technical scheme in the present application embodiment will be clearly and completely described below in conjunction with the drawings in the present application embodiment. Obviously, the described embodiment is only a part of the present application embodiment, rather than all the embodiments. The components of the present application embodiment usually described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the present application for protection, but merely represents the selected embodiment of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work belong to the scope of protection of the present application.
[0024] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings. At the same time, in the description of this application, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.
[0025] See also Figure 1 , Figure 1 A flow chart of a data processing method proposed in one embodiment of the present application is shown, which is used in an electronic device. The method includes:
[0026] S110 . In response to multiple editors performing editing operations on the logical arrangement instance to be edited simultaneously, based on the editing operations of each editor, determine the data to be merged for each editor for the logical arrangement instance to be edited.
[0027] The logic arrangement instance to be edited may be a visualized logic arrangement instance. For example, the logic arrangement instance to be edited may be a visualized logic arrangement instance for circuit fault analysis of a vehicle. In another example, the logic arrangement instance to be edited may be a visualized logic arrangement instance for motherboard fault analysis of a mobile phone.
[0028] Figure 2 A visualized logic arrangement instance to be edited for circuit fault analysis of a circuit fault of a vehicle is shown, and the logic arrangement instance to be edited is displayed in a first area 201 of the editing interface 20, and the visualized logic arrangement instance to be edited is edited through a second area 202 in the editing interface 20. Each node in the logic arrangement instance to be edited can be edited in the second area 202.
[0029] For example, in Figure 2 In the second area 202, the node to be edited 2011 (that is, the power loop harness faulty node) can be edited. The specific editing operation may involve configuring basic information of the node to be edited 2011. Specifically, the node name, node description and node type of the node to be edited 2011 can be edited in the second area 202.
[0030] In this embodiment, the editor may refer to a user, or a script or application program that can edit the logic arrangement instance to be edited. In other words, the editing operation of the editor may refer to a manual editing operation of the user, or an automatic editing operation of the script or application program.
[0031] It can be understood that in the present application, multiple editors editing the logical orchestration instance to be edited simultaneously means that there are multiple editors editing the logical orchestration instance to be edited at the same time, and the multiple editors may start editing the logical orchestration instance to be edited at the same time, or may not start editing the logical orchestration instance to be edited at the same time, and correspondingly, the multiple editors may end editing the logical orchestration instance to be edited at the same time, or may not end editing the logical orchestration instance to be edited at the same time.
[0032] For example, user a1 starts editing the logical orchestration instance to be edited at time t1. After user a1 has been editing the logical orchestration instance to be edited for a period of time, user a2 starts editing the logical orchestration instance to be edited at time t2. At this time, it is determined that a1 and a2 are editing the logical orchestration instance to be edited at the same time.
[0033] When there are multiple editors, you can create an editing session (such as Ring TM A plurality of editors are in the editing session, and in the editing session, the plurality of editors edit the logical arrangement instance to be edited.
[0034] When there is only one editor, the edited layout instance can be edited directly without creating an edit session.
[0035] As mentioned above, multiple editors may not edit the edited orchestration instance at the same time. In this case, after the first editor starts editing the edited orchestration instance, a new editor joins to edit the edited orchestration instance, then an edit session is created, and the first editor and the editors who join later are added to the edit session, so that multiple editors can edit the edited logical orchestration instance in the edit session.
[0036] For each editor, the data generated by the editor's editing operation is determined as the editing data. For example, if the editor's editing operation for the to-be-edited arrangement instance is to input "123" at position w1, the editing data is "123 is input at position w1". Afterwards, based on the editing data of each editor and the to-be-edited logical arrangement instance, the merged data of each editor for the to-be-edited logical arrangement instance can be determined.
[0037] In some embodiments, S110 may include: in response to multiple editors' simultaneous editing operations on the logical arrangement instance to be edited, obtaining the editing data generated by each editor's editing operation; based on the editing data generated by each editor's editing operation and the basic data of the logical arrangement instance to be edited, determining the data to be merged of each editor.
[0038] The basic data of the logical arrangement instance to be edited refers to data used to indicate the specific content of the logical arrangement instance to be edited, and can be data converted from the logical arrangement instance to be edited into a target format to obtain the converted data as the basic data corresponding to the logical arrangement instance to be edited. The target format can be, for example, json format.
[0039] That is, when the target format is json format, the logical orchestration instance to be edited can be converted into descriptive json format data to obtain a basic orchestration draft as the basic data of the logical orchestration instance to be edited.
[0040] After obtaining the editing data generated by each editor's editing operation, the editing data generated by each editor's editing operation is used to perform corresponding editing operations on the basic data of the logical arrangement instance to be edited, thereby obtaining the data to be merged of each editor.
[0041] For example, the editing data of user a3 is "type 456 at position w3". Afterwards, based on the editing data of user a3, 456 can be typed at position w3 of the basic data j1 of the logical arrangement instance to be edited, and data j2 with "456" typed at position w3 can be obtained as the merged data of user a3.
[0042] S120. Determine a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors.
[0043] In this embodiment, a plurality of preset merging algorithms are set, and a target merging algorithm may be selected from the plurality of preset merging algorithms based on the number of editors of the plurality of editors and / or the merging complexity of merging the data to be merged of the plurality of editors.
[0044] Multiple preset merge algorithms may include a conflict-free replicated data type algorithm (CRDT) and an operational transformation algorithm (OT); CRDT is a data structure that solves the problem of data synchronization in a distributed system. The core idea of the CRDT algorithm is to ensure data consistency between all copies without complex operational transformations; the OT algorithm is a real-time collaborative editing technology that allows multiple users to edit documents simultaneously in a network environment.
[0045] Compared with the OT algorithm, the implementation of the CRDT algorithm is relatively simple because it does not need to deal with complex operation conversions. At the same time, the CRDT algorithm can well support a large number of users because the processing overhead of each operation is relatively small.
[0046] The OT algorithm can merge the operations of multiple users in real time, making the collaborative editing experience smoother. At the same time, the OT algorithm can ensure that the documents after different editing operations remain consistent through the conversion function. Compared with the CRDT algorithm, the OT algorithm has higher real-time performance.
[0047] However, the overhead of the CRDT algorithm is relatively small, while the relative overhead of the OT algorithm is relatively large, and the real-time performance of the CRDT algorithm is relatively poor, while the real-time performance of the OT algorithm is relatively good. Therefore, in this application, a target merge algorithm is selected from the CRDT algorithm and the OT algorithm in combination with the number of editors of multiple editors and / or the complexity of merging the data to be merged of multiple editors.
[0048] In the present application, the complexity of merging the data to be merged of multiple editors can be determined based on the differences between the data to be merged of multiple editors. For example, the complexity of merging the data to be merged of multiple editors can be determined based on the differences between the data to be merged of multiple editors by using a diff algorithm as the aforementioned merging complexity.
[0049] In some embodiments, when the number of editors is greater than a number threshold and / or the merge complexity is greater than a complexity threshold, a conflict-free replication data type algorithm is obtained as a target merge algorithm. The number threshold and the complexity threshold can be set based on demand, for example, the number threshold is 6 and the complexity threshold is 8.
[0050] If the number of editors is greater than the threshold, it means that there are many editors editing the logical orchestration instance to be edited at the same time, and the difficulty and cost of merging data are large. Therefore, a CRDT algorithm with a smaller algorithm overhead is selected as the target merging algorithm.
[0051] If the merge complexity is greater than the complexity threshold, it means that it is difficult to merge the data to be merged, and the difficulty and overhead of merging the data are large. A CRDT algorithm with a small algorithm overhead is selected as the target merge algorithm.
[0052] Of course, the target merge algorithm can also be determined by combining the number of editors and the merge complexity: when the number of editors is greater than the number threshold and the merge complexity is greater than the complexity threshold, a conflict-free replication data type algorithm is obtained as the target merge algorithm.
[0053] In some further embodiments, when the number of editors is not greater than a number threshold and / or the merge complexity is not greater than a complexity threshold, an operation conversion algorithm is obtained as a target merge algorithm.
[0054] The number of editors is not greater than the threshold, which means that there are fewer editors editing the logical arrangement instance to be edited at the same time, and the difficulty and overhead of merging data are relatively small. The OT algorithm with a larger algorithm overhead is selected as the target merging algorithm to ensure the real-time performance of the merging.
[0055] The merge complexity is not greater than the complexity threshold, which means that the merging difficulty of the data to be merged is relatively small, and the difficulty and overhead of merging the data are relatively small. The OT algorithm with a larger algorithm overhead is selected as the target merging algorithm to ensure the real-time performance of the merge.
[0056] Of course, the target merge algorithm can also be determined by combining the number of editors and the merge complexity: when the number of editors is not greater than the number threshold and the merge complexity is not greater than the complexity threshold, a conflict-free replication data type algorithm is obtained as the target merge algorithm.
[0057] S130 , merging the data to be merged of multiple editors according to a target merging algorithm to obtain the edited data of the logical arrangement instance to be edited.
[0058] After obtaining the target merging algorithm, the data to be merged of multiple editors can be merged according to the target merging algorithm to obtain the merged data as the data after editing the logical arrangement instance to be edited.
[0059] Of course, the data obtained after editing the logical arrangement instance to be edited can be used as the basic data for the next editing operation on the logical arrangement instance to be edited, so that the next time editing is performed, editing can be continued directly based on the data after the editing operation, thereby achieving multiple editing operations and continuous editing of the logical arrangement instance to be edited.
[0060] Of course, if the logical arrangement instance to be edited is a visual logical arrangement instance to be edited, after obtaining the edited data of the logical arrangement instance to be edited, the rendering engine can also be used to render based on the edited data of the logical arrangement instance to be edited to display the visual editing result to the editor.
[0061] In the present embodiment, when multiple editors are simultaneously performing editing operations on a logical orchestration instance to be edited, the data to be merged of each editor is determined, and then based on the number of editors of the multiple editors and / or the complexity of merging the data to be merged of the multiple editors, a target merging algorithm is determined, and then the data to be merged of the multiple editors are merged based on the target merging algorithm to obtain the edited data of the logical orchestration instance to be edited. Thus, multiple editors can simultaneously edit the logical orchestration instance to be edited to obtain the edited data, which solves the problem in the related art that multiple editors cannot simultaneously perform editing operations on the logical orchestration instance to be edited, and realizes the collaborative editing of the same logical orchestration instance to be edited by multiple editors, thereby improving the editing efficiency of the logical orchestration instance to be edited.
[0062] Secondly, when the merging difficulty is high (the number of editors is greater than the quantity threshold and / or the merging complexity is greater than the complexity threshold), a conflict-free replication data type algorithm with low overhead is selected as the target merging algorithm to achieve data merging with low overhead and reduce resource waste; when the merging difficulty is low (the number of editors is not greater than the quantity threshold and / or the merging complexity is not greater than the complexity threshold), an operation conversion algorithm with better real-time performance is selected as the target merging algorithm to achieve data merging with high real-time performance and ensure the real-time performance of the merging.
[0063] In some embodiments, the data processing process is as follows Figure 3 As shown, an editing operation on a logic arrangement instance to be edited is received. The editing operation may be triggered by multiple editors at the same time or by one editor.
[0064] Afterwards, determine whether there are multiple editors. If not, it means there is only one editor. In this case, the logical orchestration instance to be edited is edited directly based on the editing operation of the editor. If so, it means that multiple editors are editing the logical orchestration instance to be edited at the same time. Multiple editors are added to the created editing session, and based on the editing operations of each editor in the editing session and the basic data of the logical orchestration instance to be edited, the data to be merged of each editor is determined.
[0065] Afterwards, determine whether manual data merging is required. If so, merge the data to be merged of multiple editors based on subsequent manual operations of users. If not, determine whether it is a high-complexity data merging process: if the number of editors is greater than the quantity threshold or the merging complexity of the data to be merged of multiple editors is greater than the complexity threshold, it is a high-complexity data merging process; if the number of editors is not greater than the quantity threshold and the merging complexity of the data to be merged of multiple editors is not greater than the complexity threshold, it is not a high-complexity data merging process.
[0066] If it is a high-complexity data merging process, the data is merged through the CRDT algorithm to obtain the data after editing the logical orchestration instance to be edited; if it is not a high-complexity data merging process, the data is merged through the OT algorithm to obtain the data after editing the logical orchestration instance to be edited.
[0067] Of course, there may be a situation where the merging of data to be merged by multiple editors fails. In this case, a merge failure prompt message may be output to prompt the user to merge manually, or to fix the fault and re-perform the automatic merging process.
[0068] See attached Figure 4 , Figure 4 The structure block diagram of a data processing device proposed in one embodiment of the present application is shown, which is used in an electronic device. The data processing device 800 includes:
[0069] A response module 810 is used to respond to multiple editors' editing operations on the logical arrangement instance to be edited at the same time, and determine the data to be merged for each editor for the logical arrangement instance to be edited based on the editing operation of each editor;
[0070] A determination module 820, for determining a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors;
[0071] The merging module 830 is used to merge the data to be merged of multiple editors according to the target merging algorithm to obtain the edited data of the logical arrangement instance to be edited.
[0072] Optionally, the determination module 820 is further used to obtain a conflict-free replication data type algorithm as a target merge algorithm when the number of editors is greater than a number threshold and / or the merge complexity is greater than a complexity threshold.
[0073] Optionally, the determination module 820 is further used to obtain an operation conversion algorithm as a target merge algorithm when the number of editors is not greater than a number threshold and / or the merge complexity is not greater than a complexity threshold.
[0074] Optionally, the determination module 820 is further used to determine the complexity of merging the data to be merged of multiple editors based on the differences between the data to be merged of multiple editors.
[0075] Optionally, the response module 810 is also used to respond to multiple editors' simultaneous editing operations on the logical arrangement instance to be edited, obtain the editing data generated by each editor's editing operation; based on the editing data generated by each editor's editing operation and the basic data of the logical arrangement instance to be edited, determine the data to be merged of each editor.
[0076] Optionally, the response module 810 is further configured to convert the to-be-edited logical arrangement instance into data in a target format, and obtain basic data corresponding to the to-be-edited logical arrangement instance.
[0077] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices and modules can refer to the corresponding processes in the aforementioned method embodiments, and will not be repeated here.
[0078] In addition, each function in each embodiment of the present application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The above integrated module can be implemented in the form of hardware or in the form of software function module.
[0079] Please refer to Figure 5 , which shows a structural block diagram of an electronic device provided according to an embodiment of the present application. The electronic device 500 can be an electronic device capable of running applications, such as a smart phone, a tablet computer, an e-book, and a vehicle. The electronic device 500 in the present application may include one or more of the following components: a processor 510, a memory 520, and one or more applications. One or more applications may be stored in the memory 520 and configured to be executed by one or more processors 510, and one or more programs are configured to execute the method described in the aforementioned method embodiment.
[0080] The processor 510 may include one or more processing cores. The processor 510 uses various interfaces and lines to connect various parts of the entire electronic device 500, and executes various functions and processes data of the electronic device 500 by running or executing instructions, programs, code sets or instruction sets stored in the memory 520, and calling data stored in the memory 520. Optionally, the processor 510 can be implemented in at least one hardware form of digital signal processing (Digital Signal Processing, DSP), field programmable gate array (Field-Programmable Gate Array, FPGA), and programmable logic array (Programmable Logic Array, PLA). The processor 510 can integrate one or a combination of a central processing unit (Central Processing Unit, CPU), a graphics processing unit (Graphics Processing Unit, GPU), and a modem. Among them, the CPU mainly processes the operating system, user interface, and application programs; the GPU is responsible for rendering and drawing display content; and the modem is used to process wireless communications. It can be understood that the above-mentioned modem may not be integrated into the processor 510, but may be implemented separately through a communication chip.
[0081] The memory 520 may include a random access memory (RAM) or a read-only memory (ROM). The memory 520 may be used to store instructions, programs, codes, code sets or instruction sets. The memory 520 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function (such as a touch function, a sound playback function, an image playback function, etc.), instructions for implementing the following various method embodiments, etc. The data storage area may also store data (such as a phone book, audio and video data, chat record data) created by the electronic device 500 during use.
[0082] In addition, each function in each embodiment of the present application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The above integrated module can be implemented in the form of hardware or in the form of software function module.
[0083] On the other hand, the present application also provides a computer-readable storage medium, in which program code is stored. The program code can be called by a processor to execute the method described in the above method embodiment.
[0084] The computer readable storage medium may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read-only memory), an EPROM, a hard disk, or a cluster of ROMs. Optionally, the computer readable storage medium comprises a non-transitory computer-readable storage medium. The computer readable storage medium has storage space for program codes that execute any of the method steps in the above method. These program codes can be read from or written to one or more computer program products. The program code can be compressed, for example, in an appropriate form.
[0085] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit it. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present application.
Claims
1. A data processing method, characterized in that: The method comprises: In response to multiple editors performing editing operations on the logical arrangement instance to be edited simultaneously, determining the data to be merged for each editor for the logical arrangement instance to be edited based on the editing operations of each editor; Determining a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors; The data to be merged of the multiple editors are merged according to the target merging algorithm to obtain the edited data of the logical arrangement instance to be edited.
2. The method according to claim 1, characterized in that The determining of a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of the to-be-merged data of the multiple editors comprises: When the number of editors is greater than a number threshold and / or the merge complexity is greater than a complexity threshold, a conflict-free replication data type algorithm is obtained as the target merge algorithm.
3. The method according to claim 1, characterized in that The determining of a target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of the to-be-merged data of the multiple editors comprises: When the number of editors is not greater than a number threshold and / or the merging complexity is not greater than a complexity threshold, an operation conversion algorithm is obtained as the target merging algorithm.
4. The method according to claim 1, characterized in that: Before determining the target merging algorithm based on the number of editors of the multiple editors and / or the merging complexity of merging the to-be-merged data of the multiple editors, the method further includes: Based on the differences between the data to be merged of the multiple editors, a merging complexity of merging the data to be merged of the multiple editors is determined.
5. The method according to claim 1, characterized in that In response to multiple editors' simultaneous editing operations on the to-be-edited logical arrangement instance, determining the to-be-merged data for the to-be-edited logical arrangement instance by each editor based on the editing operation of each editor, comprises: In response to multiple editors performing editing operations on the logical arrangement instance at the same time, acquiring editing data generated by the editing operations of each of the editors; Based on the editing data generated by the editing operation of each editor and the basic data of the logical arrangement instance to be edited, the data to be merged of each editor is determined.
6. The method according to claim 5, characterized in that Before determining the data to be merged of each editor based on the edit data generated by the editing operation of each editor and the basic data of the logical arrangement instance to be edited, the method further includes: The logic arrangement instance to be edited is converted into data in a target format to obtain basic data corresponding to the logic arrangement instance to be edited.
7. The method according to any one of claims 1 to 7, characterized in that The logic arrangement instance to be edited is a visualized logic arrangement instance.
8. A data processing device, characterized in that: The device comprises: A response module, configured to respond to the editing operations of multiple editors on the logical arrangement instance to be edited at the same time, and determine the data to be merged of each editor for the logical arrangement instance to be edited based on the editing operations of each editor; A determination module, configured to determine a target merging algorithm based on the number of editors of the plurality of editors and / or the merging complexity of merging the to-be-merged data of the plurality of editors; The merging module is used to merge the data to be merged of the multiple editors according to the target merging algorithm to obtain the data after editing the logical arrangement instance to be edited.
9. An electronic device, characterized in that: include: one or more processors; Memory; One or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, and the one or more applications are configured to execute the method according to any one of claims 1-7.
10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program code executable by a processor, and when the program code is executed by the processor, the processor executes the method according to any one of claims 1 to 7.