Data table processing method and device, equipment and storage medium

Abstract

Embodiments of the present application disclose a data table processing method, device and equipment and a storage medium, wherein the method comprises: obtaining an update operation task about a target data table; if the update operation task is associated with a visible area and a non-visible area of the target data table, splitting the update operation task to obtain a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visible area; updating data content in the visible area according to the first update operation subtask; if the data content in the visible area has been updated, obtaining a first task processing state of a terminal when the data content in the visible area has been updated, and updating data content in the non-visible area according to the second update operation subtask and the first task processing state. The present application can improve the update efficiency of the data table.

Description

Technical Field

[0001] This application relates to the field of Internet technology, and in particular to a data table processing method, apparatus, device and storage medium. Background Technology

[0002] A data table is a type of spreadsheet database. It uses fields to describe the main information or value range of a row of data records, or fields to describe the main information or value range of a column of data records, providing a well-organized data structure. Therefore, data tables are widely used in fields such as finance, education, and healthcare. For example, businesses can use data tables to collect revenue information over a period of time, or students can use data tables to collect weekly class schedules. Currently, however, updating data in data tables can easily lead to problems such as slowdowns, resulting in relatively low update efficiency. Summary of the Invention

[0003] This application provides a data table processing method, apparatus, device, and storage medium to reduce the probability of data table lag during the update process and improve the update efficiency of the data table.

[0004] One embodiment of this application provides a data table processing method, including: Retrieve update operation tasks for the target data table; If the update operation task is associated with both the visible and invisible areas of the target data table, then the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the invisible area; the visible area is the area in the target data table where the data content is visible, and the invisible area is the area in the target data table where the data content is invisible. Update the data content within the visible area according to the first update operation subtask; If the data content within the visible area has been updated, the first task processing status of the terminal when the data content within the visible area has been updated is obtained. Based on the second update operation subtask and the first task processing status, the data content within the non-visual area is updated. The terminal is a terminal used to update the target data table.

[0005] One embodiment of this application provides a data table processing apparatus, including: The acquisition module is used to acquire update operation tasks related to the target data table; The splitting module is used to split the update operation task into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visible area if the update operation task is associated with both the visible and non-visible areas of the target data table; the visible area is the area in the target data table where the data content is visible, and the non-visible area is the area in the target data table where the data content is invisible. The first update module is used to update the data content within the visible area according to the first update operation subtask; The second update module is used to obtain the first task processing status of the terminal when the data content in the visible area has been updated, if the data content in the visible area has been updated, and update the data content in the non-visible area according to the second update operation subtask and the first task processing status; the terminal is a terminal used to update the target data table.

[0006] One embodiment of this application provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps of the method described.

[0007] One embodiment of this application provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of the method described.

[0008] One aspect of this application provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the method described.

[0009] In this application, when an update operation task associated with both the visible and non-visual areas of the target data table is obtained, the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. In other words, independent update operation subtasks are maintained for the visible and non-visual areas. During the update of data content in either the visible or non-visual area, it is not necessary to scan the entire data content of the data table to determine whether the data content in the visible or non-visual area has been updated, thereby reducing the computational resource consumption during the data table update process and improving the efficiency of the data table update. Furthermore, the data content in the visible area is updated synchronously according to the first update operation subtask, and the data content in the non-visual area is updated asynchronously according to the second update operation subtask. Here, synchronous update refers to immediately updating the data content in the visible area according to the first update operation subtask, and asynchronous update refers to updating the data content in the non-visual area based on the first task processing state when the terminal has completed updating the data content in the visible area, and the second update operation subtask updating the data content in the non-visual area. That is, asynchronous update is a non-immediate update method. In other words, by synchronously updating the data content within the visible area and asynchronously updating the data content within the non-visible area, the amount of data updated in a single update process can be reduced, thereby decreasing the probability of data table lag and improving the smoothness and efficiency of data table updates. Attached Figure Description

[0010] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0011] Figure 1 This is a schematic diagram of the architecture of a data table processing system provided in this application; Figure 2 This is a schematic diagram of the visible and non-visual areas of a data table provided in this application; Figure 3 This application provides an interactive scenario diagram for updating a target data table; Figure 4 This is a flowchart illustrating a data table processing method provided in this application; Figure 5 This is a flowchart illustrating a data table processing method provided in this application; Figure 6 This is a flowchart illustrating a data table processing method provided in this application; Figure 7 This is a schematic diagram illustrating a scenario for updating data content in a non-visual area, as provided in this application. Figure 8 This is a flowchart illustrating the process of managing pending tasks in an asynchronous task management storage area, as provided in this application. Figure 9 This is a schematic diagram illustrating a scenario where data content in the visible and non-visual areas of a target data table is updated, as provided in this application. Figure 10 This is a schematic diagram of the structure of a data table processing device provided in an embodiment of this application; Figure 11 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0012] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of this application.

[0013] To facilitate a clearer understanding of this application, we will first introduce the data table processing system that implements the data table processing method of this application, such as... Figure 1 As shown, this data processing system includes server 10 and a terminal cluster. The terminal cluster can include one or more terminals; the number of terminals will not be limited here. Figure 1 As shown, the terminal cluster may specifically include terminal 1, terminal 2, ..., terminal n; it can be understood that terminal 1, terminal 2, terminal 3, ..., terminal n can all connect to server 10 via the network so that each terminal can interact with server 10 via the network connection.

[0014] The terminal is equipped with a data table platform that provides data table services to users. This platform can include mini-programs, web pages, or applications associated with the data tables. Users can create, view, and update data tables through the platform installed on the terminal. The data table here is a database-type spreadsheet, also known as a smart sheet. It uses fields to describe the subject information or value range of a row of data records, or fields to describe the subject information or value range of a column of data records, providing a well-organized data structure. The data table includes data content, which includes at least one of data records and fields. Fields describe the subject information or value range of the data records, etc. The data content may also include data table metadata (such as table ID, table title, etc.) and display view data (such as display view name, display view ID, display view type, and display view attributes, etc.). In this application, a row of data in the data table can be collectively referred to as a single data entry.

[0015] In one embodiment, the fields in the data table can be arranged in rows, meaning all fields in the data table are arranged in the same row. In this case, a field in the data table is used to describe the subject information or value range of the data record in the column containing that field. For example, assuming the data table is Data Table 1, which collects student information, the arrangement of the fields and data records in Data Table 1 is shown in Table 1 below: Table 1

[0016] As can be seen, the fields in Table 1 include name, gender, etc. All fields are arranged in the first row of Table 1. The name field is located in the first row and first column of Table 1. The name field describes the student's name in the data record located in the first column of Table 1. For example, "Xiao Wang" in the first column of the second row and "Xiao Li" in the second column of the second row are both student names. The gender field is located in the first row and second column of Table 1. The gender field describes the student's gender in the data record located in the second column of Table 1. For example, "Male" in the second row and second column is the gender of "Xiao Wang," and "Female" in the second row and third column is the gender of "Xiao Li."

[0017] In one embodiment, the fields in the data table can be arranged in columns, meaning all fields in the data table are arranged in the same column. In this case, a field in the data table is used to describe the subject information or value range of the data record in the row containing that field. For example, assuming the data table is Data Table 2 which collects student information, the arrangement of the fields and data records in Data Table 2 is shown in Table 2 below: Table 2

[0018] As can be seen, the fields in Table 2 include name, gender, etc. All fields in Table 2 are arranged in the first column. The name field is located in the first row and first column of Table 2. The name field describes the names of students in the data records in the first row of Table 2, such as "Xiao Wang" in the first row and second column, and "Xiao Li" in the first row and second column. The gender field is located in the second row and first column of Table 2. The gender field describes the gender of students in the data records in the second row of Table 2, such as "Male" in the second row and second column, representing the gender of "Xiao Wang," and "Female" in the second row and third column, representing the gender of "Xiao Li." It is understood that the data records and fields in the data table can be arranged in other ways, and this application does not limit this arrangement.

[0019] It is understood that the data table in this application can refer to a collaborative data table or a non-collaborative data table. A collaborative data table is one that supports at least two users simultaneously performing update operations online, while a non-collaborative data table is one that supports one user simultaneously performing update operations online. The update operation here can refer to performing operations such as deletion or modification on the data content in the data table, or it can refer to updating the row height, column width, line wrapping style, etc., of the data content.

[0020] Understandably, a data table contains multiple data entries. When displaying a data table, the terminal typically only shows a portion of the data on the data table platform's interface. Users can display the remaining data by performing touch operations on the data table. In this application, the data content displayed on the data table platform's interface is referred to as the visible data content, and the area containing the visible data content is called the visible area; that is, the visible data content refers to the data content that is currently visible to the user. The data content not displayed on the data table platform's interface is referred to as the invisible data content, and the area containing the invisible data content is called the non-visible area; that is, the non-visible data content refers to the data content that is currently not visible to the user. The size of the visible and non-visible areas can be determined based on the size of the display interface used to display the data table and the scaling factor of the data table; the visible and non-visible areas of the data table dynamically change with the user's touch operations on the data table.

[0021] For example, such as Figure 2As shown, at time T, data table 10a includes a visible area 11a, a non-visual area 12a, and a non-visual area 13a. The visible area 11a is located before the non-visual areas 12a and 13a, meaning the vertical arrangement markers of the data content within the visible area 11a are all smaller than the vertical arrangement markers (i.e., row markers) of the data content within the non-visual area 12a, while the vertical arrangement markers of the data content within the non-visual area 13a are larger than the vertical arrangement markers of the data content within the non-visual area 13a. When the terminal detects a touch operation on data table 10a, specifically a downward (i.e., along the increasing direction of the vertical arrangement markers) swipe, the visible and non-visual areas of data table 10a are adjusted based on this touch operation, resulting in the visible and non-visual areas of data table 10a at time T+1. Figure 2 In the table, at time T+1, data table 10a includes a non-visible area 14b, a visible area 15b, and a non-visible area 16b. Visible area 15b lies between non-visible areas 14b and 16b, meaning the vertical arrangement indicator of the data content in visible area 15b is greater than that in non-visible area 14b, and less than that in non-visible area 16b. Specifically, since the update methods for the data content in non-visible areas 12a and 13a are consistent, they are typically considered as a single non-visible area.

[0022] Understandably, server 10 can refer to a device used to provide backend services for a data table platform. For example, server 10 can be used to store the source data and data content of the data table. The source data of the data table includes information such as the layout of the data content, arrangement indicators, font, color, and font size.

[0023] The server can be a single physical server, a server cluster or distributed system consisting of at least two physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, Content Delivery Network (CDN), and big data and artificial intelligence platforms. The terminal can specifically refer to smartphones, tablets, laptops, desktop computers, smart speakers, speakers with screens, smartwatches, etc., but is not limited to these. The terminals and servers can be directly or indirectly connected via wired or wireless communication. The number of terminals and servers can be one or at least two; this application does not impose any restrictions.

