CN118036579A - How to process the table - Google Patents

Abstract

The invention provides a processing method of a table, which comprises the following steps: generating a table; establishing a cache data table corresponding to the table on the memory; correspondingly storing the data in the table in a cache data table, and changing the data in the cache data table based on the change of the table data; when a preset operation instruction in the table is received, executing preset operation on the data in the cache data table based on the preset operation instruction, and updating the data in the table through the data after executing the preset operation.

Description

How to process the table

Technical Field

The invention relates to the technical field of petroleum object detection, and in particular to a table processing method.

Background technique

Spreadsheets are a useful tool. However, the application of these spreadsheet processing tools has inconveniences and limitations in specific industries, such as:

Ordinary spreadsheet tools cannot meet the needs when faced with millions or even tens of millions of data volumes; professional industry data processing software needs to be embedded with big data processing spreadsheet functions, which cannot be replaced by ordinary spreadsheets. The petroleum geophysical surveying industry has dedicated data processing software, which is based on the collected physical point data, and performs internal quality control processing, conversion and other complex operations before presenting it to users in a table format. These are functions that third-party tools do not have. As exploration and acquisition projects develop towards large-scale high-density acquisition, the amount of physical point data in exploration projects has increased exponentially, with millions of physical point data needing to be processed, and the processing performance requirements of independent processing software for tables are also constantly increasing.

Therefore, how to come up with a solution to the problems that existing electronic spreadsheets are difficult to process millions of data volumes, the data processing time is long, and the existing dedicated data processing software has poor processing capabilities for spreadsheets has become an urgent problem to be solved.

Summary of the invention

In order to solve the above technical problem, a first aspect of the present invention proposes a table processing method.

In view of this, the first aspect of the present invention proposes a table processing method, including: generating a table; establishing a cache data table corresponding to the table in the memory; storing the data in the table in the cache data table, and changing the data in the cache data table based on the change of the table data; when receiving a preset operation instruction in the table, performing a preset operation on the data in the cache data table based on the preset operation instruction, and updating the data in the table through the data after performing the preset operation.

According to the table processing method provided by the present invention, it includes: establishing a table, which is an interface for displaying data and operating data. A cache data table corresponding to the table is established on the memory, which can read the data in the input table and store the data in the cache data table. The data in the table is stored in the cache data table, and the data in the cache data table is changed based on the change of the table data. When the data in the table is updated, the data in the cache data table will be updated, so that there is always a cache data table corresponding to the existing table data in the cache data table. Since the cache data table is set in the memory instead of the hard disk, the data processing speed is fast, no physical file is generated, and after the cache data table is closed, the memory occupied by the table can be automatically released. When processing millions or even tens of millions of data, the processing speed of the cache data table in the present application is faster, thereby meeting the demand for processing speed in millions or even tens of millions of data. When receiving the preset operation instruction in the table, the preset operation is performed on the data in the cache data table based on the preset operation instruction, and the data in the table is updated by the data after the preset operation is performed. When in use, the cache data table is updated first, and then the updated cache data table is updated to the table, so that the table can be read and accessed to realize the processing of the table data. Since the reading location of the table is often set in the hard disk, additional physical files are often generated when in use. At the same time, the processing speed of the hard disk is much lower than the processing speed of the memory, so the modification speed of the table is much lower than the modification speed of the cache data table. Therefore, except for filling the data of the table, the cache data table is used to access the table. When processing the data in the table, the data is modified by directly modifying the cache data table, and the modified data is updated to the table, so that the table does not need to process any data and only performs the functions of reading and accessing. In the petroleum exploration industry, there are often dedicated data processing software, but these data processing software is not strong in processing tables. After the data are transferred to ordinary tables, the time for ordinary tables to process the data is too long and cannot meet the use requirements. In addition, when executing each step of the operation, a large number of physical files will be generated due to the need to establish a cache in the hard disk, which further prolongs the processing time of the table. In this application, by directly setting the cache data table in the memory, the generation time and processing time of the cache data table are greatly reduced. And the data exported by the dedicated data processing software can be directly accepted to generate a table. Therefore, the processing difficulty of millions of data volumes is reduced, the processing time of the data is reduced, and at the same time, the data of the table exported by the dedicated data processing software can be received, and then the table data exported by the dedicated data processing software can be directly connected. The table can directly adopt the table form of the dedicated data processing software, thereby solving the problem that the ordinary table cannot recognize some data. At the same time, the processing capacity of the table is improved, and the problem of the poor processing capacity of the dedicated data processing software for the table is solved.

