A data storage method and device based on data storage type tvariant

Abstract

The invention discloses a data storage method and device based on a data storage type TVariant. The method comprises the steps that the type to which to-be-stored data belongs is judged; when the to-be-stored data belongs to a known subdata type, the to-be-stored data is stored according to the known subdata type; when the to-be-stored data belongs to a dynamic subdata type, the to-be-stored datais sequenced as sequenced data, and the sequenced data is stored; occupied space of the data storage type is dynamically adjusted according to the data storage situation, and when there is data needing to be stored, the current length of the data storage type is increased according to the length of the data; the attribute of the occupied space of the storage type is a local variable; the number ofmembers of the data storage type is adjusted, dynamic adjustment is conducted according to the data storage situation, and when there is data needing to be stored, new members are added in the data storage type; the data stored according to the data storage type is uniformly stored in a data container.

Description

technical field [0001] The present invention relates to the field of data storage, in particular to a data storage method based on the data storage type TVariant, which is applicable to the development scenario of C++-based data storage and access. Background technique [0002] When using C++11 for functional development, it is usually necessary to store different types of data in the same data container (std::vector, std::map, std::list, std::set, etc.), and In a usage scenario, under the condition of not caring about the data type, in order to achieve the purpose of "improving development efficiency, improving engineering maintainability, and improving function operation efficiency", unified management and access are carried out. [0003] In the prior art, there are data storage types, but usually only the same type of data can be stored in traditional data storage types. Cups can be placed, and regardless of whether cups are placed, the number of boxes is always 5. [0...

AI Technical Summary

Problems solved by technology

Among them, COM is a code library, _VaFiant_t is a data storage type in the code library COM, and boost is another code library, and Variant is a data storage type in the code library boost. The disadvantage is: every time How many boxes must be defined first, and when the number of boxes needs to be changed, it must be redefined, resulting in an increase in the amount of code