Implementation method of barrel type linked list structure

Abstract

The invention provides an implementation method of a barrel type linked list structure. The method is characterized in that a linked list uses barrel type structures as unit organization nodes, the positions of the previous node and the next node are pointed out by digital indexes among the nodes, and the linked list can be serially connected by multiple barrel type structures; during node adding, the idle positions in the barrel type structure are searched, and if the barrel type structure is full, another barrel type structure is created and data is saved into the barrel type structure; during node deletion, the corresponding positions of the barrel type structure is set to be idle. Compared with traditional linked list structure, the barrel type linked list has the advantages that the barrel type linked list can be managed by using the barrel type structure as unit, bidirectional connection in a pointer manner is avoided, node adding and deleting are quite fast and convenient, and during linked lift node traversing, internal memory cache hit ratio is increased while the operation efficiency of the a software system is increased evidently due to the fact that the nodes are internal memory continuous.

Description

technical field [0001] The invention relates to a method for realizing a barrel-type linked list structure, in particular to methods for creating the linked list structure and adding and deleting nodes. Background technique [0002] Linked list is a data structure that connects the elements of each node through pointers. When adding nodes and deleting nodes in linked list, you only need to modify the pointers of the previous and next nodes to complete the addition and deletion operations. Compared with the array structure, it saves a lot of The element movement operation. [0003] Since the nodes of the linked list are organized by a single unit, when a large number of node operations are performed on the linked list, frequent node addition and deletion operations lead to a sharp decline in performance, which seriously affects the operating efficiency of the program. Contents of the invention [0004] In order to solve the problem of inefficiency in adding and deleting no...

AI Technical Summary

Problems solved by technology

[0004] In order to solve the problem of inefficiency in adding and deleting nodes in the existing linked list, the present invention provides a novel method for realizing the structure of the bucket-type linked list. By introducing the bucket-type structure, the nodes in the bucket are connected to each other in the form of digital index , speed up the addition, deletion and access of nodes, and improve the operating efficiency of the program

Images