[0024] Understandably, based on Figure 1 The data table processing system shown can update data tables. The update process includes synchronously updating the data content within the visible area of ​​the data table and asynchronously updating the data content within the non-visible area. This reduces the amount of data updated in a single operation, lowers the probability of data table lag, and improves update efficiency. Specifically, such as... Figure 3 As shown, Figure 3 Server 30a in the text can refer to Figure 1 Server 10 in the middle, Figure 3 Terminal 31a in the text can refer to Figure 1 For any terminal in the process, updating the data table may include the following steps S1 to S6: S1. Terminal 31a generates a request to retrieve the target data table and sends it to server 30a. This request carries the data table's identifier and its display view type identifier, etc. The display view type refers to parameters describing the arrangement of data records and fields in the data table. Display view types include dashboard view type, table view type, brochure view type, and Gantt view type, etc. Upon receiving the request, server 30a can determine the requested data table (the target data table) based on the data table identifier and retrieve the source data of the target data table from its local storage, returning the source data to terminal 31a.

[0025] S2. Terminal 31a displays the target data table. After receiving the source data of the target data table, the terminal can display the target data table on the display interface of the data table platform based on the source data. The area containing the data content of the target data table displayed on the display interface is called the visible area, and the area containing the data content of the target data table not displayed on the display interface is called the non-visible area. For example... Figure 3 The target data table includes a visible area 32b and a non-visible area 33b. The vertical arrangement markers of the data content in the visible area 32b are all smaller than the vertical arrangement markers of the data content in the non-visible area 33b.

[0026] S3, Terminal 31a obtains update operation tasks for the target data table.

[0027] Understandably, this update operation task can be associated with the rendering layer of the target data table. The rendering layer refers to the module used to convert the data from the data layer of the target data table into data that needs to be rendered, and to render the final presentation (table). The data layer refers to the module used to manage and maintain the data (such as data records and fields) in all cells of the target data table. The task type of the update operation task can include global task type and local task type. A global task type refers to the task type corresponding to an update operation that operates on both the visible and invisible areas of the target data table; that is, a global task type update operation task is associated with both the visible and invisible areas of the target data table. For example, a global task type update operation task may include, but is not limited to: adjusting the column width of a column in the target data table, performing automatic line wrapping on data records under a certain field in the target data table (i.e., performing automatic line wrapping on a column in the target data table), etc. A local task type refers to the task type corresponding to an update operation task that operates on either the visible or invisible areas of the target data table; that is, a local task type update operation task is associated with either the visible or invisible areas of the target data table. For example, local update operations may include, but are not limited to: performing automatic line wrapping on the data content of a specific row in a target data table (i.e., all data records in that row); performing automatic line wrapping on a portion of the data records in a specific row in a target data table; adjusting the row height of a specific row in a target data table; and performing an overwrite / hide operation on the data content of a specific row in a target data table. An overwrite operation means that when the data record in cell A exceeds the current cell, based on whether there are data records in adjacent cells in the row containing cell A, and the alignment direction of the row containing cell A, the data record in cell A is extended into adjacent cells, thus covering the adjacent cells. A hide operation means that when the data record in cell B exceeds the current cell, a portion of the data record in cell B is hidden.

[0028] Understandably, if the target data table is a non-collaborative data table, the update operation task can be generated based on the user performing an update operation on terminal 31a; if the target data table is a collaborative data table, the update operation task can be generated based on the user performing an update operation on terminal 31a, or the update operation task can be sent to terminal 31a by a collaborative terminal, which refers to a terminal other than terminal 31a among the terminals that have editing permissions for the target data table.

[0029] S4. If the update operation task is associated with both the visible area and the non-visual area, the terminal 31a splits the update operation task to obtain a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. The first update operation subtask is used to indicate the update of the data content in the visible area, and the second update operation subtask is used to indicate the update of the data content in the non-visual area.

[0030] S5. Terminal 31a updates the data content within the visible area according to the first update operation subtask. When the data content within the visible area has been updated, the terminal 31a obtains the first task processing status when the data content within the visible area has been updated. The first task processing status is used to reflect whether there are any remaining tasks to be executed when the data content within the visible area has been updated. The remaining tasks to be executed here are the tasks in the terminal other than the second update operation subtask.

[0031] S6. Terminal 31a updates the data content in the non-visual area according to the first task processing status and the second update operation sub-task. For example, when the first task processing status indicates that all remaining tasks to be executed on the terminal have been completed, i.e., terminal 31a is in an idle state, the data content in the non-visual area can be updated immediately according to the second update operation sub-task. When the first task processing status indicates that there are remaining tasks to be executed on the terminal, i.e., terminal 31a is in a non-idle state, the remaining tasks to be executed can be executed according to their task types, and the data content in the non-visual area can be updated immediately according to the second update operation sub-task.

[0032] In summary, by synchronously updating data within the visible area and asynchronously updating data within the non-visible area, the amount of data updated in a single update is reduced, which lowers the probability of data table lag and improves the smoothness and efficiency of data table updates. Furthermore, prioritizing updates to data within the visible area allows for faster display of the updated data to the user, improving the efficiency of human-computer interaction.

[0033] Further, please see Figure 4 This is a flowchart illustrating a data table processing method provided in an embodiment of this application. Figure 4 As shown, this method can be derived from... Figure 1 It can be executed by the terminal in the middle, or by Figure 1 The server in the middle can be used to execute it, or it can be executed by... Figure 1 The method is executed jointly by a terminal and a server. The device used to execute this method in this application can be collectively referred to as a computer device. The data table processing method may include the following steps S101~S104: S101. Obtain update operation tasks for the target data table.

[0034] In this application, if an update operation is detected for a target data table, an update operation task for the target data table is generated; or, the computer device can obtain the update operation task for the target data table from the cooperating terminal, where the task type of the update operation task is the aforementioned global task type or local task type.

[0035] S102. If the update operation task is associated with both the visible and invisible areas of the target data table, then the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the invisible area; the visible area is the area where the data content in the target data table is visible, and the invisible area is the area where the data content in the target data table is invisible.

[0036] In this application, if the update operation task is only associated with the visible area of ​​the target data table, it indicates that the task type of the update operation task is a local task type, and the computer device can update the data content of the visible area according to the update operation task. If the update operation task is only associated with the non-visible area of ​​the target data table, it indicates that the task type of the update operation task is a local task type, and the computer device can wait for the update operation task associated with the visible area to be executed, or, when the terminal is in an idle state, update the data content of the non-visible area according to the update operation task. If the update operation task is associated with both the visible and non-visible areas of the target data table, it indicates that the task type of the update operation task is a global task type, and the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visible area. Here, the first update operation subtask is used to indicate the update of the data content within the visible area, and the second update operation subtask is used to indicate the update of the data content within the non-visible area. The first update operation subtask and the second update operation subtask are independent of each other. By splitting the update operation task into independent first update operation subtasks and second update operation subtasks, the computer device does not need to scan the entire data content of the data table (i.e., the target data table) to determine whether the data content in the visible or non-visual areas has been updated during the update process. This reduces the consumption of computing resources during the data table update process and improves the efficiency of data table updates.

[0037] For example, the target data table is a student grade table. The fields in this table include student name, age, grades, etc., and these fields are arranged in rows, meaning that data records under the same field belong to the same column. If the update operation task is to adjust the column width of the column containing the grade field, that is, the update operation task instructs to adjust the column width of the cells corresponding to the grade field in each row of the target data table, meaning this update operation task is associated with both the visible and invisible areas, the computer device can split the update operation task into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. The first update operation subtask instructs to adjust the column width of the cells corresponding to the grade field in each row within the visible area, and the second update operation subtask instructs to adjust the column width of the cells corresponding to the grade field in each row within the non-visual area. For example, if the grade field of the student grade table is located in the first row and third column of the student grade table, and assuming that the visible area includes the data content of the first to fiftieth rows of the student grade table, and the non-visible area includes the data content of the fifty-first to one hundred and twentyth rows of the student grade table, then the first update operation subtask is used to instruct the adjustment of the column width of the cell in the third column of each row in the first to fiftieth rows of the student grade table, and the second update operation subtask is used to instruct the adjustment of the column width of the cell in the third column of each row in the fifty-first to one hundred and twentyth rows of the student grade table.

[0038] S103. Update the data content within the visible area according to the first update operation subtask.

[0039] In this application, the computer device can immediately update the data content in the visible area according to the first update operation subtask, which is conducive to quickly displaying the updated data content in the visible area to the user and improving the efficiency of human-computer interaction.

[0040] Understandably, the computer device can update the data content within the visible area in either of the following two ways: Method 1: The computer device can obtain the ascending direction of the arrangement indicators of the data content within the visible area in the target direction, and update the data content within the visible area sequentially according to the first update operation subtask in the ascending direction of the arrangement indicators of the data content within the visible area in the target direction. Here, the target direction can refer to the vertical axis of the target data table, and the arrangement indicators in the target direction can refer to the row indicators. Method 2: The computer device can first update the data content located at the center of the visible area according to the first update operation subtask, and then alternately update the remaining data content within the visible area according to the first update operation subtask. The remaining data content consists of all data content within the visible area except for the data content located at the center. The implementation method for alternately updating the remaining data content within the visible area can be any of the following four methods: Method 1: First, update the data content of row 'a' within the visible area whose row identifier is greater than the center position' according to the first update operation subtask. Then, update the data content of row 'b' within the visible area whose row identifier is less than the center position' according to the first update operation subtask, and so on, until all data within the visible area is updated. 'a' and 'b' are positive integers greater than or equal to 1, and both 'a' and 'b' are less than N, where N is the number of data content rows in the visible area whose row identifier is less than the center position'. 'a' and 'b' can be the same or different. Method 2: First, update the data content of row 'b' within the visible area whose row identifier is less than the center position' according to the first update operation subtask. Then, update the data content of row 'a' within the visible area whose row identifier is greater than the center position' according to the first update operation subtask, and so on, until all data within the visible area is updated. Method 3: First, update all data within the visible area whose row identifier is greater than the center position's row identifier according to the first update operation subtask. If all data within the visible area whose row identifier is greater than the center position's row identifier has been updated, then update all data within the visible area whose row identifier is greater than the center position's row identifier according to the first update operation subtask. Method 4: First, update all data within the visible area whose row identifier is greater than the center position's row identifier according to the first update operation subtask. If all data within the visible area whose row identifier is less than the center position's row identifier has been updated, then update all data within the visible area whose row identifier is greater than the center position's row identifier according to the first update operation subtask.

[0041] S104. If the data content in the visible area has been updated, obtain the first task processing status when the data content in the visible area of ​​the terminal has been updated, and update the data content in the non-visible area according to the second update operation subtask and the first task processing status.

[0042] In this application, if the data content within the visible area has been updated, the computer device can obtain a first task processing status when the data content within the visible area has been updated. This first task processing status reflects whether there are any remaining tasks yet to be executed when the data content within the visible area has been updated. Further, based on the second update operation subtask and the first task processing status, the data content within the non-visual area is updated. In other words, the data content within the non-visual area will only be updated after the data content within the visible area has been updated; that is, the data content within the non-visual area is updated asynchronously. By synchronously updating the data content within the visible area and asynchronously updating the data content within the non-visual area, the amount of data updated in a single update is reduced, which can decrease the probability of data table lag and improve the smoothness and efficiency of data table updates.

[0043] For example, such as Figure 5As shown, the update process of the target data table in this application includes the following steps S50a~S53a: S50a, Large task fragmentation management; here, large task fragmentation management refers to splitting the operation scope of the update operation task when the update operation task of the target data table is associated with both the visible area and the non-visual area, resulting in a first update operation sub-task associated with the visible area and a second update operation sub-task associated with the non-visual area. S51a, Calculation update; here, calculation update can refer to immediately updating the data content in the visible area according to the first update operation sub-task, obtaining the updated data content in the visible area, and then rendering the updated data content in the visible area according to the row height, column width, data record color, font, wireframe, etc. of the row where the updated data content is located, obtaining the rendered data content in the visible area, and replacing the data content in the visible area before the update with the rendered data content in the visible area. S52a, Management of areas to be updated; that is, treating the non-visual area as the area to be updated, and asynchronously fetching the second update operation sub-task when the data content in the visible area has been updated. S53a. Calculating and updating data content in non-visual areas. This can be understood as follows: The calculation and updating of data content in non-visual areas includes: obtaining the first task processing state when the terminal has completed updating the data content in the visible area; updating the data content in the non-visual area (i.e., the area to be updated) according to the first task processing state and the second update operation sub-task to obtain the updated data content in the non-visual area; when the non-visual area meets the rendering conditions, rendering the updated data content in the non-visual area according to the row height, column width, data record color, font, wireframe, etc., of the row containing the updated data content in the non-visual area to obtain the rendered data content in the non-visual area; and replacing the unupdated data content in the non-visual area with the rendered data content in the non-visual area. Meeting the rendering conditions in the non-visual area can mean that some or all of the data content in the non-visual area has been adjusted and is now visible; or, meeting the rendering conditions in the non-visual area can mean that the terminal is in an idle state when the data content update in the non-visual area is completed.

[0044] Understandably, the above-described updating of data content in the non-visual area based on the second update operation subtask and the first task processing status includes: if the first task processing status indicates that all remaining tasks to be executed in the terminal have been completed, it indicates that the terminal is currently in an idle state. Therefore, the computer device can immediately update the data content in the non-visual area according to the second update operation subtask. Here, the remaining tasks to be executed refer to the tasks to be executed in the terminal other than the second update operation subtask. Specifically, the remaining tasks to be executed can refer to tasks associated with the target data table, or the remaining tasks to be executed can refer to tasks not associated with the target data table, such as opening a new data table, etc. If the first task processing status indicates that there are remaining tasks to be executed in the terminal that have not been completed, it indicates that the terminal is not currently in an idle state. Then, the task type of the remaining tasks to be executed is obtained, the remaining tasks to be executed are executed according to the task type of the remaining tasks to be executed, and the data content in the non-visual area is updated according to the second update operation subtask. By updating the data content in the non-visible area according to the processing status of the first task and the second update operation sub-task, it is possible to avoid executing too many tasks simultaneously during the update process in the non-visible area, which could cause the target data table to lag, thus improving the smoothness and efficiency of the target data table update.

[0045] Understandably, the above-mentioned execution of the remaining pending task according to its task type, and the updating of the data content in the non-visual area according to the second update operation subtask, includes: if the task type of the remaining pending task is a task type unrelated to the non-visual area, it indicates that the remaining pending task and the second update operation subtask are independent of each other. For example, the remaining pending task could be a pending task related to the visible area, or a pending task unrelated to the target data table (such as opening a new data table), etc. In this case, the computer device can determine the execution priorities corresponding to the remaining pending task and the second update operation subtask respectively. If the execution priority of the remaining pending task is higher than the execution priority of the second update operation subtask, the remaining pending task can be executed first, and then the data content in the non-visual area can be updated according to the second update operation subtask. If the execution priority of the remaining pending task is lower than the execution priority of the second update operation subtask, the data content in the non-visual area can be updated first according to the second update operation subtask, and then the remaining pending task can be executed. By executing the remaining tasks and the second update operation subtask sequentially according to their respective execution priorities, and updating the data content in the non-visible area according to the second update operation subtask, the remaining tasks and the second update operation subtask are executed asynchronously, reducing the probability of the target data table experiencing lag and improving the smoothness and efficiency of the target data table's updates.

[0046] Furthermore, if the task type of the remaining pending task is associated with the non-visible area, it indicates that the remaining pending task and the second update operation subtask are related. For example, the remaining pending task and the second update operation subtask may be generated by multiple consecutive operations triggered by the user on the target data table, or they may be generated by multiple users editing the target data table. In this case, the computer device can merge the remaining pending task with the second update operation subtask to obtain a merged pending task, and update the data content in the non-visible area according to the merged pending task. By merging the second update operation subtask and the remaining pending task, it is beneficial to reduce the computing resource consumption of the computer device. When multiple users simultaneously perform large-scale editing operations on the target data table, or when the same user triggers multiple consecutive operations on the target data table, it reduces the probability of the target data table experiencing lag, and improves the smoothness and efficiency of the target data table update.

[0047] Understandably, determining the execution priorities of the remaining tasks to be executed and the second update operation subtask includes: if the task type of the remaining task to be executed is a first task type or a second task type, that is, the task type of the remaining task to be executed is an interactive type unrelated to the non-visual area, such as opening a new data table or a new webpage, modifying data records within the visible area; or, the task type of the remaining task to be executed is a non-interactive task type related to the visible area, such as storing or reporting data content within the visible area, then the computer device can determine the first execution priority as the execution priority of the remaining task to be executed and the second execution priority as the execution priority of the second update operation subtask. In other words, the execution priority of interactive task types and the execution priority of tasks associated with the visible area are both higher than the execution priority of tasks associated with non-visual areas. This is beneficial for quickly presenting the updated data content within the visible area to the user and improving human-computer interaction efficiency.

[0048] Furthermore, if the remaining task to be executed is a third task type, then the generation times corresponding to the remaining task to be executed and the second update operation subtask are obtained. The execution priority of the remaining task to be executed is determined based on its generation time, and the execution priority of the second update operation subtask is determined based on its generation time. For example, if the generation time of the remaining task to be executed is earlier than the generation time of the second update subtask, then the first execution priority can be determined as the execution priority of the remaining task to be executed, and the second execution priority can be determined as the execution priority of the second update operation subtask. That is, the execution priority of the remaining task to be executed is higher than the execution priority of the second update operation subtask, so the remaining task to be executed is executed first, and then the second update operation subtask is executed. If the generation time of the remaining task to be executed is later than the generation time of the second update subtask, then the second execution priority can be determined as the execution priority of the remaining task to be executed, and the first execution priority can be determined as the execution priority of the second update operation subtask. That is, the execution priority of the remaining task to be executed is lower than the execution priority of the second update operation subtask, so the second update operation subtask is executed first, and then the remaining task to be executed is executed. By generating execution priorities for the remaining tasks to be executed and the second update operation subtask based on their respective generation times, the execution latency of the tasks can be reduced. The remaining tasks to be executed and the second update operation subtask can be executed asynchronously according to their execution priorities, thus avoiding the problem of the target data table being stuck due to the execution of too many tasks at once.

[0049] Understandably, the first execution priority here is higher than the second execution priority. The first task type is an interactive task type unrelated to the non-visual area. An interactive task type refers to a task type related to user interaction. For example, the remaining pending task of an interactive task type is to adjust the color of the data record in the visual area to red. The second task type is a non-interactive task type unrelated to the non-visual area but related to the visible area. The third task type is a non-interactive task type unrelated to both the visible and non-visual areas. Non-interactive task types refer to task types unrelated to user interaction, such as data reporting, data storage, etc.

[0050] Understandably, if the task type of the remaining pending task is associated with the non-visual area, then the remaining pending task is merged with the second update operation subtask to obtain a merged pending task. The data content in the non-visual area is then updated according to this merged pending task. This includes: if the task type of the remaining pending task is the fourth task type, meaning the remaining pending task is only associated with the non-visual area, then the remaining pending task is merged with the second update operation subtask to obtain a first merged pending task. The data content in the non-visual area is then updated according to this first merged pending task. For example, if the remaining pending task is to cancel the adjustment of the column width of the third column in the non-visual area, and the second update operation subtask is to adjust the column width of the third column in the non-visual area, the first merged pending task obtained by merging the remaining pending task and the second update operation subtask is used to indicate that the adjustment of the column width of the third column in the non-visual area is canceled, meaning that the column width of the third column in the non-visual area does not need to be adjusted. Alternatively, the remaining task to be executed is to increase the column width of the third column in the non-visual area by 3cm, and the second update operation subtask is to decrease the column width of the third column in the non-visual area by 2cm. The first merged task to be executed, obtained by merging the remaining task to be executed and the second update operation subtask, is used to instruct to increase the column width of the third column in the non-visual area by 1cm, thereby reducing the number of updates to the data content in the non-visual area and reducing the consumption of computing resources of the computer equipment.

[0051] Furthermore, if the remaining pending task is of task type five, meaning it is associated with both the visible and non-visual areas, then the remaining pending task is split into a first remaining pending subtask associated with the visible area and a second remaining pending subtask associated with the non-visual area. The first remaining pending subtask instructs for updating data content within the visible area, and the second remaining pending task instructs for updating data content within the non-visual area. Therefore, the computer device can prioritize executing the first remaining pending subtask. If the first remaining pending subtask is completed, the second remaining pending subtask is merged with the second update operation subtask to obtain a second merged pending task. The data content within the non-visual area is then updated according to this second merged pending task. By prioritizing the execution of tasks associated with the visible area, the updated data content within the visible area can be quickly presented to the user, improving the user experience.

[0052] Understandably, the fourth task type is a task type that is associated with the non-visible area but not with the visible area; the fifth task type is a task type that is associated with both the visible and non-visible areas.

[0053] In this application, when an update operation task associated with both the visible and non-visual areas of the target data table is obtained, the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. In other words, independent update operation subtasks are maintained for the visible and non-visual areas. During the update of either the visible or non-visual area, it is not necessary to scan the entire data content of the data table to determine whether the data content in the visible or non-visual areas has been updated, thereby reducing the consumption of computing resources during the data table update process and improving the efficiency of the data table update. Furthermore, the data content in the visible area is updated synchronously according to the first update operation subtask, and the data content in the non-visual area is updated asynchronously according to the second update operation subtask. Here, synchronous update means immediately updating the data content in the visible area according to the first update operation subtask, and asynchronous update means updating the data content in the non-visual area based on the first task processing state when the terminal has completed updating the data content in the visible area, and the second update operation subtask updating the data content in the non-visual area. That is, asynchronous update is a non-immediate update method. In other words, by synchronously updating the data content within the visible area and asynchronously updating the data content within the non-visible area, the amount of data updated in a single update process can be reduced, thereby decreasing the probability of data table lag and improving the smoothness and efficiency of data table updates.

[0054] Further, please see Figure 6 This is a flowchart illustrating a data table processing method provided in an embodiment of this application. Figure 6 As shown, this method can be derived from... Figure 1 It can be executed by the terminal in the middle, or by Figure 1 The server in the middle can be used to execute it, or it can be executed by... Figure 1 The method is executed jointly by the terminal and the server. The device used to execute this method in this application can be collectively referred to as a computer device. The data table processing method may include the following steps S201~S207: S201. Obtain update operation tasks for the target data table.

[0055] S202. If the update operation task is associated with both the visible and non-visible areas of the target data table, then the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visible area.

[0056] S203. Update the data content within the visible area according to the first update operation subtask.

[0057] S204. If the data content within the visible area has been updated and a touch operation is received for the target data table, then the visible and non-visual areas of the target data table are adjusted according to the touch operation.

[0058] S205. Obtain the first task processing status when the data content of the terminal in the visible area has been updated.

[0059] S206. If there is unupdated data content in the adjusted visible area, then update the unupdated data content in the adjusted visible area according to the second update operation subtask.

[0060] It is understood that the implementation method in this application of updating the unupdated data content in the adjusted visible area according to the second update operation subtask can refer to the above-described implementation method of updating the data content in the visible area according to the first update operation subtask. For example, the computer device can obtain the incrementing direction of the row identifiers of the unupdated data content in the adjusted visible area, and update the unupdated data content in the adjusted visible area sequentially according to the second update operation subtask in the incrementing direction of the row identifiers of the unupdated data content in the adjusted visible area.

[0061] S207. If the data content in the adjusted visible area has been updated, then according to the second update operation subtask and the processing status of the first task, update the data content in the adjusted non-visible area that has not been updated.

[0062] It is understood that the implementation method in this application of updating the unupdated data content in the adjusted non-visual area based on the second update operation subtask and the first task processing status can refer to the above-described implementation method of updating the data content in the non-visual area based on the second update operation subtask and the first task processing status. For example, if the first task processing status indicates that there are no unexecuted remaining tasks in the terminal, the computer device can update the unupdated data content in the adjusted non-visual area according to the second update operation subtask; if the first task processing status indicates that there are unexecuted remaining tasks in the terminal, the computer device can obtain the task type of the remaining tasks, execute the remaining tasks according to the task type, and update the unupdated data content in the adjusted non-visual area according to the second update operation subtask.

[0063] In steps S204-S207, if the data content within the visible area has been updated and a touch operation is received on the target data table (e.g., a swipe operation on the target data table), the computer device can adjust the visible and non-visual areas of the target data table based on the touch operation. Specifically, some sub-areas within the visible area of ​​the target data table are adjusted to non-visual areas, and some non-visual sub-areas within the non-visual areas of the target data table are adjusted to visible areas; or, the visible area of ​​the target data table is adjusted to non-visual areas, and some non-visual sub-areas (or all non-visual areas) of the target data table are adjusted to visible areas. Further, the computer device can obtain the first task processing state when the data content within the visible area of ​​the terminal has been updated. If there is unupdated data content within the adjusted visible area, the data content within the adjusted visible area can be updated according to the second update operation sub-task. If the data content in the adjusted visible area has been updated, then the data content in the adjusted non-visible area that has not been updated will be updated according to the second update operation subtask and the processing status of the first task.

[0064] For example, the target data table includes 120 rows and three columns. The visible area includes rows 1 to 50, and the non-visible area includes rows 51 to 120. A first update operation subtask instructs the adjustment of the column width of the third column in each of rows 1 to 50. A second update operation subtask instructs the adjustment of the column width of the third column in each of rows 51 to 120. Assuming that after updating the data content within the visible area according to the first update operation subtask, a sliding operation is received targeting the target data table. Based on this sliding operation, the visible and non-visible areas of the target data table are adjusted, resulting in the adjusted visible and non-visible areas. Assuming the adjusted visible area includes rows 20 to 70 of the target data table, and the non-visual area includes rows 1 to 19 and rows 71 to 120 of the target data table, the column width of the third column of each row in the adjusted visible area (rows 51 to 70) remains unchanged. Therefore, according to the second update operation subtask, the column width of the third column of each row in the adjusted visible area can be adjusted. Similarly, since the column width of the third column of each row in the adjusted non-visual area (rows 71 to 120) remains unchanged, the computer device can adjust the column width of the third column of each row in the adjusted non-visual area (rows 71 to 120) according to the first task processing status and the second update operation subtask.

[0065] Understandably, once the data content within the visible area has been updated, the computer device can render the updated data content within that area. This involves rendering the updated data content based on factors such as row height, column width, data record color, font, and borders. Displaying this rendered data content on the terminal reduces waiting time for each user operation and prevents subsequent operations from being blocked and causing lag. When it's detected that updated data content outside the visible area needs to be displayed, the computer device can then render that updated data content, reducing unnecessary rendering operations and conserving computing resources.

[0066] It is understood that the number of data entries in the aforementioned non-visual area is at least two. The update of the data content in the non-visual area according to the second update operation subtask includes: the computer device can obtain the arrangement relationship between the data content in the visible area and the data content in the non-visual area. The arrangement relationship indicates the size relationship between the arrangement identifier of the data content in the visible area in the target direction and the arrangement identifier of the data content in the non-visual area in the target direction. The target direction can refer to the vertical direction of the target data table, and the arrangement identifier in the target direction can refer to the row identifier. Further, the computer device can update the data content in the non-visual area sequentially according to the arrangement relationship and the second update operation subtask. Timing begins when the data content in the non-visual area is updated. If the timed time exceeds a time threshold, a second task processing state is obtained when the timed time exceeds the time threshold. This second task processing state reflects whether there are any unexecuted remaining tasks to be executed when the timed time exceeds the time threshold. Further, based on the second task processing state and the second update operation subtask, the unupdated data content in the non-visual area is updated.

[0067] For example, such as Figure 7As shown, the target data table comprises 120 rows and three columns. The visible area includes rows 1 to 50, and the non-visible area includes rows 51 to 120. The row identifiers of the data content within the visible area are 1 to 50, and those within the non-visible area are 51 to 120. The row identifiers of the data content within the visible area are all greater than those within the non-visible area. Assume that the first update operation subtask instructs the adjustment of the column width of the third column in each row from row 1 to row 50, and the second update operation subtask instructs the adjustment of the column width of the third column in each row from row 51 to row 120. The time threshold is 50ms. The computer device can adjust the column width of the third column in each row from row 1 to row 50 in the target data table based on the first update operation subtask, and then add the second update operation subtask to the asynchronous task management storage area 70a. This asynchronous task management storage area 70a is used to store and manage unexecuted tasks. Then, if the column width of the third column in each row from the first to the fiftieth row of the target data table has been adjusted, and the first task processing status indicates that all remaining tasks to be executed in the terminal have been completed, the computer device can read the second update operation subtask from the asynchronous task management storage area 70a. It will prioritize adjusting the column width of the third column in row 51 according to the second update operation subtask, and start a timer. Then, it will adjust the column width of the third column in row 52, ​​and so on. Assuming the column width of the third column in row 70 within the non-visible area has been adjusted, and the timer reading is greater than 50ms, the computer device can then obtain the second task processing status of the terminal when the timer reading is greater than 50ms. The computer device can reset the timer, setting the timer's countdown to an initial value, such as 00:00:00. A third update operation subtask is generated based on the second update operation subtask. This third update operation subtask instructs the adjustment of the column width of the cells in the third column of each row from row 71 to row 120 within the non-visible area. If the second task processing status indicates that there are remaining unexecuted tasks in the terminal, and the execution priority of these remaining tasks is higher than that of the second update operation subtask, the third update operation subtask can be stored in the asynchronous task management storage area 70a. After all remaining tasks have been executed, the third update operation subtask is read from the asynchronous task management area 70a. Based on this third update operation subtask, the column width of the cell in the third column of row 71 is adjusted, and the timer is restarted. Then, the column width of the cell in the third column of row 72 is adjusted, and so on.Assuming the column width of the cell in the third column of row 90 within the non-visual area has been adjusted, and the timer reading is greater than 50ms, the computer can then obtain the third task processing status of the terminal when the timer reading is greater than 50ms. This process is repeated until all data within the non-visual area has been updated.

[0068] Understandably, such as Figure 8 As shown, the asynchronous task management storage area 70a manages unexecuted tasks through the following four steps: 1. Obtain the tasks to be executed for uncalculated areas. For example, if the uncalculated area is a non-visible area in the target data table and the task to be executed is the second update operation subtask, add the second update operation subtask to the asynchronous task management storage area 70a. 2. When the tasks to be executed in the asynchronous task management storage area 70a meet the execution conditions, such as when all remaining tasks to be executed in the terminal have been executed, the computer device can execute the tasks to be executed. Every 50ms, it checks again whether the tasks to be executed in the asynchronous task management storage area 70a meet the execution conditions. If the execution conditions are met, the tasks to be executed in the asynchronous task management storage area 70a continue to be executed; if the execution conditions are not met, it waits for the next execution opportunity. 3. When all tasks to be executed in the asynchronous task management storage area 70a have been completed, the task management of the asynchronous task management storage area 70a ends. 4. When a new task to be executed is generated, the task management of the asynchronous task management storage area 70a is resumed, and steps 1-3 above are repeated.

[0069] Understandably, the second task processing state here is used to reflect whether there are any remaining unexecuted tasks when the timed time exceeds the time threshold. If there are no remaining unexecuted tasks when the timed time exceeds the time threshold, the computer device can immediately adjust the column width of the cells in the third column of each row in the non-visual area according to the third update operation subtask. If there are remaining unexecuted tasks when the timed time exceeds the time threshold, the computer device can obtain the task type of the remaining unexecuted tasks, execute the remaining unexecuted tasks according to the task type, and adjust the column width of the cells in the third column of each row in the non-visual area according to the third update operation subtask.

[0070] Understandably, this time threshold is determined based on the terminal's task processing performance. For example, if the terminal's task processing performance is good, a first duration can be set as the time threshold; if the terminal's task processing performance is poor, a second duration can be set as the time threshold, with the first duration being longer than the second duration. Of course, this time threshold can also be set by the user corresponding to the terminal. The terminal's task processing performance can be determined based on one or more of the following: task processing accuracy, processing efficiency, etc.

[0071] Understandably, computer devices can update data content in non-visual areas using any of the following three methods: Method 1: If the arrangement indicates that all first arrangement identifiers are less than the second arrangement identifiers, it means that the visible area precedes the non-visible area. The computer device can determine the increment direction of the second arrangement identifiers corresponding to the data content in the non-visible area, and update the data content in the non-visible area sequentially according to the second update operation subtask based on the increment direction of the second arrangement identifiers. By updating the data content in the non-visible area sequentially according to the increment direction of the second arrangement identifiers, it is beneficial for users to quickly present the updated data content in the non-visible area to the user when performing a downward scrolling operation on the target data table. Here, the downward scrolling operation refers to scrolling the data content in the target data table according to the increment direction of the row identifiers.

[0072] It is understood that the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target data table in the target direction. The target direction can refer to the vertical direction, and the arrangement identifier in the target direction refers to the row identifier.

[0073] For example, the target data table comprises 120 rows and three columns. The visible area includes rows 1 to 50, and the non-visible area includes rows 51 to 120. The row identifiers of the data content within the visible area are 1 to 50, and the row identifiers of the content within the non-visible area are 51 to 120. The row identifiers of the data content within the visible area are all greater than those within the non-visible area. Assuming the second update operation subtask instructs the adjustment of the column width of the cells in the third column of each row from row 51 to 120, the computer device can first adjust the column width of the cell in the third column of row 51, then adjust the column width of the cell in the third column of row 52, ​​and so on, until the column width of the cells in the third column of each row within the non-visible area has been adjusted.

[0074] Method 2: If the arrangement relationship indicates that the first arrangement identifier is greater than the second arrangement identifier, then the decreasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined. The first and second arrangement identifiers respectively reflect the arrangement identifiers of the data content in the visible area and the data content in the non-visual area in the target direction of the target data table. Following the decreasing direction of the second arrangement identifier, the data content in the non-visual area is updated sequentially according to the second update operation subtask. By updating the data content in the non-visual area sequentially according to the decreasing direction of the second arrangement identifier, it is beneficial for users to quickly view the updated data content in the non-visual area when performing an upward swipe operation on the target data table. Here, the upward swipe operation refers to swiping the data content in the target data table according to the decreasing direction of the row identifiers.

[0075] For example, the target data table comprises 120 rows and three columns. The visible area includes rows 70 to 120, and the non-visible area includes rows 1 to 69. The row identifiers of the data within the visible area are 70 to 120, and the row identifiers of the data within the non-visible area are 1 to 69. All row identifiers within the visible area are smaller than those within the non-visible area. Assuming the second update operation subtask instructs the adjustment of the column width of the third column in each of rows 1 to 69, the computer can first adjust the column width of the third column in row 69, then adjust the column width of the third column in row 68, and so on, until the column width of the third column in each row within the non-visible area is adjusted.

[0076] Method 3, as shown in Figure 9, involves two non-visible regions, including a first non-visible region and a second non-visible region. If the arrangement relationship indicates that the third arrangement identifier is always less than the first arrangement identifier, and the fourth arrangement identifier is greater than the first arrangement identifier, it indicates that the visible region is arranged between the first and second non-visible regions. Then, the decreasing direction of the third arrangement identifier corresponding to the data content in the first non-visible region and the increasing direction of the fourth arrangement identifier corresponding to the data content in the second non-visible region are determined. The first, third, and fourth arrangement identifiers respectively reflect the arrangement identifiers of the data content in the visible region, the data content in the first non-visible region, and the data content in the second non-visible region in the target direction within the target data table. Furthermore, following the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, the data content in the first non-visual area and the data content in the second non-visual area are alternately updated according to the second update operation sub-task. By alternately updating the data content in the first and second non-visual areas, it is beneficial to quickly present the updated data content in the first and second non-visual areas to the user when the user performs a touch operation on the target data table.

[0077] Understandably, the alternating updates here can include the following four meanings: 1. First, following the decreasing direction of the third arrangement identifier, update the data content in the first non-visible area according to the second update operation sub-task; when the data content in the first non-visible area has been updated, update the data content in the second non-visible area according to the increasing direction of the fourth arrangement identifier, according to the second update operation sub-task. 2. First, following the increasing direction of the fourth arrangement identifier, update the data content in the second non-visible area according to the second update operation sub-task; when the data content in the second non-visible area has been updated, update the data content in the first non-visible area according to the decreasing direction of the third arrangement identifier, according to the second update operation sub-task. 3. First, following the decreasing direction of the third arrangement identifier, update G data items in the first non-visible area according to the second update operation sub-task; then, following the increasing direction of the fourth arrangement identifier, update F data items in the second non-visible area according to the second update operation sub-task, and so on, until the data content in both the visible and non-visible areas has been updated. G and F are both positive integers greater than or equal to 1. G is less than the number of data entries in the first non-visible area, and F is less than the number of data entries in the second non-visible area. G and F can be the same or different. 4. First, following the increasing direction of the fourth arrangement identifier, update the F data entries in the second non-visible area according to the second update operation subtask. Then, following the decreasing direction of the third arrangement identifier, update the G data entries in the first non-visible area according to the second update operation subtask, and so on, until all data entries in both the visible and non-visible areas have been updated.

[0078] For example, the first non-visual area includes M data items, and the second non-visual area includes N data items, where N and M are both positive integers, and G=F=1; the data items in the first and second non-visual areas are alternately updated according to the second update operation subtask, following the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, including: updating the data items M according to the second update operation subtask. i Update if the data content M i Once the update is complete, the data content N will be processed according to the second update operation subtask. j Update; if the data content N j Once the update is complete, the data content M will be updated according to the second update operation subtask. i-1 Update if the data content M i-1 Once the update is complete, the data content N will be processed according to the second update operation subtask. j+1 Update; the data content Mi This belongs to the M data contents, and the data contents M i-1 The identifier of the third permutation of the M data items is less than the data item M. i The third row of identifiers contains the data content, which is N. j It belongs to the N data contents, and the data contents N j+1 The fourth permutation identifier of the N data items is greater than the N data items. j The fourth arrangement of the data content is identified. By alternately updating the data content in the first and second non-visible areas, it is beneficial to quickly present the updated data content in the first and second non-visible areas to the user when the user performs a touch operation on the target data table.

[0079] For example, the target data table includes 120 rows and three columns. The visible area includes rows 20 to 70 of the target data table, the first non-visible area includes rows 1 to 19 of the target data table, and the second visible area includes rows 71 to 120 of the target data table. The row identifiers of the data content in the first non-visible area are 1 to 19, and the row identifiers of the data content in the second non-visible area are 71 to 120. Assume that the second update operation subtask is used to instruct the adjustment of the column width of the cell in the third column of each row from row 1 to row 19 and from row 71 to row 120; the computer device can first adjust the column width of the cell in the third column of row 19 according to the second update operation subtask, and then adjust the column width of the cell in the third column of row 71 according to the second update operation subtask. Furthermore, according to the second update operation subtask, the column width of the cell in the third column of the row with row identifier 18 is adjusted. Then, according to the second update operation subtask, the column width of the cell in the third column of the row with row identifier 72 is adjusted, and so on, until the data content in the first and second non-visible areas has been updated.

[0080] For example, assuming the target data table has 1 million cells, the time required to update the target data table using the update scheme of this application and the time required using the existing update scheme are shown in Table 3. The existing update scheme refers to the scheme that updates all data content in the target data table at once. Table 3 shows that the time required to perform the border line setting operation on the target data table using the update scheme of this application is 26 seconds, while the existing update scheme requires 29 seconds. Therefore, the update scheme of this application reduces the time by 3 seconds, representing a time optimization of 10%. Similarly, the time required to perform the automatic line wrapping operation on the target data table using the update scheme of this application is 16 seconds, while the existing update scheme requires 10 seconds. Therefore, the update scheme of this application reduces the time by 6 seconds, representing a time optimization of 38%. Similarly, the update scheme of this application takes less time to perform full table filtering, set border lines (entire column operation), and set automatic line wrapping on the target data table than to perform the corresponding update operations on the target data table based on the existing update scheme, which can reduce the probability of the target data table experiencing lag. Table 3

[0081] In this application, when an update operation task is obtained that is associated with both the visible and invisible areas of the target data table, the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. In other words, independent update operation subtasks are maintained for the visible and non-visual areas. During the update process of the visible or non-visual areas, it is not necessary to scan the entire data content of the data table to determine whether the data content in the visible and non-visual areas has been updated, thereby reducing the computational resource consumption during the data table update process and improving the efficiency of the data table update. Furthermore, according to the first update operation subtask, the data content within the visible area is updated. If the data content within the visible area has been updated and a touch operation regarding the target data table is received, the visible and non-visual areas of the target data table are adjusted according to the touch operation. The first task processing state when the data content within the visible area of ​​the terminal has been updated is obtained. The unupdated data content within the adjusted visible area is updated according to the second update operation subtask. The unupdated data content in the non-visual area is updated according to the second update operation subtask and the first task processing state. In other words, if the visible and non-visual areas are adjusted before updating the data content in the non-visual area, the unupdated data content within the adjusted visible area is still updated first. Then, the unupdated data content in the adjusted non-visual area is updated asynchronously. This reduces the amount of data updated in a single update, lowers the probability of data table lag, and improves the smoothness and efficiency of data table updates. Simultaneously, it facilitates quickly presenting the updated data content within the adjusted visible area to the user, reducing user waiting time.

[0082] Please see Figure 10 This is a schematic diagram of the structure of a data table processing device provided in an embodiment of this application. The aforementioned data table processing device can be a computer program (including program code) running on a network device; for example, the data table processing device is an application software. This device can be used to execute the corresponding steps in the method provided in the embodiments of this application. Figure 10 As shown, the data table processing device may include: an acquisition module 111, a splitting module 112, a first update module 113, a second update module 114, and a rendering module 115.

[0083] The acquisition module 111 is used to acquire update operation tasks related to the target data table; The splitting module 112 is used to split the update operation task into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visible area if the update operation task is associated with both the visible and non-visible areas of the target data table; the visible area is the area in the target data table where the data content is visible, and the non-visible area is the area in the target data table where the data content is invisible. The first update module 113 is used to update the data content within the visible area according to the first update operation subtask; The second update module 114 is used to obtain the first task processing status of the terminal when the data content in the visible area has been updated, if the data content in the visible area has been updated, and update the data content in the non-visible area according to the second update operation subtask and the first task processing status; the terminal is a terminal used to update the target data table.

[0084] It is understood that the second update module 114 includes a first update unit 40a and a second update unit 41a: The first update unit 40a is configured to update the data content in the non-visible area according to the second update subtask if the first task processing status indicates that all remaining tasks to be executed in the terminal have been completed; the remaining tasks to be executed are the tasks to be executed in the terminal other than the second update subtask. The second update unit 41a is configured to, if the first task processing status indicates that there are remaining tasks to be executed in the terminal that have not been completed, obtain the task type of the remaining tasks to be executed, execute the remaining tasks to be executed according to the task type of the remaining tasks to be executed, and update the data content in the non-visible area according to the second update operation subtask.

[0085] Understandably, the second update unit 41a executes the remaining tasks according to their task types, and updates the data content in the non-visible area according to the second update operation subtask, including: If the task type of the remaining tasks to be executed is a task type that is not associated with the non-visual area, then the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task are determined respectively. The remaining tasks to be executed are executed in sequence according to the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task, and the data content in the non-visual area is updated according to the second update operation sub-task. If the task type of the remaining tasks to be executed is a task type associated with the non-visible area, then the remaining tasks to be executed are merged with the second update operation subtask to obtain a merged task to be executed, and the data content in the non-visible area is updated according to the merged task to be executed.

[0086] Understandably, the second update unit 41a determines the execution priorities corresponding to the remaining tasks to be executed and the second update operation subtasks, including: If the task type of the remaining tasks to be executed is a first task type or a second task type, then the first execution priority is determined as the execution priority of the remaining tasks to be executed, and the second execution priority is determined as the execution priority of the second update operation subtask; the first execution priority is higher than the second execution priority, the first task type is an interactive task type that is not associated with the non-visual area, and the second task type is a non-interactive task type that is not associated with the non-visual area but is associated with the visible area; If the task type of the remaining tasks to be executed is the third task type, then the generation time corresponding to the remaining tasks to be executed and the second update operation sub-task is obtained, the execution priority of the remaining tasks to be executed is determined according to the generation time of the remaining tasks to be executed, and the execution priority of the second update operation sub-task is determined according to the generation time of the second update operation sub-task; the third task type is a non-interactive task type that is not associated with either the visible area or the non-visual area. Understandably, if the task type of the remaining tasks to be executed is a task type associated with the non-visible area, the second update unit 41a merges the remaining tasks to be executed with the second update operation subtask to obtain a merged task to be executed, and updates the data content in the non-visible area according to the merged task to be executed, including: If the task type of the remaining tasks to be executed is the fourth task type, then the remaining tasks to be executed are merged with the second update operation subtask to obtain the first merged task to be executed, and the data content in the non-visual area is updated according to the first merged task to be executed; the fourth task type is a task type that is associated with the non-visual area but not associated with the visible area, and the first merged task to be executed belongs to the merged task to be executed; If the task type of the remaining tasks to be executed is the fifth task type, then the remaining tasks to be executed are split into a first remaining sub-task associated with the visible area and a second remaining sub-task associated with the non-visible area. The first remaining sub-task is executed. If the first remaining sub-task is completed, the second remaining sub-task is merged with the second update operation sub-task to obtain a second merged task to be executed. The data content in the non-visible area is updated according to the second merged task to be executed. The second merged task to be executed belongs to the merged task to be executed. The fifth task type is a task type associated with both the visible area and the non-visible area.

[0087] It is understood that the number of data entries in the non-visual area is at least two. The first update unit 40a updates the data content in the non-visual area according to the second update operation subtask, including: Obtain the arrangement relationship between the data content within the visible area and the data content within the non-visual area; According to the arrangement relationship, the data content in the non-visual area is updated sequentially according to the second update operation subtask; Timing begins when the data content in the non-visual area is updated. If the time elapsed exceeds a time threshold, the terminal acquires a second task processing state when the elapsed time exceeds the time threshold. The time threshold is determined based on the task processing performance of the terminal. Based on the second task processing status and the second update operation subtask, update the data content that has not been updated in the non-visible area.

[0088] Understandably, the first update unit 40a updates the data content in the non-visible area sequentially according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that the first arrangement identifier is less than the second arrangement identifier, then the increasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the increasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

[0089] Understandably, the first update unit 40a updates the data content in the non-visible area sequentially according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that the first arrangement identifier is greater than the second arrangement identifier, then the decreasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the decreasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

[0090] It is understood that there are two non-visual areas, including a first non-visual area and a second non-visual area; the first update unit 40a updates the data content within the non-visual areas according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that all third arrangement identifiers are less than the first arrangement identifiers and the fourth arrangement identifier is greater than the first arrangement identifier, then the decreasing direction of the third arrangement identifiers corresponding to the data content in the first non-visible area and the increasing direction of the fourth arrangement identifiers corresponding to the data content in the second non-visible area are determined; the first arrangement identifier, the third arrangement identifier, and the fourth arrangement identifier respectively reflect the arrangement identifiers of the data content in the visible area, the data content in the first non-visible area, and the data content in the second non-visible area in the target direction in the target data table; According to the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, the data content in the first non-visible area and the data content in the second non-visible area are alternately updated according to the second update operation subtask.

[0091] Understandably, the first non-visual area includes M data entries, and the second non-visual area includes N data entries, where N and M are both positive integers. The first update unit 40a updates the data entries in the first non-visual area and the second non-visual area alternately according to the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, based on the second update operation subtask, including: According to the second update operation subtask, the data content M is... i Update the data if the data content M i Once the update is complete, the data content N is processed according to the second update operation subtask. j Update; If the data content N j Once the update is complete, the data content M is processed according to the second update operation subtask. i-1 Update the data if the data content M i-1 Once the update is complete, the data content N is processed according to the second update operation subtask. j+1 Update; the data content M i Belonging to the M data contents, the data contents M i-1 The identifier of the third permutation of the M data contents is less than the M data contents. i The adjacent data content of the third arrangement identifier, the data content N j Belonging to the N data contents, the data contents N j+1 The fourth permutation identifier of the N data contents is greater than the N data contents. j The adjacent data content of the fourth arrangement identifier.

[0092] Understandably, if the data content within the visible area has been updated, the second update module 114 obtains the first task processing status of the terminal when the data content within the visible area has been updated, and updates the data content within the non-visual area according to the second update operation subtask and the first task processing status, including: If the data content within the visible area has been updated and a touch operation is received for the target data table, then the visible and non-visual areas of the target data table are adjusted according to the touch operation. The first task processing status is obtained when the data content of the terminal in the visible area has been updated. If there is unupdated data content in the adjusted visible area, then the unupdated data content in the adjusted visible area is updated according to the second update operation subtask; If the data content in the adjusted visible area has been updated, then the data content in the adjusted non-visible area that has not been updated is updated according to the second update operation subtask and the processing status of the first task.

[0093] Understandably, the rendering module 115 is used to render the updated data content in the visible area if the data content in the visible area has been updated. The rendered data content within the visible area is displayed on the terminal.

[0094] Understandably, the first update module 113 is used to obtain the increasing direction of the arrangement indicators of the data content in the visible area in the target direction of the target data table; and to update the data content in the visible area sequentially according to the increasing direction of the arrangement indicators of the data content in the visible area in the target direction of the target data table, based on the first update operation subtask.

[0095] According to one embodiment of this application, Figure 4 The steps involved in the data table processing method shown can be derived from... Figure 10 The data processing unit shown in the diagram executes the operation through its various modules. For example, Figure 4 Step S101 shown can be performed by Figure 10 The acquisition module 111 in the middle is used to execute, Figure 4 Step S102 shown can be performed by Figure 10 The split module 112 in the middle is used for execution; Figure 4 Step S103 shown can be performed by Figure 10 The first update module 113 in the middle is used to execute; Figure 4 Step S104 shown can be derived from Figure 10 The second update module 114 in the middle is used to execute it.

[0096] According to one embodiment of this application, Figure 10 The modules in the data table processing device shown can be individually or entirely combined into one or more units, or one or more of these units can be further divided into at least two functionally smaller sub-units to achieve the same operation without affecting the technical effects of the embodiments of this application. The above modules are based on logical functional division. In practical applications, the function of one module can also be implemented by at least two units, or the function of at least two modules can be implemented by one unit. In other embodiments of this application, the data table processing device may also include other units. In practical applications, these functions can also be implemented with the assistance of other units, and can be implemented collaboratively by at least two units.

[0097] According to one embodiment of this application, the following can be executed by running on a general-purpose computer device, such as a computer, which includes processing components and storage components such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM). Figure 4 and Figure 5 The computer program (including program code) involved in each step of the corresponding method shown, to construct such... Figure 10 The data table processing apparatus shown herein, and the data table processing method for implementing the embodiments of this application, are described. The computer program described above may be recorded on, for example, a computer-readable recording medium, loaded onto the aforementioned computing device via the computer-readable recording medium, and run therein.

[0098] In this application, when an update operation task associated with both the visible and non-visual areas of the target data table is obtained, the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. In other words, independent update operation subtasks are maintained for the visible and non-visual areas. During the update of either the visible or non-visual area, it is not necessary to scan the entire data content of the data table to determine whether the data content in the visible or non-visual areas has been updated, thereby reducing the consumption of computing resources during the data table update process and improving the efficiency of the data table update. Furthermore, the data content in the visible area is updated synchronously according to the first update operation subtask, and the data content in the non-visual area is updated asynchronously according to the second update operation subtask. Here, synchronous update means immediately updating the data content in the visible area according to the first update operation subtask, and asynchronous update means updating the data content in the non-visual area based on the first task processing state when the terminal has completed updating the data content in the visible area, and the second update operation subtask updating the data content in the non-visual area. That is, asynchronous update is a non-immediate update method. In other words, by synchronously updating the data content within the visible area and asynchronously updating the data content within the non-visible area, the amount of data updated in a single update process can be reduced, thereby decreasing the probability of data table lag and improving the smoothness and efficiency of data table updates.

[0099] Please see Figure 11 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Figure 11 As shown, the aforementioned computer device 1000 may include: a processor 1001, a network interface 1004, and a memory 1005. Furthermore, the computer device 1000 may also include: a user interface 1003, and at least one communication bus 1002. The communication bus 1002 is used to enable communication between these components. The user interface 1003 may include a display screen and a keyboard; optionally, the user interface 1003 may also include a standard wired interface or a wireless interface. The network interface 1004 may optionally include a standard wired interface or a wireless interface (such as a Wi-Fi interface). The memory 1005 may be high-speed RAM or non-volatile memory, such as at least one disk storage device. Optionally, the memory 1005 may also be at least one storage device located remotely from the aforementioned processor 1001. Figure 11 As shown, the memory 1005, which is a computer-readable storage medium, may include an operating system, a network communication module, a user interface module, and a device control application.

[0100] exist Figure 11 In the computer device 1000 shown, the network interface 1004 provides network communication functionality; the user interface 1003 is mainly used to provide an input interface; and the processor 1001 can be used to call the device control application stored in the memory 1005 to achieve: Retrieve update operation tasks for the target data table; If the update operation task is associated with both the visible and invisible areas of the target data table, then the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the invisible area; the visible area is the area in the target data table where the data content is visible, and the invisible area is the area in the target data table where the data content is invisible. Update the data content within the visible area according to the first update operation subtask; If the data content within the visible area has been updated, the first task processing status of the terminal when the data content within the visible area has been updated is obtained. Based on the second update operation subtask and the first task processing status, the data content within the non-visual area is updated. The terminal is a terminal used to update the target data table.

[0101] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to update the data content in the non-visible area according to the second update operation subtask and the first task processing state, including: If the first task processing status indicates that all remaining tasks to be executed in the terminal have been completed, then the data content in the non-visual area is updated according to the second update subtask; the remaining tasks to be executed are the tasks to be executed in the terminal other than the second update subtask. If the first task processing status indicates that there are remaining unfinished tasks in the terminal, then the task type of the remaining unfinished tasks is obtained, the remaining unfinished tasks are executed according to the task type of the remaining unfinished tasks, and the data content in the non-visible area is updated according to the second update operation subtask.

[0102] Understandably, processor 1001 can be used to call the device control application stored in memory 1005 to execute the remaining tasks according to their task types, and to update the data content in the non-visible area according to the second update operation subtask, including: If the task type of the remaining tasks to be executed is a task type that is not associated with the non-visual area, then the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task are determined respectively. The remaining tasks to be executed are executed in sequence according to the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task, and the data content in the non-visual area is updated according to the second update operation sub-task. If the task type of the remaining tasks to be executed is a task type associated with the non-visible area, then the remaining tasks to be executed are merged with the second update operation subtask to obtain a merged task to be executed, and the data content in the non-visible area is updated according to the merged task to be executed.

[0103] Understandably, processor 1001 can be used to call the device control application stored in memory 1005 to determine the execution priorities of the remaining tasks to be executed and the second update operation subtask, including: If the task type of the remaining tasks to be executed is a first task type or a second task type, then the first execution priority is determined as the execution priority of the remaining tasks to be executed, and the second execution priority is determined as the execution priority of the second update operation subtask; the first execution priority is higher than the second execution priority, the first task type is an interactive task type that is not associated with the non-visual area, and the second task type is a non-interactive task type that is not associated with the non-visual area but is associated with the visible area; If the task type of the remaining tasks to be executed is the third task type, then the generation time corresponding to the remaining tasks to be executed and the second update operation sub-task is obtained, the execution priority of the remaining tasks to be executed is determined according to the generation time of the remaining tasks to be executed, and the execution priority of the second update operation sub-task is determined according to the generation time of the second update operation sub-task; the third task type is a non-interactive task type that is not associated with either the visible area or the non-visual area. Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to implement the following: if the task type of the remaining tasks to be executed is a task type associated with the non-visual area, then the remaining tasks to be executed are merged with the second update operation subtask to obtain a merged task to be executed, and the data content in the non-visual area is updated according to the merged task to be executed, including: If the task type of the remaining tasks to be executed is the fourth task type, then the remaining tasks to be executed are merged with the second update operation subtask to obtain the first merged task to be executed, and the data content in the non-visual area is updated according to the first merged task to be executed; the fourth task type is a task type that is associated with the non-visual area but not associated with the visible area, and the first merged task to be executed belongs to the merged task to be executed; If the task type of the remaining tasks to be executed is the fifth task type, then the remaining tasks to be executed are split into a first remaining sub-task associated with the visible area and a second remaining sub-task associated with the non-visible area. The first remaining sub-task is executed. If the first remaining sub-task is completed, the second remaining sub-task is merged with the second update operation sub-task to obtain a second merged task to be executed. The data content in the non-visible area is updated according to the second merged task to be executed. The second merged task to be executed belongs to the merged task to be executed. The fifth task type is a task type associated with both the visible area and the non-visible area.

[0104] It is understood that the number of data entries in the non-visual area is at least two. The processor 1001 can be used to call the device control application stored in the memory 1005 to update the data content in the non-visual area according to the second update operation subtask, including: Obtain the arrangement relationship between the data content within the visible area and the data content within the non-visual area; According to the arrangement relationship, the data content in the non-visual area is updated sequentially according to the second update operation subtask; Timing begins when the data content in the non-visual area is updated. If the time elapsed exceeds a time threshold, the terminal acquires a second task processing state when the elapsed time exceeds the time threshold. The time threshold is determined based on the task processing performance of the terminal. Based on the second task processing status and the second update operation subtask, update the data content that has not been updated in the non-visible area.

[0105] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to update the data content in the non-visible area according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that the first arrangement identifier is less than the second arrangement identifier, then the increasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the increasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

[0106] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to update the data content in the non-visible area according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that the first arrangement identifier is greater than the second arrangement identifier, then the decreasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the decreasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

[0107] It is understood that there are two non-visual areas, including a first non-visual area and a second non-visual area; the processor 1001 can be used to call the device control application stored in the memory 1005 to update the data content in the non-visual areas according to the arrangement relationship and the second update operation subtask, including: If the arrangement relationship indicates that all third arrangement identifiers are less than the first arrangement identifiers and the fourth arrangement identifier is greater than the first arrangement identifier, then the decreasing direction of the third arrangement identifiers corresponding to the data content in the first non-visible area and the increasing direction of the fourth arrangement identifiers corresponding to the data content in the second non-visible area are determined; the first arrangement identifier, the third arrangement identifier, and the fourth arrangement identifier respectively reflect the arrangement identifiers of the data content in the visible area, the data content in the first non-visible area, and the data content in the second non-visible area in the target direction in the target data table; According to the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, the data content in the first non-visible area and the data content in the second non-visible area are alternately updated according to the second update operation subtask.

[0108] Understandably, the first non-visual area includes M data entries, and the second non-visual area includes N data entries, where N and M are both positive integers. The processor 1001 can call the device control application stored in the memory 1005 to alternately update the data entries in the first non-visual area and the second non-visual area according to the second update operation subtask, following the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier. This includes: According to the second update operation subtask, the data content M is... i Update the data if the data content M i Once the update is complete, the data content N is processed according to the second update operation subtask. j Update; If the data content N j Once the update is complete, the data content M is processed according to the second update operation subtask. i-1 Update the data if the data content M i-1 Once the update is complete, the data content N is processed according to the second update operation subtask. j+1 Update; the data content M i Belonging to the M data contents, the data contents M i-1 The identifier of the third permutation of the M data contents is less than the M data contents. i The adjacent data content of the third arrangement identifier, the data content N j Belonging to the N data contents, the data contents N j+1 The fourth permutation identifier of the N data contents is greater than the N data contents. j The adjacent data content of the fourth arrangement identifier.

[0109] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to achieve, if the data content in the visible area has been updated, obtain the first task processing state when the data content in the visible area has been updated, and update the data content in the non-visible area according to the second update operation subtask and the first task processing state, including: If the data content within the visible area has been updated and a touch operation is received for the target data table, then the visible and non-visual areas of the target data table are adjusted according to the touch operation. The first task processing status is obtained when the data content of the terminal in the visible area has been updated. If there is unupdated data content in the adjusted visible area, then the unupdated data content in the adjusted visible area is updated according to the second update operation subtask; If the data content in the adjusted visible area has been updated, then the data content in the adjusted non-visible area that has not been updated is updated according to the second update operation subtask and the processing status of the first task.

[0110] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to: obtain the increasing direction of the arrangement identifier of the data content in the visible area in the target direction of the target data table; and update the data content in the visible area sequentially according to the first update operation subtask in accordance with the increasing direction of the arrangement identifier of the data content in the visible area in the target direction of the target data table.

[0111] Understandably, the processor 1001 can be used to call the device control application stored in the memory 1005 to render the updated data content in the visible area if the data content in the visible area has been updated. The rendered data content within the visible area is displayed on the terminal.

[0112] In this application, when an update operation task associated with both the visible and non-visual areas of the target data table is obtained, the update operation task is split into a first update operation subtask associated with the visible area and a second update operation subtask associated with the non-visual area. In other words, independent update operation subtasks are maintained for the visible and non-visual areas. During the update of either the visible or non-visual area, it is not necessary to scan the entire data content of the data table to determine whether the data content in the visible or non-visual areas has been updated, thereby reducing the consumption of computing resources during the data table update process and improving the efficiency of the data table update. Furthermore, the data content in the visible area is updated synchronously according to the first update operation subtask, and the data content in the non-visual area is updated asynchronously according to the second update operation subtask. Here, synchronous update means immediately updating the data content in the visible area according to the first update operation subtask, and asynchronous update means updating the data content in the non-visual area based on the first task processing state when the terminal has completed updating the data content in the visible area, and the second update operation subtask updating the data content in the non-visual area. That is, asynchronous update is a non-immediate update method. In other words, by synchronously updating the data content within the visible area and asynchronously updating the data content within the non-visible area, the amount of data updated in a single update process can be reduced, thereby decreasing the probability of data table lag and improving the smoothness and efficiency of data table updates.

[0113] It should be understood that the computer device 1000 described in the embodiments of this application can execute the foregoing text. Figure 6 and the preceding text Figure 4 The description of the data table processing method in the corresponding embodiments can also be implemented as described above. Figure 10 The description of the data table processing apparatus in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated.

[0114] Furthermore, it should be noted that this application embodiment also provides a computer-readable storage medium, which stores a computer program executed by the aforementioned data table processing device. The computer program includes program instructions, and when the processor executes the program instructions, it can execute the aforementioned... Figure 6 and the preceding text Figure 4 The description of the data table processing method in the corresponding embodiments is already provided, and therefore will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the computer-readable storage medium embodiments related to this application, please refer to the description of the method embodiments of this application.

[0115] As an example, the above program instructions can be deployed and executed on a computer device, or deployed and executed on at least two computer devices in one location, or executed on at least two computer devices distributed in at least two locations and interconnected by a communication network. At least two computer devices distributed in at least two locations and interconnected by a communication network can form a blockchain network.

[0116] The aforementioned computer-readable storage medium can be a data table processing apparatus provided in any of the foregoing embodiments or a central storage unit of the aforementioned computer device, such as a hard disk or central storage of the computer device. The computer-readable storage medium can also be an external storage device of the computer device, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., provided on the computer device. Furthermore, the computer-readable storage medium may include both the central storage unit and external storage devices of the computer device. The computer-readable storage medium is used to store the computer program and other programs and data required by the computer device. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0117] The terms "first," "second," etc., in the specification, claims, and drawings of this application are used to distinguish content in different media, rather than to describe a specific order. Furthermore, the term "comprising," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, apparatus, product, or device that includes a series of steps or units is not limited to the listed steps or modules, but may optionally include steps or modules not listed, or may optionally include other step units inherent to these processes, methods, apparatuses, products, or devices.

[0118] This application also provides a computer program product, including a computer program / instructions, which, when executed by a processor, implement the foregoing description. Figure 4 and Figure 6 The description of the data table processing method in the corresponding embodiments will not be repeated here. Furthermore, the beneficial effects of using the same method will also not be repeated. For technical details not disclosed in the embodiments of the computer program product involved in this application, please refer to the description of the method embodiments of this application.

[0119] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementations should not be considered beyond the scope of this application.

[0120] The methods and related apparatus provided in this application are described with reference to the method flowcharts and / or structural diagrams provided in this application. Specifically, each block of the method flowchart and / or structural diagram, as well as combinations of blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable network-connected device to create a machine, such that the instructions, which execute via the processor of the computer or other programmable network-connected device, generate instructions for implementing the process. Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable network-connected device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 A schematic diagram of one or more processes and / or structures. Figure 1 The functions specified in one or more boxes. These computer program instructions may also be loaded onto a computer or other programmable network-connected device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable device for implementing the process. Figure 1 A process or multiple processes and / or structures illustrate the steps of the functions specified in one or more boxes.

[0121] The above-disclosed embodiments are merely preferred embodiments of this application and should not be construed as limiting the scope of this application. Therefore, any equivalent variations made in accordance with the claims of this application shall still fall within the scope of this application.

Claims

1. A data table processing method, characterized in that, include: Update the data content within the visible area of ​​the target data table according to the first update operation subtask; If the data content within the visible area has been updated, the first task processing status of the terminal when the data content within the visible area has been updated is obtained. If the first task processing status indicates that all remaining tasks to be executed in the terminal have been executed, a timer is started to begin timing, and the data content in the target data table that is in the non-visible area is updated according to the second update operation subtask. The terminal is a terminal used to update the target data table. If the time obtained by timing is greater than the time threshold, then the second task processing status of the terminal when the time obtained by timing is greater than the time threshold is obtained. If the second task processing status indicates that there are new remaining tasks to be executed in the terminal that have not been executed, and the execution priority of the new remaining tasks to be executed is higher than the execution priority of the second update operation subtask, then after waiting until all the new remaining tasks to be executed have been executed, the timer is restarted to start timing again, and the data content that has not been updated in the non-visible area is updated through the second update operation subtask.

2. The method as described in claim 1, characterized in that, Also includes: If the first task processing status indicates that there are remaining unfinished tasks in the terminal, then the task type of the remaining unfinished tasks is obtained, the remaining unfinished tasks are executed according to the task type of the remaining unfinished tasks, and the data content in the non-visible area is updated according to the second update operation subtask.

3. The method as described in claim 2, characterized in that, The step of executing the remaining tasks according to their task types, and updating the data content in the non-visible area according to the second update operation subtask, includes: If the task type of the remaining tasks to be executed is a task type that is not associated with the non-visual area, then the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task are determined respectively. The remaining tasks to be executed are executed in sequence according to the execution priorities corresponding to the remaining tasks to be executed and the second update operation sub-task, and the data content in the non-visual area is updated according to the second update operation sub-task. If the task type of the remaining tasks to be executed is a task type associated with the non-visible area, then the remaining tasks to be executed are merged with the second update operation subtask to obtain a merged task to be executed, and the data content in the non-visible area is updated according to the merged task to be executed.

4. The method as described in claim 3, characterized in that, Determining the execution priorities of the remaining tasks to be executed and the second update operation subtask respectively includes: If the task type of the remaining tasks to be executed is a first task type or a second task type, then the first execution priority is determined as the execution priority of the remaining tasks to be executed, and the second execution priority is determined as the execution priority of the second update operation subtask; the first execution priority is higher than the second execution priority, the first task type is an interactive task type that is not associated with the non-visual area, and the second task type is a non-interactive task type that is not associated with the non-visual area but is associated with the visible area; If the task type of the remaining tasks to be executed is the third task type, then the generation time corresponding to the remaining tasks to be executed and the second update operation sub-task is obtained, the execution priority of the remaining tasks to be executed is determined according to the generation time of the remaining tasks to be executed, and the execution priority of the second update operation sub-task is determined according to the generation time of the second update operation sub-task; the third task type is a non-interactive task type that is not associated with either the visible area or the non-visual area.

5. The method as described in claim 3, characterized in that, If the task type of the remaining tasks to be executed is a task type associated with the non-visible area, then the remaining tasks to be executed are merged with the second update operation subtask to obtain a merged task to be executed. The data content within the non-visible area is then updated according to the merged task to be executed, including: If the task type of the remaining tasks to be executed is the fourth task type, then the remaining tasks to be executed are merged with the second update operation subtask to obtain the first merged task to be executed, and the data content in the non-visual area is updated according to the first merged task to be executed; the fourth task type is a task type that is associated with the non-visual area but not associated with the visible area, and the first merged task to be executed belongs to the merged task to be executed; If the task type of the remaining tasks to be executed is the fifth task type, then the remaining tasks to be executed are split into a first remaining sub-task associated with the visible area and a second remaining sub-task associated with the non-visible area. The first remaining sub-task is executed. If the first remaining sub-task is completed, the second remaining sub-task is merged with the second update operation sub-task to obtain a second merged task to be executed. The data content in the non-visible area is updated according to the second merged task to be executed. The second merged task to be executed belongs to the merged task to be executed. The fifth task type is a task type associated with both the visible area and the non-visible area.

6. The method as described in claim 1, characterized in that, The step of updating the data content in the target data table that is located in a non-visible area according to the second update operation subtask includes: Obtain the arrangement relationship between the data content within the visible area and the data content within the non-visual area; According to the arrangement relationship, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

7. The method as described in claim 6, characterized in that, The step of updating the data content in the non-visible area according to the arrangement relationship and the second update operation subtask includes: If the arrangement relationship indicates that the first arrangement identifier is less than the second arrangement identifier, then the increasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the increasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

8. The method as described in claim 6, characterized in that, The step of updating the data content in the non-visible area according to the arrangement relationship and the second update operation subtask includes: If the arrangement relationship indicates that the first arrangement identifier is greater than the second arrangement identifier, then the decreasing direction of the second arrangement identifier corresponding to the data content in the non-visual area is determined; the first arrangement identifier and the second arrangement identifier respectively reflect the arrangement identifier of the data content in the visible area and the data content in the non-visual area in the target direction in the target data table; Following the decreasing direction of the second arrangement identifier, the data content in the non-visible area is updated sequentially according to the second update operation subtask.

9. The method as described in claim 6, characterized in that, The number of non-visual areas is two, and the two non-visual areas include a first non-visual area and a second non-visual area; The step of updating the data content in the non-visible area according to the arrangement relationship and the second update operation subtask includes: If the arrangement relationship indicates that all third arrangement identifiers are less than the first arrangement identifiers and the fourth arrangement identifier is greater than the first arrangement identifier, then the decreasing direction of the third arrangement identifiers corresponding to the data content in the first non-visible area and the increasing direction of the fourth arrangement identifiers corresponding to the data content in the second non-visible area are determined; the first arrangement identifier, the third arrangement identifier, and the fourth arrangement identifier respectively reflect the arrangement identifiers of the data content in the visible area, the data content in the first non-visible area, and the data content in the second non-visible area in the target direction in the target data table; According to the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, the data content in the first non-visible area and the data content in the second non-visible area are alternately updated according to the second update operation subtask.

10. The method as described in claim 9, characterized in that, The first non-visual area includes M data items, and the second non-visual area includes N data items, where N and M are both positive integers; The step of alternately updating the data content in the first non-visible area and the data content in the second non-visible area according to the second update operation subtask, following the decreasing direction of the third arrangement identifier and the increasing direction of the fourth arrangement identifier, includes: According to the second update operation subtask, the data content M is... i Update the data if the data content M i Once the update is complete, the data content N is processed according to the second update operation subtask. j Update; If the data content N j Once the update is complete, the data content M is processed according to the second update operation subtask. i-1 Update the data if the data content M i-1 Once the update is complete, the data content N is processed according to the second update operation subtask. j+1 Update; the data content M i Belonging to the M data contents, the data contents M i-1 The identifier of the third permutation of the M data contents is less than the M data contents. i The adjacent data content of the third arrangement identifier, the data content N j Belonging to the N data contents, the data contents N j+1 The fourth permutation identifier of the N data contents is greater than the N data contents. j The adjacent data content of the fourth arrangement identifier.

11. The method as described in claim 1, characterized in that, The step of updating the data content within the visible area of ​​the target data table according to the first update operation subtask includes: Obtain the ascending direction of the arrangement markers of the data content within the visible area of ​​the target data table in the target direction of the target data table; According to the increasing direction of the arrangement of data content within the visible area in the target direction of the target data table, the data content within the visible area is updated sequentially according to the first update operation subtask.

12. A data table processing device, characterized in that, include: The first update module is used to update the data content in the visible area of ​​the target data table according to the first update operation subtask; The second update module is used to obtain the first task processing status when the data content in the visible area has been updated, if the data content in the visible area has been updated, and if the first task processing status indicates that all remaining tasks to be executed in the terminal have been executed, then start a timer to begin timing, and update the data content in the target data table that is in the non-visible area according to the second update operation subtask; the terminal is a terminal used to update the target data table. The second update module is further configured to, if the time obtained by timing is greater than a time threshold, obtain the second task processing status of the terminal when the time obtained by timing is greater than the time threshold; if the second task processing status indicates that there are new remaining tasks to be executed in the terminal that have not been executed, and the execution priority of the new remaining tasks to be executed is higher than the execution priority of the second update operation subtask, then after waiting until all the new remaining tasks to be executed have been executed, the timer is restarted to start timing again, and the data content that has not been updated in the non-visual area is updated through the second update operation subtask.

13. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 11.

14. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 11.

15. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 11.

Images