CN116484822A - Form field expression circular dependency calculation method and device - Google Patents
Form field expression circular dependency calculation method and device Download PDFInfo
- Publication number
- CN116484822A CN116484822A CN202310756067.7A CN202310756067A CN116484822A CN 116484822 A CN116484822 A CN 116484822A CN 202310756067 A CN202310756067 A CN 202310756067A CN 116484822 A CN116484822 A CN 116484822A
- Authority
- CN
- China
- Prior art keywords
- field
- ring
- graph
- path
- dependency
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 52
- 230000014509 gene expression Effects 0.000 title claims abstract description 50
- 125000004122 cyclic group Chemical group 0.000 claims abstract description 74
- 238000000034 method Methods 0.000 claims abstract description 10
- 230000001419 dependent effect Effects 0.000 claims description 33
- 239000003550 marker Substances 0.000 claims description 5
- 238000011144 upstream manufacturing Methods 0.000 claims description 4
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 13
- 125000002015 acyclic group Chemical group 0.000 description 6
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/177—Editing, e.g. inserting or deleting of tables; using ruled lines
- G06F40/18—Editing, e.g. inserting or deleting of tables; using ruled lines of spreadsheets
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The disclosure provides a form field expression circular dependency calculation method and device, wherein the method comprises the following steps: according to whether the form field with external change in the form dependency relationship directed graph is on the cyclic dependency path, selecting whether to use the form field as a new latest updated field; obtaining a sub-graph of the whole form dependency relationship directed graph according to the form field with external change, and obtaining a cyclic dependency path needing to be updated and an entering ring list of the sub-graph according to an entering ring point of the sub-graph; determining a unique mark node for cutting off according to the latest update field and the ring entry list; traversing all the cyclic dependency paths, marking the incoming edge of the marking node in each cyclic dependency path as cut-off, and converting the cyclic graph of the form dependency relationship directed graph into the acyclic graph; and performing topological sorting on the acyclic graph to obtain the optimal calculation sequence of the expressions, and sequentially calculating the field expressions by using the optimal calculation sequence.
Description
Technical Field
The present document relates to the field of computer software, and in particular, to a form field expression type circular dependency calculation method and apparatus.
Background
Forms are the most common data input and interaction modes in programs and websites in the Internet field, form fields are usually data input by users, and field expressions can be calculated or processed according to the input of the users, so that the efficiency of form input is improved. The calculation order of the field expressions is typically to build a dependency graph between form fields, determine the calculation order of the form fields as a topological order in the directed acyclic graph, and then calculate the form fields according to the topological order.
There may be a cyclic dependency between form fields, e.g., a's calculation depends on B's value, B's calculation depends on C's value, and C's calculation depends on a's value, in which case if the calculations are performed in the order of the expressions, infinite loops may result and correct calculation results may not be obtained.
Currently, methods for solving the form field expression type circular dependency generally avoid circular dependency by manually adjusting the expression dependency of the form field. The existing method has the following defects: manual intervention is required, automatic processing cannot be realized, and processing efficiency is low. In view of the above analysis of the development status in the technical field, the existing technical solution lacks an automated related design, so that a form field expression circular dependency calculation method and device capable of solving the above problems are urgently needed.
Disclosure of Invention
The invention aims to provide a form field expression circular dependency calculation method and device, and aims to solve the problems in the prior art.
According to a first aspect of an embodiment of the present disclosure, there is provided a form field expression loop dependency calculation method, including:
according to whether the form field with external change in the form dependency relationship directed graph is on the cyclic dependency path, selecting whether to use the form field as a new latest updated field;
obtaining a sub-graph of the whole form dependency relationship directed graph according to the form field with external change, and obtaining a cyclic dependency path needing to be updated and an entering ring list of the sub-graph according to an entering ring point of the sub-graph;
determining a unique mark node for cutting off according to the latest update field and the ring entry list;
traversing all the cyclic dependency paths, marking the incoming edge of the marking node in each cyclic dependency path as cut-off, and converting the cyclic graph of the form dependency relationship directed graph into the acyclic graph;
and performing topological sorting on the acyclic graph to obtain the optimal calculation sequence of the expressions, and sequentially calculating the field expressions by using the optimal calculation sequence.
According to a second aspect of embodiments of the present disclosure, there is provided a form field expression loop-dependent computing device, comprising:
the latest update field determining module is used for selecting whether to use the form field as a new latest update field according to whether the form field with external change in the form dependency relationship directed graph is on a cyclic dependency path or not;
the sub-graph path list updating module is used for acquiring a sub-graph of the whole form dependency relationship directed graph according to the form field with external change, and acquiring a cyclic dependency path and a sub-graph ring entry list thereof which need to be updated according to an entry point of the sub-graph;
the marking node determining module is used for determining a unique marking node for cutting off the update according to the latest update field and the ring entry list;
the loop-free graph conversion module is used for traversing all the circularly dependent paths, marking the incoming edge of the marking node in each circularly dependent path as cut-off, and converting the loop graph of the form dependency relationship directed graph into the loop-free graph;
and the optimal calculation sequence acquisition module is used for carrying out topological ordering on the acyclic graph to obtain the optimal calculation sequence of the expressions, and sequentially calculating the field expressions by using the optimal calculation sequence.
The technical scheme provided by the embodiment of the disclosure can comprise the following beneficial effects: and determining the marking nodes to cut off the cyclic dependency relationship by updating the fields recently, the subgraph of the cyclic dependency path and the ring entry list of the subgraph, so that the efficiency and the automation calculation degree of the cyclic dependency calculation of the form field expression are improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
For a clearer description of one or more embodiments of the present description or of the solutions of the prior art, the drawings that are necessary for the description of the embodiments or of the prior art will be briefly described, it being apparent that the drawings in the description that follow are only some of the embodiments described in the description, from which, for a person skilled in the art, other drawings can be obtained without inventive faculty.
FIG. 1 is a flow chart of a form field expression loop dependent calculation method of an embodiment of the present invention;
FIG. 2 is a schematic diagram of a form field expression loop-dependent computing device in accordance with an embodiment of the present invention.
Detailed Description
In order to enable a person skilled in the art to better understand the technical solutions in one or more embodiments of the present specification, the technical solutions in one or more embodiments of the present specification will be clearly and completely described below with reference to the drawings in one or more embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one or more embodiments of the present disclosure without inventive faculty, are intended to be within the scope of the present disclosure.
Method embodiment
According to an embodiment of the present invention, a form field expression circular dependency calculation method is provided, and fig. 1 is a schematic diagram of the form field expression circular dependency calculation method according to the embodiment of the present invention, as shown in fig. 1, the form field expression circular dependency calculation method according to the embodiment of the present invention specifically includes:
in step S110, according to whether the form field with the external change in the form dependency relationship directed graph is on the cyclic dependency path, selecting whether to use the form field as a new latest updated field specifically includes:
if the form field with the external change is located on a certain circularly dependent path, the form field is used as a new latest updated field; if the form field with the external change is not on a certain circularly dependent path, the original latest updated field is reserved; if the external change involves multiple form fields on a certain circularly dependent path, the field with the largest weight value is selected as the new latest updated field.
In step S120, a sub-graph of the entire form dependency relationship directed graph is obtained according to the form field with the external change, and a ring entry list of the cyclic dependency path and the sub-graph thereof to be updated is obtained according to the ring entry point of the sub-graph;
in step S120, the obtaining, according to the ring-in node of the sub-graph, the ring-in list of the cyclic dependency path and the sub-graph thereof, which need to be updated, specifically includes: if the subgraph is judged to have no cyclic dependency path of the ring node, the cyclic dependency path does not need to be updated; if the subgraph is judged to have the cyclic dependency path of the ring entering node, the cyclic dependency path and the ring entering list thereof need to be updated, the form field with external change is added to the ring entering list on the cyclic dependency path, the form field with external change is not on the cyclic dependency path, and the form field with external change can walk up to the ring node on the dependent path to be added to the ring entering list.
In step S130, determining a unique marker node for cutting off according to the latest update field and the ring entry list, which specifically includes:
setting the ring-in node as a marking node under the condition that the ring-in list has only one ring-in node; and setting the ring-in node which is farthest from the absolute value of the latest updated field in the ring-in list as a mark node when the ring-in list has a plurality of ring-in nodes.
In step S140, traversing all the cyclic dependency paths, marking the incoming edge of the marking node in each cyclic dependency path as cut-off, and converting the cyclic graph of the form dependency directed graph into the acyclic graph;
in step S150, the acyclic graph is topologically ordered to obtain an optimal calculation order of the expressions, and the field expressions are sequentially calculated using the optimal calculation order.
The method further comprises the steps of: when the external change of the form fields occurs for the first time, marking weight values for all the form fields in the form in advance by using a form field expression type circular dependency calculation method, so that the weights among the form fields are ensured to be different; and reversely establishing the dependency relationship between the form fields as a directed graph, taking the form fields as nodes, taking the dependency relationship as edges, positioning the dependent form fields at the upstream, detecting and recording all the cyclic dependency paths, and setting the form field with the maximum weight value in each cyclic dependency path as the current latest updated field.
In the following embodiment, a form contains A, B, C, D, E five fields, and the dependency relationship between the fields is: the calculation of A depends on the values of D and E; the calculation of B depends on the value of a; the calculation of C depends on the value of B; the calculation of D is independent of other values; the calculation of E depends on the values of C and D. The solving steps are as follows:
the form fields are marked with weight values, a=1, b=2, c=3, d=4, e=5, in this embodiment, the established directed graph is d→a, d→e, e→a, a→b, b→c, c→e, and the current latest updated field is E with the largest weight value.
The user modifies the value of form field B, which in this embodiment has only one circularly dependent path, and the B field is located on the circularly dependent path, with form field B as the new most recently updated field.
The subgraph of the whole form dependency relationship directed graph includes B, C, E, A, in this embodiment, only one cyclic dependency path needs to be updated, and since the B field is located on the cyclic dependency path, only the form field B is in the ring entry list, the form field B is set as a marking node, and the marking node is marked as cut-off at the entry side a→b of the cyclic dependency path.
After converting a loop diagram of a form dependency directed diagram into an acyclic diagram, the edges of the acyclic diagram comprise D-A, D-E, E-A, B-C, C-E, and performing topological ordering on the acyclic diagram to obtain an optimal calculation sequence of the expression, namely B-C-D-E-A, and sequentially calculating the field expression by using the optimal calculation sequence.
When the user modifies the value of the form field D again, the form field which is changed externally at this time is not on a certain circularly dependent path, the original latest updated field, namely the form field B, is reserved.
At this time, the subgraph of the whole form dependency relationship directed graph includes D, E, A, B, C, only one cyclic dependency path needs to be updated, the entering ring list has a form field a and a form field E, the absolute value distance between the form field a and the latest updated field B is 1, the absolute value distance between the form field E and the latest updated field B is 2, the form field E with the farthest absolute value distance is selected as a marking node, and the marking node is marked as cut off at the entering edge c→e of the cyclic dependency path.
After converting a loop diagram of a form dependency directed diagram into an acyclic diagram, the edges of the acyclic diagram comprise D-A, D-E, E-A, A-B, B-C, topological ordering is carried out on the acyclic diagram to obtain an optimal calculation sequence of the expressions, namely D-E-A-B-C, and the field expressions are calculated sequentially by using the optimal calculation sequence.
In summary, the above technical solution of the embodiment of the present invention provides a form field expression circular dependency calculation method, which acquires a latest updated field by collecting a change sequence of form fields, determines a sub-graph of a circular dependency path and an in-loop list of the sub-graph, and determines a marker node to cut off a circular dependency relationship, so as to ensure that a form field which has been recently modified is calculated last in circular dependency, thereby improving efficiency and automation degree of form field expression circular dependency calculation.
Device embodiment
According to an embodiment of the present invention, there is provided a form field expression loop-dependent computing device, and fig. 2 is a schematic diagram of the form field expression loop-dependent computing device according to an embodiment of the present invention, as shown in fig. 2, where the form field expression loop-dependent computing device according to an embodiment of the present invention specifically includes:
the latest update field determining module 20 is configured to select whether to use the form field as a new latest update field according to whether the form field that has changed externally in the form dependency relationship directed graph is on the cyclic dependency path, specifically configured to:
if the form field with the external change is located on a certain circularly dependent path, the form field is used as a new latest updated field; if the form field with the external change is not on a certain circularly dependent path, the original latest updated field is reserved; if the external change involves multiple form fields on a certain circularly dependent path, the field with the largest weight value is selected as the new latest updated field.
The sub-graph path list updating module 22 is configured to obtain a sub-graph of the entire form dependency relationship directed graph according to a form field that changes externally, and obtain a cyclic dependency path that needs to be updated and a sub-graph ring entry list thereof according to an entry point where the sub-graph is;
the sub-graph path list updating module 22 obtains the circularly dependent path to be updated and the sub-graph loop list thereof according to the ingress node where the sub-graph is, and is specifically configured to: if the subgraph is judged to have no cyclic dependency path of the ring node, the cyclic dependency path does not need to be updated; if the subgraph is judged to have the cyclic dependency path of the ring entering node, the cyclic dependency path and the ring entering list thereof need to be updated, the form field with external change is added to the ring entering list on the cyclic dependency path, the form field with external change is not on the cyclic dependency path, and the form field with external change can walk up to the ring node on the dependent path to be added to the ring entering list.
The marking node determining module 24 is configured to determine, according to the latest update field and the ring entry list, a marking node for cutting off that is unique to the update, and specifically is configured to:
setting the ring-in node as a marking node under the condition that the ring-in list has only one ring-in node; and setting the ring-in node which is farthest from the absolute value of the latest updated field in the ring-in list as a mark node when the ring-in list has a plurality of ring-in nodes.
The loop-free graph conversion module 26 is configured to traverse all the cyclic dependency paths, mark the incoming edge of the marking node in each cyclic dependency path as cut-off, and convert the loop graph of the form dependency relationship directed graph into the loop-free graph;
the optimal computation order acquisition module 28 is configured to topologically order the acyclic graph to obtain an optimal computation order of the expressions, and sequentially compute the field expressions using the optimal computation order.
The apparatus further comprises:
an initialization module 210, configured to, when a first external change of a form field occurs, mark weight values for all form fields in the form in advance by using a form field expression type circular dependency calculation method, so as to ensure that weights between fields are different; and reversely establishing the dependency relationship between the form fields as a directed graph, taking the form fields as nodes, taking the dependency relationship as edges, positioning the dependent form fields at the upstream, detecting and recording all the cyclic dependency paths, and setting the form field with the maximum weight value in each cyclic dependency path as the current latest updated field.
In summary, the above technical solution of the embodiment of the present invention provides a form field expression circular dependency calculation device, which acquires a latest updated field by collecting a change sequence of form fields, determines a sub-graph of a circular dependency path and an in-loop list of the sub-graph, and determines a marker node to cut off a circular dependency relationship, so as to ensure that a form field which has been recently modified is calculated last in the circular dependency, thereby improving efficiency and automation degree of the form field expression circular dependency calculation.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (10)
1. A form field expression loop dependency calculation method, comprising:
according to whether the form field with external change in the form dependency relationship directed graph is on the cyclic dependency path, selecting whether to use the form field as a new latest updated field;
obtaining a sub-graph of the whole form dependency relationship directed graph according to the form field with external change, and obtaining a cyclic dependency path needing to be updated and an entry ring list of the sub-graph according to an entry ring point of the sub-graph;
determining a unique mark node for cutting off the update according to the latest update field and the ring entry list;
traversing all the cyclic dependency paths, marking the incoming edge of the marking node in each cyclic dependency path as cut-off, and converting the cyclic graph of the form dependency relationship directed graph into an acyclic graph;
and performing topological sorting on the acyclic graph to obtain the optimal calculation sequence of the expressions, and sequentially calculating the field expressions by using the optimal calculation sequence.
2. The method according to claim 1, wherein the method further comprises:
when the external change of the form fields occurs for the first time, marking weight values for all the form fields in the form in advance by using a form field expression type circular dependency calculation method, so that the weights among the form fields are ensured to be different; and reversely establishing the dependency relationship between the form fields as a directed graph, taking the form fields as nodes, taking the dependency relationship as edges, positioning the dependent form fields at the upstream, detecting and recording all the cyclic dependency paths, and setting the form field with the maximum weight value in each cyclic dependency path as the current latest updated field.
3. The method according to claim 1, wherein the selecting whether the form field is used as the new latest updated field according to whether the form field that is changed externally in the form dependency graph is on the cyclic dependency path comprises:
if the form field with the external change is located on a certain circularly dependent path, the form field is used as a new latest updated field; if the form field with the external change is not on a certain circularly dependent path, the original latest updated field is reserved; if the external change involves multiple form fields on a certain circularly dependent path, the field with the largest weight value is selected as the new latest updated field.
4. The method according to claim 1, wherein the step of obtaining the ring entry list of the cyclic dependency path and the sub-graph thereof, which need to be updated, according to the ring entry point of the sub-graph specifically comprises:
if the subgraph is judged to have no cyclic dependency path of the ring node, the cyclic dependency path does not need to be updated; if the subgraph is judged to have a cyclic dependency path of a ring entering node, the cyclic dependency path and a ring entering list thereof need to be updated, the form field with external change is added to the ring entering list on the cyclic dependency path, the form field with external change is not on the cyclic dependency path, and the form field with external change can walk up to the ring node on the cyclic dependency path to be added to the ring entering list.
5. The method according to claim 1, wherein the determining, according to the latest update field and the ring entry list, a marker node for cutting off that is unique to the current update specifically includes:
setting the ring-in node as a marking node under the condition that the ring-in list has only one ring-in node; and setting the ring entry node with the farthest absolute value distance from the latest updated field in the ring entry list as a marked node under the condition that the ring entry list is provided with a plurality of ring entry nodes.
6. A form field expression loop dependent computing device, comprising:
the latest update field determining module is used for selecting whether to use the form field as a new latest update field according to whether the form field with external change in the form dependency relationship directed graph is on a cyclic dependency path or not;
the sub-graph path list updating module is used for acquiring a sub-graph of the whole form dependency relationship directed graph according to the form field with external change, and acquiring a cyclic dependency path and a sub-graph ring entry list thereof which need to be updated according to an entry point of the sub-graph;
the marking node determining module is used for determining a unique marking node for cutting off the update according to the latest update field and the ring entry list;
the loop-free graph conversion module is used for traversing all the circularly dependent paths, marking the incoming edge of the marking node in each circularly dependent path as cut-off, and converting the loop graph of the form dependency relationship directed graph into the loop-free graph;
and the optimal calculation sequence acquisition module is used for carrying out topological ordering on the acyclic graph to obtain the optimal calculation sequence of the expressions, and sequentially calculating the field expressions by using the optimal calculation sequence.
7. The apparatus of claim 6, wherein the apparatus further comprises:
the initialization module is used for marking weight values for all the form fields in the form in advance by using a form field expression type circular dependency calculation method when the form field external change occurs for the first time, so that the weights among the fields are ensured to be different; and reversely establishing the dependency relationship between the form fields as a directed graph, taking the form fields as nodes, taking the dependency relationship as edges, positioning the dependent form fields at the upstream, detecting and recording all the cyclic dependency paths, and setting the form field with the maximum weight value in each cyclic dependency path as the current latest updated field.
8. The apparatus of claim 6, wherein the most recent update field determination module specifically comprises:
if the form field with the external change is located on a certain circularly dependent path, the form field is used as a new latest updated field; if the form field with the external change is not on a certain circularly dependent path, the original latest updated field is reserved; if the external change involves multiple form fields on a certain circularly dependent path, the field with the largest weight value is selected as the new latest updated field.
9. The apparatus of claim 6, wherein the sub-graph path list update module specifically comprises:
if the subgraph is judged to have no cyclic dependency path of the ring node, the cyclic dependency path does not need to be updated; if the subgraph is judged to have a cyclic dependency path of a ring entering node, the cyclic dependency path and a ring entering list thereof need to be updated, the form field with external change is added to the ring entering list on the cyclic dependency path, the form field with external change is not on the cyclic dependency path, and the form field with external change can walk up to the ring node on the cyclic dependency path to be added to the ring entering list.
10. The apparatus of claim 6, wherein the marker node determination module specifically comprises:
setting the ring-in node as a marking node under the condition that the ring-in list has only one ring-in node; and setting the ring entry node with the farthest absolute value distance from the latest updated field in the ring entry list as a marked node under the condition that the ring entry list is provided with a plurality of ring entry nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310756067.7A CN116484822B (en) | 2023-06-26 | 2023-06-26 | Form field expression circular dependency calculation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310756067.7A CN116484822B (en) | 2023-06-26 | 2023-06-26 | Form field expression circular dependency calculation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116484822A true CN116484822A (en) | 2023-07-25 |
| CN116484822B CN116484822B (en) | 2023-09-01 |
Family
ID=87221805
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310756067.7A Active CN116484822B (en) | 2023-06-26 | 2023-06-26 | Form field expression circular dependency calculation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116484822B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080040367A1 (en) * | 2006-08-07 | 2008-02-14 | International Business Machines Corporation | Methods, systems, and computer program products for using graphs to solve circular dependency in object persistence |
| CN103678621A (en) * | 2013-12-18 | 2014-03-26 | 上海达梦数据库有限公司 | SQL statement optimization method based on constant substitution |
| CN106970788A (en) * | 2017-02-24 | 2017-07-21 | 中国人民解放军海军大连舰艇学院 | A kind of object dependency relation based on tense finds method and system |
| CN108541321A (en) * | 2016-02-26 | 2018-09-14 | 谷歌有限责任公司 | Program code is mapped to the technique of compiling of the programmable graphics processing hardware platform of high-performance, high effect |
| CN112861492A (en) * | 2021-01-27 | 2021-05-28 | 亿企赢网络科技有限公司 | Method and device for linkage calculation between internal tables of report table and electronic equipment |
| CN115113858A (en) * | 2022-06-28 | 2022-09-27 | 平安银行股份有限公司 | Method and system for detecting class cycle dependence |
| CN115840745A (en) * | 2022-11-10 | 2023-03-24 | 重庆市通信产业服务有限公司中冉信息分公司 | Scheduling method and device based on dynamic form, computer equipment and storage medium |
-
2023
- 2023-06-26 CN CN202310756067.7A patent/CN116484822B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080040367A1 (en) * | 2006-08-07 | 2008-02-14 | International Business Machines Corporation | Methods, systems, and computer program products for using graphs to solve circular dependency in object persistence |
| CN103678621A (en) * | 2013-12-18 | 2014-03-26 | 上海达梦数据库有限公司 | SQL statement optimization method based on constant substitution |
| CN108541321A (en) * | 2016-02-26 | 2018-09-14 | 谷歌有限责任公司 | Program code is mapped to the technique of compiling of the programmable graphics processing hardware platform of high-performance, high effect |
| CN106970788A (en) * | 2017-02-24 | 2017-07-21 | 中国人民解放军海军大连舰艇学院 | A kind of object dependency relation based on tense finds method and system |
| CN112861492A (en) * | 2021-01-27 | 2021-05-28 | 亿企赢网络科技有限公司 | Method and device for linkage calculation between internal tables of report table and electronic equipment |
| CN115113858A (en) * | 2022-06-28 | 2022-09-27 | 平安银行股份有限公司 | Method and system for detecting class cycle dependence |
| CN115840745A (en) * | 2022-11-10 | 2023-03-24 | 重庆市通信产业服务有限公司中冉信息分公司 | Scheduling method and device based on dynamic form, computer equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 董东等: "《动态拓扑排序途径的XForms表单自动计算研究》", 《计算机工程与设计》, vol. 28, no. 13 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116484822B (en) | 2023-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks | |
| US9710455B2 (en) | Feature text string-based sensitive text detecting method and apparatus | |
| CN111125268B (en) | Network alarm analysis model creation method, alarm analysis method and device | |
| US8626835B1 (en) | Social identity clustering | |
| CN107918629B (en) | Correlation method and device for alarm fault | |
| CN107211178B (en) | Somatosensory quality optimization system, device, method, suggestion request device, method and readable storage medium | |
| CN108924198A (en) | A kind of data dispatching method based on edge calculations, apparatus and system | |
| JP6897446B2 (en) | Search method, search program and search device | |
| TW201700955A (en) | Path planning method and device | |
| CN1517718A (en) | Mobile terminal with positioning function and positioning method | |
| CN111294819B (en) | Network optimization method and device | |
| CN116484822B (en) | Form field expression circular dependency calculation method and device | |
| CN111159420B (en) | Entity optimization method based on attribute calculation and knowledge template | |
| CN107315671B (en) | Application state monitoring method, device and equipment | |
| CN116339239A (en) | Numerical control machine tool cooperative control method, device, equipment and computer storage medium | |
| CN107291767B (en) | Optimization processing method and device for task execution time | |
| CN113688602A (en) | Task processing method and device | |
| CN106407126B (en) | Processing method, device and the server of coverage data | |
| CN107682409B (en) | Cluster resource pre-stretching method and device | |
| JP2015228545A (en) | Information processing device and program | |
| CN111143643B (en) | Element identification method, element identification device, readable storage medium and electronic equipment | |
| CN106778872B (en) | Density-based connected graph clustering method and device | |
| CN109446439A (en) | A kind of selection method of Resource TOC, device, system and storage medium | |
| CN114138330A (en) | Code clone detection optimization method and device based on knowledge graph and electronic equipment | |
| CN111835541B (en) | Method, device, equipment and system for detecting aging of flow identification model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |