List display method and device, equipment and medium

By using paging query identifiers in the tree list for paging cutting and loading, the page lag problem when the tree list is expanded is solved, efficient paging data display is achieved, and the integrity of hierarchical relationships is maintained.

CN120256511APending Publication Date: 2025-07-04BEIJING FEISHU TECH CO LTD
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202510736865.2
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-06-04
Publication Date
2025-07-04

Smart Images

  • Figure CN120256511A_ABST
    Figure CN120256511A_ABST
Patent Text Reader

Abstract

The embodiment of the invention relates to a list display method and device, equipment and a medium, and the method comprises the steps: obtaining first paging data included in first data and a paging query identifier of the first paging data in response to a subordinate display operation of the first data in a tree list; displaying the first paging data; in response to a remaining data display operation on the first paging data, second paging data included in the first data is obtained based on the paging query identifier of the first paging data, and both the first paging data and the second paging data comprise a preset number of second data; and switching the first paging data to the second paging data for display. According to the method and the device, the preset number of paging cutting and paging loading are carried out on the data of each level in the tree list, so that the problem of page lagging during expansion caused by excessive subordinate data of each level node is effectively solved, the next page of data can be efficiently and accurately positioned by marking the query position through the paging query identifier, and the paging data display efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of information processing technologies, and in particular, to a method, apparatus, device, and medium for list display. Background Art

[0002] Multiple data can be managed through a list. When there is a hierarchical relationship between different data, a tree list can be used to represent it. When the tree list is displayed, all data is returned from the interface to the front end at once. When the amount of data is too large, it causes a high page delay and a dull user experience. Also, when expanding data with a hierarchical relationship, if there is a large amount of data at that level, the page is likely to freeze. In related technologies, to solve the above problems, the data in the tree list is usually flattened or downgraded to a tiled list and then paged for display. However, in this way, the tree structure fails, and the hierarchical relationship cannot be displayed, and the problem of page lag cannot be solved under the tree structure, which needs to be improved. Summary of the Invention

[0003] To solve the above technical problems, the present disclosure provides a method, apparatus, device, and medium for list display.

[0004] An embodiment of the present disclosure provides a method for list display, the method including: In response to a lower-level display operation on the first data in the tree list, obtaining first paged data included in the first data and a paging query identifier of the first paged data; Displaying the first paged data; In response to a remaining data display operation on the first paged data, obtaining second paged data included in the first data based on the paging query identifier of the first paged data, where both the first paged data and the second paged data include a preset number of second data; Switching the first paged data to the second paged data for display.

[0005] An embodiment of the present disclosure further provides a list display apparatus, the apparatus including: A first obtaining module, configured to obtain first paged data included in the first data and a paging query identifier of the first paged data in response to a lower-level display operation on the first data in the tree list; A first display module, configured to display the first paged data; A second obtaining module, configured to obtain second paged data included in the first data based on the paging query identifier of the first paged data in response to a remaining data display operation on the first paged data, where both the first paged data and the second paged data include a preset number of second data; A second display module, configured to switch the first paged data to the second paged data for display.

[0006] An embodiment of the present disclosure also provides an electronic device, which includes: a processor; a memory for storing executable instructions executable by the processor; the processor is configured to read the executable instructions from the memory and execute the executable instructions to implement the list display method provided by the embodiment of the present disclosure.

[0007] An embodiment of the present disclosure also provides a computer-readable storage medium, which stores a computer program for executing the list display method provided by the embodiment of the present disclosure.

[0008] The technical solution provided by the embodiment of the present disclosure has the following advantages compared with the prior art: In the list display solution provided by the embodiment of the present disclosure, in response to a lower-level display operation on the first data in the tree list, the first paging data included in the first data and the paging query identifier of the first paging data are obtained; the first paging data is displayed; in response to a remaining data display operation on the first paging data, the second paging data included in the first data is obtained based on the paging query identifier of the first paging data, where both the first paging data and the second paging data include a preset number of second data; the first paging data is switched to the second paging data for display. By adopting the above technical solution, when displaying the lower-level data of a data in the tree list, the first paging data included in the first data and the paging query identifier of the first paging data can be obtained, and the first paging data is displayed. Then, when the user triggers a remaining data display operation based on the first paging data, the second paging data can be obtained and displayed through the paging query identifier of the first paging data. By performing preset-number paging cutting and paging loading on the data at each level in the tree list, the problem of page jamming when expanding due to too much lower-level data of each level node is effectively solved, and the next page data can be efficiently and accurately located by marking the query position with the paging query identifier, improving the display efficiency of the paging data. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] In combination with the accompanying drawings and with reference to the following specific embodiments, the above and other features, advantages and aspects of the embodiments of the present disclosure will become more obvious. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic and the original and elements are not necessarily drawn to scale.

[0010] Figure 1 It is a flowchart of a list display method provided by an embodiment of the present disclosure; Figure 2 It is a schematic diagram of a tree list provided by an embodiment of the present disclosure; Figure 3 It is a flowchart of another list display method provided by an embodiment of the present disclosure; Figure 4 Another schematic diagram of a tree list provided by an embodiment of the present disclosure; Figure 5 A schematic diagram of a list display process provided by an embodiment of the present disclosure; Figure 6 A schematic structural diagram of a list display device provided by an embodiment of the present disclosure; Figure 7 A schematic structural diagram of an electronic device provided by an embodiment of the present disclosure. Detailed implementation manners

[0011] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0012] It should be understood that the various steps recited in the method embodiments of the present disclosure can be executed in a different order and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this regard.

[0013] The term "including" and its variations used herein are open-ended, that is, "including but not limited to". The term "based on" is "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0014] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence relationship of the functions executed by these devices, modules or units.

[0015] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive. Those skilled in the art should understand that, unless otherwise clearly specified in the context, it should be understood as "one or more".

[0016] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only for illustrative purposes and are not used to limit the scope of these messages or information.

[0017] To solve the problem of lag when displaying a tree list in related technologies, embodiments of the present disclosure provide a list display method, which will be introduced below in combination with specific embodiments.

[0018] Figure 1 As shown in the flowchart of a list display method provided by an embodiment of the present disclosure, this method can be executed by a list display device, where the device can be implemented by software and / or hardware and is generally integrated in an electronic device. Figure 1 As shown, the method includes: Step 101, in response to a lower-level display operation on the first data in the tree list, obtain the first paging data included in the first data and the paging query identifier of the first paging data.

[0019] Among them, the tree list can be a data structure that organizes data in a hierarchical structure, and can display data in a hierarchical manner, presenting the visualization of the tree structure. Each data in the tree list can be used as a node, and each node can have one or more child nodes. At the same time, each node (except the root node) has a parent node, and the nodes form a hierarchical structure through the parent-child relationship. Through the tree list, a large number of data can be managed. For example, the tree list can be applied to scenarios such as organizational positions, classification directories, and file systems. In the embodiments of the present disclosure, taking organizational positions as an example, the tree list can manage the position data of a company or organization, and there is a hierarchical relationship between different position data, such as departments, teams, and members. Exemplarily, Figure 2 As shown in the schematic diagram of a tree list provided by an embodiment of the present disclosure, Figure 2 as shown, the figure shows page 200, in area 201 of this page 200, a tree list is displayed. The root node of this tree list is the A4 department of Company A. The position data of the next level included in the A4 department is first displayed in the tree list. On the left side of this page 200, a tree list with the root node of Company A is also displayed.

[0020] The first data can be the data triggered by the current user for display in the tree list, that is, the data corresponding to the lower-level display operation. The first data can be any data at any level in the tree list except the data of the leaf nodes. For example, the first data can be the data of the root node or the data of the child nodes at a certain level. The lower-level display operation can be used to trigger the display of the data at the next level included in the first data. Specifically, it can be a gesture control operation such as clicking, long-pressing, or double-clicking on the first data, and the specific type is not limited. The first paged data can be the data included in the first page obtained by paging multiple second data at the next level included in the first data. The first paged data can include a preset number of second data. The preset number can be the fixed data number of a single page set when the lower-level data of the tree list is expanded. The preset number can be set according to the actual situation. For example, the preset number can be 20. The second data can be the data at the next level of the first data. For example, if the first data is a certain data at the first level, the second data is the data included in the first data at the second level.

[0021] The paging query identifier can be an identifier that marks the query position of the previous data query. The paging query identifier indicates the end of the previous page and has the data of the next page, so that the next data query can start obtaining data after the query position of the paging query identifier.

[0022] Specifically, when the user wants to view the details of the first data in the tree list, the lower-level display operation can be triggered on the first data. When the list display device receives the lower-level display operation, it can obtain the first paged data among the multiple second data included in the first data and the paging query identifier of the first paged data from the server.

[0023] In some embodiments, obtaining the first paged data included in the first data and the paging query identifier of the first paged data may include: sending a first data acquisition request of the first data to the server, so that the server sorts the multiple second data included in the first data according to the sorting field and then extracts the preset number of second data with the top sorting results as the first paged data, and constructs a paging query identifier corresponding to the first paged data; obtaining the first paged data and the paging query identifier of the first paged data sent by the server.

[0024] Among them, the first data acquisition request may be a request for acquiring data at the next level included in the first data, and the identifier of the first data is included in the first data acquisition request. The sorting field may be a field used to determine the data sorting order during the process of querying and displaying data in a tree list. Through this sorting field, the arrangement manner of the data can be controlled. In the embodiments of the present disclosure, the sorting field may include a timestamp or a data name. The data name may be the naming of the data, which is convenient for identification, processing, and analysis; the timestamp may be the insertion time or the effective time of the data.

[0025] By using the timestamp as the sorting field, real-time data updates can be better processed and consistency in a distributed environment can be supported. In applications with high real-time requirements, data may be continuously updated and inserted. When new data is inserted, its timestamp will be newer than the existing data. Sorting by the timestamp enables the paging query identifier to obtain new data in a timely manner, ensuring that the paging result can reflect the latest data state. Even in the case of continuously changing data, it can ensure that the user obtains the latest data arranged in chronological order, without data omission or duplication. Back-end applications usually run in a distributed cluster environment, and data may be distributed across multiple nodes. The timestamp helps to ensure data consistency and order among different nodes in such an environment. Each node can determine the order of data based on the timestamp when processing data, thereby achieving unified sorting and paging results across the entire cluster. Regardless of which node the query request is sent to, the paging query identifier based on the timestamp can ensure the return of consistent paging data, avoiding confusion in query results caused by inconsistent data order among nodes.

[0026] Specifically, when the list display device acquires the first paging data included in the first data and the paging query identifier of the first paging data, it may send the first data acquisition request to the server. After the server acquires multiple second data included in the first data, it may first sort the multiple second data according to the sorting field to obtain a sorting result. For example, when the sorting field is a timestamp, the multiple second data may be sorted in ascending order of the timestamp to obtain a sorting result. Then, a preset number of second data sorted in the front are extracted as the first paging data, and if it is determined that there are still second data after the first paging data, a paging query identifier corresponding to the first paging data is constructed, and the first paging data and its paging query identifier are returned. The list display device can acquire the first paging data and its paging query identifier.

[0027] In the above solution, the server sorts and pages the data at the next level of a piece of data, and returns the paged data and the corresponding paging query identifier. This not only enables quick determination of the current paged data, but also prepares for the query of the next page of data at the current level through the paging query identifier, ensuring the accuracy and efficiency of data query.

[0028] Step 102: Display the first paged data.

[0029] The first paged data can be the data included in the first page obtained by paging multiple second-level data included in the first data. The first paged data can include a preset number of second-level data. Specifically, after obtaining the first paged data, the list display device can display the first paged data in a tree list. Exemplarily, see Figure 2 , in the figure, the arrow indicates the lower-level display operation. When the first data is the root node A4 department, the first paged data is tiled and displayed in area 201; when the first data is the sub-node position level three - 18 at the next level of the A4 department, the first paged data is tiled and displayed in the lower area 202 of the first data in area 201.

[0030] Step 103: In response to the operation of displaying the remaining data of the first paged data, obtain the second paged data included in the first data based on the paging query identifier of the first paged data.

[0031] Among them, the operation of displaying the remaining data can be an operation of triggering the display of the remaining data after the data on the current page is displayed. For example, the operation of displaying the remaining data can be an operation of scrolling to the bottom or triggering the next page button. The second paged data can be the data included in the second page obtained by paging among the multiple second-level data included in the first data. Both the first paged data and the second paged data include a preset number of second-level data, or the number of second-level data included in the second paged data is less than the preset number. At this time, the second paged data can be the last page of the paging of multiple data included in the first data. Therefore, the data volume of the second paged data is less than or equal to the preset number. By loading data in pages, even if the data volume at the current level is large, it will not cause page freezing, and data can be displayed quickly.

[0032] Specifically, after the list display device displays the first paged data, when it receives the operation of displaying the remaining data of the first paged data by the user, it can query whether there is a paging query identifier for the first paged data. If there is, it sends the paging query identifier to the server. The server returns the second paged data included in the first data based on the paging query identifier, and the list display device obtains the second paged data.

[0033] In some embodiments, obtaining the second paging data included in the first data based on the paging query identifier of the first paging data may include: sending a second data acquisition request including the paging query identifier of the first paging data to the server, so that the server locates and queries the data according to the sorting field and the data identifier in the paging query identifier of the first paging data, and extracts a preset number of second data sorted after the query data as the second paging data; obtaining the second paging data sent by the server.

[0034] Wherein, the second data acquisition request may be a request for obtaining the next paging data included in the first data after the first paging data, and the second data acquisition request includes the paging query identifier of the first paging data. The paging query identifier may be composed of the data identifier of the last data of the previous data query and the sorting value of the last data in the sorting field. For example, when the sorting field is a timestamp, the paging query identifier may include the data identifier of the last data of the previous query, the key of the timestamp, and the value of the timestamp. The value of the timestamp is the specific timestamp of the last data, that is, the sorting value in the sorting field. The query data may be the basis for this query, and data is obtained starting from after the query data. The query data may be the last data of the previous query.

[0035] Specifically, when the list display device obtains the second paging data included in the first data, it may send a second data acquisition request carrying the paging query identifier of the first paging data to the server. The server may extract the sorting field and the data identifier from the paging query identifier, sort a plurality of second data included in the first data based on the sorting field to obtain a sorting result, and locate the data corresponding to the data identifier in the sorting result as the query data. The query data is the last data among the preset number of second data included in the first paging data. Extract a preset number of second data sorted after the query data as the second paging data, or when the number of second data sorted after the query data is less than the preset number, extract all the second data sorted after the query data as the second paging data, and return the second paging data. The list display device may receive the second paging data.

[0036] In the above solution, by marking the last position of the previous query with a paging identifier, an accurate order mark can be provided, so that the next data query can start obtaining data from after the query position of the paging query identifier, and the starting position of the data on the next page can be quickly and accurately located, greatly reducing unnecessary data processing, thereby realizing efficient paging data query.

[0037] Step 104: Switch the first paging data to the second paging data for display.

[0038] Specifically, after the list display device obtains the first paged data, it can close the first paged data and switch to display the second paged data. For example, when the tree list scrolls to the bottom of the first paged data for the next level of the first data, the second paged data can be switched for display. Refer to Figure 2 , assuming that the first data is the root node A4 department, the first paged data displayed in area 201 can be switched to the second paged data; assuming that the first data is the sub-node position level three - 18 at the next level of the A4 department, the first paged data displayed in area 202 is switched to the second paged data.

[0039] The list display solution provided by the embodiments of the present disclosure, in response to a lower-level display operation on the first data in the tree list, obtains the first paged data included in the first data and the paging query identifier of the first paged data; displays the first paged data; in response to a remaining data display operation on the first paged data, obtains the second paged data included in the first data based on the paging query identifier of the first paged data, where both the first paged data and the second paged data include a preset number of second data; switches the first paged data to the second paged data for display. By adopting the above technical solution, when displaying the lower-level data of a data in the tree list, the first paged data included in the first data and the paging query identifier of the first paged data can be obtained, and the first paged data is displayed. Then, when the user triggers a remaining data display operation based on the first paged data, the second paged data can be obtained and displayed through the paging query identifier of the first paged data. By performing preset-number paging cutting and paging loading on the data at each level of the tree list, and marking the query position through the paging query identifier, the next page data can be efficiently and accurately located, effectively solving the problem of page jamming when expanding due to too much lower-level data of each level node, and improving the efficiency of paged data display.

[0040] In some embodiments, after switching the first paged data to the second paged data for display, the list display method may further include: in response to a remaining data display operation on the second paged data, displaying a prompt message indicating that there is no remaining data when there is no corresponding paging query identifier for the second paged data.

[0041] Among them, the prompt message is used to remind the user that there is no remaining data after the current paged data. The specific text of the prompt message can be determined according to the actual situation and is not specifically limited. After the list display device displays the second paged data, if it receives a user operation to display the remaining data of the second paged data, it can first determine whether there is a corresponding paged query identifier for the second paged data, that is, whether a corresponding paged query identifier is obtained when obtaining the second paged data. If not, it means that the server determines that there is no data after the second paged data when returning the second paged data, and it is determined that there is no corresponding paged query identifier. At this time, there is no need to request the server, and it can be directly determined that there is no remaining data, and a prompt message indicating that there is no remaining data is displayed. By using the paged query identifier to indicate that there is still data after the previous query, it is possible to determine that there is no remaining data without requesting the server. Further, through the prompt message, the user can quickly learn that there is no data later, effectively improving the data query efficiency and enhancing the user experience effect.

[0042] In some embodiments, before obtaining the second paged data included in the first data based on the paged query identifier of the first paged data, the list display method may further include: in response to the existence of a corresponding paged query identifier for the first paged data, displaying a loading identifier, where the loading identifier is closed after the second paged data is obtained.

[0043] Among them, the loading identifier may be an identifier indicating that the remaining data is in the loading process. By displaying this loading identifier, the user is reminded that the data is being loaded. The loading identifier can be represented by text, patterns, progress bars, etc. In response to an operation to display the remaining data of the first paged data, the list display device may first query whether there is a paged query identifier for the first paged data. If so, it first displays the loading identifier and closes the loading identifier after the second paged data is obtained, and switches to display the second paged data; if there is no paged query identifier for the first paged data, it may display a prompt message indicating that there is no remaining data. Exemplarily, see Figure 2 , a loading identifier is displayed at the bottom of area 201, indicating that the second paged data of the root node A4 department is being loaded; a loading identifier is displayed in area 202, indicating that the first paged data of the sub-node position level three - 18 at the next level of the A4 department is being loaded. By displaying the loading identifier, a visual feedback of the loading is provided to the user, effectively enhancing the user experience effect when waiting for the loading.

[0044] Exemplarily, Figure 3 is a schematic flowchart of another list display method provided by an embodiment of the present disclosure. As Figure 3 shown, in a feasible implementation manner, the server constructing the paged query identifier corresponding to the first paged data may include the following steps: Step 301: When there is a second piece of data after determining the first paged data, use the last piece of data in the first paged data as the query data.

[0045] When constructing the paged query identifier corresponding to the first paged data, the server can first determine whether there is a second piece of data after the first paged data according to the above sorting result. When it is determined that there is a second piece of data after the first paged data, the last piece of data in the first paged data can be used as the query data, that is, as the starting position for the next query.

[0046] Step 302: Construct the paged query identifier corresponding to the first paged data according to the sorting value of the query data in the sorting field and the data identifier.

[0047] After the server determines the query data, it can obtain the data identifier of the query data and the sorting value of the query data in the sorting field. For example, if the sorting field is a timestamp, the sorting value of the query data in the sorting field is the timestamp corresponding to the query data; assuming the sorting field is a name, the sorting value of the query data in the sorting field is the specific name corresponding to the query data; combine the data identifier and sorting value of the query data to obtain the paged query identifier of the first paged data.

[0048] In the above solution, when there is subsequent data after a paged data, the server can construct the corresponding paged query identifier. When constructing, consider the sorting field and data identifier of the last piece of data in the previous query. Synchronize the sorting field of the data in the tree list on the server to the front end through the paged query identifier. When the front end requests the remaining data, send the paged query identifier to make the server sort the data using the same sorting field, avoiding the confusion of the query results caused by modifying the data sorting method between the previous query and the next query, and realizing unified sorting and paged results.

[0049] Next, a specific example is used to further illustrate the list display method of the embodiments of the present disclosure. Exemplarily, Figure 4 is a schematic diagram of another tree list provided by the embodiments of the present disclosure, as Figure 4As shown, the tree list includes three hierarchical structures. In the figure, it is assumed that the sorting field is the effective time of the timestamp, and it is assumed that paging starts from the second level of the tree list, and the amount of paged data (i.e., the above-mentioned preset quantity) is 2. When the user performs a lower-level display operation on the data with the data identifier 1 in the first level, the server can sort all the data included in this data in the second level according to the effective time, extract the first two data according to the sorting result and return them to the front end, and at the same time return the paging query identifier to the front end: {"en_uc": 3, "id": 5}, where en_uc represents the effective time of the last data in the previous data query, and id represents the data identifier; when the user pulls down to load the remaining data or scrolls to the bottom to load the remaining data at the front end, the paging query identifier is sent to the server, the server re-sorts all the data included in this data in the second level according to the effective time, and at the same time locates the query data corresponding to the paging query identifier as the data with the data identifier 5, and extracts the two data after the query data and returns them to the front end, and at the same time returns a new paging query identifier: {"en_uc": 7, "id": 6}.

[0050] Exemplarily, Figure 5 is a schematic diagram of a list display process provided by an embodiment of the present disclosure. As Figure 5 shown, the list display process shown in the figure may include: the user clicks on a piece of data in the tree list at the front end; the front end requests the first paged data of the next level of this data from the back end; the back end returns the first paged data to the front end, and when it is determined that there is data after the first paged data, returns the paging query identifier of the first paged data to the front end; the user scrolls the tree list to the bottom at the front end; when the front end determines that there is a paging query identifier for the first paged data, it can render the loading identifier at the bottom and at the same time request the back end; the front end requests the second paged data according to the paging query identifier of the first paged data; the back end returns the second paged data, and if there is data after the second paged data, returns the paging query identifier of the second paged data to the front end; the front end renders the second paged data. When the front end determines that there is no paging query identifier for the first paged data, it can remove the loading identifier at the bottom, directly render the complete list data, scrolling to the bottom no longer triggers the loading of the remaining data, and a prompt message indicating that there is no remaining data can be displayed.

[0051] This solution realizes the hierarchical paging and scrolling loading of the tree list through the cooperation of the front and back ends, solves the problems such as page jamming caused by a large amount of data on the first screen, and can implement the paging loading technology based on the hierarchical dimension. When multiple levels are expanded, even if the user quickly scrolls the list, each node can still request and load its own next page separately. Thanks to the ability to page by layer, even if there is a large amount of data in a certain layer of the list data of the tree structure, it will not affect the page loading performance, and solves the jamming when the user clicks to expand the data due to too many subordinate data of a certain hierarchical node. This solution does not require flattening the data to implement the paging ability. Flattening the data requires the back end to modify the database structure and also requires the front end to perform hard coding to achieve the visual hierarchical effect, with high costs and low efficiency. This solution can achieve paging loading and display while retaining the hierarchical relationship at low cost and high efficiency.

[0052] Figure 6 FIG. is a schematic structural diagram of a list display device provided by an embodiment of the present disclosure. The device can be implemented by software and / or hardware and is generally integrated in an electronic device. As Figure 6 shown, the device includes: A first acquisition module 601, configured to acquire first paging data included in the first data and a paging query identifier of the first paging data in response to a lower-level display operation on the first data in the tree list; A first display module 602, configured to display the first paging data; A second acquisition module 603, configured to acquire second paging data included in the first data based on the paging query identifier of the first paging data in response to a remaining data display operation on the first paging data, where both the first paging data and the second paging data include a preset number of second data; A second display module 604, configured to switch the first paging data to the second paging data for display.

[0053] Optionally, the first acquisition module 601 is configured to: Send a first data acquisition request of the first data to the server, so that the server sorts a plurality of second data included in the first data according to a sorting field and then extracts a preset number of second data sorted in the front according to the sorting result as the first paging data, and constructs a paging query identifier corresponding to the first paging data; Acquire the first paging data sent by the server and the paging query identifier of the first paging data.

[0054] Optionally, when the server determines that there is second data after determining the first paging data for the paging query identifier corresponding to the first paging data, the server uses the last data in the first paging data as the query data, and constructs based on the sorting value of the query data in the sorting field and the data identifier.

[0055] Optionally, the sorting field includes a timestamp or a data name.

[0056] Optionally, the second acquisition module 603 is configured to: Send a second data acquisition request including the paging query identifier of the first paging data to the server, so that the server locates and queries the data according to the sorting field and the data identifier in the paging query identifier of the first paging data, and extracts a preset number of second data sorted after the query data as the second paging data; Acquire the second paging data sent by the server.

[0057] Optionally, the device further includes a prompt module, configured to: after switching the first paging data to the second paging data for display, In response to an operation of displaying the remaining data of the second paging data, when there is no corresponding paging query identifier for the second paging data, display a prompt message indicating that there is no remaining data.

[0058] Optionally, the device further includes a loading identifier module, configured to: before acquiring the second paging data included in the first data based on the paging query identifier of the first paging data, In response to the existence of a corresponding paging query identifier for the first paging data, display a loading identifier, where the loading identifier is closed after the second paging data is acquired.

[0059] The list display device provided by the embodiments of the present disclosure can execute the list display method provided by any embodiment of the present disclosure, and has corresponding functional modules and beneficial effects for executing the method.

[0060] The embodiments of the present disclosure further provide a computer program product, including a computer program / instructions, and when the computer program / instructions are executed by a processor, the list display method provided by any embodiment of the present disclosure is implemented.

[0061] Figure 7 It is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure.

[0062] Specifically refer to the following Figure 7, which shows a schematic structural diagram of an electronic device 700 suitable for implementing the embodiments of the present disclosure. The electronic device 700 in the embodiments of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, personal digital assistants (PDAs), tablet computers (Personal Access Devices, PADs), portable media players (PMPs), in-vehicle terminals (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 7 The electronic device shown is merely an example and should not impose any limitations on the functions and usage scope of the embodiments of the present disclosure.

[0063] As Figure 7 shown, the electronic device 700 may include a processing device 701 (such as a central processing unit, a graphics processing unit, etc.), which may perform various appropriate actions and processes according to the programs stored in the read-only memory (ROM) 702 or the programs loaded from the storage device 708 into the random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the electronic device 700 are also stored. The processing device 701, the ROM 702, and the RAM 703 are connected to each other through a bus 704. The input / output (I / O) interface 705 is also connected to the bus 704.

[0064] Generally, the following devices may be connected to the I / O interface 705: an input device 706 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 707 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 708 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 709. The communication device 709 may allow the electronic device 700 to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 7 the electronic device 700 with various devices is shown, it should be understood that it is not required to implement or have all the shown devices. More or fewer devices may be implemented or had alternatively.

[0065] In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowchart can be implemented as computer software programs. For example, an embodiment of the present disclosure includes a computer program product that includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes program code for performing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network via a communication device 709, or installed from a storage device 708, or installed from a ROM 702. When the computer program is executed by a processing device 701, the above-mentioned functions defined in the list display method of the embodiment of the present disclosure are performed.

[0066] It should be noted that the above-mentioned computer-readable medium in the present disclosure can be a computer-readable signal medium, a computer-readable storage medium, or any combination of the two. A computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of a computer-readable storage medium can include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory (EPROM), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or in combination with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium can include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, and the computer-readable signal medium can send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wires, optical cables, radio frequency (RF), etc., or any suitable combination of the above.

[0067] In some embodiments, the client and the server can communicate using any currently known or future-developed network protocol such as the HyperText Transfer Protocol (HTTP), and can be interconnected with digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include local area networks (LANs), wide area networks (WANs), the Internet (e.g., the Internet), and end-to-end networks (e.g., ad hoc end-to-end networks), as well as any currently known or future-developed networks.

[0068] The above computer-readable medium can be included in the above electronic device; it can also exist separately without being assembled into the electronic device.

[0069] The above computer-readable medium carries one or more programs. When the above one or more programs are executed by the electronic device, the electronic device is caused to: in response to a lower-level display operation on the first data in the tree list, obtain the first paging data included in the first data and the paging query identifier of the first paging data; display the first paging data; in response to a remaining data display operation on the first paging data, obtain the second paging data included in the first data based on the paging query identifier of the first paging data, where both the first paging data and the second paging data include a preset number of second data; and switch the display of the first paging data to the second paging data.

[0070] Computer program code for performing the operations of the present disclosure can be written in one or more programming languages or combinations thereof. The above programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, and C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network or a wide area network, or can be connected to an external computer (e.g., by using an Internet service provider to connect through the Internet).

[0071] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a segment of a program, or a portion of code that contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions noted in the blocks may occur in a different order than noted in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, or they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented by a dedicated hardware-based system that performs the specified functions or operations, or can be implemented by a combination of dedicated hardware and computer instructions.

[0072] The units described in the embodiments of the present disclosure can be implemented in software or in hardware. In some cases, the name of the unit does not constitute a limitation on the unit itself.

[0073] The functions described above herein can be performed, at least in part, by one or more hardware logic components. By way of example, and without limitation, exemplary types of hardware logic components that may be used include: Field-Programmable Gate Array (FPGA), Application Specific Integrated Circuit (ASIC), Application Specific Standard Parts (ASSP), System on Chip (SOC), Complex Programmable Logic Device (CPLD), and the like.

[0074] In the context of the present disclosure, a machine-readable medium may be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer disk, a hard disk, a random access memory, a read-only memory, an erasable programmable read-only memory, a flash memory, an optical fiber, a portable compact disc read-only memory, an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0075] It can be understood that before using the technical solutions disclosed in the embodiments of the present disclosure, the type, scope of use, usage scenarios, etc. of the information involved in the present disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0076] The above description is only a preferred embodiment of the present disclosure and an explanation of the applied technical principles. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the technical features (but not limited to) having similar functions disclosed in the present disclosure.

[0077] In addition, although the operations are depicted in a particular order, this should not be construed as requiring that the operations be performed in the particular order shown or in sequential order. In certain environments, multitasking and parallel processing may be advantageous. Similarly, although several specific implementation details are included in the foregoing discussion, these should not be construed as limiting the scope of the present disclosure. Certain features described in the context of separate embodiments may also be implemented combinatorially in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately or in any suitable sub-combination in multiple embodiments.

[0078] Although the subject matter has been described in language specific to structural features and / or methodological acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A list display method, characterized in that, Including: In response to a lower-level display operation on the first data in the tree list, obtain the first paged data included in the first data and the paging query identifier of the first paged data; Display the first paged data; In response to a remaining data display operation on the first paged data, obtain the second paged data included in the first data based on the paging query identifier of the first paged data, wherein both the first paged data and the second paged data include a preset number of second data; Switch the first paged data to the second paged data for display.

2. The method according to claim 1, characterized in that, Obtaining the first paged data included in the first data and the paging query identifier of the first paged data includes: Send a first data acquisition request of the first data to the server, so that the server sorts the multiple second data included in the first data according to the sorting field and then extracts the preset number of second data with the highest sorting results as the first paged data, and constructs the paging query identifier corresponding to the first paged data; Obtain the first paged data and the paging query identifier of the first paged data sent by the server.

3. The method according to claim 2, wherein For the paging query identifier corresponding to the first paged data, when the server determines that there is second data after the first paged data, use the last data in the first paged data as the query data, and construct according to the sorting value of the query data in the sorting field and the data identifier.

4. The method according to claim 2 or 3, characterized in that, The sorting field includes a timestamp or a data name.

5. The method according to claim 1, wherein Obtaining the second paged data included in the first data based on the paging query identifier of the first paged data includes: Send a second data acquisition request including the paging query identifier of the first paged data to the server, so that the server locates and queries the data according to the sorting field and the data identifier in the paging query identifier of the first paged data, and extracts the preset number of second data sorted after the query data as the second paged data; Obtain the second paged data sent by the server.

6. The method according to claim 1, wherein After switching the first paged data to the second paged data for display, the method further includes: In response to a remaining data display operation on the second paged data, display a prompt message indicating that there is no remaining data when there is no corresponding paging query identifier for the second paged data.

7. The method according to claim 1, characterized in that Before obtaining the second paged data included in the first data based on the paging query identifier of the first paged data, the method further includes: In response to the first paged data having a corresponding paging query identifier, display a loading identifier, where the loading identifier is closed after obtaining the second paged data.

8. A list display device, characterized in that, Including: A first acquisition module, configured to obtain the first paged data included in the first data and the paging query identifier of the first paged data in response to a lower-level display operation on the first data in the tree list; A first display module, configured to display the first paged data; A second acquisition module, configured to, in response to an operation of displaying remaining data of the first paged data, acquire second paged data included in the first data based on a paging query identifier of the first paged data, where both the first paged data and the second paged data include a preset number of second data; A second display module, configured to switch the first paged data to the second paged data for display.

9. An electronic device, characterized in that, The electronic device includes: A processor; A memory for storing executable instructions executable by the processor; The processor is configured to read the executable instructions from the memory and execute the executable instructions to implement the list display method according to any one of claims 1-7 above.

10. A computer-readable storage medium, characterized in that, The storage medium stores a computer program, and the computer program is used to execute the list display method according to any one of claims 1-7 above.

Citation Information

Patent Citations

  • Paging display method and device

    CN108848244A

  • Paging display method and device for tree-shaped folding table, equipment and storage medium

    CN114154031A

  • Browse data loading method, product, computer equipment and storage medium

    CN119271916A

  • Efficient querying and paging in databases

    US20060287978A1