Implementation method of barrel type linked list structure

An implementation method, a bucket-type technology, is applied in the implementation field of a bucket-type linked list structure, which can solve problems such as low efficiency and acceleration, and achieve the effects of solving low efficiency, improving efficiency significantly, and improving cache hit rate

Inactive Publication Date: 2014-12-10
HANGZHOU ELECTRONICS SOUL NETWORK TECH
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 int

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Implementation method of barrel type linked list structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0012] The features and advantages of the present invention will be illustrated through the following example schematic diagrams. The examples shown in the schematic diagrams are only typical examples of the technical solutions of the present invention. All technical solutions formed by equivalent replacement or equivalent transformation all involve the protection required by the present invention within range.

[0013] figure 1 It is a schematic diagram of the bucket-type linked list structure in the present invention. In this schematic diagram, the linked list is composed of three bucket-type structures connected in series. Each bucket-type structure has 5 node spaces respectively, and each node is composed of a forward index, node data and a backward index. Since the third position (starting from 0) in bucket 1 is free, the backward index of node 3 points to the fourth position. The backward index of the 4th node points to the 0th node of bucket 2, and the total position o...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
CPCG06F16/22
Inventor 余欣
Owner HANGZHOU ELECTRONICS SOUL NETWORK TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap