CN113539405B - Processing method of electronic medical record form operation control - Google Patents
Processing method of electronic medical record form operation control Download PDFInfo
- Publication number
- CN113539405B CN113539405B CN202110707597.3A CN202110707597A CN113539405B CN 113539405 B CN113539405 B CN 113539405B CN 202110707597 A CN202110707597 A CN 202110707597A CN 113539405 B CN113539405 B CN 113539405B
- Authority
- CN
- China
- Prior art keywords
- node
- symbol
- root
- processing
- operator
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 13
- 238000012545 processing Methods 0.000 claims abstract description 85
- 238000004364 calculation method Methods 0.000 claims abstract description 76
- 238000000034 method Methods 0.000 claims abstract description 33
- 238000000605 extraction Methods 0.000 claims description 7
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 14
- 230000006870 function Effects 0.000 description 5
- 238000013461 design Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000001502 supplementing effect Effects 0.000 description 1
- 230000026676 system process Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H10/00—ICT specially adapted for the handling or processing of patient-related medical or healthcare data
- G16H10/60—ICT specially adapted for the handling or processing of patient-related medical or healthcare data for patient-specific data, e.g. for electronic patient records
- G16H10/65—ICT specially adapted for the handling or processing of patient-related medical or healthcare data for patient-specific data, e.g. for electronic patient records stored on portable record carriers, e.g. on smartcards, RFID tags or CD
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/103—Formatting, i.e. changing of presentation of documents
- G06F40/106—Display of layout of documents; Previewing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/12—Use of codes for handling textual entities
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- General Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Databases & Information Systems (AREA)
- Epidemiology (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Data Mining & Analysis (AREA)
- Medical Treatment And Welfare Office Work (AREA)
- Document Processing Apparatus (AREA)
Abstract
The embodiment of the invention relates to a processing method of an electronic medical record form operation control, which comprises the following steps: extracting a first operation formula from the setting information of the statistical field of the electronic medical record form by using an operation control; performing operation structure splitting treatment on the first operation formula to generate a top-down root operation structure; in the root-like operation structure, the marking, calculation and recursion processing of the end operation node are circularly executed until recursion to the root operation node and the calculation processing of the root operation node is completed, and the final calculation result is used as first result data; and finally, the first result data is used as display information of the statistical field of the electronic medical record form to be displayed. The method of the invention can avoid the error rate generated by manual calculation, improve the accuracy of the statistical data of the electronic form, and solve the problem that the developer cannot develop the electronic form in time for the second time.
Description
Technical Field
The invention relates to the technical field of data information processing, in particular to a processing method of an electronic medical record form operation control.
Background
With the popularity of medical information systems, most medical institutions have adopted electronic medical record systems. However, when designing the electronic medical record form template, the conventional electronic medical record system does not provide a form operation function similar to that of the office software for obtaining statistical data by setting a form operation formula and performing self-operation on the form operation formula for the form template, so that a user of a medical institution can only perform statistical calculation on the form data of the created electronic medical record form by manual calculation or require a developer to additionally develop a custom program. With this solution, which is manually calculated, it is known that it is difficult to avoid calculation errors; the solution of supplementing and developing the customized program by the developer is that on one hand, the development is periodic and can not timely solve the requirements of clients, and on the other hand, the developer can not adapt to each statistical requirement by developing a section of application program.
Disclosure of Invention
The invention aims at overcoming the defects of the prior art, and provides a processing method of an electronic medical record form operation control, which provides an operation control capable of directly carrying out form operation on an electronic medical record form for an electronic medical record system, and the control can automatically carry out statistical operation on the form content according to a preset operation formula.
To achieve the above objective, an embodiment of the present invention provides a method for processing an electronic medical record form operation control, where the method includes:
extracting a first operation formula from the setting information of the statistical field of the electronic medical record form by using an operation control;
performing operation structure splitting treatment on the first operation formula to generate a top-down root operation structure; the root operation structure consists of a plurality of operation nodes; the plurality of operation nodes comprise a root operation node and a plurality of sub operation nodes; each sub-operation node can trace back to the root operation node step by step through a recursion relation with an upper operation node;
in the root operation structure, the marking, calculation and recursion processing of the end operation node are circularly executed until recursion to the root operation node and the calculation processing of the root operation node are completed, and the final calculation result is used as first result data;
and displaying the first result data as display information of the statistical field of the electronic medical record form.
Preferably, each operation node comprises at least one group of operation object sequences and operation symbol sequences; the operation object sequence comprises a plurality of operation objects, and the operation symbol sequence comprises a plurality of operation symbols; each sub operation node corresponds to one operation object of the previous operation node;
The operation control is preset with a primary operator set, a secondary operator set and a tertiary operator set; the first-level set of operators includes an addition operator and a subtraction operator; the set of secondary operators includes a multiply operator and a divide operator; the three-level operator set comprises a square operator, an evolution operator, a power operator and a logarithm operator;
the operation control is preset with a bracket character set; the set of bracket symbols includes a small bracket symbol, a medium bracket symbol, and a large bracket symbol.
Preferably, the splitting of the operation structure of the first operation formula to generate a top-down root operation structure specifically includes:
the operation control marks the first operation formula as the root operation node;
splitting the operation object and the operation symbol of the root operation node to obtain an operation object sequence and an operation symbol sequence of the root operation node; then, each operation object of the operation object sequence of the root operation node is polled, the operation formula identification processing is carried out on the operation object currently polled, and if the operation object currently polled is identified as the operation formula, the operation object currently polled is marked as a new sub operation node;
Continuing to split the operation objects and the operation symbols of all the new sub operation nodes until all the operation objects of the operation object sequence split by the new sub operation nodes are not recognized as an operation formula;
and finally, forming the root operation structure by the hierarchical recursion relation of the root operation node and each sub operation node, and the operation object sequence and the operation symbol sequence split by each operation node.
Further, the splitting processing of the operand and the operand specifically includes:
the operation node to be split by the operation control is used as a first split operation node; the character information of the first splitting operation node is used as first character string data;
performing first judgment processing on the first character string data: extracting first and last characters which are not empty of the current first character string data to form first comparison character string data, judging whether the first comparison character string data are matched with any bracket symbol of the bracket symbol set, and removing the characters corresponding to the first comparison character string data from the current first character string data if the judgment result is that the first comparison character string data are matched with any bracket symbol of the bracket symbol set, so as to obtain new first character string data; and continuing the first judgment processing on the new first character string data until the judgment result is not matched; and taking the last first character string data as second character string data;
Firstly, using operators in the first-level operator set and the second-level operator set as operator extraction marks, extracting matched characters or character strings from the second character string data as operation symbols, and forming an operation symbol sequence by the operation symbols; when the operation symbol is extracted, extracting no bracketed characters or three-level operator characters in the second character string data; backing up the index position of the operation symbol in the second character string data when the operation symbol is extracted;
if the operation symbol sequence is not null, sequentially extracting characters or character strings separated by the operation symbols from the second character string data as the operation objects, and forming the operation object sequence by the operation objects;
if the operation symbol sequence is empty, then using an operator in the three-level operator set as an operator extraction mark, extracting a unique matched character or character string from the second character string data as the operation symbol, and forming the operation symbol sequence by the operation symbol; and if the operation symbol sequence is not null, taking the characters or the character strings except the operation symbols in the second character string data as the unique operation objects, and forming the operation object sequence by the operation objects.
Further, the identification processing of the operation formula specifically includes:
the operation control takes an operation object to be subjected to identification processing as a first identification operation object;
extracting the first and last characters which are not empty of the first identification operation object to form second comparison character string data;
if the second comparison character string data is matched with any bracket symbol of the bracket symbol set, setting an identification result of the identification processing of the operation formula as the operation formula;
and if the second comparison character string data is not matched with any bracket symbol of the bracket symbol set, performing three-level operator matching processing on the first identification operation object according to an operator of the three-level operator set, and if matching is successful, setting an identification result of the identification processing of the operation formula as the operation formula.
Preferably, in the root computing structure, the marking, calculating and recursing of the end computing node are circularly performed until recursion to the root computing node and completion of the calculating process of the root computing node, and a final calculation result is taken as first result data, and specifically includes:
Step 61, the operation control performs marking processing of the end operation nodes in the root operation structure, so as to obtain a plurality of end operation nodes;
step 62, if the number of the end operation nodes is not unique or the end operation nodes are not the root operation nodes, performing calculation processing of the end operation nodes on the end operation nodes respectively, and generating corresponding first node values; performing recursion processing of the end operation nodes on each end operation node according to the first node value; then deleting each terminal operation node marked at the time from the root operation structure; continuing to step 61;
step 63, if the number of the end operation nodes is unique and the end operation node is the root operation node, performing calculation processing of the end operation node on the root operation node, and generating the first result data.
Further, the operation control performs a marking process of the end operation node in the root operation structure, so as to obtain a plurality of end operation nodes, and specifically includes:
the operation control marks the operation nodes which only comprise a group of operation object sequences and operation symbol sequences in the root operation structure as the end operation nodes, and all the end operation nodes form a plurality of end operation nodes.
Further, the processing method of the electronic medical record form operation control is characterized in that the calculation processing of the terminal operation node specifically comprises the following steps:
the terminal operation node to be subjected to calculation processing by the operation control is used as a first terminal operation node;
then, replacing the electronic medical record table field object with the operation object sequence of the first end operation node; polling the operation object of the operation object sequence, if the character type of the operation object currently polled is not a digital character type, taking the operation object currently polled as a table field label, acquiring corresponding field content from the electronic medical record table according to the table field label to generate first parameter data, and replacing the operation object currently polled by using the first parameter data;
then, carrying out operator level recognition on the operation symbols of the operation symbol sequence of the first end operation node; if the number of the operation symbols is unique and the operation symbols are matched with any operator of the three-level operator set, setting the level identification result as three levels; if all the operation symbols are matched with operators of the primary operator set or the secondary operator set, setting the grade identification result as a secondary;
Then, according to the grade identification result, calculating an operation object;
if the level identification result is a three-level operator, extracting a unique operation object from the operation object sequence as a first one-to-one calculation parameter, extracting a unique operation symbol from the operation symbol sequence as a first one-to-one operation symbol, executing first digital operation processing corresponding to the first one-to-one operation symbol on the first one-to-one calculation parameter, and taking the operation result as final output data of the calculation processing of the terminal operation node;
if the level identification result is a level operator, extracting a first operation object from the operation object sequence as a first operation item; extracting a first operation symbol from the operation symbol sequence as a second operation symbol, extracting a second operation object from the operation object sequence as a second calculation parameter, and taking a first operation item, a second operation symbol and a second calculation parameter as a second operation item; the last operation symbol is extracted from the operation symbol sequence to be used as a final operation symbol after the last operation item of the last operation is obtained, the last operation object is extracted from the operation object sequence to be used as a final calculation parameter, and the last operation item, the final operation symbol and the final calculation parameter are used as final operation items; and carrying out corresponding second digital operation processing on the final operation item according to a four-way algorithm of first multiply-divide and then add-subtract, and taking an operation result as final output data of the calculation processing of the terminal operation node.
Further, the performing, according to the first node value, recursive processing of the end operation node on each of the end operation nodes includes:
and marking the operation object corresponding to the current terminal operation node as a first operation object in an operation object sequence of a previous operation node of the current terminal operation node by the operation control, and replacing the first operation object by using the first node value.
According to the processing method of the electronic medical record form operation control, an operation control capable of directly performing form operation on the electronic medical record form is provided for an electronic medical record system, and the control can automatically perform statistical operation on form contents according to a preset operation formula. Therefore, the method of the invention avoids the error rate generated by manual calculation, improves the accuracy of the statistical data of the electronic form, and solves the problem that the developer cannot develop the electronic form for the second time in place.
Drawings
FIG. 1 is a schematic diagram of a processing method of an electronic medical record form operation control according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an electronic medical record table according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a root computing structure according to an embodiment of the present invention;
FIG. 4a is a schematic diagram of a root operation structure for deleting N5 according to an embodiment of the present invention;
fig. 4b is a schematic diagram of a root operation structure for deleting N4 according to an embodiment of the present invention;
fig. 4c is a schematic diagram of a root operation structure for deleting N3 according to an embodiment of the present invention;
fig. 4d is a schematic diagram of a root operation structure for deleting N2 according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
When a user designs a specific electronic medical record form through an electronic medical record form template provided by an electronic medical record system, parameters such as data types, fonts, data quotation relations and the like can be set for each field, and formula design can be performed for each field; after the user completes formula design, the electronic medical record system stores the operation formula information corresponding to the fields into a configuration file related to the current electronic medical record form; when the electronic medical record system retrieves the electronic medical record form, the electronic medical record system processes the content of each field according to the corresponding field configuration information in the configuration file, and when the configuration information of a certain field is found to have an operation formula, the electronic medical record system automatically analyzes and carries out operation processing on the operation formula by using the operation control provided by the embodiment of the invention according to the processing method of the electronic medical record form operation control provided by the embodiment of the invention, and the operation result is used as the display information of the current field to display the user; fig. 1 is a schematic diagram of a processing method of an electronic medical record form operation control according to an embodiment of the present invention, where, as shown in fig. 1, the method mainly includes the following steps:
And step 1, extracting a first operation formula from the setting information of the statistical field of the electronic medical record table by using an operation control.
Here, the statistical field is a field in which an operation formula is set in advance, and the first operation formula is an operation formula set in advance in the statistical field.
The electronic medical record system can acquire configuration information of each field in the table from the configuration file related to the current electronic medical record table by using the operation control, wherein the configuration information of the statistical field not only comprises information such as data types and font settings of conventional fields, but also comprises setting information of an operation formula, namely a first operation formula; and the electronic medical record system reads the configuration information of the statistical field by using the operation control, so that the first operation formula can be obtained. In the embodiment of the invention, the formulas of the fields support primary operators including addition and subtraction, secondary operators including multiplication and division, tertiary operators including evolution, squaring, exponentiation and logarithmic operation, and three types of brackets: brackets, middle brackets and large brackets, while also supporting the use of field labels and or numbers as calculation parameters; in order to meet the above operation functions, the operation control will set a primary operator set, a secondary operator set, a tertiary operator set and a bracket set locally in advance for matching with the subsequent formula analysis operation; wherein the first-level set of operators includes an addition operator and a subtraction operator; the secondary operator set includes multiply operators and divide operators; the three-level operator set includes square operators, evolution operators, power operators, and logarithm operators; the set of bracket symbols includes a small bracket symbol, a medium bracket symbol, and a large bracket symbol; the sub data in each data set is stored in character type.
For example, as shown in the schematic diagram of the electronic medical record table provided in the embodiment of the present invention in fig. 2, the field corresponding to the a-th column of the 1 st row of the table is A1, the field corresponding to the B-th column of the 1 st row is B1, the field corresponding to the C-th column of the 1 st row is C1, the field corresponding to the a-th column of the 2 nd row is A2, the field corresponding to the B-th column of the 2 nd row is B2, the field corresponding to the C-th column of the 2 nd row is C2, and all of A1, B1, C1, A2, B2, and C2 are field labels; c2 is used as a statistical field in advance, and the formula { [ (A1+2) ×3 is set in the internal configuration] 2 If B2+2} +1X2, the first operation formula extracted by the operation control from the statistical field of the electronic medical record table is "{ [ (A1+2) ×3 ]] 2 ÷B2+2}+1×2”。
Step 2, carrying out operation structure splitting treatment on the first operation formula to generate a top-down root operation structure;
the first operation formula is logically summarized by adopting a data structure of a recursion tree (or root), and the purpose of the first operation formula is to hierarchy a long string of character strings containing multi-level operators and multi-brackets, so that the long string of character strings is divided into a plurality of calculation nodes capable of forming the recursion relation; it is common to implement it with recursive functions (classes) or nested functions (classes) when it is implemented;
the root-shaped operation structure consists of a plurality of operation nodes; the plurality of operation nodes comprise a root operation node and a plurality of sub operation nodes; each sub operation node can trace back to the root operation node step by step through the recursion relation with the upper operation node; each operation node at least comprises a group of operation object sequences and operation symbol sequences; the operation object sequence comprises a plurality of operation objects, and the operation symbol sequence comprises a plurality of operation symbols; each sub-operation node corresponds to one operation object of the previous operation node;
Here, since the first operation formula is detached downwards from the first operation formula, the first operation formula is the root of the root-like operation structure, the root operation node starts from the root operation node, the addition, subtraction, multiplication and division are taken as basic operators, the calculation items with brackets or calculated by using three-level operators are taken as sub-formulas, each sub-formula is taken as a next-stage operation node (sub-operation node) of the current operation node (the root operation node is considered if the root is the root operation node, and the sub-operation node is considered if the root is not the root) layer by layer until the calculation items with brackets and calculated by using three-level operators are detached from the content of the last current operation node;
the method specifically comprises the following steps: step 21, the operation control marks the first operation formula as a root operation node;
FIG. 3 is a schematic diagram of a root computing structure according to an embodiment of the present invention;
step 22, splitting the operation object and the operation symbol of the root operation node to obtain an operation object sequence and an operation symbol sequence of the root operation node; then, each operation object of the operation object sequence of the root operation node is polled, the operation formula identification processing is carried out on the operation object currently polled, and if the operation object currently polled is identified as the operation formula, the operation object currently polled is marked as a new sub operation node;
Here, the splitting process of the operand and the operator is performed on the root operation node, specifically including:
a1, an operation control takes a root operation node as a first split operation node; the character information of the first splitting operation node is used as first character string data;
for example, as shown in fig. 3, the character information (first character string data) of the root operation node, that is, the first split operation node, is that the content of the first operation formula is "{ [ (a1+2) ×3] 2 B2+2} +1×2"; the root compute node is labeled N1 in fig. 3;
step A2, performing first judgment processing on the first character string data: extracting first and last characters which are not empty of the current first character string data to form first comparison character string data, judging whether the first comparison character string data are matched with any bracket symbol of a bracket symbol set, and removing the characters corresponding to the first comparison character string data from the current first character string data if the judgment result is that the first comparison character string data are matched with any bracket symbol of the bracket symbol set, so as to obtain new first character string data; and continuing the first judgment processing on the new first character string data until the judgment result is not matched; and taking the last first character string data as second character string data;
Here, if the judgment result of the first judgment processing is a match, it is indicated that the first character string data is a bracket expression, such as a small bracket expression, a middle bracket expression, or a large bracket expression, and the processing mode of the bracket expression in this step is to directly remove the outer edge brackets;
for example, if the first string data is "{ [ (a1+2) ]}", using "{ [ (a1+2) ]}" as the current first string data, extracting first comparison string data composed of the first and last non-null characters thereof as "{ }", and if the first comparison string data in the set of bracket symbols matches with the bracket symbols, determining that the first comparison string data is matched, deleting the characters "{" and "}" corresponding to the first comparison string data from the current first string data "{ [ (a1+2) ]" ", and obtaining new first string data as" [ (a1+2) ] "";
extracting first comparison character string data consisting of first and last characters which are not empty from new first character string data [ (A1 + 2) ] which are current first character string data to be "[ ]", wherein the first comparison character string data in the bracket character set are matched with bracket symbols, and judging that the first comparison character string data are matched, and deleting characters "[" and "]", which correspond to the first comparison character string data, from the current first character string data "[ (A1 + 2)", so that the obtained new first character string data are "(A1 + 2)";
Extracting first comparison character string data consisting of first and last characters which are not null from new first character string data (A1 +2) serving as current first character string data as "()", wherein the first comparison character string data in a bracket symbol set is matched with bracket symbols, if a judgment result is matched, deleting characters "(" sum ") corresponding to the first comparison character string data from the current first character string data (A1 +2)", and obtaining new first character string data which is "A1+2";
extracting first comparison character string data consisting of a first character and a last character which are not null from new first character string data A1+2 as current first character string data to obtain first comparison character string data A2, wherein the first comparison character string data is not matched with any bracket symbol in a bracket symbol set, the judgment result is not matched, the first judgment processing of the current cycle is finished, and the last first character string data is A1+2 after the cycle is finished for a plurality of times;
that is, the first string data becomes "a1+2" after several cycles of bracket removal, and then the corresponding second string data is "a1+2";
for another example, the first string data is "{ [ (A1+2) ×3 ] 2 Since the first comparison string data is "{2", which is neither a small bracket nor a middle bracket nor a large bracket, the judgment result of the first judgment process is that it is not matched, and the second string data is "{ [ (a1+2) ×3" as the first string data] 2 ÷B2+2}+1×2”；
A3, firstly, extracting a matched character or character string from the second character string data by taking operators in the first operator set and the second operator set as operator extraction marks, and forming an operation symbol sequence by the operation symbols; during extraction, characters in brackets or three-level operators are not extracted; the operation symbols are extracted and the index positions of the operation symbols in the second character string data are backed up;
for example, the second string data is "{ [ (A1+2) ×3] 2 2+2} +1×2", because the bracketed characters ({ } characters, the characters in ()) or the three-level operator characters ([ the characters in }) cannot be aligned with each other] 2 Character in (c) so that only the last two operators in the second string data can be extracted: the addition operator "+" belonging to the first-level operator set and the multiplication operator "×" belonging to the second-level operator set, so the sequence of operation symbols of the root operation node is "+, ×", as shown in fig. 3; in addition, if the character index in the second string data is calculated from 1, the position of "+" in the second string data should be the 19 th character, and the position of "×" in the second string data should be the 21 st character;
For another example, if the second string data is "[ (A1+2) ×3] 2 ", because it is not possible to work with characters in brackets (()) or with characters in three-level operators ([ the] 2 The character in (b) so that the operation symbol cannot be extracted from the second character string data, and the corresponding operation symbol sequence is null;
step A4, if the operation symbol sequence is not null, sequentially extracting the characters or character strings separated by the operation symbols from the second character string data as operation objects, and forming an operation object sequence by the operation objects;
here, the index position of each operation symbol in the second string data is marked as an isolated position, the character or the string from the first character position of the second string data to the previous character of the first isolated position is the first operation object, the character or the string from the first isolated position to the second isolated position is the second operation object, and so on, the character or the string from the next character position to the last character position of the last isolated position is the last first operation object;
for example, a secondString data is "{ [ (A1+2) ×3] 2 The symbol sequence is "+," x "is not null, the position of" + "in the symbol sequence in the second string data is the 19 th character, the position of" × "in the second string data is the 21 st character, then the strings separated by" + "and" × "are the strings" { [ (a1+2) ×3 ] from 1 to 18 in order ] 2 B2+2} ", 20 th character" 1 "and 22 nd character" 2"; that is, the operation object sequence is "{ [ (A1+2) ×3] 2 B2+2},1,2", as shown in fig. 3;
step A5, if the operation symbol sequence is null, then using the operators in the three-level operator set as operator extraction marks, extracting the uniquely matched characters or character strings from the second character string data as operation symbols, and forming the operation symbol sequence by the operation symbols; if the operation symbol sequence is not null, taking the characters or the character strings except the operation symbols in the second character string data as unique operation objects, and forming an operation object sequence by the operation objects;
here, when the operator symbol sequence is empty, it is described that the second character string data is a three-level operation expression, such as a square expression, an open expression, a power calculation expression, or a logarithmic calculation expression;
for example, if the second string data is "[ (A1+2) ×3] 2 ", the sequence of operation symbols is null," [] 2 ”、“() 2 "and" { } 2 "all can be regarded as square operators of the three-level operator set, and" can be extracted from the second string data "[] 2 If the symbol sequence is "(A1+2) ×3", the symbol sequence is used as the unique symbol, and the operation object sequence is also used as the unique square symbol;
After the splitting processing of the operand and the operator is completed on the root operation node, an operand sequence and an operator sequence corresponding to the root operation node are obtained; to confirm that the operands in the sequence of operands do not include a calculation term or expression with brackets and calculated using three-level operators, it is necessary to identify whether each operand is a calculation term or expression with brackets or calculated using three-level operators, that is, to identify whether each operand is a sub-formula for which the identification process of the formula is performed, specifically including:
step B1, an operation object to be subjected to identification processing by an operation control is used as a first identification operation object;
for example, the operand sequence is "{ [ (A1+2) ×3] 2 When the 1 st operand is identified by ≡B2+2},1, 2', the first identified operand is "{ [ (A1+2) ×3-] 2 B2+2 "; when the 2 nd operation object is identified, the first identification operation object is 1; when the 3 rd operation object is identified, the first identification operation object is 2;
step B2, extracting the first character and the last character which are not empty of the first identification operation object to form second comparison character string data;
For example, the first recognition operand is "{ [ (A1+2) ×3] 2 When ∈2+2} ", the second alignment string data is" { } "; when the first identification operation object is 1, the second comparison character string data is 1; when the first identification operation object is 3, the second comparison character string data is 3;
step B3, if the second comparison character string data is matched with any bracket symbol of the bracket symbol set, setting the identification result of the identification processing of the operation formula as the operation formula;
for example, the operand sequence is "{ [ (A1+2) ×3] 2 When the 1 st operand is identified, the second comparison string data is "{ }" and the bracket symbol of the bracket symbol set are matched, and the corresponding 1 st operand is regarded as an operation formula, as shown in fig. 3;
step B4, if the second comparison character string data is not matched with any bracket symbol of the bracket symbol set, performing three-level operator matching processing on the first identification operation object according to an operator of the three-level operator set, and if matching is successful, setting an identification result of the identification processing of the operation formula as the operation formula;
for example, the operand sequence is "{ [ (A1+2) ×3 ] 2 When the first recognition operand is specifically the 2 nd operand and the 3 rd operand in the operand sequence, the second comparison character string data are respectively '1' and '2', and are not matched with any bracket symbol of the bracket symbol set, the operation control further carries out three-level operator matching treatment on the 2 nd operand and the 3 rd operand according to operators (square operator, evolution operator, power operator and logarithmic operator) of the three-level operator set, and obviously, the two operators are not matched, and the 2 nd operand and the 3 rd operand do not belong to an operation formula as shown in fig. 3;
in summary, through the splitting process of the operation objects and the operation symbols in the steps A1 to A5 and the identifying process of the operation formulas in the steps B1 to B5, the above step 22 completes the splitting and refinement of the structure of the root operation node, as shown in fig. 3, and marks the 1 st operation object identified as the formula as the sub operation node N2 according to the result of the identifying process of the operation formulas;
step 23, continuing to split the operation objects and the operation symbols of all the new sub operation nodes until all the operation objects of the operation object sequence split by the new sub operation nodes are no longer identified as operation formulas;
Here, the operation method of step 22 is adopted to split the sub operation node N2 continuously downwards;
for example, the child operation node N2 is "{ [ (A1+2) ×3] 2 "B2+2 }" the corresponding operand sequence should be "[ (A1+2) ×3 ]] 2 B2,2", the operation symbol sequence is" +.2, + ", each operation object is identified, the obtained result is that the 1 st operation object of the sub operation node N2 is identified as a formula, and then the 1 st operation object is marked as a sub operation node N3;
the sub-operation node N3 is "[ (A1+2) x 3] 2 The corresponding operand sequence only includes "(a1+2) ×3", the operand sequence only includes square operator, the unique operand is identified, the result is that the unique operand of the sub-operand N3 is identified as a formula, and then it is identifiedMarked as a sub-operation node N4;
the sub-operation node N4 is "(a1+2) ×3", the corresponding operation object sequence should be "(a1+2), 3", the operation symbol sequence is "x", each operation object is identified, the 1 st operation object of the obtained result is the sub-operation node N4 identified as a formula, and the sub-operation node N5 is marked;
the sub-operation node N5 is "(a1+2)", the corresponding operation object sequence should be "A1,2", the operation symbol sequence is "+", and each operation object is identified, so that all operation objects of the sub-operation node N5 cannot be identified as formulas, and therefore are not split down continuously;
And step 24, finally, forming a root operation structure by the hierarchical recursion relation of the root operation node and each sub operation node, and the operation object sequence and the operation symbol sequence split by each operation node.
Here, the complete root operation structure and the recursive relation of the sub operation nodes of each level are shown in fig. 3.
Step 3, in the root operation structure, the marking, calculation and recursion processing of the terminal operation node are circularly executed until recursion to the root operation node and the calculation processing of the root operation node is completed, and the final calculation result is used as first result data;
the method specifically comprises the following steps: step 31, the operation control performs marking processing of the terminal operation nodes in the root operation structure, so as to obtain a plurality of terminal operation nodes;
the method comprises the following steps: in the root-shaped operation structure, the operation control marks the operation nodes which only comprise a group of operation object sequences and operation symbol sequences as end operation nodes, and all the end operation nodes form a plurality of end operation nodes;
for example, as shown in fig. 3, if the root operation structure is N5, the operation node including only one group of operation object sequences and operation symbol sequences is denoted as the end operation node;
Step 32, if the number of the end operation nodes is not unique or the end operation node is not the root operation node, respectively executing the calculation processing of the end operation node on each end operation node to generate a corresponding first node value; performing recursion processing of the end operation nodes on each end operation node according to the first node value; then deleting each terminal operation node marked at this time from the root operation structure; continuing to step 31;
the method specifically includes the steps of performing recursion processing of the end operation nodes on each end operation node according to a first node value, wherein the recursion processing includes: the operation control marks an operation object corresponding to the current terminal operation node as a first operation object in an operation object sequence of an operation node at the upper stage of the current terminal operation node, and replaces the first operation object by using a first node value;
here, if the root operation structure is shown in fig. 3, only N5 is marked as an end operation node, that is, the number of end operation nodes is unique, but the end operation node is not the root operation node, performing calculation processing on N5 to obtain an operation value of N5, that is, a first node value, and replacing the first node value of N5 with the 1 st operation object of the operation object sequence of N4 to obtain a "first node value of N5, 3", and deleting N5 from the root operation structure, as shown in fig. 4a, which is a schematic diagram of the root operation structure for deleting N5 provided in the embodiment of the present invention;
Turning to step 31 to identify the end operation node, where only N4 is marked as the end operation node, that is, the number of end operation nodes is unique, but the end operation node is not the root operation node, performing calculation processing on N4 to obtain an operation value of N4, that is, a first node value, and replacing the first node value of N4 with the unique operation object of the operation object sequence of N3 to obtain a "first node value of N4", and deleting N4 from the root operation structure, as shown in fig. 4b, which is a schematic diagram of the root operation structure for deleting N4 provided in the embodiment of the present invention;
turning to step 31 to identify the end operation node, where only N3 is marked as the end operation node, that is, the number of end operation nodes is unique, but the end operation node is not the root operation node, performing calculation processing on N3 to obtain an operation value of N3, that is, a first node value, and replacing the first node value of N3 with the 1 st operation object of the operation object sequence of N2 to obtain a "first node value of N3, B2,2", and deleting N3 from the root operation structure, as shown in fig. 4c, which is a schematic diagram of the root operation structure for deleting N3 provided in the embodiment of the present invention;
Turning to step 31 to identify the end operation node, where only N2 is marked as the end operation node, that is, the number of end operation nodes is unique, but the end operation node is not the root operation node, performing calculation processing on N2 to obtain an operation value of N2, that is, a first node value, and replacing the first node value of N2 with the 1 st operation object of the operation object sequence of N1 to obtain a "first node value of N2, 1,2", and deleting N2 from the root operation structure, as shown in fig. 4d, which is a schematic diagram of the root operation structure for deleting N2 provided in the embodiment of the present invention;
turning to step 31 to identify the end operation node, where only N1 is marked as the end operation node, that is, the number of end operation nodes is unique and the end operation node is the root operation node, and turning to step 33;
in step 33, if the number of end operation nodes is unique and the end operation node is the root operation node, the end operation node is calculated on the root operation node to generate the first result data.
Here, as shown in fig. 4d, the calculation processing of the end operation node is performed on N1 to obtain the operation value of the root operation node, that is, the first result data.
In the above steps 32 and 33, the process of performing the calculation processing of the end operation node on each end operation node or root operation node is substantially identical, and the specific steps are as follows:
step C1, an end operation node to be subjected to calculation processing by an operation control is used as a first end operation node;
here, if the root operation structure is as shown in fig. 3, N5 is denoted as the first end operation node; if the root operation structure is as shown in FIG. 4a, N4 is denoted as the first end operation node; if the root operation structure is as shown in FIG. 4b, N3 is denoted as the first end operation node; if the root operation structure is as shown in FIG. 4c, N2 is denoted as the first end operation node; if the root operation structure is as shown in fig. 4d, then N1, i.e., the root operation node, is denoted as the first end operation node;
step C2, next, replacing the electronic medical record table field object with the operation object sequence of the first end operation node;
the method comprises the following steps: polling the operation object of the operation object sequence, if the character type of the operation object currently polled is not the digital character type, taking the operation object currently polled as a table field label, acquiring corresponding field content from the electronic medical record table according to the table field label to generate first parameter data, and replacing the operation object currently polled by using the first parameter data;
Here, if the field numbers a1=200, b2=10 in the table of fig. 2, and the root operation structure is shown in fig. 3, the first end operation node is N5, and the operation object sequence is "A1,2", the first parameter data is 200, and the operation object sequence after the replacement with the first parameter data is "200,2"; similarly, B2 in N3 is also replaced by 10;
step C3, then carrying out operator level recognition on the operation symbols of the operation symbol sequence of the first end operation node;
the method comprises the following steps: if the number of the operation symbols is unique and the operation symbols are matched with any operator of the three-level operator set, setting the level identification result as three levels; if all the operation symbols are matched with the operators of the first-level operator set or the second-level operator set, setting the grade identification result as a second level;
here, if the root operation structure is as shown in fig. 3, the first end operation node is N5, the corresponding operation symbol sequence is "+", the operator number of the operation symbol sequence is unique but does not match the three-level operator set, so the level recognition result is two-level;
if the root operation structure is as shown in fig. 4a, the first end operation node is N4, the corresponding operation symbol sequence is "x", and the operator number of the operation symbol sequence is unique but not matched with the three-level operator set, so that the level recognition result is two-level;
If the root operation structure is as shown in fig. 4b, the first end operation node is N3, the corresponding operation symbol sequence is a square operator, and the operation symbols of the operation symbol sequence are unique and matched with the three-level operator set, so that the level recognition result is three-level;
if the root operation structure is as shown in fig. 4c, the first end operation node is N2, the corresponding operation symbol sequence is "++and the operation symbol of the operation symbol sequence is not unique and does not match the three-level operator set, so the level recognition result is two-level;
if the root operation structure is as shown in fig. 4d, the first end operation node is N1, the corresponding operation symbol sequence is "+, ×", and the operation symbol of the operation symbol sequence is not unique and does not match the three-level operator set, so the level recognition result is two-level;
step C4, then carrying out calculation processing of an operation object according to the grade identification result;
the method specifically comprises the following steps:
step C41, if the level identification result is a three-level operator, extracting a unique operation object from the operation object sequence as a first one-to-one calculation parameter, extracting a unique operation symbol from the operation symbol sequence as a first one-to-one operation symbol, executing first digital operation processing corresponding to the first one-to-one operation symbol on the first one-to-one calculation parameter, and taking the operation result as final output data of the calculation processing of the terminal operation node;
Step C42, if the grade identification result is a secondary operator, extracting a first operation object from the operation object sequence as a first operation item; extracting a first operation symbol from the operation symbol sequence as a second operation symbol, extracting a second operation object from the operation object sequence as a second first calculation parameter, and taking the first operation item, the second operation symbol and the second calculation parameter as a second operation item; after the last operation item is obtained, extracting a last operation symbol from the operation symbol sequence to serve as a last operation symbol, extracting a last operation object from the operation object sequence to serve as a last calculation parameter, and taking the last operation item, the last operation symbol and the last calculation parameter as a last operation item; and carrying out corresponding second digital operation processing on the final operation item according to a four-law algorithm of first multiply-divide and then add-subtract, and taking an operation result as final output data of the calculation processing of the terminal operation node.
Here, if the field numbers a1=200, b2=10,
when the root operation structure is shown in fig. 3, the first end operation node is N5, the operation object sequence is "A1,2", the operation object sequence is changed to "200,2" after replacement by a1=200, the corresponding operation symbol sequence is "+", the grade identification result is two-grade, and the final operation item is 200+2 obtained through the step C42, the final output data of the calculation process of the N5 end operation node, that is, the first node value of N5 is 202;
When the root operation structure is as shown in fig. 4a, the first end operation node is N4, the operation object sequence is "the first node value of N5, 3", the operation object sequence is "202,3" after the replacement by using the first node value=202 of N5, the corresponding operation symbol sequence is "x", the grade recognition result is a grade one, and the final operation item is 202×3 obtained through the above step C42, the final output data of the calculation process of the N4 end operation node, that is, the first node value of N4 is 606;
when the root operation structure is as shown in fig. 4b, the first end operation node is N3, the operation object sequence is "the first node value of N4", the operation object sequence is "606" after the replacement by using the first node value=606 of N4, the corresponding operation symbol sequence is the square operator, the level recognition result is three-level, and the final operation item is 606 obtained through the above step C41 2 The final output data of the calculation process of the N3 end operation node, that is, the first node value of N3 is 367236;
when the root-like operation structure is shown in fig. 4C, the first end operation node is N2, the operation object sequence is "the first node value of N3, B2,2", the operation object sequence is "367236,10,2" after the replacement by using the first node value= 367236 and b2=10 of N3, the corresponding operation symbol sequence is "++", the grade identification result is two-grade, and the final operation item is 367236 ++10+2 obtained by the step C42, the final output data of the calculation process of the N2 end operation node, that is, the first node value of N2 is 36725.6;
As shown in fig. 4d, when the root operation structure is shown in fig. 4d, the first end operation node is N1, the operation object sequence is "the first node value of N2, 1,2", the operation object sequence is "36725.6,1,2" after the replacement by using the first node value= 36725.6 of N2, the corresponding operation symbol sequence is "+, ×", the level recognition result is a level, and the final operation item is 367825.6+1×2 obtained by the above step C42, the final output data of the calculation process of the N1 end operation node, that is, the first result data calculated by the root operation node last is 36727.6.
And 4, displaying the first result data as display information of the statistical field of the electronic medical record form.
According to the processing method of the electronic medical record form operation control, an operation control capable of directly performing form operation on the electronic medical record form is provided for an electronic medical record system, and the control can automatically perform statistical operation on form contents according to a preset operation formula. Therefore, the method of the invention avoids the error rate generated by manual calculation, improves the accuracy of the statistical data of the electronic form, and solves the problem that the developer cannot develop the electronic form for the second time in place.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative elements and steps are described above generally in terms of function in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, in a software module executed by a processor, or in a combination of the two. The software modules may be disposed in Random Access Memory (RAM), memory, read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The foregoing description of the embodiments has been provided for the purpose of illustrating the general principles of the invention, and is not meant to limit the scope of the invention, but to limit the invention to the particular embodiments, and any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (5)
1. A method for processing an electronic medical record form operation control, the method comprising:
extracting a first operation formula from the setting information of the statistical field of the electronic medical record form by using an operation control;
performing operation structure splitting treatment on the first operation formula to generate a top-down root operation structure; the root operation structure consists of a plurality of operation nodes; the plurality of operation nodes comprise a root operation node and a plurality of sub operation nodes; each sub-operation node can trace back to the root operation node step by step through a recursion relation with an upper operation node;
in the root operation structure, the marking, calculation and recursion processing of the end operation node are circularly executed until recursion to the root operation node and the calculation processing of the root operation node are completed, and the final calculation result is used as first result data;
displaying the first result data as display information of the statistical field of the electronic medical record form;
each operation node at least comprises a group of operation object sequences and operation symbol sequences; the operation object sequence comprises a plurality of operation objects, and the operation symbol sequence comprises a plurality of operation symbols; each sub operation node corresponds to one operation object of the previous operation node;
The operation control is preset with a primary operator set, a secondary operator set and a tertiary operator set; the first-level set of operators includes an addition operator and a subtraction operator; the set of secondary operators includes a multiply operator and a divide operator; the three-level operator set comprises a square operator, an evolution operator, a power operator and a logarithm operator;
the operation control is preset with a bracket character set; the set of bracket symbols includes a small bracket symbol, a medium bracket symbol, and a large bracket symbol;
the splitting processing of the operation structure is performed on the first operation formula to generate a top-down root operation structure, which specifically comprises the following steps:
the operation control marks the first operation formula as the root operation node;
splitting the operation object and the operation symbol of the root operation node to obtain an operation object sequence and an operation symbol sequence of the root operation node; then, each operation object of the operation object sequence of the root operation node is polled, the operation formula identification processing is carried out on the operation object currently polled, and if the operation object currently polled is identified as the operation formula, the operation object currently polled is marked as a new sub operation node;
Continuing to split the operation objects and the operation symbols of all the new sub operation nodes until all the operation objects of the operation object sequence split by the new sub operation nodes are not recognized as an operation formula;
finally, the root operation structure is formed by the hierarchical recursion relation of the root operation node and each sub operation node, and the operation object sequence and the operation symbol sequence split by each operation node;
the splitting processing of the operand and the operation symbol specifically comprises the following steps:
the operation node to be split by the operation control is used as a first split operation node; the character information of the first splitting operation node is used as first character string data;
performing first judgment processing on the first character string data: extracting first and last characters which are not empty of the current first character string data to form first comparison character string data, judging whether the first comparison character string data are matched with any bracket symbol of the bracket symbol set, and removing the characters corresponding to the first comparison character string data from the current first character string data if the judgment result is that the first comparison character string data are matched with any bracket symbol of the bracket symbol set, so as to obtain new first character string data; and continuing the first judgment processing on the new first character string data until the judgment result is not matched; and taking the last first character string data as second character string data;
Firstly, using operators in the first-level operator set and the second-level operator set as operator extraction marks, extracting matched characters or character strings from the second character string data as operation symbols, and forming an operation symbol sequence by the operation symbols; when the operation symbol is extracted, extracting no bracketed characters or three-level operator characters in the second character string data; backing up the index position of the operation symbol in the second character string data when the operation symbol is extracted;
if the operation symbol sequence is not null, sequentially extracting characters or character strings separated by the operation symbols from the second character string data as the operation objects, and forming the operation object sequence by the operation objects;
if the operation symbol sequence is empty, then using an operator in the three-level operator set as an operator extraction mark, extracting a unique matched character or character string from the second character string data as the operation symbol, and forming the operation symbol sequence by the operation symbol; if the operation symbol sequence is not null, taking the characters or character strings except the operation symbols in the second character string data as the unique operation objects, and forming the operation object sequence by the operation objects;
The identification processing of the operation formula specifically comprises the following steps:
the operation control takes an operation object to be subjected to identification processing as a first identification operation object;
extracting the first and last characters which are not empty of the first identification operation object to form second comparison character string data;
if the second comparison character string data is matched with any bracket symbol of the bracket symbol set, setting an identification result of the identification processing of the operation formula as the operation formula;
and if the second comparison character string data is not matched with any bracket symbol of the bracket symbol set, performing three-level operator matching processing on the first identification operation object according to an operator of the three-level operator set, and if matching is successful, setting an identification result of the identification processing of the operation formula as the operation formula.
2. The processing method of the electronic medical record table operation control according to claim 1, wherein in the root operation structure, the marking, calculation and recursion processing of the end operation node are circularly executed until recursion to the root operation node and the calculation processing of the root operation node is completed, and the final calculation result is taken as first result data, specifically including:
Step 61, the operation control performs marking processing of the end operation nodes in the root operation structure, so as to obtain a plurality of end operation nodes;
step 62, if the number of the end operation nodes is not unique or the end operation nodes are not the root operation nodes, performing calculation processing of the end operation nodes on the end operation nodes respectively, and generating corresponding first node values; performing recursion processing of the end operation nodes on each end operation node according to the first node value; then deleting each terminal operation node marked at the time from the root operation structure; continuing to step 61;
step 63, if the number of the end operation nodes is unique and the end operation node is the root operation node, performing calculation processing of the end operation node on the root operation node, and generating the first result data.
3. The processing method of the electronic medical record table operation control according to claim 2, wherein the operation control performs marking processing of end operation nodes in the root operation structure, thereby obtaining a plurality of end operation nodes, and specifically includes:
The operation control marks the operation nodes which only comprise a group of operation object sequences and operation symbol sequences in the root operation structure as the end operation nodes, and all the end operation nodes form a plurality of end operation nodes.
4. The method for processing the electronic medical record form operation control according to claim 2, wherein the calculation processing of the end operation node specifically comprises:
the terminal operation node to be subjected to calculation processing by the operation control is used as a first terminal operation node;
then, replacing the electronic medical record table field object with the operation object sequence of the first end operation node; polling the operation object of the operation object sequence, if the character type of the operation object currently polled is not a digital character type, taking the operation object currently polled as a table field label, acquiring corresponding field content from the electronic medical record table according to the table field label to generate first parameter data, and replacing the operation object currently polled by using the first parameter data;
Then, carrying out operator level recognition on the operation symbols of the operation symbol sequence of the first end operation node; if the number of the operation symbols is unique and the operation symbols are matched with any operator of the three-level operator set, setting the level identification result as three levels; if all the operation symbols are matched with operators of the primary operator set or the secondary operator set, setting the grade identification result as a secondary;
then, according to the grade identification result, calculating an operation object;
if the level identification result is a three-level operator, extracting a unique operation object from the operation object sequence as a first one-to-one calculation parameter, extracting a unique operation symbol from the operation symbol sequence as a first one-to-one operation symbol, executing first digital operation processing corresponding to the first one-to-one operation symbol on the first one-to-one calculation parameter, and taking the operation result as final output data of the calculation processing of the terminal operation node;
if the level identification result is a level operator, extracting a first operation object from the operation object sequence as a first operation item; extracting a first operation symbol from the operation symbol sequence as a second operation symbol, extracting a second operation object from the operation object sequence as a second calculation parameter, and taking a first operation item, a second operation symbol and a second calculation parameter as a second operation item; the last operation symbol is extracted from the operation symbol sequence to be used as a final operation symbol after the last operation item of the last operation is obtained, the last operation object is extracted from the operation object sequence to be used as a final calculation parameter, and the last operation item, the final operation symbol and the final calculation parameter are used as final operation items; and carrying out corresponding second digital operation processing on the final operation item according to a four-way algorithm of first multiply-divide and then add-subtract, and taking an operation result as final output data of the calculation processing of the terminal operation node.
5. The method for processing the electronic medical record table operation control according to claim 2, wherein the performing, according to the first node value, recursive processing of the end operation node on each of the end operation nodes respectively specifically includes:
and marking the operation object corresponding to the current terminal operation node as a first operation object in an operation object sequence of a previous operation node of the current terminal operation node by the operation control, and replacing the first operation object by using the first node value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110707597.3A CN113539405B (en) | 2021-06-24 | 2021-06-24 | Processing method of electronic medical record form operation control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110707597.3A CN113539405B (en) | 2021-06-24 | 2021-06-24 | Processing method of electronic medical record form operation control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113539405A CN113539405A (en) | 2021-10-22 |
| CN113539405B true CN113539405B (en) | 2024-03-19 |
Family
ID=78096729
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110707597.3A Active CN113539405B (en) | 2021-06-24 | 2021-06-24 | Processing method of electronic medical record form operation control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113539405B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2014350A1 (en) * | 1989-04-17 | 1990-10-17 | David Paradies | Expert control system for real time management of automated factory equipment and method for developing same |
| CA2370207A1 (en) * | 1989-09-29 | 1991-03-30 | James R. Savage | Parallel processing system |
| JP2001222452A (en) * | 2000-02-10 | 2001-08-17 | Ricoh Co Ltd | Inquiry processing optimization device in relational data base system |
| AU2001271283A1 (en) * | 2000-06-01 | 2001-12-11 | Aerocast.Com, Inc. | Client side holistic health check |
| CN102521411A (en) * | 2011-12-28 | 2012-06-27 | 畅捷通信息技术股份有限公司 | Formula and formula data processing device and formula and formula data processing method |
| US8627199B1 (en) * | 2010-01-29 | 2014-01-07 | Asana, Inc. | Incremental computing of changes to computer user interfaces |
| CN104932909A (en) * | 2014-03-17 | 2015-09-23 | 中兴通讯股份有限公司 | Terminal software upgrading method and device |
| AU2017200664A1 (en) * | 2013-07-10 | 2017-02-23 | Facebook, Inc. | Network-aware product rollout in online social networks |
| CA3064125A1 (en) * | 2018-12-10 | 2020-06-10 | Sap Se | Non-uniform pagination of columnar data |
| CN112307719A (en) * | 2020-10-13 | 2021-02-02 | 江汉大学 | Character string expression calculation method based on N-way tree |
| CN112463819A (en) * | 2020-11-26 | 2021-03-09 | 北京宏景世纪软件股份有限公司 | Computing method, device and equipment based on Chinese expression and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7784094B2 (en) * | 2005-06-30 | 2010-08-24 | Intel Corporation | Stateful packet content matching mechanisms |
| US10965775B2 (en) * | 2012-11-20 | 2021-03-30 | Airbnb, Inc. | Discovering signature of electronic social networks |
| US10755039B2 (en) * | 2018-11-15 | 2020-08-25 | International Business Machines Corporation | Extracting structured information from a document containing filled form images |
-
2021
- 2021-06-24 CN CN202110707597.3A patent/CN113539405B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2014350A1 (en) * | 1989-04-17 | 1990-10-17 | David Paradies | Expert control system for real time management of automated factory equipment and method for developing same |
| CA2370207A1 (en) * | 1989-09-29 | 1991-03-30 | James R. Savage | Parallel processing system |
| JP2001222452A (en) * | 2000-02-10 | 2001-08-17 | Ricoh Co Ltd | Inquiry processing optimization device in relational data base system |
| AU2001271283A1 (en) * | 2000-06-01 | 2001-12-11 | Aerocast.Com, Inc. | Client side holistic health check |
| US8627199B1 (en) * | 2010-01-29 | 2014-01-07 | Asana, Inc. | Incremental computing of changes to computer user interfaces |
| CN102521411A (en) * | 2011-12-28 | 2012-06-27 | 畅捷通信息技术股份有限公司 | Formula and formula data processing device and formula and formula data processing method |
| AU2017200664A1 (en) * | 2013-07-10 | 2017-02-23 | Facebook, Inc. | Network-aware product rollout in online social networks |
| CN104932909A (en) * | 2014-03-17 | 2015-09-23 | 中兴通讯股份有限公司 | Terminal software upgrading method and device |
| CA3064125A1 (en) * | 2018-12-10 | 2020-06-10 | Sap Se | Non-uniform pagination of columnar data |
| CN112307719A (en) * | 2020-10-13 | 2021-02-02 | 江汉大学 | Character string expression calculation method based on N-way tree |
| CN112463819A (en) * | 2020-11-26 | 2021-03-09 | 北京宏景世纪软件股份有限公司 | Computing method, device and equipment based on Chinese expression and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| 基于多重特征匹配的点云配准算法;李强;高保禄;窦明亮;;计算机应用研究(第02期);第274-278页 * |
| 混合服务策略轮询特性下物联网传感节点设计;盖昊宇;张震;李慧;;佳木斯大学学报(自然科学版)(第06期);第52-55页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113539405A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106897559B (en) | A kind of symptom and sign class entity recognition method and device towards multi-data source | |
| WO2018040899A1 (en) | Error correction method and device for search term | |
| CN110292775B (en) | Method and device for acquiring difference data | |
| CN112016304A (en) | Text error correction method and device, electronic equipment and storage medium | |
| CN111753767A (en) | Method and device for automatically correcting operation, electronic equipment and storage medium | |
| CN108537183B (en) | Formula automatic identification method and device, electronic equipment and storage medium | |
| CN108268884B (en) | Document comparison method and device | |
| CN112163424A (en) | Data labeling method, device, equipment and medium | |
| CN109522397B (en) | Information processing method and device | |
| CN110610175A (en) | OCR data mislabeling cleaning method | |
| CN109508448A (en) | Short information method, medium, device are generated based on long article and calculate equipment | |
| CN111859857B (en) | Method, system, device and medium for generating training data set based on labeled text | |
| CN110209838A (en) | A kind of text template acquisition methods and relevant apparatus | |
| CN107463537A (en) | A kind of method that structuring processing is carried out to text message | |
| CN107783953A (en) | Information input method and terminal device | |
| CN113539405B (en) | Processing method of electronic medical record form operation control | |
| CN113344125A (en) | Long text matching identification method and device, electronic equipment and storage medium | |
| CN117235105A (en) | Method and device for fine tuning large model and generating SQL (structured query language) statement | |
| CN112613367A (en) | Bill information text box acquisition method, system, equipment and storage medium | |
| CN114861625A (en) | Method for obtaining target training sample, electronic device and medium | |
| CN115167965A (en) | Transaction progress bar processing method and device | |
| CN110502731B (en) | Spreadsheet defect detection method based on refined cell clustering | |
| JP5824429B2 (en) | Spam account score calculation apparatus, spam account score calculation method, and program | |
| CN112800778B (en) | Intent recognition method, system and storage medium based on word string length | |
| CN109739839A (en) | Data processing empty value method, apparatus and terminal device |
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 |