In addition, the table processing method in the above technical solution provided by the present invention may also have the following additional technical features:

In the above technical solution, when a preset operation instruction in a table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: after receiving a sorting instruction, the data in the cache data table is read out, and sorted according to the sorting method indicated by the sorting instruction, and the sorted data is saved as a sorting index table; after obtaining the sorting instruction from the table, the data in the table is updated based on the data in the sorting index table.

In this technical solution, when a preset operation instruction in a table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: after receiving the sorting instruction, the data in the buffer database is read out, and the data in the buffer database is sorted according to the sorting method indicated by the sorting instruction, and the data in the sorted cache data table is updated to the table, thereby realizing the sorting of the table. Since it is not necessary to directly process the data in the table, it is achieved that there is no need to directly process the table, and the table only needs to read the data, so that the table does not need to generate additional physical files, thereby improving the sorting speed when sorting the table and reducing the sorting time.

In the above technical solution, when a change process is received for table data, a change index table corresponding to the change process is established in sequence in the cache data table, and when a preset operation instruction is received in the table, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the data in the table is updated with the data after performing the preset operation. The steps include: when a preset operation instruction is received in the table, a corresponding change index table is searched in the cache data table based on the preset operation instruction, and the data in the table is updated using the data in the found change index table.

In this technical solution, when a change process for table data is received, a change index table corresponding to the change process is established in sequence in the cache data table. When a preset operation instruction in the table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: when the preset instruction of the table is received, the corresponding change index table is found according to the preset instruction, the data in the change index table is the table data formed after executing the preset instruction, and the table data is changed to the data in the change index table, thereby realizing the execution function of the preset instruction. By finding the corresponding change index table, the preset instruction can be realized without directly controlling the data in the table but directly controlling the data in the cache data table in the memory, thereby improving the processing speed of the preset instruction.

Specifically, define the variable "m_nCurTable" as the data table index for storing the current table, define "m_nCurTable--" as storing the previous data table index of the current table, and preset operation instructions include undo instructions and redo instructions. When the undo instruction is received, the data of the table is updated according to the data table corresponding to "m_nCurTable--", and "m_nCurTable--" is redefined as "m_nCurTable"; define "m_nCurTable++" as the next data table index of "m_nCurTable". When the redo instruction is received, the data of the table is updated according to the corresponding data table of "m_nCurTable++", and "m_nCurTable++" is redefined as "m_nCurTable".

In this technical solution, the variable "m_nCurTable" is first defined as the data table index for storing the current table data, and "m_nCurTable--" is defined as the data table index for storing the previous step of the current table, and "m_nCurTable++" is defined as the data table index for the next step of "m_nCurTable". The preset operation instructions include undo instructions and redo instructions. When receiving the undo instruction, the data table index "m_nCurTable--" of the previous step of the current data table is matched, and then the data table corresponding to "m_nCurTable--" is read, and the table is updated according to the data table corresponding to "m_nCurTable--", and "m_nCurTable--" is redefined as "m_nCurTable", so as to implement the undo instruction.

When receiving the redo instruction, the data table index "m_nCurTable++" of the next step of the current data table is matched, and then the data table corresponding to "m_nCurTable--" is read, and the table is updated according to the data table corresponding to "m_nCurTable++", and "m_nCurTable++" is redefined as "m_nCurTable", so as to implement the redo instruction. The undo instruction and the redo instruction in this application directly read the information in the cache data table instead of modifying the data in the table. Therefore, when the amount of data is in the millions or even tens of millions, the amount of data to be processed becomes smaller, thereby improving the processing speed of the undo instruction and the redo instruction.

In the above technical solution, each column of the cache data table is represented by the variable F%d, %d is equal to the total number of columns minus 1, and the total number of columns of the cache data table is the value of the variable m_nCols; the number of columns of the cache data table is consistent with the number of columns of the table, and a column object is established in the cache data table for each column of the table; the rows of the cache data table are set with two variables nRows and m_nDataRows. When "nRows" is less than "m_nDataRows", the records after nRows in the cache data table are deleted, the "m_nDataRows" value is updated, and the number of rows of the table is set.

In this technical solution, columns are defined in the buffer data table by using F%d, where %d is equal to the total number of columns minus 1, and the total number of columns in the buffer data table is defined as the value of m_nCols. The number of columns in the buffer data table is consistent with the number of columns in the table, and a column object is set for each column in the table in the cache data table, so that the data in the cache data table can correspond to the data in the table. Similarly, the rows of the cache data table are set with two variables nRows and m_nDataRows. When "nRows" is less than "m_nDataRows", the records after nRows in the cache data table are deleted, the "m_nDataRows" value is updated, and the number of rows of the table is set, so that the row data in the cache data table is always consistent with the row data in the table.

In the above technical solution, any cell of the table is represented by the value of the variable "nRow" and the value of the variable "nCol", and the position of the target cell in the cache data table is the intersection of the "nRow" row and the "FnCol-1" column; the step of changing the data in the cache data table based on the change of the table data includes: when the data in the target cell changes, if "nRow" is less than "m_nDataRows", the data at the corresponding position in the cache data table is updated by the data of the target cell; when "nRow" is greater than "m_nDataRows", a corresponding blank row is added to the cache data table, and then the data of the target cell is inserted into the corresponding position in the cache data table, and the "m_nDataRows" value of the cache data table is updated.

In this technical solution, any cell of the table is represented by the value of the variable "nRow" and the value of the variable "nCol", that is, the position of the target cell in the table can be located by the value of the variable "nRow" and the value of the variable "nCol", and the position of the target cell in the cache data table is the intersection of the "nRow" row and the "FnCol-1" column; thus, the cell is located. The step of changing the data in the cache data table based on the change of the table data includes: when the data in the target cell changes, if "nRow" is less than "m_nDataRows", it means that the number of rows of data in the buffer data table is greater than the number of rows of data in the table, so it is necessary to update the data at the corresponding position in the cache data table through the data of the target cell to achieve the correspondence between the number of rows of the cache data table and the table. When "nRow" is greater than "m_nDataRows", it means that the number of rows in the buffered data table is less than the number of rows in the table. Therefore, it is necessary to add a corresponding blank row in the cached data table, insert the data of the target cell at the corresponding position in the cached data table, and update the "m_nDataRows" value of the cached data table, so as to achieve the correspondence between the number of rows in the cached data table and the table. This achieves optimized management of memory, ensures that the number of tables in the cached data table matches the number of tables actually required in the table, and does not generate redundant tables.

In the above technical solution, when the reading or display instruction of the data of the preset row of table data is obtained, if the preset row is less than m_nDataRows, the data corresponding to the preset row will be retrieved from the cache data table and recorded or displayed in the preset row. If the preset row is greater than m_nDataRows, a null value is returned.

In this technical solution, when the read and display instructions of the preset row of table data are obtained, if the preset row is less than m_nDataRows, it means that there is data in the table that does not exist in the cache data table, so it is necessary to retrieve the data corresponding to the preset row from the cache data table and record or display it in the preset row. If the preset row is greater than m_nDataRows, it means that there is redundant data in the cache data table, so it is necessary to return the redundant data to a null value so that the cache data table is consistent with the data in the table.

In the above technical solution, the table processing device includes a cache data table interface for receiving external instructions. The table processing method includes: performing operations corresponding to the instructions on the data in the cache data table based on the external instructions received by the cache data table interface, and updating the data in the table after the operation is completed.

In the technical solution, the table processing device also includes a cache data table interface, which can accept external instructions. The table processing method includes: based on the external instructions received by the cache data table interface, the data of the cache data table is operated in accordance with the corresponding instructions, and the data of the table is updated after the operation is completed. Through the buffer data table interface, the data update between the cache data table and the table is realized, and then the table does not need to perform data processing, and the data processing is completely performed in the cache data table, thereby reducing the data processing time and improving the data processing efficiency.

In the above technical solution, the table processing device includes: a row data saving interface and a row data reading interface, through which the table data can be saved; through which the table data can be transmitted; and the cache data table is named ":memory:". Any cell of the table is compatible with any data type operation of char, string, int, double, CString; and/or corresponds to a write function at the same time, and can read multiple types of cell data for processing and use.

In this technical solution, the table processing device includes: a row data saving interface and a row data reading interface. Since the table does not process data, it is necessary to import the data in the table into the buffer data table or read the data in the buffer data table through the row data saving interface and the row data reading interface. By defining the row data saving interface and the row data reading interface, when reading and writing data, it can be read and saved according to the arrangement of rows, thereby realizing fast reading and writing of row data. The buffer data table is named ":memory:", thereby realizing the role of establishing a cache data table in memory. Any cell of the table is compatible with operations of any data type of char, string, int, double, and CString; and/or corresponds to a write function at the same time, and can read multiple types of cell data for processing and use, thereby improving the practicality of the table. At the same time, when processing data at the million and ten million levels, there is no need to use special algorithms for processing.

Furthermore, the row data saving interface is defined as void SetRowText(intnRow, vector<string>sTextArray); and/or the row data saving interface is defined as void SetRowText(intnRow, map<int, string>sTextArray); the row data reading interface is defined as vector<string>GetRowText(intnRow); and/or the row data reading interface is defined as vector<CString>GetRowString(int nRow). By defining different row data saving interfaces and row data reading interfaces, users can set different row data saving interfaces and row data reading interfaces as needed, thereby achieving matching with different processing devices and improving the applicability of the present application.

Additional aspects and advantages of the present invention will become apparent from the following description or may be learned by practice of the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and/or additional aspects and advantages of the present invention will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:

FIG1 is a schematic flow chart of a method for processing a table according to an embodiment of the present invention;

FIG2 is a schematic diagram of multiple types of cells of a table component according to an embodiment of the present invention;

FIG3 is a schematic diagram of loading a large amount of physical point data according to an embodiment of the present invention;

FIG4 is a schematic diagram of the time for loading a large amount of data according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of memory monitoring for loading large amounts of data according to an embodiment of the present invention.

Detailed ways

In order to more clearly understand the above-mentioned purpose, features and advantages of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.

In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention may also be implemented in other ways different from those described herein. Therefore, the protection scope of the present invention is not limited to the specific embodiments disclosed below.

The table processing method in some embodiments of the present invention is described below with reference to FIG. 1 to FIG. 5 .

The first embodiment of the present invention provides a table processing method. As shown in FIG1 , the table processing method includes:

S102: Generate a table.

S104: Create a cache data table corresponding to the table in the memory.

S106: The data in the table are stored in the cache data table accordingly, and the data in the cache data table is changed based on the change of the table data.

S108: When receiving the preset operation instruction in the table, perform a preset operation on the data in the cache data table based on the preset operation instruction, and update the data in the table with the data after performing the preset operation.

According to the table processing method provided by the present invention, it includes: establishing a table, which is an interface for displaying data and operating data. A cache data table corresponding to the table is established on the memory, which can read the data in the input table and store the data in the cache data table. The data in the table is stored in the cache data table, and the data in the cache data table is changed based on the change of the table data. When the data in the table is updated, the data in the cache data table will be updated, so that there is always a cache data table corresponding to the existing table data in the cache data table. Since the cache data table is set in the memory instead of the hard disk, the data processing speed is fast, no physical file is generated, and after the cache data table is closed, the memory occupied by the table can be automatically released. As shown in Figures 4 and 5, when processing millions or even tens of millions of data, the processing speed of the cache data table in the present application is faster, thereby meeting the demand for processing speed in millions or even tens of millions of data. When receiving the preset operation instruction in the table, the preset operation is performed on the data in the cache data table based on the preset operation instruction, and the data in the table is updated by the data after the preset operation is performed. When in use, the cache data table is updated first, and then the updated cache data table is updated to the table, so that the table can be read and accessed to realize the processing of the table data. Since the reading location of the table is often set in the hard disk, additional physical files are often generated when in use. At the same time, the processing speed of the hard disk is much lower than the processing speed of the memory, so the modification speed of the table is much lower than the modification speed of the cache data table. Therefore, except for filling the data of the table, the cache data table is used to access the table. When processing the data in the table, the data is modified by directly modifying the cache data table, and the modified data is updated to the table, so that the table does not need to process any data and only performs the functions of reading and accessing. As shown in FIG3 , in the petroleum exploration industry, there are often dedicated data processing software, but these data processing software is not strong in processing tables. After the data are transferred to the ordinary table, the ordinary table takes too long to process the data and cannot meet the use requirements. In addition, when executing each step of the operation, a large number of physical files will be generated due to the need to establish a cache in the hard disk, which further prolongs the processing time of the table. In this application, by directly setting the cache data table in the memory, the generation time and processing time of the cache data table are greatly reduced. And the data exported by the dedicated data processing software can be directly accepted to generate a table. Therefore, the processing difficulty of millions of data volumes is reduced, the processing time of the data is reduced, and at the same time, the data of the table exported by the dedicated data processing software can be received, and then the table data exported by the dedicated data processing software can be directly connected. The table can directly adopt the table form of the dedicated data processing software, thereby solving the problem that the ordinary table cannot recognize some data. At the same time, the processing capacity of the table is improved, and the problem of poor processing capacity of the dedicated data processing software for the table is solved.

In the above embodiment, when a preset operation instruction in a table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: after receiving a sorting instruction, the data in the cache data table is read out, and sorted according to the sorting method indicated by the sorting instruction, and the sorted data is saved as a sorting index table; after obtaining the sorting instruction from the table, the data in the table is updated based on the data in the sorting index table.

In this embodiment, when a preset operation instruction in a table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: after receiving the sorting instruction, the data in the buffer database is read out, and the data in the buffer database is sorted according to the sorting method indicated by the sorting instruction, and the sorted data in the cache data table is updated to the table, thereby realizing the sorting of the table. Since there is no need to directly process the data in the table, it is achieved that there is no need to directly process the table, and the table only needs to read the data, so that the table does not need to generate additional physical files, thereby improving the sorting speed when sorting the table and reducing the sorting time.

In the above embodiment, when a change process is received for table data, a change index table corresponding to the change process is established in sequence in the cache data table. When a preset operation instruction is received in the table, a preset operation is performed on the data in the cache data table based on the preset operation instruction. The step of updating the data in the table with the data after performing the preset operation includes: when a preset operation instruction is received in the table, a corresponding change index table is searched in the cache data table based on the preset operation instruction, and the data in the table is updated using the data in the found change index table.

In this embodiment, when a change process for table data is received, a change index table corresponding to the change process is established in sequence in the cache data table. When a preset operation instruction in the table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the step of updating the data in the table by the data after performing the preset operation includes: when the preset instruction of the table is received, the corresponding change index table is found according to the preset instruction, the data in the change index table is the table data formed after executing the preset instruction, and the table data is changed to the data in the change index table, thereby realizing the execution function of the preset instruction. By finding the corresponding change index table, the preset instruction can be realized without directly controlling the data in the table but directly controlling the data in the cache data table in the memory, thereby improving the processing speed of the preset instruction.

Specifically, as shown in Figure 2, the variable "m_nCurTable" is defined as the data table index for storing the current table, and "m_nCurTable--" is defined as the data table index for storing the previous step of the current table. The preset operation instructions include undo instructions and redo instructions. When the undo instruction is received, the data of the table is updated according to the data table corresponding to "m_nCurTable--", and "m_nCurTable--" is redefined as "m_nCurTable"; "m_nCurTable++" is defined as the data table index for the next step of "m_nCurTable". When the redo instruction is received, the data of the table is updated according to the data table corresponding to "m_nCurTable++", and "m_nCurTable++" is redefined as "m_nCurTable".

In this embodiment, as shown in FIG2 , the variable “m_nCurTable” is first defined as the data table index storing the current table data, and “m_nCurTable--” is defined as the data table index storing the previous step of the current table, and “m_nCurTable++” is defined as the data table index of the next step of “m_nCurTable”. The preset operation instructions include undo instructions and redo instructions. When the undo instruction is received, the data table index “m_nCurTable--” of the previous step of the current data table is matched, and then the data table corresponding to “m_nCurTable--” is read, and the table is updated according to the data table corresponding to “m_nCurTable--”, and “m_nCurTable--” is redefined as “m_nCurTable”, so as to implement the undo instruction. When receiving the redo instruction, the data table index "m_nCurTable++" of the next step of the current data table is matched, and then the data table corresponding to "m_nCurTable--" is read, and the table is updated according to the data table corresponding to "m_nCurTable++", and "m_nCurTable++" is redefined as "m_nCurTable", so as to implement the redo instruction. The undo instruction and the redo instruction in this application directly read the information in the cache data table instead of modifying the data in the table. Therefore, when the amount of data is in the millions or even tens of millions, the amount of data to be processed becomes smaller, thereby improving the processing speed of the undo instruction and the redo instruction.

In the above embodiment, each column of the cache data table is represented by the variable F%d, %d is equal to the total number of columns minus 1, and the total number of columns of the cache data table is the value of the variable m_nCols; the number of columns of the cache data table is consistent with the number of columns of the table, and a column object is established in the cache data table for each column of the table; the rows of the cache data table are set with two variables nRows and m_nDataRows. When "nRows" is less than "m_nDataRows", the records after nRows in the cache data table are deleted, the "m_nDataRows" value is updated, and the number of rows of the table is set.

In this embodiment, as shown in FIG. 2 , by defining the columns in the buffer data table through F%d, %d is equal to the value of the total number of columns minus 1, and the total number of columns in the buffer data table is defined as the value of m_nCols, the number of columns in the buffer data table is consistent with the number of columns in the table, and a column object is set for each column in the table in the cache data table, so that the data in the cache data table can correspond to the data in the table. Similarly, the rows of the cache data table are set with two variables nRows and m_nDataRows. When "nRows" is less than "m_nDataRows", the records after nRows in the cache data table are deleted, the "m_nDataRows" value is updated, and the number of rows of the table is set, so that the row data in the cache data table is always consistent with the row data in the table.

In the above embodiment, as shown in Figure 2, any cell of the table is represented by the value of the variable "nRow" and the value of the variable "nCol", and the position of the target cell in the cache data table is the intersection of the "nRow" row and the "FnCol-1" column; the step of changing the data in the cache data table based on the change of the table data includes: when the data in the target cell changes, if "nRow" is less than "m_nDataRows", the data at the corresponding position in the cache data table is updated by the data of the target cell; when "nRow" is greater than "m_nDataRows", a corresponding blank row is added to the cache data table, and then the data of the target cell is inserted into the corresponding position in the cache data table, and the "m_nDataRows" value of the cache data table is updated.

In this embodiment, any cell of the table is represented by the value of the variable "nRow" and the value of the variable "nCol", that is, the position of the target cell in the table can be located by the value of the variable "nRow" and the value of the variable "nCol", and the position of the target cell in the cache data table is the intersection of the "nRow" row and the "FnCol-1" column; thereby, the cell is located. The step of changing the data in the cache data table based on the change of the table data includes: when the data in the target cell changes, if "nRow" is less than "m_nDataRows", it means that the number of rows of data in the buffer data table is greater than the number of rows of data in the table, so it is necessary to update the data at the corresponding position in the cache data table through the data of the target cell to achieve the correspondence between the number of rows of the cache data table and the table. When "nRow" is greater than "m_nDataRows", it means that the number of rows in the buffered data table is less than the number of rows in the table. Therefore, it is necessary to add a corresponding blank row in the cached data table, insert the data of the target cell at the corresponding position in the cached data table, and update the "m_nDataRows" value of the cached data table, so as to achieve the correspondence between the number of rows in the cached data table and the table. This achieves optimized management of memory, ensures that the number of tables in the cached data table matches the number of tables actually required in the table, and does not generate redundant tables.

In the above embodiment, as shown in Figure 2, when the read or display instruction of the data of the preset row of the table data is obtained, if the preset row is less than m_nDataRows, the data corresponding to the preset row will be retrieved from the cache data table and recorded or displayed in the preset row. If the preset row is greater than m_nDataRows, a null value is returned.

In this embodiment, when the read and display instructions of the preset row of table data are obtained, if the preset row is less than m_nDataRows, it means that there is data in the table that does not exist in the cache data table, so it is necessary to retrieve the data corresponding to the preset row from the cache data table and record or display it in the preset row. If the preset row is greater than m_nDataRows, it means that there is redundant data in the cache data table, so it is necessary to return the redundant data to a null value so that the cache data table is consistent with the data in the table.

In the above embodiment, the table processing device includes a cache data table interface for receiving external instructions. The table processing method includes: performing operations corresponding to the instructions on the data of the cache data table based on the external instructions received by the cache data table interface, and updating the data of the table after the operation is completed.

In this embodiment, the table processing device also includes a cache data table interface, which can accept external instructions. The table processing method includes: based on the external instructions received by the cache data table interface, the data of the cache data table is operated according to the corresponding instructions, and the data of the table is updated after the operation is completed. Through the buffer data table interface, the data update between the cache data table and the table is realized, and then the table does not need to perform data processing, and the data processing is completely performed in the cache data table, thereby reducing the data processing time and improving the data processing efficiency.

In the above embodiment, the table processing device includes: a row data saving interface and a row data reading interface, through which the table data can be saved; through which the table data can be transmitted; and the cache data table is named ":memory:". Any cell of the table is compatible with any data type operation of char, string, int, double, CString; and/or corresponds to a write function at the same time, and can read multiple types of cell data for processing and use.

In this embodiment, the table processing device includes: a row data saving interface and a row data reading interface. Since the table does not perform data processing, it is necessary to import the data in the table into the buffer data table or read the data in the buffer data table through the row data saving interface and the row data reading interface. By defining the row data saving interface and the row data reading interface, when reading and writing data, it can be read and saved according to the arrangement of rows, thereby realizing fast reading and writing of row data. The buffer data table is named ":memory:", thereby realizing the role of establishing a cache data table in memory. Any cell of the table is compatible with operations of any data type in char, string, int, double, and CString; and/or corresponds to a write function at the same time, and can read multiple types of cell data for processing and use, thereby improving the practicality of the table. At the same time, when processing data in the millions and tens of millions, there is no need to use special algorithms for processing.

Furthermore, the row data saving interface is defined as void SetRowText(intnRow, vector<string> sTextArray); and/or the row data saving interface is defined as void SetRowText(intnRow, map<int, string> sTextArray); the row data reading interface is defined as vector<string> GetRowText(intnRow); and/or the row data reading interface is defined as vector<CString> GetRowString(intnRow). By defining different row data saving interfaces and row data reading interfaces, users can set different row data saving interfaces and row data reading interfaces as needed, thereby achieving matching with different processing devices and improving the applicability of the present application.

In this specification, the term "plurality" means two or more than two, unless otherwise clearly defined. The terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense. For example, "connected" can be a fixed connection, a detachable connection, or an integral connection; "connected" can be a direct connection or an indirect connection through an intermediate medium. For those of ordinary skill in the art, the specific meanings of the above terms in the present invention can be understood according to the specific circumstances.

In the description of this specification, the description of the terms "one embodiment", "some embodiments", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

The above are only preferred embodiments of the present invention and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims (10)

1. A table processing method, characterized by comprising: Generate a table; Establishing a cache data table corresponding to the table in the memory; The data in the table are stored in the cache data table accordingly, and the data in the cache data table are changed based on the change of the table data; When a preset operation instruction in the table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the data in the table is updated by the data after the preset operation is performed. 2. The table processing method according to claim 1, characterized in that the step of performing a preset operation on the data in the cache data table based on the preset operation instruction upon receiving the preset operation instruction in the table, and updating the data in the table by the data after performing the preset operation comprises: After receiving the sorting instruction, the data in the cache data table is read out, and sorted according to the sorting method indicated by the sorting instruction, and the sorted data is saved as a sorting index table; After the sorting instruction is obtained from the table, the data in the table is updated based on the data in the sorting index table. 3. The table processing method according to claim 1 is characterized in that, when a change process to the table data is received, a change index table corresponding to the change process is sequentially established in the cache data table, and when a preset operation instruction in the table is received, a preset operation is performed on the data in the cache data table based on the preset operation instruction, and the data in the table is updated by the data after the preset operation is performed, the step comprises: When the preset operation instruction in the table is received, the corresponding change index table is searched in the cache data table based on the preset operation instruction, and the data in the table is updated using the data in the searched change index table. 4. The table processing method according to claim 3, characterized in that: Define the variable "m_nCurTable" as the data table index for storing the current table. "m_nCurTable--" is defined as storing the previous data table index of the current table. The preset operation instructions include undo instructions and redo instructions. When the cancellation instruction is received, the data of the table is updated according to the data table corresponding to the "m_nCurTable--", and the "m_nCurTable--" is redefined as the "m_nCurTable"; Define "m_nCurTable++" as the next data table index of the "m_nCurTable". When the redo instruction is received, update the data of the table according to the corresponding data table of the "m_nCurTable++", and redefine the "m_nCurTable++". 5. The table processing method according to any one of claims 1 to 4, characterized in that: Each column of the cache data table is represented by a variable F%d, where %d is equal to the total number of columns minus 1, and the total number of columns of the cache data table is the value of the variable m_nCols; The number of columns of the cache data table is consistent with the number of columns of the table, and a column object is established in the cache data table for each column of the table; The rows of the cache data table are set with two variables nRows and m_nDataRows. When "nRows" is less than "m_nDataRows", the records after nRows in the cache data table are deleted, the value of "m_nDataRows" is updated, and the number of rows of the table is set. 6. The table processing method according to claim 5, characterized in that: Any cell of the table is represented by the value of the variable "nRow" and the value of the variable "nCol", and the position of the target cell in the cache data table is the intersection of the row "nRow" and the column "FnCol-1"; The step of changing the data in the cache data table based on the change of the table data includes: When the data in the target cell changes, if "nRow" is less than "m_nDataRows", the data at the corresponding position in the cache data table is updated by the data in the target cell; When "nRow" is greater than "m_nDataRows", a corresponding blank row is added to the cache data table, and then the data of the target cell is inserted into the corresponding position in the cache data table, and the "m_nDataRows" value of the cache data table is updated. 7. The table processing method according to claim 5, further comprising: When an instruction to read or display data of a preset row of table data is obtained, if the preset row is less than m_nDataRows, the data corresponding to the preset row will be retrieved from the cache data table and recorded or displayed in the preset row; if the preset row is greater than m_nDataRows, a null value will be returned. 8. The table processing method according to any one of claims 1 to 7, characterized in that the table processing device comprises a cache data table interface for receiving external instructions, and the table processing method comprises: Based on the external instruction received by the cache data table interface, an operation corresponding to the instruction is performed on the data in the cache data table, and the data in the table is updated after the operation is completed. 9. A table processing method according to any one of claims 1 to 7, characterized in that the table processing device comprises: a row data saving interface and a row data reading interface, through which the data of the table can be saved; and through which the data of the table can be transmitted. 10. The table processing method according to any one of claims 1 to 7, characterized in that: Name the cache data table ":memory:"; Any cell of the table is compatible with any data type operation of char, string, int, double, CString; and/or At the same time, corresponding to the write function, various types of cell data can be read for processing.