CN115809048A - Computing method, system, equipment and storage medium for multi-field concurrent modification - Google Patents
Computing method, system, equipment and storage medium for multi-field concurrent modification Download PDFInfo
- Publication number
- CN115809048A CN115809048A CN202211430557.XA CN202211430557A CN115809048A CN 115809048 A CN115809048 A CN 115809048A CN 202211430557 A CN202211430557 A CN 202211430557A CN 115809048 A CN115809048 A CN 115809048A
- Authority
- CN
- China
- Prior art keywords
- preset
- calculation
- field information
- field
- chain
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Debugging And Monitoring (AREA)
Abstract
The invention provides a computing method, a system, equipment and a storage medium for multi-field concurrent modification, wherein the method comprises the following steps: acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm; adding the field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated. The method changes the concurrent modification action into the sequential action by the modified field through the preset first-in first-out queue, thereby ensuring the consistency of the calculation sequence; meanwhile, the calculated formula is subjected to parameter and field information matching in the preset calculation chain history set, so that the probability of occurrence of calculation dead cycle can be reduced, and the preparation of calculation results of all fields is consistent.
Description
Technical Field
The present invention relates to the field of computer application technologies, and in particular, to a computing method, system, device, and storage medium for concurrent modification of multiple fields.
Background
The Low Code Development Platform (LCDP) is a development platform that can quickly generate an application without encoding (0 code) or with a small amount of code. The method for developing the application program through visualization (referring to a visual programming language) enables developers with different experience levels to create web pages and application programs through a graphical user interface by using a dragging component and model-driven logic. The formal name of the Low Code Development Platform (LCDP) is not formally determined until 6 months 2014, but the whole low code development field can be traced back to the fourth generation programming language and the rapid application development tool earlier.
With the high-speed development of low-code technology, low-code platforms are gradually and fully applied in various industries, on the low-code platforms, a module can be quickly generated through simple configuration, the module can be provided with a plurality of fields, the fields can be mutually linked through a configuration calculation formula, and when some fields are modified, the values of other fields can be recalculated according to the calculation formula.
Disclosure of Invention
The invention provides a method, a system, equipment and a storage medium for calculating multi-field concurrent modification aiming at the technical problems in the prior art, and aims to solve the problem of endless loop when two fields in a calculation formula are mutually associated and influenced.
According to a first aspect of the present invention, a computing method for multi-field concurrent modification is provided, which includes:
acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low code platform;
adding the plurality of field information to a preset first-in first-out queue;
sequentially taking out the field information in the preset first-in first-out queue;
recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated.
On the basis of the technical scheme, the invention can be improved as follows.
Optionally, after the step of recalculating, in the preset calculation chain history set, the calculation chain whose calculation parameters include the field information, the method includes:
and updating a corresponding result field based on the recalculated result, and adding the result field to the preset first-in first-out queue.
Optionally, the step of recalculating the calculation chain whose calculation parameters include the field information in a preset calculation chain history set further includes:
and performing no recalculation on the calculation chain of which the calculation result comprises the field information in the preset calculation chain history set.
Optionally, the step of recalculating all the field information in the preset fifo queue includes:
and when the length of the preset first-in first-out queue is 0, emptying the preset calculation chain history set and sending a finishing instruction.
Optionally, the step of issuing a completion instruction further includes:
and executing a preset hook function, and updating the display pages corresponding to the plurality of modified values.
Optionally, before the step of adding the field information to the preset fifo queue, the method includes:
and initializing the preset first-in first-out queue into an empty queue.
Optionally, before the step of recalculating the calculation chain whose calculation parameters include the field information in the preset calculation chain history set, the method includes:
and calculating the calculation chain according to the calculation starting instruction, and storing the calculation chain which is subjected to calculation into a preset calculation chain history set.
According to a second aspect of the present invention, there is provided a computing system for multi-field concurrent modification, comprising:
the modification acquisition module is used for acquiring a plurality of field information corresponding to a plurality of modification values in a preset time period based on an anti-shake algorithm;
the queue storage module is used for adding the field information to a preset first-in first-out queue;
the queue reading module is used for sequentially taking out the field information in the preset first-in first-out queue;
and the recalculation module is used for recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until the recalculation of all the field information in the preset first-in first-out queue is completed.
According to a third aspect of the present invention, there is provided an apparatus, comprising a memory, and a processor, configured to implement the steps of the computing method for multi-field concurrent modification in any one of the above first aspects when executing a computer management class program stored in the memory.
According to a fourth aspect of the present invention, there is provided a computer readable storage medium, on which a computer management class program is stored, which when executed by a processor implements the steps of the computing method of any of the above-described first aspect for multi-field concurrent modification.
The invention provides a computing method, a system, equipment and a storage medium for multi-field concurrent modification, wherein the method comprises the following steps: acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low code platform; adding the plurality of field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated. According to the method, the field information corresponding to the modification value is obtained through the anti-shake algorithm, so that the calculated amount during frequent modification can be reduced, and meanwhile, the timeliness of real-time display and feedback of the calculation result is guaranteed; then, the modified fields are changed into sequential actions through a preset first-in first-out queue, and the consistency of the calculation sequence is ensured; meanwhile, the calculated formula is subjected to parameter and field information matching in the preset calculation chain history set, so that the probability of occurrence of calculation dead cycle can be reduced, and the preparation of calculation results of all fields is consistent.
Drawings
FIG. 1 is a flow chart of a computing method for multi-field concurrent modification according to the present invention;
FIG. 2 is a diagram illustrating a process of a multi-field concurrent modified computational chain according to the present invention;
FIG. 3 is a structural diagram of a multi-field concurrent modification computing system according to the present invention;
FIG. 4 is a schematic diagram of a hardware structure of a possible apparatus provided in the present invention;
fig. 5 is a schematic diagram of a hardware structure of a possible computer-readable storage medium provided in the present invention.
Detailed Description
The following detailed description of embodiments of the present invention is provided in connection with the accompanying drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
Fig. 1 is a flowchart of a computing method for multi-field concurrent modification provided by the present invention, and as shown in fig. 1, the method includes:
step S100: acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low code platform;
it should be noted that the main body of the method in this embodiment may be a computer terminal device with data processing, network communication and program running functions, for example: computers, tablet computers, etc.; the cloud server may also be a server device having the same similar function, or may also be a cloud server having the similar function, which is not limited in this embodiment. For ease of understanding, this embodiment and the following embodiments will be described by taking a server device as an example.
It can be understood that the anti-shake algorithm may be used to obtain a field corresponding to a modified value within a preset time period, and the anti-shake algorithm may be based on a working principle that the anti-shake algorithm is triggered after the value is modified, the anti-shake algorithm executes a callback after delaying a preset time period, and if the anti-shake algorithm is triggered again within the time period, the anti-shake algorithm executes the callback again. For example: when a user continuously inputs a segment of characters in the input box, the query request can be executed only after the input is finished through the anti-shake algorithm, so that the request times can be effectively reduced, and the request resources are saved.
It should be understood that the preset time period may be set in advance by an administrator or manually adjusted by a user, and the preset time period may be set as follows: 1 second, 5 seconds, 10 seconds, etc., which the present embodiment does not limit.
In a specific implementation, when the server executes a calculation process, a user modifies data information in the calculation process, acquires a plurality of modified values within a period of time through an anti-shake algorithm, and acquires a plurality of corresponding field information through the plurality of modified values.
Step S200: adding the plurality of field information to a preset first-in first-out queue;
it should be noted that the preset fifo queue may be used to store fields that need to be recalculated, the access mode of the fifo queue is to take out the data of the first-in queue first-in, and the queue needs to be initialized before the fifo queue is used, and the step of initializing may be a step of initializing the preset fifo queue to an empty queue.
Step S300: sequentially taking out the field information in the preset first-in first-out queue;
in a specific implementation, the field information in the preset fifo queue is taken out one by one according to the order of fifo for subsequent recalculation.
Step S400: recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated.
The calculation parameter may refer to field information on the left side of the equal sign of the calculation formula, for example: in the calculation formula "[ tax-containing unit price ] = [ tax-free unit price ] (1 + [ tax rate ])", the tax-containing unit price is a calculation parameter, and in the calculation formula "[ tax-free unit price ] (1 + [ tax rate ]) = [ tax-containing unit price ]", the tax-free unit price and the tax rate are calculation parameters.
It is understood that the preset calculation chain history set may be a set for storing calculation chains in which calculation formulas, values of calculation parameters, and values of calculation results are stored.
It can be appreciated that, based on the drawbacks of the background art, the embodiment of the present invention provides a computing method for multi-field concurrent modification. The method comprises the following steps: acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm; adding the field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated. According to the method, the field information corresponding to the modification value is obtained through the anti-shake algorithm, so that the calculated amount during frequent modification can be reduced, and meanwhile, the timeliness of real-time display and feedback of the calculation result is guaranteed; then, the modified fields are changed into sequential actions through a preset first-in first-out queue, and the consistency of the calculation sequence is ensured; meanwhile, the calculated formula is subjected to parameter and field information matching in the preset calculation chain history set, so that the probability of occurrence of calculation dead cycle can be reduced, and the preparation of calculation results of all fields is consistent.
In a possible embodiment, after the step of recalculating, in a preset calculation chain history set, a calculation chain whose calculation parameters include the field information, the method includes:
step S500: and updating a corresponding result field based on the recalculated result, and adding the result field to the preset first-in first-out queue.
In a specific implementation, the result field obtained by recalculation is added to the preset fifo queue, so that the result field that changes due to the modified field corresponding to the modified value is set as the modified field, and further, all the calculation chains in which the change occurs in the calculation chain that has completed the calculation are recalculated.
In this embodiment, the calculation chain history is combined with the formula already calculated in the record, and the result field corresponding to the modification field is set as the modification field, so that all the calculation chains with changes in the calculation chain that have been calculated are recalculated, and the accuracy and consistency of the calculation results of all the fields and the correctness of the final calculation result are ensured.
In a possible embodiment, the step of recalculating, in a preset calculation chain history set, a calculation chain whose calculation parameters include the field information further includes:
step S401: and performing no recalculation on the calculation chain of which the calculation result comprises the field information in the preset calculation chain history set.
In a specific implementation, no recalculation is performed for the calculation chain containing the above-mentioned modified field in the result field to the right of the equal sign in the calculation formula.
In this embodiment, the calculation chain including the modified field in the result field on the right side of the equal sign in the calculation formula is not recalculated, so that the calculation dead cycle caused by the mutual influence of the correlation between more than two fields can be effectively reduced.
In a possible embodiment mode, the step of completing recalculation of all field information in the preset fifo queue includes:
step S402: and when the length of the preset first-in first-out queue is 0, emptying the preset calculation chain history set and sending a completion instruction.
It should be noted that, when the length of the preset fifo queue is 0, it indicates that all fields related to the modified value have been recalculated, and thus the historical calculation chain in the preset calculation chain history set is emptied.
In a specific implementation, when the length of the preset fifo queue is 0, the historical calculation chain in the preset calculation chain history set is emptied, and a completion instruction is issued to indicate that the calculation is completed.
In the embodiment, after the fields related to the modified values are calculated, the historical data in the preset calculation chain historical set are cleared, so that the calculation resources can be timely released, the calculation force required by calculation is effectively reduced, and the use experience of a user is greatly improved.
In a possible embodiment, the step of issuing a completion instruction further includes:
step S4021: and executing a preset hook function, and updating the display pages corresponding to the plurality of modified values.
It should be noted that the preset hook function may be a calculation completion function triggered after the field related to the modified value is recalculated, and is used for the system to execute a subsequent task after the system obtains the completion instruction, where the subsequent task may be to update the field information and other changed data in the display page, or to send a message to remind the user that the calculation is completed, which is not limited in this embodiment.
In the embodiment, the subsequent tasks are triggered by the preset hook function, so that the calculation result is displayed in real time in time.
In a possible embodiment, before the step of recalculating, in a preset calculation chain history set, a calculation chain whose calculation parameters include the field information, the method includes:
step S001: and calculating the calculation chain according to the calculation starting instruction, and storing the calculation chain which is subjected to calculation into a preset calculation chain history set.
It should be noted that the computation start instruction may be an operation instruction issued by a user and used to tell the server that a computation task starts to be executed, and the server stores a computation chain that has completed computation into the preset computation chain history set and is used to participate in recalculation when the user modifies data, or the preset computation chain history set is emptied when the computation task ends.
In a possible application scenario, in order to further clearly describe the working principle of the present invention, referring to fig. 2, fig. 2 is a schematic diagram of a computation chain flow of a multi-field concurrent modification provided by the present invention; in fig. 2, firstly, all modified fields of all values in a short time are obtained by using an anti-shake algorithm, all modified fields of all values are added to a first-in first-out queue, whether the first-in first-out queue is empty or not is judged, when the first-in first-out queue is empty, the computation chain history combination is emptied, a computation completion hook function is called, and a page redraws all changes; if not, taking out the first field A in the queue, and judging whether the formula related to the field A is calculated; if all the calculation is completed, continuously taking out the first field in the queue (after the field A is taken out, the second field becomes the first field); if the calculation is not finished, when the ith formula is calculated, if the result is to be stored in the field B, whether a calculation formula with the calculation sequence of 'field B → field A' exists in the calculation chain history set or not is judged, if the calculation formula with the calculation sequence of 'field B → field A' exists, the judgment step of re-executing whether the relevant calculation of the field A is completely finished or not is skipped, if the calculation formula with the calculation sequence of 'field A → field B' does not exist, the calculation chain with the calculation sequence of 'field A → field B' is stored in the calculation chain history combination, the calculation result is ensured to be in the field B, meanwhile, the field B is added in the first-in first-out queue until the length of the first-in first-out queue is 0 (namely, the first-in first-out queue is empty), the calculation chain history set is emptied, a calculation finishing hook function is called, and all changes are redrawn in the display page.
In the application scenario, when the calculation chain is long or the calculation is concurrent, calculation errors are likely to occur. For example, with n fields A1 to An, A1 modification would result in A2 change, A2 change would result in A3 change, and so on, an change may result in A1 change, forming a circular calculation chain. If the intermediate calculation sequence is wrong or the calculation is performed concurrently, calculation errors of some field values are caused. The following takes the actual data as an example: assuming that the tax free unit price is 100, the tax rate is 0.03, and the tax containing unit price is 100 (+0.03) =103. When the tax rate is changed to 0.04, the calculation formulas of "tax free unit price" and "tax containing unit price" are executed simultaneously when the modification completion status is triggered, the "tax free unit price" is 103/(1 + 0.04) ≈ 99.038, and the "tax containing unit price" is 100 ++ 0.04) =104. Obviously, the result at the end of the calculation is wrong, 99.038 (1 + 0.04) ≠ 104. Thus, the use of such circularly correlated calculation formulas is not suggested in such low code platforms. But when traffic is complex, the calculation of circular associations of multiple fields is sometimes difficult to avoid completely. Therefore, after the method is used, the probability of errors generated during the cyclic calculation can be greatly reduced, and the use experience of a user is greatly improved.
Referring to fig. 3, fig. 3 is a schematic diagram illustrating a structure of a computing system for multi-field concurrent modification according to an embodiment of the present invention, and as shown in fig. 3, the computing system for multi-field concurrent modification includes a modification obtaining module 100, a queue storing module 200, a queue reading module 300, and a recalculating module 400, where:
a modification obtaining module 100, configured to obtain, based on an anti-shake algorithm, a plurality of pieces of field information corresponding to a plurality of modification values in a preset time period; a queue storage module 200, configured to add the plurality of field information to a preset fifo queue; the queue reading module 300 is configured to sequentially take out field information in the preset fifo queue; a recalculation module 400, configured to recalculate the calculation chain whose calculation parameters include the field information in a preset calculation chain history set until all the field information in the preset fifo queue is recalculated.
It can be understood that the computing system for multi-field concurrent modification provided by the present invention corresponds to the computing method for multi-field concurrent modification provided by the foregoing embodiments, and the related technical features of the computing system for multi-field concurrent modification may refer to the related technical features of the computing method for multi-field concurrent modification, and are not described herein again.
Referring to fig. 4, fig. 4 is a schematic diagram of an embodiment of an apparatus according to an embodiment of the present invention. As shown in fig. 4, an embodiment of the present invention provides an apparatus, which includes a memory 1310, a processor 1320, and a computer program 1311 stored in the memory 1310 and operable on the processor 1320, where the processor 1320, when executing the computer program 1311, implements the following steps:
acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low code platform; adding the plurality of field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated.
Referring to fig. 5, fig. 5 is a schematic diagram of an embodiment of a computer-readable storage medium according to the present invention. As shown in fig. 5, the present embodiment provides a computer-readable storage medium 1400, on which a computer program 1411 is stored, the computer program 1411 when executed by a processor implements the steps of:
acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low-code platform; adding the plurality of field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset first-in first-out queue is recalculated.
The embodiment of the invention provides a computing method, a system and a storage medium for multi-field concurrent modification, wherein the method comprises the following steps: acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low-code platform; adding the plurality of field information to a preset first-in first-out queue; sequentially taking out the field information in the preset first-in first-out queue; and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset FIFO queue is recalculated. According to the method, the field information corresponding to the modification value is obtained through the anti-shake algorithm, so that the calculated amount during frequent modification can be reduced, and meanwhile, the timeliness of real-time display and feedback of the calculation result is guaranteed; then, the modified fields are changed into sequential actions through a preset first-in first-out queue, and the consistency of the calculation sequence is ensured; meanwhile, the calculated formula is subjected to parameter and field information matching in the preset calculation chain history set, so that the probability of occurrence of calculation dead cycle can be reduced, and the preparation of calculation results of all fields is consistent.
It should be noted that, in the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to relevant descriptions of other embodiments for parts that are not described in detail in a certain embodiment.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While the preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including the preferred embodiment and all changes and modifications that fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A computing method for multi-field concurrent modification, the method comprising:
acquiring a plurality of field information corresponding to a plurality of modified values in a preset time period based on an anti-shake algorithm in a low code platform;
adding the plurality of field information to a preset first-in first-out queue;
sequentially taking out the field information in the preset first-in first-out queue;
and recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until all the field information in the preset FIFO queue is recalculated.
2. The computing method for multi-field concurrent modification according to claim 1, wherein the step of recalculating the computation chain including the field information in the computation parameter in a preset computation chain history set is followed by:
and updating a corresponding result field based on the result obtained by recalculation, and adding the result field to the preset first-in first-out queue.
3. The computing method of claim 1, wherein the step of recalculating the computation chain with the field information included in the computation parameters in a preset computation chain history set further comprises:
and performing no recalculation on the calculation chain of which the calculation result comprises the field information in the preset calculation chain history set.
4. The method according to claim 1, wherein the step of completing the recalculation of all the field information in the pre-set fifo queue comprises:
and when the length of the preset first-in first-out queue is 0, emptying the preset calculation chain history set and sending a finishing instruction.
5. The method of claim 4, wherein the step of issuing a completion instruction further comprises:
and executing a preset hook function, and updating the display pages corresponding to the plurality of modified values.
6. The method for computing multi-field concurrent modification according to claim 1, wherein the step of adding the plurality of field information to a preset fifo queue is preceded by:
and initializing the preset first-in first-out queue into an empty queue.
7. The computing method of claim 1, wherein the step of recalculating the computation chain with the field information included in the computation parameter in a preset computation chain history set is preceded by the step of:
and calculating the calculation chain according to the calculation starting instruction, and storing the calculation chain which is subjected to calculation into a preset calculation chain history set.
8. A computing system for concurrent modification of multiple fields, comprising
The modification acquisition module is used for acquiring a plurality of field information corresponding to a plurality of modification values in a preset time period based on an anti-shake algorithm in a low-code platform;
the queue storage module is used for adding the field information to a preset first-in first-out queue;
the queue reading module is used for sequentially taking out the field information in the preset first-in first-out queue;
and the recalculation module is used for recalculating the calculation chain of which the calculation parameters comprise the field information in a preset calculation chain history set until the recalculation of all the field information in the preset first-in first-out queue is completed.
9. An apparatus comprising a memory, a processor for implementing the steps of the computational method of multi-field concurrent modification according to any of claims 1-7 when executing a computer management class program stored in the memory.
10. A computer-readable storage medium, characterized in that a computer management class program is stored thereon, which, when executed by a processor, implements the steps of the computing method of multi-field concurrent modification according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211430557.XA CN115809048A (en) | 2022-11-15 | 2022-11-15 | Computing method, system, equipment and storage medium for multi-field concurrent modification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211430557.XA CN115809048A (en) | 2022-11-15 | 2022-11-15 | Computing method, system, equipment and storage medium for multi-field concurrent modification |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115809048A true CN115809048A (en) | 2023-03-17 |
Family
ID=85483327
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211430557.XA Pending CN115809048A (en) | 2022-11-15 | 2022-11-15 | Computing method, system, equipment and storage medium for multi-field concurrent modification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115809048A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117648202A (en) * | 2024-01-30 | 2024-03-05 | 深圳市纷享互联科技有限责任公司 | Heterogeneous system data synchronization process endless loop detection method, system and medium |
-
2022
- 2022-11-15 CN CN202211430557.XA patent/CN115809048A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117648202A (en) * | 2024-01-30 | 2024-03-05 | 深圳市纷享互联科技有限责任公司 | Heterogeneous system data synchronization process endless loop detection method, system and medium |
| CN117648202B (en) * | 2024-01-30 | 2024-05-14 | 深圳市纷享互联科技有限责任公司 | Heterogeneous system data synchronization process endless loop detection method, system and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Drechsler et al. | Distributed REScala: An update algorithm for distributed reactive programming | |
| US20180240062A1 (en) | Collaborative algorithm development, deployment, and tuning platform | |
| US9672276B2 (en) | Multi-act creation user interface element | |
| US10963301B2 (en) | Scheduling operations on a computation graph | |
| JP2019533257A (en) | Neural architecture search | |
| US20200294038A1 (en) | System and method for executing transactions on blockchain networks | |
| US10303444B2 (en) | Composable application session parameters | |
| CN108509220B (en) | Revit engineering calculation amount parallel processing method, device, terminal and medium | |
| US20190370322A1 (en) | Spreadsheet recalculation algorithm for directed acyclic graph processing | |
| US20100281241A1 (en) | Method and system for synchronizing inclusive decision branches | |
| US20090315894A1 (en) | Browser-independent animation engines | |
| CN115809048A (en) | Computing method, system, equipment and storage medium for multi-field concurrent modification | |
| US11429378B1 (en) | Change estimation in version control system | |
| CN110599341A (en) | Transaction calling method and system | |
| CN108920281A (en) | Extensive image processing method and system | |
| CN110377769B (en) | Modeling platform system, method, server and medium based on graph data structure | |
| CN111523921B (en) | Funnel analysis method, analysis device, electronic device, and readable storage medium | |
| US20080092147A1 (en) | Method for Determining Deadlocks in Secondary Processes | |
| CN115865607A (en) | Distributed training computing node management method and related device | |
| US20160004982A1 (en) | Method and system for estimating the progress and completion of a project based on a bayesian network | |
| CN116009852A (en) | Code construction method, device, computer equipment and storage medium | |
| CN114237775A (en) | Parallel execution method and device, electronic equipment and storage medium | |
| CN111258785B (en) | Data shuffling method and device | |
| WO2019136178A1 (en) | Collaborative algorithm development, deployment, and tuning platform | |
| CN110442572A (en) | The determination method and device of user characteristics value |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |