CN113808716B

CN113808716B - Hospitalization closed-loop information processing method

Info

Publication number: CN113808716B
Application number: CN202111073488.7A
Authority: CN
Inventors: 蒋威; 姜跃滨; 胡廷焱; 孙喜锋
Original assignee: Beijing Tianjian Source Technology Co ltd
Current assignee: Beijing Tianjian Source Technology Co ltd
Priority date: 2021-09-14
Filing date: 2021-09-14
Publication date: 2024-03-19
Anticipated expiration: 2041-09-14
Also published as: CN113808716A

Abstract

The embodiment of the invention relates to a hospitalization closed-loop information processing method, which comprises the following steps: configuring a plurality of hospitalization closed-loop standard node chains; configuring a corresponding node time limit list; acquiring a first real-time information group of a first user hospitalization and storing the first real-time information group into a user hospitalization real-time information list; acquiring a first hospitalization closed loop query instruction; sequencing the matched first real-time nodes according to the time sequence to obtain a first real-time node chain; marking the matched hospitalization closed loop standard node chain as a first standard node chain; the corresponding node time limit list is marked as a first time limit list; performing missing node inspection and corresponding missing node completion processing according to the first standard node chain; performing overtime node checking processing according to the first time limit list to generate a corresponding first checking information sequence; and carrying out user hospitalization closed-loop information chain display processing according to the first real-time node chain and the first examination information sequence. The invention can ensure the real-time effectiveness and accuracy of the node state check.

Description

Hospitalization closed-loop information processing method

Technical Field

The invention relates to the technical field of data information processing, in particular to a hospitalization closed-loop information processing method.

Background

The hospitalization closed-loop information refers to hospitalization node link information composed of a plurality of nodes. Medical staff can judge whether the inpatient node link of the user is complete by checking the closed loop node type of the user, and judge whether the inpatient node state of the user is normal by comparing information deviation between an actual node and an expected node. Under the conventional circumstances, the above-mentioned work is accomplished by medical personnel or users through manual mode, lacks real-time, also can not guarantee better degree of accuracy.

Disclosure of Invention

The invention aims at overcoming the defects of the prior art, and provides a hospitalization closed-loop information processing method, which is characterized in that a hospitalization closed-loop standard node chain is configured to provide standard hospitalization closed-loop node chain structures for different hospitalization item types, a node time limit list is configured to provide time limit constraint for hospitalization closed-loop nodes of different hospitalization item types, after a real-time node chain for hospitalization of a user is obtained, the integrity of the real-time node chain is checked by taking the hospitalization closed-loop standard node chain as a reference, and the node state of the real-time node chain is checked by taking the node time limit list as a reference. The invention can ensure the real-time effectiveness of the node state inspection and the accuracy of the node time limit inspection.

In order to achieve the above object, an embodiment of the present invention provides a method for processing hospitalized closed-loop information, including:

configuring a plurality of hospitalization closed-loop standard node chains; each hospitalization closed-loop standard node chain corresponds to a preset hospitalization item type;

configuring a node time limit list corresponding to each hospitalization closed-loop standard node chain;

acquiring a first real-time information group of a first user hospitalization and storing the first real-time information group into a user hospitalization real-time information list; the first real-time information group comprises first user identification information, first inpatient item identification information and a first real-time node;

acquiring a first hospitalization closed loop query instruction; the first hospitalization closed loop query instruction comprises first query user identification information and first query hospitalization item identification information;

in the user hospitalization real-time information list, sorting the first real-time nodes of the first real-time node information group, of which the first user identification information is matched with the first query user identification information and the first hospitalization item identification information is matched with the first query hospitalization item identification information, according to time sequence, so as to obtain a corresponding first real-time node chain;

Marking the hospitalization closed-loop standard node chain matched with the hospitalization item type corresponding to the first query hospitalization item identification information as a first standard node chain; the node time limit list corresponding to the first standard node chain is recorded as a first time limit list;

according to the first standard node chain, carrying out missing node inspection and corresponding missing node completion processing on the first real-time node chain;

performing overtime node inspection processing on the first real-time node chain completed by the missing node according to the first time limit list, and generating a corresponding first inspection information sequence;

and carrying out user hospitalization closed-loop information chain display processing based on a preset hospitalization closed-loop display template according to the first real-time node chain and the corresponding first examination information sequence.

Preferably, the hospitalization closed loop standard node chain comprises a plurality of standard nodes; the standard nodes comprise node coding information, node name information, necessary node mark information, front associated node coding information and rear associated node coding information;

the node time limit list comprises a plurality of node time limit records; the node time limit record comprises initial node name information, end node name information and node time limit information;

The first real-time node comprises first real-time node coding information, first real-time node occurrence time information and first real-time node operator information;

the first inspection information sequence includes a plurality of first inspection information groups; the first checking information group comprises first real-time node index information, second real-time node index information and first node overtime early warning information.

Preferably, the step of performing missing node inspection and corresponding missing node completion processing on the first real-time node chain according to the first standard node chain specifically includes:

according to the first standard node chain, checking the necessary nodes of the first real-time node chain, and if the necessary nodes are checked out, performing corresponding necessary node completion processing;

according to the first standard node chain, checking the front associated nodes of each first real-time node in the first real-time node chain, and if the front associated nodes are detected to be missing, performing corresponding front associated node completion processing;

and according to the first standard node chain, checking the post-association nodes of each first real-time node in the first real-time node chain, and if the missing post-association nodes are checked, performing corresponding post-association node completion processing.

Further, the checking the necessary nodes of the first real-time node chain according to the first standard node chain, and if the necessary nodes are checked, performing corresponding necessary node completion processing, specifically including:

marking the standard nodes with the necessary node mark information not being empty in the first standard node chain as necessary nodes;

polling all the obtained necessary nodes, marking the currently polled necessary nodes as current necessary nodes, and marking the node coding information of the current necessary nodes as current necessary node coding information; if the first real-time node of which the first real-time node coding information is matched with the current necessary node coding information does not exist in the first real-time node chain, the current necessary node is marked as a newly added necessary node, and necessary node completion processing is carried out in the first real-time node chain according to the newly added necessary node.

Further preferably, the performing necessary node completion processing in the first real-time node chain according to the newly added necessary node specifically includes:

referring to the node position of the newly added necessary node in the first standard node chain, and newly adding one first real-time node at the corresponding position in the first real-time node chain; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added necessary node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null.

Further, according to the first standard node chain, each first real-time node in the first real-time node chain is checked for a front associated node, and if a missing front associated node is checked, a corresponding front associated node completion process is performed, which specifically includes:

polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the front association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the front association node coding information as the current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the first real-time node before the current real-time node is not matched with the current associated node coding information, marking the standard node in the first standard node chain, in which the node coding information is matched with the current associated node coding information, as a newly-added previous associated node, and carrying out previous associated node completion processing on the position of the previous node of the current real-time node according to the newly-added previous associated node.

Further preferably, the performing, according to the newly added previous associated node, previous associated node completion processing on a node position previous to the current real-time node specifically includes:

in the first real-time node chain, a first real-time node is newly added at a position of a node before the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the related node before the new addition; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null.

Further, according to the first standard node chain, checking the post-association nodes of each first real-time node in the first real-time node chain, and if the missing post-association nodes are checked, performing corresponding post-association node completion processing, including:

polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the post-association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the post-association node coding information as current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the first real-time node next to the current real-time node is not matched with the current associated node coding information, marking the standard node in the first standard node chain, in which the node coding information is matched with the current associated node coding information, as a newly added associated node, and performing post-associated node completion processing on the position of the next node of the current real-time node according to the newly added associated node.

Further preferably, the performing post-association node completion processing on the node position next to the current real-time node according to the newly added post-association node specifically includes:

in the first real-time node chain, a first real-time node is newly added at a position of a node next to the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added associated node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null.

Preferably, the step of performing timeout node inspection processing on the first real-time node chain completed with the missing node according to the first time limit list to generate a corresponding first inspection information sequence specifically includes:

polling the node time limit records of the first time limit list, recording the currently polled node time limit records as current time limit records, recording the initial node name information of the current time limit records as first node name information, recording the ending node name information of the current time limit records as second node name information, and recording the node time limit information of the current time limit records as first time limit information;

In the first standard node chain, marking the node coding information of the standard node matched with the node name information and the first node name information as first coding information; recording the node coding information of the standard node, which is matched with the node name information, as second coding information;

in the first real-time node chain, the first real-time node with the first real-time node coding information matched with the first coding information is marked as a first node; recording a first one of the first real-time nodes after the first node as a second node, wherein the first real-time node is matched with the first encoding information; the first real-time node occurrence time information of the first node is recorded as first time information, and the first real-time node occurrence time information of the second node is recorded as second time information;

if the first time information or the second time information is empty, setting a first checking state as a overtime node state;

if the first time information and the second time information are not empty, calculating the time interval between the first time information and the second time information, and generating corresponding first time interval information; if the first time interval information exceeds the first time limit information, setting the first checking state as a overtime node state; if the first time interval information does not exceed the first time limit information, setting the first checking state as a normal node state;

If the first checking state is a overtime node state, adding a first checking information group in the first checking information sequence; setting the first real-time node index information of the newly added first inspection information group according to the node index information of the first node in the first real-time node chain, setting the second real-time node index information of the newly added first inspection information group according to the node index information of the second node in the first real-time node chain, generating corresponding overtime early warning information according to a preset overtime early warning information format, and setting the overtime early warning information of the newly added first node of the first inspection information group.

Preferably, the method further comprises:

when the user hospitalization closed-loop information chain display processing is carried out, the first real-time node with the unique first real-time node coding information in the first real-time node chain is regarded as a single node; and regarding a plurality of first real-time nodes with the same encoding information of the first real-time nodes as repeated nodes; for the single node, extracting node name information matched with node codes from the first standard node chain as corresponding node name display information and using the node name information for node display; and extracting node name information matched with node codes from the first standard node chain as basic node information for a plurality of repeated nodes, adding a distinguishing mark to the basic node information according to the time sequence of each repeated node as node name display information corresponding to each repeated node, and displaying the nodes.

Preferably, the method further comprises:

when the user hospitalization closed-loop information chain display processing is carried out, the first real-time node in which the first real-time node occurrence time information and the first real-time node operator information are not empty in the first real-time node chain is regarded as a real node; the first real-time node generating time information before the last real node and the first real-time node operator information are empty are regarded as missing nodes; the first real-time node with the empty occurrence time information of the first real-time node and the first real-time node operator information after the last normal node is regarded as a node to be executed; setting display information of the missing node, the real node and the node to be executed by adopting different colors;

and when the user hospitalization closed-loop information chain display processing is performed, if the first examination information sequence is not empty, displaying and setting the first node overtime early warning information of the first examination information sequence by adopting a preset first color.

According to the hospitalization closed-loop information processing method provided by the embodiment of the invention, a hospitalization closed-loop standard node chain is configured to provide standard hospitalization closed-loop node chain structures for different hospitalization item types, a node time limit list is configured to provide time limit constraint for hospitalization closed-loop nodes of different hospitalization item types, after a real-time node chain for user hospitalization is obtained, the integrity of the real-time node chain is checked by taking the hospitalization closed-loop standard node chain as a reference, and the node state of the real-time node chain is checked by taking the node time limit list as a reference. By the method and the device, the real-time effectiveness of the node state inspection is ensured, and the accuracy of the node time limit inspection is ensured.

Drawings

Fig. 1 is a schematic diagram of a hospitalization closed-loop information processing method 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.

The hospital medical information system can conduct real-time supervision and inspection on the hospitalization closed-loop information of each user through the hospitalization closed-loop information processing method provided by the embodiment of the invention, so that the real-time performance and accuracy of the hospitalization closed-loop information inspection are ensured; fig. 1 is a schematic diagram of a hospitalization closed-loop information processing method according to an embodiment of the present invention, as shown in fig. 1, the method mainly includes the following steps:

step 1, configuring a plurality of hospitalization closed-loop standard node chains;

wherein, each hospitalization closed loop standard node chain corresponds to a preset hospitalization item type; the hospitalization closed loop standard node chain comprises a plurality of standard nodes; the standard nodes comprise node coding information, node name information, necessary node mark information, pre-association node coding information and post-association node coding information.

Here, the type of inpatient item may be subdivided according to the specific execution type of inpatient, examination, such as inpatient examination type, inpatient pathology type, inpatient ultrasound endoscope type, inpatient radiation type, inpatient electrocardiographic type, inpatient blood transfusion type, inpatient order type, inpatient visit type, inpatient operation type, inpatient prescription management type, inpatient treatment type, and the like; aiming at the various inpatient item types, the embodiment of the invention is provided with a corresponding standard closed-loop information chain structure, namely a corresponding inpatient closed-loop standard node chain; a plurality of standard nodes are arranged on each hospitalization closed-loop standard node chain; the node coding information is uniformly configured coding information; the node name information is uniformly configured name information; some nodes are necessary and some are optional on the hospitalized closed-loop standard node chain, the necessary node mark information of the necessary standard nodes is not null, and the necessary node mark information of the necessary standard nodes is null; the front and rear nodes of some nodes are fixed on the hospitalized closed-loop standard node chain, the front associated node coding information is not null to indicate the node which is required to be appointed by the front node of the current standard node for the front associated node coding information, and similarly, the rear associated node coding information is not null to indicate the node which is required to be appointed by the rear associated node coding information of the current standard node.

For example, taking an order type of a plurality of order types as an example, the configured closed loop standard node chain for hospitalization includes 16 standard nodes, as follows:

standard node 1 (node code information is M1, node name information is "order, necessary node mark information is 1, front association node code information is empty, and rear association node code information is empty), and data structure of standard node 1 is abbreviated as (M1," order, 1, empty);

standard node 2 is abbreviated as (M3, "ditto," 1, null, M4);

standard node 3 is abbreviated as (M4, "proof", 1, M3, null);

the standard node 4 is abbreviated as (M8, "order drug placement (splitting)", empty);

the standard node 5 is abbreviated as (M9, "start of static allocation (in warehouse)", empty, null, empty);

the standard node 6 is abbreviated as (M10, "end of static fit (finished product review)", empty, null, empty);

the standard node 7 is abbreviated as (M11, "get (deliver)", empty, null, empty;

the standard node 8 is abbreviated as (M12, "drug release (receive)", empty, null, empty);

the standard node 9 is abbreviated as (M13, "administration performed," empty, null);

the standard node 10 is abbreviated as (M14, "end of medication", empty;

the standard node 11 is abbreviated as (M15, "stop order," empty, null);

The standard node 12 is abbreviated as (M16, "stop order transfer" empty, M17);

the standard node 13 is abbreviated as (M17, "stop order proofreading", empty, M16, empty);

the standard node 14 is abbreviated as (M19, "voiding order," empty, null);

the standard node 15 is abbreviated as (M20, "voiding order meter reading", empty, null);

the standard node 16 is abbreviated as (M21, "void, empty" for order review).

Step 2, configuring a node time limit list corresponding to each hospitalization closed loop standard node chain;

the node time limit list comprises a plurality of node time limit records; the node time limit record comprises start node name information, end node name information and node time limit information.

Here, the embodiment of the invention can set time limit requirements for the designated node pairs on the hospitalized closed-loop standard node chain, and is realized by setting a node time limit list; the method comprises the steps that initial node name information and end node name information in a node time limit record correspond to two standard nodes of a designated node pair, the node time limit information is a maximum time interval threshold value of a corresponding hospitalization closed loop process from the standard node designated by the initial node name information to the standard node designated by the end node name information, and if the maximum time interval threshold value exceeds the node time limit information, the hospitalization closed loop process flow between the two standard nodes is overtime; if the node time limit list is empty, the hospitalization closed loop processing flow among all the standard nodes on the corresponding hospitalization closed loop standard node chain is not required by the time limit.

For example, taking an order type of hospitalization of multiple order types as an example, the configured node time limit list includes 1 node time limit record as follows: node time limit record 1 (the start node name information is "transfer" and the end node name information is "check" and the node time limit information is "10 minutes") abbreviated as node time limit record 1 ("transfer", "check", "10 minutes"). The present example illustrates that the closed-loop hospitalization standard node chain with the hospitalization item type of the hospitalization doctor's advice type only has time limit requirements on the closed-loop hospitalization processing flow from the "transfer" standard node to the "check" standard node, and the corresponding time limit threshold, namely the node time limit information, is 10 minutes.

Step 3, acquiring a first real-time information group of a first user hospitalization and storing the first real-time information group into a user hospitalization real-time information list;

the first real-time information group comprises first user identification information, first inpatient item identification information and a first real-time node; the first real-time node comprises first real-time node coding information, first real-time node occurrence time information and first real-time node operator information.

Here, the embodiment of the present invention provides a user hospitalization real-time information list to store the real-time hospitalization information of all users, that is, the first real-time information group. The first user identification information in the first real-time information group is used for storing the identity information of the user; the first hospitalization item identification information is used for storing specific identification information of hospitalization items carried out by a user, each first hospitalization item identification information corresponds to one hospitalization item type, and the corresponding relation between the hospitalization item identification information and the hospitalization item type can be associated by establishing a corresponding relation table reflecting the two, and further description is omitted here; the first real-time node is used for storing the hospitalization closed-loop node information of the user. In the first real-time node, the first real-time node coding information is the coding information of the real-time node, and the coding information is consistent with the coding of the same-name standard node in the corresponding hospitalized closed-loop standard node chain; the first real-time node occurrence time information is the time of the medical institution staff completing the node processing flow; the first real-time node operator information is the staff information of the medical institution completing the node processing flow.

For example, after the user 001 is hospitalized, the person 1 opens a medical order 1 for the user 001 at the time 1 through the medical information system, the system can know that the type of the hospitalized item corresponding to the medical order 1 is the type of the hospitalized order through the corresponding relation table reflecting the identification information of the hospitalized item and the type of the hospitalized item, and the system also automatically stores a first real-time information group 1 (first user identification information 1, first hospitalized item identification information 1, first real-time node 1) into the user hospitalized real-time information list, wherein the first user identification information 1 is "user 001", the first hospitalized item identification information 1 is "medical order 1", and the first real-time node 1 specifically comprises: the first real-time node coding information is M1, the first real-time node occurrence time information is time 1, and the first real-time node operator information is personnel 1.

Step 4, acquiring a first hospitalization closed loop query instruction;

the first hospitalization closed loop query instruction comprises first query user identification information and first query hospitalization item identification information.

Here, in the embodiment of the invention, after the hospitalization closed-loop standard node chains and the node time limit lists corresponding to the types of the hospitalization items are set and the real-time hospitalization information of the user is stored by using the user hospitalization real-time information list, whether the hospitalization closed-loop process of the user is integrated or not and whether the hospitalization closed-loop process between the nodes is overtime or not can be checked. When the examination is performed, the corresponding examination flow is activated through the first hospitalization closed loop query instruction, namely, the processing flow consisting of the following steps 5-9. The first query user identification information in the first hospitalization closed loop query instruction is identity information of a user to be checked, and the first query hospitalization item identification information is specific hospitalization item identification information to be checked.

For example, when the first query user identification information acquired by the medical information system is "user 001" and the first query hospitalization item identification information is "order 1", it means that the system checks the hospitalization closed-loop processing flow of "order 1" of user 001.

And 5, in the user hospitalization real-time information list, sequencing the first real-time nodes of the first real-time node information group, of which the first user identification information is matched with the first query user identification information and the first hospitalization item identification information is matched with the first query hospitalization item identification information, according to time sequence, so as to obtain a corresponding first real-time node chain.

For example, 7 first real-time node information groups are stored in the user hospitalization real-time information list, and are respectively:

the first real-time node information group 1[ the first inpatient item identification information is "user 001", the first inpatient item identification information is "doctor's advice 1", the first real-time node (the first real-time node coding information is M1, the first real-time node occurrence time information is time 1, the first real-time node operator information is personnel 1) ], the first real-time node information group 1 is abbreviated as [ "user 001", "doctor's advice 1", (M1, time 1, personnel 1) ];

The first real-time node information group 2 is abbreviated as [ "user 001", "order 1", (M3, time 2, person 2) ];

the first real-time node information group 3 is abbreviated as [ "user 001", "order 1", (M8, time 3, person 3) ];

the first real-time node information group 4 is abbreviated as [ "user 001", "order 1", (M13, time 4, person 4) ];

the first real-time node information group 5 is abbreviated as [ "user 001", "order 1", (M15, time 5, person 5) ];

the first real-time node information group 6 is abbreviated as [ "user 001", "order 1", (M16, time 6, person 6) ];

the first real-time node information group 7 is abbreviated as [ "user 001", "order 2", (M1, time 7, person 7) ];

knowing that the first query user identification information is ' user 001 ', and the first query hospitalization item identification information is ' doctor ' 1 ', the first real-time node information group matched with the user hospitalization real-time information list is a first real-time node information group 1-6; the first real-time node chain is [ (M1, time 1, person 1), (M3, time 2, person 2), (M8, time 3, person 3), (M13, time 4, person 4), (M15, time 5, person 5), (M16, time 6, person 6) ].

Step 6, marking a hospitalization closed-loop standard node chain matched with the hospitalization item type corresponding to the first query hospitalization item identification information as a first standard node chain; and the node time limit list corresponding to the first standard node chain is recorded as a first time limit list.

For example, the first query hospitalization item identification information is "order 1", and by querying a correspondence table reflecting the hospitalization item identification information and the hospitalization item type, it is known that the hospitalization item type corresponding to the first query hospitalization item identification information is the hospitalization order type, and then the first standard node chain is a hospitalization closed-loop standard node chain corresponding to the hospitalization order type, that is, a hospitalization closed-loop standard node chain including 16 standard nodes as given in step 1; the node time limit list corresponding to the first standard node chain, that is, the node time limit list corresponding to the hospitalized closed loop standard node chain corresponding to the hospitalized doctor's order type, that is, the node time limit list including 1 node time limit record as given in step 2.

Step 7, carrying out missing node inspection and corresponding missing node completion treatment on the first real-time node chain according to the first standard node chain;

the first standard node chain is used as a reference for checking necessary nodes and associated nodes in the first real-time node chain, if the necessary nodes are confirmed to be missing, the necessary nodes are correspondingly complemented in the first real-time node chain, and if the front and rear associated nodes of a certain real-time node are confirmed to be missing, the corresponding front and rear associated nodes are correspondingly complemented in the front and rear positions of the real-time node in the first real-time node chain;

The method specifically comprises the following steps: step 71, according to the first standard node chain, checking the necessary nodes of the first real-time node chain, and if the necessary nodes are checked out, performing corresponding necessary node completion processing;

the first standard node chain is used as a reference for checking the necessary nodes in the first real-time node chain, and if the necessary nodes are confirmed to be missing, the necessary node completion is correspondingly carried out in the first real-time node chain;

the method specifically comprises the following steps: step 711, marking the standard node with the necessary node mark information not being empty in the first standard node chain as a necessary node;

here, the necessary nodes are marked in the first standard node chain;

for example, the first standard node chain is a hospitalized closed-loop standard node chain including 16 standard nodes, which is given in the step 1, and standard nodes with necessary node mark information not being empty are standard nodes 1-3, that is, corresponding node names are "doctor order opening", "transfer reading" and "check-up" 3 standard nodes are necessary nodes;

step 712, polling all the obtained necessary nodes, and recording the currently polled necessary nodes as current necessary nodes and recording the node coding information of the current necessary nodes as current necessary node coding information; if the first real-time node of which the first real-time node coding information is matched with the current necessary node coding information does not exist in the first real-time node chain, the current necessary node is marked as a newly added necessary node, and necessary node completion processing is carried out in the first real-time node chain according to the newly added necessary node;

The necessary node completion processing is performed in the first real-time node chain according to the newly added necessary node, specifically: referring to the node position of the newly added necessary node in the first standard node chain, and newly adding a first real-time node at the corresponding position in the first real-time node chain; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added necessary node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting first real-time node operator information of the newly added first real-time node to be null;

for example, the first real-time node chain is a first real-time node chain example containing 6 first real-time nodes, which is given in step 5, the first standard node chain is a hospitalized closed-loop standard node chain containing 16 standard nodes, which is given in step 1, wherein standard nodes 1-3 with node names "order open", "transfer" and "check" are necessary nodes, and the 3 necessary nodes are polled;

when the current necessary node is a standard node 1 with a node name of ' doctor ' and order opening ', the current necessary node coding information is M1, and the first real-time node coding information of the 1 st first real-time node in the first real-time node chain is M1, which indicates that the first real-time node chain contains the current necessary node and does not need to carry out necessary node completion operation;

When the current necessary node is a standard node 2 with a node name of 'transfer reading', the current necessary node coding information is M3, and the first real-time node coding information of the 2 nd first real-time node in the first real-time node chain is M3, which indicates that the first real-time node chain contains the current necessary node and does not need to carry out necessary node completion operation;

when the current necessary node is a standard node 3 with a node name of 'proofreading', a first real-time node with the first real-time node coding information of M4 does not exist in the first real-time node chain, which indicates that the current necessary node is missing in the first real-time node chain, the current necessary node, namely the standard node 3 with the node name of 'proofreading', is set as a newly added necessary node, and necessary node completion processing is carried out on the first real-time node chain according to the newly added necessary node; when necessary node completion processing is performed on the first real-time node chain, because the position of the standard node 3 with the node name of 'proofreading' in the first standard node chain is a third node position, a first real-time node is newly added in the third node position in the first real-time node chain, and the first real-time node coding information of the newly added first real-time node is set as M4, and because the first real-time node is a completion node generated in the checking process, no actual flow operator and no actual operation time exist, and therefore, the first real-time node occurrence time information and the first real-time node operator information are both set as null;

After the above-mentioned necessary node checking and completing operation, the first real-time node chain obtained finally should be the first real-time node chain added with the newly added necessary node (M4, empty), i.e., the first real-time node chain is [ (M1, time 1, personnel 1), (M3, time 2, personnel 2), (M4, empty), (M8, time 3, personnel 3), (M13, time 4, personnel 4), (M15, time 5, personnel 5), (M16, time 6, personnel 6) ];

step 72, according to the first standard node chain, checking the front associated node of each first real-time node in the first real-time node chain, and if the front associated node is detected to be missing, performing corresponding front associated node completion processing;

the method specifically comprises the following steps: polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the front association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the front association node coding information as the current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the first real-time node before the current real-time node is not matched with the current associated node coding information, marking the standard node in the first standard node chain, in which the node coding information is matched with the current associated node coding information, as a newly added previous associated node, and carrying out previous associated node completion processing on the position of the previous node of the current real-time node according to the newly added previous associated node;

The method comprises the following steps of carrying out front association node completion processing on the position of a node before a current real-time node according to the newly added front association node, wherein the method specifically comprises the following steps: in the first real-time node chain, a first real-time node is newly added at the position of the previous node of the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added related node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting first real-time node operator information of the newly added first real-time node to be null;

for example, the first real-time node chain is a first real-time node chain example containing 7 first real-time nodes, which is given in step 71, and the first standard node chain is a hospitalized closed-loop standard node chain containing 16 standard nodes, which is given in step 1; polling 7 first real-time nodes of the first real-time node chain;

when the current real-time node is the 1 st, 2 nd, 4 th, 5 th, 6 th and 7 th first real-time nodes, the current real-time node coding information is M1, M3, M8, M13, M15 th and M16 th respectively, the node coding information in the first standard node chain is M1 standard node 1, 2 nd, 4 th, 9 th, 11 th and 12 th, and the previous associated node coding information of the standard nodes 1, 2 nd, 4 th, 9 th, 11 th and 12 th is empty, so the current associated node coding information is empty; the method has the advantages that when the current real-time nodes are 1 st, 2 nd, 4 th, 5 th, 6 th and 7 th first real-time nodes, no front association nodes are set, namely the deletion check and the corresponding completion operation of the front association nodes are not needed;

When the current real-time node is the 3 rd first real-time node, the current real-time node coding information is M4, the node coding information in the first standard node chain is M4 and is the standard node 3, the front association node coding information of the standard node 3 is M3, namely the current association node coding information is M3, and the fact that the front association node of the current real-time node is set as the standard node 2 with the node coding of M3 is explained; in addition, the fact that the first real-time node coding information of the first real-time node before the current real-time node, namely the first real-time node coding information of the 2 nd first real-time node is M3 and is matched with the current association node coding information M3 shows that the current real-time node is the 3 rd first real-time node, although the current real-time node has the setting of the front association node, the front association node in the first real-time node chain is not lost, and therefore corresponding completion operation is not needed;

after the above-mentioned pre-association node checking and completing operation, no additional node is added to the first real-time node chain, so that the first real-time node chain still has [ (M1, time 1, person 1), (M3, time 2, person 2), (M4, empty), (M8, time 3, person 3), (M13, time 4, person 4), (M15, time 5, person 5), (M16, time 6, person 6) ];

Step 73, according to the first standard node chain, checking the post-association nodes of each first real-time node in the first real-time node chain, and if the missing post-association nodes are checked, performing corresponding post-association node completion processing;

the method specifically comprises the following steps: polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the post-association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the post-association node coding information as the current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the next first real-time node of the current real-time node is not matched with the current associated node coding information, marking the standard node with the node coding information matched with the current associated node coding information in the first standard node chain as a newly added associated node, and carrying out post-associated node completion processing on the next node position of the current real-time node according to the newly added associated node;

And performing post-association node completion processing on the next node position of the current real-time node according to the newly added post-association node, wherein the post-association node completion processing specifically comprises the following steps: in the first real-time node chain, a first real-time node is newly added at the position of a node next to the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added associated node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null.

For example, the first real-time node chain is a first real-time node chain example containing 7 first real-time nodes, which is given in step 72, and the first standard node chain is a hospitalized closed-loop standard node chain containing 16 standard nodes, which is given in step 1; polling 7 first real-time nodes of the first real-time node chain;

when the current real-time nodes are 1 st, 3 rd, 4 th, 5 th and 6 th first real-time nodes, the current real-time node coding information is M1, M4 th, M8 th, M13 th and M15 th respectively, the node coding information in the first standard node chain is M1 st standard node 1, 3 rd, 4 th, 9 th and 11 th, and the current associated node coding information is empty because the post-associated node coding information of the standard nodes 1 st, 3 rd, 4 th, 9 th and 11 th is empty; the method has the advantages that when the current real-time nodes are 1 st, 3 rd, 4 th, 5 th and 6 th first real-time nodes, no rear association nodes are set, namely, the deletion check and the corresponding complement operation of the rear association nodes are not needed;

When the current real-time node is the 2 nd first real-time node, the current real-time node coding information is M3, the node coding information in the first standard node chain is M3, which is the standard node 2, the post-association node coding information of the standard node 2 is M4, namely the current association node coding information is M4, and the post-association node of the current real-time node is set as the standard node 3 with the node coding of M4; in addition, the fact that the first real-time node coding information M4 of the next first real-time node, namely the first real-time node of the 3 rd first real-time node, is matched with the current association node coding information M4 shows that the setting of the rear association node is provided when the current real-time node is the 2 nd first real-time node, but the rear association node in the first real-time node chain is not lost, so that corresponding completion operation is not needed;

when the current real-time node is the 7 th first real-time node, the current real-time node coding information is M16, the node coding information in the first standard node chain is M16, which is the standard node 12, the post-association node coding information of the standard node 12 is M17, namely the current association node coding information is M17, which means that the post-association node of the current real-time node is set as the standard node 13 with the node coding of M17; in addition, the first real-time node behind the current real-time node does not exist, which indicates that the related node behind the current real-time node is missing when the current real-time node is the 7 th first real-time node, and the post-related node completion processing is needed; when the post-association node completion processing is carried out, a first real-time node is newly added to the position of the next node of the 7 th first real-time node, namely the 8 th node, in the first real-time node chain, the first real-time node coding information of the newly added first real-time node is set to be M17, and the first real-time node occurrence time information and the first real-time node operator information are set to be null;

After the above-mentioned post-association node checking and completing operation, the first real-time node chain obtained finally is a first real-time node chain added with the newly added post-association node (M17, null), and the new first real-time node chain includes node chains of 8 first real-time nodes, specifically [ (M1, time 1, person 1), (M3, time 2, person 2), (M4, null), (M8, time 3, person 3), (M13, time 4, person 4), (M15, time 5, person 5), (M16, time 6, person 6), (M17, null) ].

It should be noted that, new missing nodes may be generated after each new real-time node is added, so after the checking and completing of the necessary nodes and the front and rear associated nodes are sequentially completed through the steps 71-73 in the current step 7, the checking and completing of the necessary nodes and the front and rear associated nodes are further required to be performed again on the first real-time node chain obtained this time through the steps 71-73 until no missing necessary nodes and front and rear associated nodes exist in the first real-time node chain obtained this time.

Step 8, performing overtime node inspection processing on the first real-time node chain completed by the missing node according to the first time limit list, and generating a corresponding first inspection information sequence;

Wherein the first inspection information sequence includes a plurality of first inspection information groups; the first checking information group comprises first real-time node index information, second real-time node index information and first node overtime early warning information;

in the embodiment of the invention, a first time limit list is used for carrying out node overtime check on a first real-time node chain completed with missing nodes, if a overtime node pair exists, a corresponding first check information group is generated, first real-time node index information in the first check information group is used for identifying the ordering index position of a starting node in the overtime node pair in the first real-time node chain, second real-time node index information is used for identifying the ordering index position of an ending node in the overtime node pair in the first real-time node chain, and first node overtime early warning information is corresponding overtime early warning information;

the method specifically comprises the following steps: step 81, polling the node time limit records of the first time limit list, recording the currently polled node time limit records as current time limit records, recording the initial node name information of the current time limit records as first node name information, recording the ending node name information of the current time limit records as second node name information, and recording the node time limit information of the current time limit records as first time limit information;

For example, the first time limit list is a node time limit list including 1 node time limit record given in the step 2, wherein the node time limit record 1 is "reeving", "checking", "10 minutes", and then when the current time limit record is the node time limit record 1, the first node name information is "reeving", the second node name information is "checking", and the first time limit information is "10 minutes";

step 82, in the first standard node chain, marking node coding information of standard nodes with node name information matched with the first node name information as first coding information; marking node coding information of a standard node with the node name information matched with the second node name information as second coding information;

for example, the first standard node chain is a hospitalized closed-loop standard node chain including 16 standard nodes, which is given in the step 1, the first standard node chain is characterized in that the first node name information is "reelpooling", the second node name information is "proofreading", and the first time limit information is "10 minutes"; then, in the first standard node chain, the standard node 2 is matched with the transfer reading, the corresponding first coding information is M3, the standard node 3 is matched with the checking, and the corresponding second coding information is M4;

Step 83, in the first real-time node chain, marking the first real-time node with the first real-time node coding information matched with the first coding information as the first node; recording a first real-time node, which is behind the first node and is matched with the first real-time node coding information, as a second node; the first real-time node occurrence time information of the first node is recorded as first time information, and the first real-time node occurrence time information of the second node is recorded as second time information;

for example, the first encoded information is M3, the second encoded information is M4, and the first real-time node chain is the node chain [ (M1, time 1, person 1), (M3, time 2, person 2), (M4, empty), (M8, time 3, person 3), (M13, time 4, person 4), (M15, time 5, person 5), (M16, time 6, person 6), (M17, empty) ] including the 8 first real-time nodes obtained in step 7; then the first node should be (M3, time 2, person 2) and the second node should be (M4, empty); correspondingly, the first time information is time 2, and the second time information is empty;

step 84, if the first time information or the second time information is empty, setting the first checking state as the overtime node state;

Here, the first time information or the second time information is null, and one or all nodes in the node pair of the current time limit record constraint are the nodes of the later completion and are not already occurring nodes, in this case, the embodiment of the invention sets the first check state of the mark timeout check result as the timeout node state;

step 85, if neither the first time information nor the second time information is null, calculating a time interval between the first time information and the second time information, and generating corresponding first time interval information; if the first time interval information exceeds the first time limit information, setting a first check state as a overtime node state; if the first time interval information does not exceed the first time limit information, setting a first check state as a normal node state;

here, neither the first time information nor the second time information is null, indicating that both nodes of the node pair recording the constraint at the current time limit have occurred; in this case, the calculation of the flow time interval between the two is continued to obtain first time interval information; if the first time interval information exceeds the preset first time limit information, and the hospitalization closed loop processing flow between the node pair recording the constraint in the front limit is overtime, in this case, the embodiment of the invention sets the first checking state of the mark overtime checking result as the overtime node state; if the first time interval information does not exceed the preset first time limit information, and the hospitalization closed loop processing flow between the node pairs of the record constraint in the front limit is not overtime, in this case, the embodiment of the invention sets the first checking state of the mark overtime checking result as a normal node state;

Step 86, if the first checking state is the overtime node state, adding a first checking information group in the first checking information sequence; setting first real-time node index information of the newly-added first inspection information group according to node index information of the first node in the first real-time node chain, setting second real-time node index information of the newly-added first inspection information group according to node index information of the second node in the first real-time node chain, generating corresponding overtime early warning information according to a preset overtime early warning information format, and setting first node overtime early warning information of the newly-added first inspection information group.

Here, the first check state indicates for the timeout node state that either missing complement nodes exist between the node pair that records the constraint at the current time limit, or that the inter-node hospitalization closed loop processing flow has timed out; in this case, the embodiment of the present invention generates a first inspection information group in the first inspection information sequence correspondingly;

for example, taking the example of step 83 as a reference, the obtained first check state is a timeout node state, the node index information of the first node in the first real-time node chain is 2, and the node index information of the second node in the first real-time node chain is 3; and then, the first real-time node index information of the newly added first inspection information group is 2, the second real-time node index information is 3, and the first node timeout early warning information is timeout early warning information generated according to a preset timeout early warning information format.

It should be noted that, the preset timeout early warning information format is: when the first checking state is set to be the overtime node state, if the first time information is empty but the second time information is not empty, generating overtime early warning information as' overtime: front node missing "; if the first time information is not null but the second time information is null, generating timeout early warning information as' timeout: rear node missing "; if the first time information and the second time information are both empty, generating timeout early warning information as timeout: front and rear node missing "; if the first time information and the second time information are not empty, generating first timeout information according to a difference value between the first time interval information and the first time limit information, and generating timeout early warning information by combining the first timeout information as' overtime: "+ first timeout information.

And 9, carrying out user hospitalization closed-loop information chain display processing based on a preset hospitalization closed-loop display template according to the first real-time node chain and the corresponding first examination information sequence.

Here, the hospitalization closed-loop display template has various formats, and can be set according to actual application scenarios, and further description is omitted here.

In addition, when the user hospitalization closed-loop information chain display processing is carried out, a first real-time node with unique first real-time node coding information in the first real-time node chain is regarded as a single node; and regarding a plurality of first real-time nodes with the same first real-time node coding information as repeated nodes; for a single node, extracting node name information matched with node codes from a first standard node chain as corresponding node name display information and using the node name information for node display; and extracting node name information matched with the node codes from the first standard node chain as basic node information for a plurality of repeated nodes, and adding a distinguishing mark to the basic node information according to the time sequence of each repeated node to serve as node name display information corresponding to each repeated node for node display.

Here, there may be a plurality of first real-time nodes with repeated node codes in the first real-time node chain, taking the hospitalization item type as the hospitalization order type as an example, because multiple orders and drug placement may occur, a plurality of first real-time nodes with identical (same as M8) first real-time node code information may occur in the first real-time node chain, and at this time, all the first real-time node code information is set as a repeated node with same as M8, where M8 is the first real-time node code information; otherwise, the first real-time node corresponding to the first real-time node coding information which is not repeated in the first real-time node chain is set as a single node;

when the first real-time nodes of the first real-time node chain are displayed, the names of the first real-time nodes are required to be displayed; for each single node, only the corresponding node name is extracted from the first standard node chain to be used as display information; for each repeated node, the corresponding node name is extracted from the first standard node chain as basic node information, the repeated nodes are ordered according to time sequence, and an ordering prefix information is added on the basis of the basic node information according to the ordering index as a distinguishing mark, so that final display information corresponding to each repeated node is obtained, for example, 2 first real-time node coding information in the first real-time node chain is the repeated node of M8, the corresponding basic node information is "order medicine placing (splitting)", the two first real-time nodes are ordered according to time sequence, and the final display information in front of time is "order medicine placing (splitting)", and the final display information in back of time is "order medicine placing (splitting)".

In addition, when the user hospitalization closed-loop information chain display processing is carried out, a first real-time node in which the occurrence time information of the first real-time node and the information of a first real-time node operator are not empty in the first real-time node chain is regarded as a real node; and regarding the first real-time node with empty occurrence time information of the first real-time node and operator information of the first real-time node before the last real node as missing nodes; the first real-time node with the empty occurrence time information of the first real-time node and the empty operator information of the first real-time node after the last normal node is regarded as the node to be executed; and setting display information of the missing node, the real node and the node to be executed by adopting different colors.

Here, conventionally, the missing nodes may be displayed in red, the nodes to be executed may be displayed in gray, and the real nodes may be displayed in other colors than red and gray. Of course, other color configurations may be used to set the display information of the missing node, the real node and the node to be executed, which is not further described herein.

In addition, when the user hospitalization closed-loop information chain display processing is performed, if the first examination information sequence is not empty, the first node timeout early warning information of the first examination information sequence is displayed and set by adopting a preset first color.

If the first inspection information sequence corresponding to the first real-time node chain is not empty, which indicates that the overtime phenomenon exists in the overtime inspection result of the node in the current period, displaying corresponding overtime early warning information of the first node between the corresponding nodes, and prompting the early warning information by adopting a preset first color. Conventionally, the first color may be a conspicuous red, or may be other colors that can highlight the content for display configuration, which will not be further described herein.

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

1. A method for processing hospitalized closed-loop information, said method comprising:

performing user hospitalization closed-loop information chain display processing based on a preset hospitalization closed-loop display template according to the first real-time node chain and the corresponding first examination information sequence;

wherein the hospitalization closed-loop standard node chain comprises a plurality of standard nodes; the standard nodes comprise node coding information, node name information, necessary node mark information, front associated node coding information and rear associated node coding information;

the first inspection information sequence includes a plurality of first inspection information groups; the first checking information group comprises first real-time node index information, second real-time node index information and first node overtime early warning information;

And performing missing node inspection and corresponding missing node completion processing on the first real-time node chain according to the first standard node chain, wherein the method specifically comprises the following steps of:

according to the first standard node chain, checking the post-association nodes of each first real-time node in the first real-time node chain, and if the missing post-association nodes are checked, performing corresponding post-association node completion processing;

the step of checking the first real-time node chain for necessary nodes according to the first standard node chain, and if the necessary nodes are checked, performing corresponding necessary node completion processing, specifically including:

Polling all the obtained necessary nodes, marking the currently polled necessary nodes as current necessary nodes, and marking the node coding information of the current necessary nodes as current necessary node coding information; if the first real-time node of which the first real-time node coding information is matched with the current necessary node coding information does not exist in the first real-time node chain, marking the current necessary node as a newly added necessary node, and carrying out necessary node completion processing in the first real-time node chain according to the newly added necessary node;

the necessary node completion processing in the first real-time node chain according to the newly added necessary node specifically includes:

referring to the node position of the newly added necessary node in the first standard node chain, and newly adding one first real-time node at the corresponding position in the first real-time node chain; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added necessary node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null;

The step of checking the front association nodes of each first real-time node in the first real-time node chain according to the first standard node chain, and if the front association node is detected to be missing, performing corresponding front association node completion processing, specifically including:

polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the front association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the front association node coding information as the current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the first real-time node before the current real-time node is not matched with the current associated node coding information, marking the standard node in the first standard node chain, in which the node coding information is matched with the current associated node coding information, as a newly added previous associated node, and carrying out previous associated node completion processing on the previous node position of the current real-time node according to the newly added previous associated node;

And performing pre-association node completion processing on a node position before the current real-time node according to the newly added pre-association node, wherein the method specifically comprises the following steps of:

in the first real-time node chain, a first real-time node is newly added at a position of a node before the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the related node before the new addition; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null;

and according to the first standard node chain, checking the post-association nodes of each first real-time node in the first real-time node chain, and if the missing post-association nodes are checked, performing corresponding post-association node completion processing, wherein the method specifically comprises the following steps:

polling each first real-time node in the first real-time node chain, marking the currently polled first real-time node as a current real-time node, and marking the first real-time node coding information of the current real-time node as current real-time node coding information; extracting the post-association node coding information of the standard node, which is matched with the current real-time node coding information, from the first standard node chain, and taking the post-association node coding information as current association node coding information; if the current associated node coding information is not null and the first real-time node coding information of the first real-time node next to the current real-time node is not matched with the current associated node coding information, marking the standard node in the first standard node chain, in which the node coding information is matched with the current associated node coding information, as a newly added associated node, and performing post-associated node completion processing on a position of the next node of the current real-time node according to the newly added associated node;

And performing post-association node completion processing on a node position next to the current real-time node according to the newly added post-association node, wherein the post-association node completion processing specifically comprises the following steps:

in the first real-time node chain, a first real-time node is newly added at a position of a node next to the current real-time node; setting the first real-time node coding information of the newly added first real-time node as the node coding information of the newly added associated node; setting the occurrence time information of the first real-time node of the newly added first real-time node to be null; setting the first real-time node operator information of the newly added first real-time node to be null;

and performing overtime node inspection processing on the first real-time node chain completed with the missing node according to the first time limit list to generate a corresponding first inspection information sequence, wherein the method specifically comprises the following steps of:

2. The hospitalization closed loop information processing method of claim 1, further comprising:

3. The hospitalization closed loop information processing method of claim 1, further comprising:

when the user hospitalization closed-loop information chain display processing is carried out, the first real-time node in which the first real-time node occurrence time information and the first real-time node operator information are not empty in the first real-time node chain is regarded as a real node; the first real-time node generating time information before the last real node and the first real-time node operator information are empty are regarded as missing nodes; the first real-time node generating time information after the last real node and the first real-time node operator information are empty are regarded as nodes to be executed; setting display information of the missing node, the real node and the node to be executed by adopting different colors;