Search information processing method for music playlist

Abstract

The invention relates to a search information processing method for a music playlist, which includes the steps: 1) initializing a tree structure, and building the tree structure according to the operating sequence of a user; 2) performing stack processing including initializing, popping and pushing operations; 3) enabling a terminal to traverse a whole tree according to information inputted by a user, and inquiring corresponding tree root node pointers; 4) judging whether the same node information is found or not, executing a step 5) if the same node information is found, otherwise, creating new nodes; 5) inquiring a stack space according to node IDs (identities); 6) judging whether data corresponding to the IDs are found in the stack space or not, and executing a step 7) if the data are directly called; 7) sending a request message to a server to acquire the data and executing a step 8); and 8) enabling the acquired data to enter the nodes on the same layer, and enabling the original information of the nodes to exit. Compared with the prior art, the method has the advantages that times for synchronizing with the server are decreased, instantaneity of a system is improved, and the like.

Description

technical field [0001] The invention relates to a method for acquiring network data, in particular to a method for processing search information of music listeners. Background technique [0002] After the user enters from the song encyclopedia on the main interface and the member area, the column list interface will display multiple sub-sections. Click on the newly displayed sub-section to enter the next sub-section, and so on. The user selects a sub-category list to enter the content list, and after selecting a track from the content list UI, enters the track detail UI. [0003] The above-mentioned hierarchical category information acquisition needs to send a request message to the server every time, and save it in the memory after receiving the response message. The user will request the server again when searching for the same category next time, so the response speed is too slow and the user operation is real-time. poor. Contents of the invention [0004] The object...

AI Technical Summary

Problems solved by technology

[0003] The above-mentioned hierarchical category information acquisition needs to send a request message to the server every time, and save it in the memory after receiving the response message. The user will request the server again when searching for the same category next time, so the response speed is too slow and the user operation is real-time. poor

Images