Linked list management system based on structured language and method

Abstract

The invention discloses a linked list management method based on structured language, which comprises the steps of determining an interface related to the linked list processing according to the operating system when an operating system; sending a linked list processing request from a client program to a linked list management module; calling an interface and/or a comparison interface related to the linked list processing and carrying out the processing operation on the linked list by the linked list management module according to a received linked list creation request, a linked list deletion request, a node creation request, a node query request, a node update request or a node deletion request. In different projects, by calling corresponding interfaces, the method can realize linked list management according to the set processing flow, and does not need to respectively compile codes to realize linked list management, thus being capable of obviously simplifying codes, improving the maintainability and expansibility of the codes and further improving the software development efficiency.

Description

technical field [0001] The invention relates to structured language programming technology, in particular to a linked list management system and method based on structured language. Background technique [0002] In software development, the linked list dynamically allocates memory space according to the needs, which is a structure for dynamic storage allocation. figure 1 It is a schematic diagram of a typical doubly linked list structure, such as figure 1 As shown, the doubly linked list has n nodes, node 0 is the head of the linked list, node n is the tail of the linked list, these two nodes are not used to store data, they are only used to identify the start and end positions of the linked list, and there are n-2 nodes in the middle Can be used to store data. Each node has three attributes: data, previous node pointer and next node pointer, where the data is the data managed by the linked list; the previous node pointer stores the memory address of the node adjacent to t...

AI Technical Summary

Problems solved by technology

[0004] Since linked lists are used in different projects, separate management codes are required. Therefore, when implementing linked list management in existing structured languages, there are many repeated codes, which not only occupy code space, but also have poor maintainability and scalability. In addition, a large number of The linked list management code prolongs the software development time and reduces the software development efficiency, which makes the use cost of the linked list larger and the software development efficiency is low

Images