Service node management method, linked list manager, embedded device and storage medium

Abstract

The invention provides a service node management method, a linked list manager, embedded equipment and a storage medium, and relates to the technical field of computer application. Compared with a traditional scheme, the business nodes are stored by adopting the double linked list, and the method has the advantages that when the business nodes are added or deleted, only pointers of the corresponding precursor business nodes and the subsequent business nodes need to be modified, the whole double linked list does not need to be traversed, the business nodes are added or deleted more quickly, the development efficiency of the embedded equipment is higher, and the development efficiency of the embedded equipment is improved. The maintenance cost is lower; when a plurality of service nodes are linked to the double linked list, the positions, the sequence and other distribution conditions of the service nodes on the graphical user interface are referred, so that the positions of the service nodes can be adjusted at any time according to needs, and the flexibility is higher; and the application range is wider. In short, more efficient management (such as addition, deletion, search, modification and the like) of the service nodes can be realized, and the management effect of the service nodes is better.

Description

[Technical field]

[0001] The present application relates to the technical field of computer applications, and in particular to a service node management method, a linked list manager, an embedded device, and a storage medium. [Background technology]

[0002] An embedded system (also called an embedded device) is a special computer system that can flexibly tailor software and hardware according to user needs (such as functions, reliability, cost, size, power consumption, environment, etc.). It has excellent characteristics such as high real-time performance, small data volume, and fast communication speed, which makes it widely used in many different fields. Usually, most embedded devices have a display screen, which is used to configure a GUI (Graphical User Interface). Users can interact with embedded devices through the GUI. Specifically, there are several service nodes set in the GUI, and users can implement different services through different service nodes.

[0003] In the related technology, taking medical equipment as an example, it has high requirements for real-time, smoothness, security, etc., which makes the display screen have more business nodes, and also means that a large number of graphics or text elements need to be processed, and the existing business node management scheme can no longer meet this requirement, especially the addition or deletion of business nodes. The existing business node management scheme usually uses a linear structure, that is, using a structure array or a one-way linked list to store business nodes, which has poor flexibility. For example, different embedded devices have different business functions in different modes, and the corresponding business nodes will be different. At this time, all business nodes need to be adjusted to meet the requirements of equipment and business, which directly leads to a sharp drop in development efficiency and is not conducive to later maintenance and upgrades. These undoubtedly reduce the management effect of business nodes in the GUI, so it is necessary to improve the existing management scheme of business nodes in the GUI. [Summary of the invention]

[0004] The present application provides a service node management method, a linked list manager, an embedded device and a storage medium, aiming to solve the problem of poor management effect of service nodes in a GUI in the related art.

[0005] In order to solve the above technical problems existing in the related art, the first aspect of the present application provides a service node management method, which is applied to an embedded device, wherein the embedded device has a display screen, the display screen is used to configure a graphical user interface, and a plurality of service nodes are distributed on the graphical user interface. Specifically, the service node management method of the first aspect of the present application includes: identifying the distribution of a plurality of service nodes on the graphical user interface; linking a plurality of service nodes into a bidirectional linked list according to the distribution; and managing a plurality of service nodes based on the bidirectional linked list.

[0006] The second aspect of the present application provides a linked list manager, which includes a memory and a processor communicatively connected to the memory, the memory stores a computer program, and the processor is used to call the computer program stored in the memory to implement the service node management method mentioned in the first aspect of the present application.

[0007] The third aspect of the present application provides an embedded device, which includes a display screen and the linked list manager mentioned in the second aspect of the present application. The display screen is used to configure a graphical user interface, and a number of business nodes are distributed on the graphical user interface. The linked list manager is used to manage the several business nodes according to the business node management method mentioned in the first aspect of the present application.

[0008] A fourth aspect of the present application provides a computer-readable storage medium, on which a computer program is stored. The computer program is used to be called by a processor to implement the service node management method mentioned in the first aspect of the present application.

[0009] It can be understood that through the implementation of the above technical solutions of the present application, the distribution of several business nodes on the graphical user interface is first identified, such as the position and order of several business nodes on the graphical user interface, and then the several business nodes are linked to a bidirectional linked list according to the identified distribution, so that the several business nodes can be managed through the bidirectional linked list. It can be seen that compared with the traditional solution of using structure array or one-way linked list to store business nodes, this application uses a two-way linked list to store business nodes, and its advantages are: each business node in the two-way linked list has two pointers, one pointing to the predecessor business node and the other pointing to the successor business node, so when adding or deleting business nodes, only the pointers of the corresponding predecessor business node and the successor business node need to be modified, and there is no need to traverse the entire two-way linked list. The addition or deletion of business nodes is faster, the development efficiency of embedded devices is higher, and the maintenance cost is lower; when linking several business nodes to the two-way linked list, the position, order and other distribution of several business nodes on the graphical user interface are referred to, so that the two-way linked list is more consistent with the distribution of several business nodes on the graphical user interface, so that the position of each business node can be adjusted at any time according to needs, and the flexibility is higher; it can be applied to various embedded devices and has a wider range of applications. In short, this application can achieve more efficient management of business nodes (such as adding, deleting, searching and modifying, etc.), and the management effect of business nodes is better.

Brief Description of the Drawings

[0010] In order to more clearly illustrate the technical solutions in the related technologies or the embodiments of the present application, the drawings required for use in the description of the related technologies or the embodiments of the present application will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, not all embodiments. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0011] Figure 1 A schematic diagram of the structure of an embedded device provided in an embodiment of the present application;

[0012] Figure 2 A module block diagram of a linked list manager provided in an embodiment of the present application;

[0013] Figure 3 A flow chart of a service node management method provided in an embodiment of the present application;

[0014] Figure 4 This is an example diagram of adding / deleting service nodes provided in an embodiment of the present application. [Specific implementation method]

[0015] In order to make the purpose, technical solutions and advantages of the present application more obvious and easy to understand, the present application will be clearly and completely described below in conjunction with the embodiments of the present application and the corresponding drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements with the same or similar functions. It should be understood that the various embodiments of the present application described below are only used to explain the present application and are not used to limit the present application, that is, based on the various embodiments of the present application, all other embodiments obtained by ordinary technicians in this field without making creative work belong to the scope of protection of the present application. In addition, the technical features involved in the various embodiments of the present application described below can be combined with each other as long as they do not conflict with each other.

[0016] In the related art, the existing business node management scheme usually uses a linear structure, that is, a structure array or a one-way linked list is used to store business nodes, which has poor flexibility. For example, different embedded devices have different business functions in different modes, and the corresponding business nodes will be different. At this time, all business nodes need to be adjusted to meet the requirements of the device and the business, which directly leads to a sharp drop in development efficiency and is not conducive to subsequent maintenance and upgrades. These undoubtedly reduce the management effect of business nodes in the GUI. To this end, the present application proposes a business node management method, a linked list manager that executes the business node management method, and an embedded device that applies the linked list manager in the embodiments below. The business nodes in the GUI are managed by the business node management method of the present application, which has higher flexibility and a wider range of applications. It not only makes it more convenient to add, delete, modify and search business nodes, but also improves the development efficiency of embedded devices, which is also very beneficial for subsequent maintenance and upgrades.

[0017] Figure 11 is a schematic diagram of the structure of an embedded device. In some embodiments, the embedded device 100 includes a display screen 120 and a linked list manager 110 that is communicatively connected to the display screen 120. The display screen 120 is used to configure a graphical user interface 121. A plurality of service nodes 1211 are distributed on the graphical user interface 121. The linked list manager 110 stores a computer program, which is essentially the service node management method of the present application. That is, the linked list manager 110 manages a plurality of service nodes 1211 on the graphical user interface 121 by executing the computer program stored in the linked list manager 110, including but not limited to adding, deleting, searching and modifying the service nodes 1211. Specifically, when the linked list manager 110 executes the computer program stored in the linked list manager 110, it can identify the distribution of a plurality of service nodes 1211 on the graphical user interface 121 (such as position, order, etc.), and link the plurality of service nodes 1211 to a bidirectional linked list according to the identified distribution, so as to manage the plurality of service nodes 1211 based on the bidirectional linked list. In addition, it should be noted that the bidirectional linked list of the present application is different from the structure array or unidirectional linked list in the traditional solution, but is not limited to the use of bidirectional linked lists. For example, in other embodiments, the bidirectional linked list can be replaced by a bidirectional circular linked list according to the application scenario.

[0018] It can be understood that, compared with the traditional solution of using structure array or one-way linked list to store business nodes 1211, the present application uses a two-way linked list to store business nodes 1211, which has the following advantages: each business node 1211 in the two-way linked list has two pointers, one pointing to the predecessor business node and the other pointing to the successor business node, so when adding or deleting a business node 1211, it is only necessary to modify the pointers of the corresponding predecessor business node and the successor business node without traversing the entire two-way linked list, and the addition or deletion of business nodes 1211 is faster, the development efficiency of the embedded device 100 is higher, and the maintenance cost is lower; when linking several business nodes 1211 to the two-way linked list, the position, order and other distribution of several business nodes 1211 on the graphical user interface 121 are referred to, so that the two-way linked list is more consistent with the distribution of several business nodes 1211 on the graphical user interface 121, so that the position of each business node 1211 can be adjusted at any time according to needs, with higher flexibility; it can be applicable to various embedded devices 100 and has a wider range of applications. In short, the linked list manager 110 of the present application can achieve more efficient management of the service node 1211, and has a better management effect on the service node 1211. In addition, it should be noted that the predecessor service node refers to the service node 1211 of the previous level of the target service node in the bidirectional linked list, and the successor service node refers to the service node 1211 of the next level of the target service node in the bidirectional linked list.

[0019] As one example, Figure 2 1 is a block diagram of a linked list manager. The linked list manager 110 includes a memory 111 and a processor 112. The memory 111 is in communication connection with the processor 112. The memory 111 stores a computer program, which is the service node management method of the present application. That is, the processor 112 can call the computer program stored in the memory 111 to implement the service node management method. In addition, it should be noted that the linked list manager 110 may include other common structures in the art in addition to the memory 111 and the processor 112, such as a bus 113 for implementing the communication connection between the memory 111 and the processor 112, etc., which are not listed one by one in this embodiment.

[0020] In some implementations of this embodiment, the processor 112 is composed of an integrated circuit, which may be composed of a single packaged integrated circuit, or may be composed of multiple packaged integrated circuits with the same function or different functions. The processor 112 may include a central processing unit (CPU), a microprocessor, a neural network chip, a digital processing chip, a graphics processor, and any one or more combinations of various control chips. It can be understood that the processor 112 belongs to the control core of the linked list manager 110. The processor 112 uses various interfaces and lines to connect the various components of the entire linked list manager 110, and implements various functions and data processing of the linked list manager 110 by running or executing computer programs or modules and calling data, such as implementing the management function of the service node 1211.

[0021] In some implementations of this embodiment, the memory 111 includes at least one type of computer-readable storage medium, which may include but is not limited to flash memory, a mobile hard disk, a multimedia card, a card-type memory (such as SD memory, DX memory, etc.), a magnetic memory, a disk, and an optical disk. In these implementations, the memory 111 can be an internal storage unit of the linked list manager 110 (such as a mobile hard disk of the linked list manager 110), or an external storage device of the linked list manager 110, such as a plug-in mobile hard disk, a smart memory card (SMC), a secure digital (SD) card, and a flash memory card equipped on the linked list manager 110, or the memory 111 is both an internal storage unit and an external storage device of the linked list manager 110; further, the memory 111 can be used not only to store application software, various types of data, and computer programs (such as codes for implementing the management functions of the service node 1211) installed in the linked list manager 110, but also to temporarily store data that has been output or is to be output; in the actual management process of the service node 1211, the processor 112 can call and run the computer program stored in the memory 111, thereby implementing the management function of the service node 1211.

[0022] The above embodiments are only preferred implementations of the present application, and they are not the only limitations on the embedded device 100, the linked list manager 110 and other related contents; in this regard, those skilled in the art can flexibly set them according to the actual application scenarios based on the above embodiments. Below, the computer program executed by the processor 112 in the linked list manager 110 (i.e., the service node management method) will be described in detail.

[0023] Figure 3 It is a flow chart of the business node management method. In some embodiments, the business node management method includes the following steps 301 to 303 (abbreviated as S301 to S303). In the following steps, the present application will describe the processor 112 in the linked list manager 110 as the execution subject.

[0024] S301, identifying the distribution of a number of service nodes on a graphical user interface.

[0025] In some embodiments, when the linked list manager 110 manages several business nodes 1211 on the graphical user interface 121, it needs to first identify the distribution of the several business nodes 1211 on the graphical user interface 121, such as the position and order of the several business nodes 1211 on the graphical user interface 121.

[0026] S302, linking a number of service nodes into a bidirectional linked list according to the distribution situation.

[0027] In some embodiments, after the linked list manager 110 identifies the distribution of the plurality of service nodes 1211 on the graphical user interface 121, the plurality of service nodes 1211 may be linked to a bidirectional linked list according to the identified distribution, that is, a bidirectional linked list is used to store the plurality of service nodes 1211 on the graphical user interface 121. It should be noted that in a multi-threaded application scenario, in order to protect each service node 1211, after the linked list manager 110 links the plurality of service nodes 1211 to the bidirectional linked list according to the identified distribution, it is also necessary to lock the bidirectional linked list.

[0028] It can be understood that each business node 1211 in the bidirectional linked list has two pointers, one pointing to the predecessor business node and the other pointing to the successor business node. In this way, when adding or deleting a business node 1211, it is only necessary to modify the pointers of the corresponding predecessor business node and the successor business node, without traversing the entire bidirectional linked list. The addition or deletion of business nodes 1211 is faster, the development efficiency of the embedded device 100 is higher, and the maintenance cost is lower. When linking several business nodes 1211 to the bidirectional linked list, the position, order and other distribution of several business nodes 1211 on the graphical user interface 121 are referred to, so that the bidirectional linked list is more consistent with the distribution of several business nodes 1211 on the graphical user interface 121. In this way, the position of each business node 1211 can be adjusted at any time as needed, which is more flexible.

[0029] S303, managing several service nodes based on a bidirectional linked list.

[0030] In some embodiments, after linking several service nodes 1211 into a bidirectional linked list according to the distribution of several service nodes 1211 on the graphical user interface 121, the linked list manager 110 can manage several service nodes 1211 on the graphical user interface 121 based on the bidirectional linked list, such as adding, deleting, searching and modifying the service nodes 1211. As one embodiment, each service node 1211 in the bidirectional linked list records corresponding node parameters, such as node identification, predecessor service node, successor service node, node data and callback function, etc. Based on this, the linked list manager 110 can manage several service nodes 1211 on the graphical user interface 121 according to the bidirectional linked list and the node parameters of each service node 1211 in the bidirectional linked list. In some implementations of this embodiment, the linked list manager 110 can search for the target business node in the bidirectional linked list based on the bidirectional linked list and the node parameters of each business node 1211 in the bidirectional linked list. Since the node identifier is unique relative to the business node 1211, the target business node can be found in the bidirectional linked list through the node identifier of the target business node.

[0031] In some implementations of this embodiment, the linked list manager 110 can delete the target business node in the bidirectional linked list according to the node parameters of the bidirectional linked list and each business node 1211 in the bidirectional linked list. The process is as follows: find the target business node in the bidirectional linked list through the node identifier of the target business node; delete the target business node by modifying the pointers of the predecessor business node and the successor business node of the target business node. It can be understood that when deleting the target business node, the target business node already exists in the bidirectional linked list. In this case, it is only necessary to find the target business node in the bidirectional linked list and modify the pointers of the predecessor business node and the successor business node of the target business node; illustratively, Figure 4 This is an example diagram of adding / deleting business nodes. Assume that the current bidirectional linked list is as follows Figure 4 As shown in (a), the bidirectional linked list includes five service nodes 1211 (respectively represented by a, b, c, d, and e). Now c needs to be deleted. Then, it is only necessary to modify the pointers of c's predecessor service node b and successor service node d. That is, the pointer of the predecessor service node b originally pointing to c is modified to point to the successor service node d, and the pointer of the successor service node d originally pointing to c is modified to point to the predecessor service node b. At this point, the deletion of c is completed, and the bidirectional linked list after deletion is as follows: Figure 4 (b) as shown.

[0032] In some implementations of the present embodiment, the linked list manager 110 can add the target business node to the bidirectional linked list based on the bidirectional linked list and the node parameters of each business node 1211 in the bidirectional linked list, and the process is: based on the target position when the target business node is added to the bidirectional linked list, and through the corresponding node identifier, find the predecessor business node and the successor business node (equivalent to the predecessor business node and the successor business node of the target business node) relative to this target position in the bidirectional linked list; modify the pointers of the predecessor business node and the successor business node of the target business node to achieve the addition of the target business node. It can be understood that when adding a target business node, the target business node does not exist in the bidirectional linked list. In this case, it is necessary to find the predecessor business node and the successor business node in the bidirectional linked list relative to this target position based on the target position when the target business node is added to the bidirectional linked list, and then modify the pointers of the predecessor business node and the successor business node found; illustratively, it is still based on Figure 4 For example, assuming that the current doubly linked list is Figure 4As shown in (b), the two-way linked list includes four business nodes 1211 (respectively represented by a, b, d, and e). Now it is necessary to add c between b and d. Then the target position when adding c to the two-way linked list is between b and d. That is to say, the predecessor business node relative to this target position is b and the successor business node is d. At this time, it is only necessary to modify the pointers of the predecessor business node b and the successor business node d, that is, to modify the pointer of the predecessor business node b that originally points to the successor business node d to point to c, and to modify the pointer of the successor business node d that originally points to the predecessor business node b to point to c. At this point, the addition of c is completed, and the two-way linked list after the addition is as follows. Figure 4 (a) shown.

[0033] In some implementations of this embodiment, the linked list manager 110 can modify the target business node in the bidirectional linked list based on the bidirectional linked list and the node parameters of each business node 1211 in the bidirectional linked list. The process is: find the target business node in the bidirectional linked list through the node identifier of the target business node; obtain the node data of the target business node, and use the corresponding callback function to modify the obtained node data.

[0034] The above embodiments are only preferred implementations of the present application, and are not the only limitation on the content related to the business node management method; in this regard, those skilled in the art can flexibly set them according to the actual application scenarios based on the above embodiments. It can be understood that through the implementation of the above embodiments of the present application, the distribution of several business nodes 1211 on the graphical user interface 121 is first identified, such as the position and order of several business nodes 1211 on the graphical user interface 121, and then according to the identified distribution, several business nodes 1211 are linked to a bidirectional linked list, so that several business nodes 1211 can be managed through the bidirectional linked list. It can be seen that compared with the traditional solution of using structure array or one-way linked list to store business nodes 1211, the present application uses a two-way linked list to store business nodes 1211, which has the following advantages: each business node 1211 in the two-way linked list has two pointers, one pointing to the predecessor business node and the other pointing to the successor business node. In this way, when adding or deleting a business node 1211, it is only necessary to modify the pointers of the corresponding predecessor business node and the successor business node without traversing the entire two-way linked list. The addition or deletion of business nodes 1211 is faster, the development efficiency of the embedded device 100 is higher, and the maintenance cost is lower; when linking several business nodes 1211 to the two-way linked list, the position, order and other distribution of several business nodes 1211 on the graphical user interface 121 are referred to, so that the two-way linked list is more consistent with the distribution of several business nodes 1211 on the graphical user interface 121, so that the position of each business node 1211 can be adjusted at any time according to needs, with higher flexibility; it can be applicable to various embedded devices 100 and has a wider range of applications. In short, the present application can achieve more efficient management of the business node 1211 (such as adding, deleting, searching and modifying, etc.), and achieve better management effect on the business node 1211.

[0035] In combination with the steps of the method or algorithm described in the embodiments disclosed herein, it can be implemented directly using hardware, a software module executed by a processor, or a combination of the two; wherein the software module can be set in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the technical field.

[0036] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product, which includes one or more computer instructions, and when the computer instructions are loaded and executed on a computer, the process or function described in the present application is generated in whole or in part, and the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, computer instructions can be transmitted from a website site, a computer, a server or a data center by wired (such as coaxial cable, optical fiber, digital subscriber line, etc.) or wireless (such as infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. Computer-readable storage media can be any available medium that a computer can access or a data storage device such as a server, a data center, etc. integrated by one or more available media. Available media can be magnetic media (such as floppy disks, hard disks, tapes), optical media (such as DVDs) or semiconductor media (such as solid-state hard disks Solid State Disk), etc.

[0037] It should be noted that the above-mentioned embodiments of the present application are described in a progressive manner, and each embodiment focuses on the differences from other embodiments, and the same / similar parts between the embodiments can be referred to each other. In addition, for the product-type embodiments, they are similar to the method-type embodiments, and the deficiencies in the descriptions of the two can be referred to each other.

[0038] It should also be noted that, in the present application, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any variant thereof are intended to cover non-exclusive inclusion, so that the process, method, article or equipment including a series of elements not only includes the listed elements, but also includes other elements not explicitly listed, or may also include elements inherent to such process, method, article or equipment. In the absence of further restrictions, the elements defined by the statement "include..." do not exclude the presence of other identical elements in the process, method, article or equipment including the elements.

[0039] The relevant description of each of the above embodiments of the present application enables professionals and technicians in the field to implement or use the content of the present application. Various modifications to these embodiments will be obvious to professionals and technicians in the field, and the general principles defined in the content of the present application can be implemented in other embodiments without departing from the spirit or scope of the content of the present application. Therefore, the content of the present application will not be limited to these embodiments shown in the content of the present application, but will conform to the widest range consistent with the principles and novel features disclosed in the content of the present application.

Claims

1. A service node management method, characterized in that: Applied in an embedded device, the embedded device has a display screen, the display screen is used to configure a graphical user interface, a plurality of service nodes are distributed on the graphical user interface, and the service node management method includes: Identifying the distribution of a plurality of the service nodes on the graphical user interface; According to the distribution, linking a plurality of the service nodes into a bidirectional linked list; A plurality of the service nodes are managed based on the bidirectional linked list.

2. The service node management method according to claim 1, characterized in that: Each of the service nodes in the bidirectional linked list has corresponding node parameters recorded therein; and the step of managing a plurality of the service nodes based on the bidirectional linked list comprises: Based on the bidirectional linked list and according to the node parameters of each of the service nodes in the bidirectional linked list, a plurality of the service nodes are managed.

3. The service node management method according to claim 2, characterized in that: The node parameters include a node identifier, a predecessor service node, and a successor service node; the step of managing a plurality of the service nodes based on the bidirectional linked list and according to the node parameters of each service node in the bidirectional linked list includes: Searching the target service node to be deleted in the bidirectional linked list by using the node identifier; The target service node is deleted by modifying the pointers of the predecessor service node and the successor service node of the target service node.

4. The service node management method according to claim 2, characterized in that: The node parameters include a node identifier, a predecessor service node, and a successor service node; the step of managing a plurality of the service nodes based on the bidirectional linked list and according to the node parameters of each service node in the bidirectional linked list includes: Based on the target position of the target service node to be added when it is linked to the bidirectional linked list, and by using the corresponding node identifier, searching the predecessor service node and the successor service node relative to the target position in the bidirectional linked list; The target service node is added by modifying the pointers of the predecessor service node and the successor service node relative to the target position.

5. The service node management method according to claim 2, characterized in that: The node parameters include a node identifier, node data, and a callback function; the step of managing a plurality of the service nodes based on the bidirectional linked list and according to the node parameters of each service node in the bidirectional linked list includes: Searching the target service node to be modified in the bidirectional linked list by using the node identifier; The node data of the target service node is obtained, and the node data is modified using the corresponding callback function.

6. The service node management method according to claim 1, characterized in that: In a multi-threaded application scenario, after the step of linking the plurality of service nodes into a bidirectional linked list, the process further includes: The bidirectional linked list is locked.

7. The service node management method according to claim 1, characterized in that: A bidirectional circular linked list is used to replace the bidirectional linked list.

8. A linked list manager, characterized in that: include: A memory having a computer program stored therein; A processor, the processor is communicatively connected to the memory, and is used to call the computer program to implement the service node management method according to any one of claims 1 to 7.

9. An embedded device, characterized in that: It comprises a display screen and the linked list manager as claimed in claim 8, wherein the display screen is used to configure a graphical user interface, a plurality of business nodes are distributed on the graphical user interface, and the linked list manager is used to manage the plurality of business nodes according to the business node management method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is used to be called by a processor to implement the service node management method according to any one of claims 1 to 7.

Images