CN113535206A - Multi-version code upgrading method and system - Google Patents
Multi-version code upgrading method and system Download PDFInfo
- Publication number
- CN113535206A CN113535206A CN202110836701.9A CN202110836701A CN113535206A CN 113535206 A CN113535206 A CN 113535206A CN 202110836701 A CN202110836701 A CN 202110836701A CN 113535206 A CN113535206 A CN 113535206A
- Authority
- CN
- China
- Prior art keywords
- code
- version
- modification
- modified
- file
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 64
- 238000012986 modification Methods 0.000 claims abstract description 180
- 230000004048 modification Effects 0.000 claims abstract description 180
- 230000008569 process Effects 0.000 claims abstract description 20
- 238000012217 deletion Methods 0.000 claims description 19
- 230000037430 deletion Effects 0.000 claims description 19
- 238000005457 optimization Methods 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 9
- 238000012552 review Methods 0.000 abstract description 5
- 238000010586 diagram Methods 0.000 description 10
- 238000005516 engineering process Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/65—Updates
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
- G06F8/71—Version control; Configuration management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application discloses a multi-version code upgrading method, which comprises the following steps: setting a path and an initial priority of each version code file; setting modification priorities corresponding to various modification types; comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version; and determining the optimal modification result of each code line according to the initial priority corresponding to the code file of each modified version and the modification priority corresponding to each modification type, so as to obtain the code file of the final optimized version. The application also discloses a multi-version code upgrading system, an electronic device and a computer readable storage medium. Therefore, the load of manual code review in the code version iteration process can be effectively reduced, and the time cost and the error probability when the code files of multiple versions are upgraded are reduced.
Description
Technical Field
The present application relates to the field of code upgrading technologies, and in particular, to a method, a system, an electronic device, and a computer-readable storage medium for upgrading multi-version codes.
Background
With the popularization and development of computer technology, users often need to upgrade multi-version codes on electronic devices, input methods have become important tools for interaction between users and electronic devices, and users in different professional fields, different interests and use habits have higher and higher requirements on intelligence of input modes.
Currently, the mainstream code version management tools in the market are Git, Svn and the like, and the version management tools provide a simple management content synchronization function, for example, when a local version is compared with a server version, a conflict is prompted when the local modification conflicts with the server modification, and automatic combination is performed when no conflict exists.
However, the drawback of this version management tool is that only two versions are merged or synchronized, and effective synchronization cannot be achieved for multi-version codes larger than two.
It should be noted that the above-mentioned contents are not intended to limit the scope of protection of the application.
Disclosure of Invention
The present application mainly aims to provide a method, a system, an electronic device and a computer-readable storage medium for upgrading multi-version codes, and aims to solve the problem of how to perform quick and effective merging and upgrading when the code versions are many.
In order to achieve the above object, an embodiment of the present application provides a multi-version code upgrading method, where the method includes:
Setting a path and an initial priority of each version code file;
setting modification priorities corresponding to various modification types;
comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version; and
and determining the optimal modification result of each code line according to the initial priority corresponding to the code file of each modified version and the modification priority corresponding to each modification type, so as to obtain the code file of the final optimized version.
Optionally, after setting modification priorities corresponding to various modification types, the method further includes:
setting additional priority for the modified content meeting the preset condition;
and when the optimal modification result of each code line is determined, carrying out comprehensive judgment according to the initial priority corresponding to the code file of each version, the modification priority corresponding to each modification type and the additional priority.
Optionally, the modification types include an addition modification, a content modification, and a deletion modification.
Optionally, the comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modification type of each code line in the code file of each modified version includes:
Traversing all files in the code file of the oldest original version, opening the files and acquiring code line contents;
and comparing the code file of each modified version with the code file of the oldest original version under the same path to obtain the specific modified content and modified type of the code file of the modified version aiming at the code lines by calculating the similarity between each code line in the two files through the longest common subsequence algorithm.
Optionally, the determining an optimal modification result of each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type includes:
judging whether the code file of each modified version has modification on the current code line;
when only one modified version of the code file modifies the current code line, using the specific modification content of the modified version of the code file on the current code line as the optimal modification result of the current code line;
when a plurality of modified versions of code files modify the current code line, respectively calculating the priority of each modified version, wherein the priority comprises the initial priority plus the modified priority, and the specific modified content of the code file of the modified version with the highest priority to the current code line is used as the optimal modified result of the current code line.
Optionally, the determining the optimal modification result of each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type further includes:
and when the current code line is modified by the code files of the multiple modified versions and the priorities are the same, prompting a user to manually process the conflict content, and obtaining the optimal modification result of the current code line according to the processing result of the user.
Optionally, before comparing each code line in each modified version of the code file with the oldest original version of the code file, the method further comprises:
setting a file type needing content synchronization through a suffix name;
in each modified version of the code file and the oldest original version of the code file, performing a step of comparing each line of code for the file of the file type;
and judging a modification result by comparing the MD5 codes of the files aiming at the files which are not in the file types, and determining the optimal modification result of the files according to the initial priority corresponding to the code files of each modified version.
In addition, to achieve the above object, an embodiment of the present application further provides a multi-version code upgrading system, where the system includes:
The setting module is used for setting the path and the initial priority of each version code file and setting the modification priority corresponding to various modification types;
the comparison module is used for comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version;
and the optimization module is used for determining the optimal modification result of each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type, so as to obtain the code file of the final optimized version.
In order to achieve the above object, an embodiment of the present application further provides an electronic device, including: the system comprises a memory, a processor and a multi-version code upgrading program which is stored on the memory and can run on the processor, wherein when the multi-version code upgrading program is executed by the processor, the multi-version code upgrading method is realized.
To achieve the above object, an embodiment of the present application further provides a computer-readable storage medium, on which a multi-version code upgrade program is stored, and when executed by a processor, the multi-version code upgrade program implements the multi-version code upgrade method as described above.
The multi-version code upgrading method, the multi-version code upgrading system, the electronic device and the computer readable storage medium provided by the embodiment of the application can analyze the modification type and the priority of each code line between versions according to a preset synchronization strategy by increasing the comparison among the code files of the versions, give an optimal modification result, and automatically merge and upgrade to obtain a finally optimized code file. The method can effectively reduce the burden of manual code review in the code version iteration process, and reduce the time cost and the error probability when upgrading the code files of a plurality of versions.
Drawings
FIG. 1 is a diagram of an application environment architecture in which various embodiments of the present application may be implemented;
FIG. 2 is a flowchart of a multi-version code upgrading method according to a first embodiment of the present application;
FIG. 3 is a schematic diagram of an operation interface for setting paths of various versions of code files;
FIG. 4 is a schematic view of an operation interface for setting priorities;
FIG. 5 is a detailed flowchart of step S204 in FIG. 2;
FIG. 6 is a detailed flowchart of step S206 in FIG. 2;
FIG. 7 is a schematic view of a conflict handling interface;
FIG. 8 is a flowchart of a multi-version code upgrading method according to a second embodiment of the present application;
Fig. 9 is a schematic hardware architecture diagram of an electronic device according to a third embodiment of the present application;
fig. 10 is a block diagram of a multi-version code upgrade system according to a fourth embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the descriptions relating to "first", "second", etc. in the embodiments of the present application are only for descriptive purposes and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a diagram illustrating an application environment architecture for implementing various embodiments of the present application. The present application is applicable in application environments including, but not limited to, client 2, server 4, network 6.
The client 2 is configured to display an operation interface to a user and receive an operation of the user, for example, when an automatic upgrade conflicts (a plurality of modified versions of a code file all modify a current code line and have the same priority), prompt the user to manually process conflict contents and receive a processing result of the user. The client 2 may be a terminal device such as a PC (Personal Computer), a mobile phone, a tablet Computer, and a portable Computer.
The server 4 is used for realizing automatic merging and upgrading of a plurality of version code files.
The existing version management tool has the defects that only two versions are merged or synchronized, and effective synchronization cannot be achieved for multi-version codes larger than two versions. Particularly, when a code provider gives different version codes in batches and a code receiver has own modification optimization for each version code, the previous version optimization code needs to be inherited in the received new version code, and the existing version management tool cannot realize the inheritance. For example, in the process of game localization, codes need to be modified in the optimization process from the first version of the Japanese to the first version of the my, and then when the Japanese is localized to the second version of the my after the second version, the problem of the original first version still exists in the second version and repeated optimization is needed. When the versions are more, the modified contents are too much and too miscellaneous, and the comparison and optimization are required to be repeated from the first version to the Nth version each time.
If the multi-version codes are combined through manual operation, a large amount of time is spent on comparing the difference of the codes at the same positions of the versions, then the combination scheme is determined again through the comparison result, and the error probability is extremely high through long-time visual observation. In addition, the version conflict rules of the existing version management tools are generally given, and users cannot customize the rules.
In each embodiment of the present application, the server 4 analyzes the modification type and priority of each code line between versions according to a preset synchronization policy (various priorities and other policies can be designed by user), gives an optimal modification result, and automatically merges and upgrades to obtain a finally optimized code file by increasing the comparison between code files of the versions.
The server 4 may be a rack server, a blade server, a tower server, a cabinet server, or other computing devices, may be an independent server, or may be a server cluster formed by a plurality of servers.
The network 6 may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a Global System of Mobile communication (GSM), Wideband Code Division Multiple Access (WCDMA), a 4G network, a 5G network, Bluetooth (Bluetooth), Wi-Fi, and the like. The server 4 and one or more clients 2 are connected through the network 6 for data transmission and interaction.
Example one
Fig. 2 is a flowchart of a multi-version code upgrading method according to a first embodiment of the present application. It is to be understood that the flow charts in the embodiments of the present method are not intended to limit the order in which the steps are performed. Some steps in the flowchart may be added or deleted as desired. The method will be described below with the server 4 as an execution subject.
The method comprises the following steps:
s200, setting the path and the initial priority of each version code file.
For example, a path of an oldest code file of an original version (original version old) provided by a code provider, a path of a newest code file of an original version (original version new) provided by a code provider, a path of each optimized version (optimized version N, for example, a certain game original version is a japanese version, and an optimized version may include a uniform version, a korean uniform version, a national uniform version, and the like) obtained by a code receiver performing optimization based on the oldest code file of the original version, and a path of a final optimized version (optimized version new, original content is new, and optimized content in each optimized version is provided) (initial path content is empty).
Fig. 3 is a schematic diagram of an operation interface for setting paths of code files of different versions in this embodiment. Wherein, the "optimized version path" may correspond to the optimized version N, and N paths are set. Paths can be added by clicking plus signs in an interface, one path is added at each time, and simultaneously, the paths can also be directly edited, and a plurality of paths are separated by using marks, such as: xxxxx 1; xxxxx 2; xxxxx 3. It is worth noting that the content under the "optimized version new path" needs to be empty to use at this time.
The initial priority of each version of code file is mainly the initial priority corresponding to each code file in the original version new and the optimized version N. And the code file of each optimized version in the optimized versions N corresponds to an initial priority of the code file.
Fig. 4 is a schematic diagram of an operation interface for setting priority in this embodiment. In fig. 4, the Original _ base _ priority represents the new initial priority of the Original version, and the Optimized _ base _ priority (or Optimized _ base _ priority _ N) represents the initial priority of the Optimized version N. The initial priority of the optimized version N can be filled in by clicking a plus sign in an interface, and meanwhile, the initial priority can be directly edited and separated by a part number, such as: 0; 0; 0. if a certain optimized version does not set the corresponding priority, the default is the priority set in the old version of the original version (if all the priorities are not set, the default is 0).
S202, setting modification priorities corresponding to various modification types.
The modification types include a new addition modification (a code line added with respect to the old original version), a content modification (a code line modified with respect to the old content of the original version), and a deletion modification (a code line deleted with respect to the old original version). Thus, the modification priorities include a priority of an newly added modification, a priority of a content modification, and a priority of a deletion modification.
In addition, the embodiment may also set an additional priority for the modified content meeting the preset condition. The additional priority is used for specific content usage, e.g. for code content that is or is not required, by means of which the content usage order can be controlled. The use mode of the additional priority is to judge whether the modified content of the current code line meets the preset condition, if so, the corresponding additional priority is a preset value, and the preset value is usually infinity or infinitesimal; and if not, the additional priority is 0.
For example, in fig. 4, Content _ modification _ priority represents the priority of Content modification, Content _ add _ priority represents the priority of newly-added modification, and Content _ del _ priority represents the priority of deletion modification. In addition, the appendix _ priority represents the additional priority, and the plus button corresponding to the appendix _ priority in the interface can be clicked to fill and write specific contents in the popped setting frame.
The significance of the priority is that when the code files of the two versions conflict with the modified content of the same code line, the modified content with high priority can be used as the optimal modified result, and the modified content with low priority can be abandoned in the finally obtained code file of the optimized version. The size of each priority may be determined according to the code synchronization requirement, for example, the newer version corresponds to the higher initial priority. For another example, assuming that the deletion modification needs to be preferentially used, the priority of the deletion modification is set to be greater than the priority of the content modification.
In a preferred embodiment, the setting of the priority can also ensure that the absolute value of the priority of the optimized version N minus the new priority of the original version is less than any one of the priority values of the new modification, the priority of the content modification and the priority of the deletion modification.
S204, comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line in the code file of each modified version.
After the setting is completed, in order to obtain the code file of the final optimized version, the code file of each modified version (the original version new and the optimized version N) needs to be compared with the code file of the oldest original version (the original version old) to find out the modified content of the code file of each modified version. And respectively finding the corresponding code lines of the same file under the same path in the code file of each modified version aiming at each code line in all files in the code file of the oldest original version, and comparing the content line by line.
Specifically, further refer to fig. 5, which is a schematic view of the detailed flow of step S204. It is to be understood that the flow chart is not intended to limit the order in which the steps are performed. Some steps in the flowchart may be added or deleted as desired. In this embodiment, the step S204 specifically includes:
s2040, traversing all files in the code file of the oldest original version, opening the files and acquiring code line contents.
S2042, comparing the code file of each modified version with the code file of the oldest original version under the same path, and calculating the similarity between each code line in the two files by an LCS (Longest Common Subsequence) algorithm to obtain the specific modified content and modified type of the code line of the code file of the modified version.
In this embodiment, the content similarity of a code line is not based on letters, but is based on words, for example, two code lines of int temp ═ 100 and ptrTemp- > Func () have a similarity of 0 based on words, because the word temp and the word ptrTemp are different. The LCS algorithm calculates the similarity of two code lines by calculating the length of the maximum common substring in the two code lines divided by the maximum length in the two code lines, for example, the similarity of the code lines abcde1 and abcdef2 is 5/7.
By adopting the LCS algorithm, the specific modification content can be obtained by comparing words of two code lines, and the modification type can be obtained by the similarity. The new modification with the similarity of 100%, the content modification with the similarity of more than 0 and less than 100%, and the deletion modification with the similarity of 0 are included.
S206, determining the optimal modification result of each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type, and obtaining the code file of the final optimized version.
Specifically, further refer to fig. 6, which is a schematic view of the detailed flow of step S206. It is to be understood that the flow chart is not intended to limit the order in which the steps are performed. Some steps in the flowchart may be added or deleted as desired. In this embodiment, the step S206 specifically includes:
s2060, judging whether the code file of each modified version has modification to the current code line.
S2062, when only one modified version code file has modification to the current code line, the specific modification content of the modified version code file to the current code line is used as the optimal modification result of the current code line.
That is, if the code file of only one of the new and optimized versions N of the original version is modified with respect to the current code line of the old original code, the specific modified content of the version may be directly used as the optimal modified result of the current code line.
S2064, when a plurality of modified versions of code files modify the current code line, the priority of each modified version is respectively calculated, and the specific modified content of the code file of the modified version with the highest priority to the current code line is used as the optimal modified result of the current code line.
If the code files of multiple versions in the new and optimized versions N of the original code are modified relative to the old current code line of the original code, the specific modified content of which version is used as the optimal modified result of the current code line needs to be selected by priority.
In this embodiment, the priority includes the initial priority plus the modified priority. For example, when the original version is new and has a modification to the current code line of the old original version, the priority is the new initial priority of the original version plus the modification priority corresponding to the modified modification type.
In addition, when an additional priority is set, comprehensive judgment needs to be performed according to the initial priority corresponding to each version of the code file, the modification priority corresponding to each modification type, and the additional priority, that is, the priority includes the initial priority plus the modification priority plus the additional priority.
It should be noted that, in a preferred embodiment, when a plurality of modified versions of the code file all modify the current code line and have the same priority (conflict occurs), the user may be prompted to manually process the conflict content, and an optimal modification result is obtained according to the processing result of the user.
For example, fig. 7 is a schematic diagram of a conflict handling interface in this embodiment. In fig. 7, a plurality of display areas are included, which mainly include a modified version area and an original version old area, and respectively display modified contents of the current code line by the code files of the plurality of modified versions in which a conflict occurs, and original contents of the current code line in the original version old. When the modified version area is clicked, the details of each modified version are shown below.
In this embodiment, after the code lines (the parts without conflict) are automatically merged and upgraded by adopting the above steps, the parts with conflicts are prompted to the user for manual processing. The original exception content (the content of the code line in the old original version), the original modification content (the content of the code line in the new original version) and the optimized modification content (the content of the code line in each optimized version N) of each code line with conflict can be displayed for the user, and the user is prompted to select a final optimal modification result or to perform manual modification. And marking that the processing is finished after the user processes one code line, and processing the next abnormal record (the next code line with conflict) until all the abnormal records are processed. And generating a code file of a final optimized version after all exception handling is finished.
The multi-version code upgrading method provided by this embodiment may analyze the modification type and priority of each code line between versions according to a preset synchronization policy (various priorities and other policies may be designed by self-definition) by increasing the comparison between code files of each version, give an optimal modification result, and automatically merge and upgrade to obtain a finally optimized code file. The method can effectively reduce the burden of manual code review in the code version iteration process, and reduce the time cost and the error probability when upgrading the code files of a plurality of versions.
Example two
Fig. 8 is a flowchart of a multi-version code upgrading method according to a second embodiment of the present application. In the second embodiment, the multi-version code upgrading method further includes steps S304-S306 and S312-S314 on the basis of the first embodiment. It is to be understood that the flow charts in the embodiments of the present method are not intended to limit the order in which the steps are performed. Some steps in the flowchart may be added or deleted as desired.
The method comprises the following steps:
s300, setting the path and the initial priority of each version code file.
For example, a path of an oldest code file of an original version (original version old) provided by a code provider, a path of a newest code file of an original version (original version new) provided by a code provider, a path of each optimized version (optimized version N, for example, a certain game original version is a japanese version, and an optimized version may include a uniform version, a korean uniform version, a national uniform version, and the like) obtained by a code receiver performing optimization based on the oldest code file of the original version, and a path of a final optimized version (optimized version new, original content is new, and optimized content in each optimized version is provided) (initial path content is empty).
The initial priority of each version of code file is mainly the initial priority corresponding to each code file in the original version new and the optimized version N. And the code file of each optimized version in the optimized versions N corresponds to an initial priority of the code file.
S302, setting modification priorities corresponding to various modification types.
The modification types include a new addition modification (a code line added with respect to the old original version), a content modification (a code line modified with respect to the old content of the original version), and a deletion modification (a code line deleted with respect to the old original version). Thus, the modification priorities include a priority of an newly added modification, a priority of a content modification, and a priority of a deletion modification.
In addition, the embodiment may also set an additional priority for the modified content meeting the preset condition. The additional priority is used for specific content usage, e.g. for code content that is or is not required, by means of which the content usage order can be controlled. The use mode of the additional priority is to judge whether the modified content of the current code line meets the preset condition, if so, the corresponding additional priority is a preset value, and the preset value is usually infinity or infinitesimal; and if not, the additional priority is 0.
The significance of the priority is that when the code files of the two versions conflict with the modified content of the same code line, the modified content with high priority can be used as the optimal modified result, and the modified content with low priority can be abandoned in the finally obtained code file of the optimized version. The size of each priority may be determined according to the code synchronization requirement, for example, the newer version corresponds to the higher initial priority. For another example, assuming that the deletion modification needs to be preferentially used, the priority of the deletion modification is set to be greater than the priority of the content modification.
In a preferred embodiment, the setting of the priority can also ensure that the absolute value of the priority of the optimized version N minus the new priority of the original version is less than any one of the priority values of the new modification, the priority of the content modification and the priority of the deletion modification.
S304, setting the file type needing content synchronization through a suffix name.
In this embodiment, subsequent synchronization processes will synchronize using line-by-line content comparison (i.e., comparing each code line) for the set file type, while the remaining files will synchronize in resource file comparison (i.e., comparing the MD5 code of the entire file).
For example, these file types with suffix names of. cpp,. css,. html,. java, and. mm may be set for content synchronization.
S306, obtaining each file in the code file of the oldest original version and judging whether the file belongs to the set file type. When the file belongs to the set file type, steps S308-S310 are performed. When the file does not belong to the set file type, steps S312-S314 are performed.
And when comparing and synchronizing, based on the code file of the oldest original version, traversing each file in the code file of the oldest original version, and judging whether the current file belongs to the set file type. If the file type belongs to the set file type, the synchronization is carried out by using a line-by-line content comparison mode, otherwise, the synchronization is carried out by using a resource file comparison mode.
S308, comparing each code line of the file in the code file of each modified version with each code line of the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version.
In order to obtain the code file of the final optimized version, the code file of each modified version (the original version new and the optimized version N) needs to be compared with the code file of the oldest original version (the original version old) to find out the modified content of the code file of each modified version. And respectively finding the corresponding code lines of the same file under the same path in the code file of each modified version aiming at each code line in all files in the code file of the oldest original version, and comparing the content line by line.
The specific content of this step refers to the description in the first embodiment, and is not described herein again.
S310, determining the optimal modification result of each code line according to the initial priority corresponding to the code file of each modified version and the modification priority corresponding to each modification type, and obtaining the final optimized version of the file.
After the specific modified content and the modified type of each modified version of the code file for each code line are obtained according to the content comparison line by line in the previous step, whether the code file of each modified version has modification on the current code line is judged. When only one modified version of the code file modifies the current code line, using the specific modification content of the modified version of the code file on the current code line as the optimal modification result of the current code line. When a plurality of modified versions of code files modify the current code line, the priority of each modified version is calculated respectively, and the specific modified content of the code file of the modified version with the highest priority to the current code line is used as the optimal modified result of the current code line.
The specific content of this step refers to the description in the first embodiment, and is not described herein again.
S312, comparing the MD5 codes of the files in each modified version code file and the oldest original version code file, and judging the modification result of the modified version code file to the oldest original version code file.
For files not belonging to the set file type, whether the file is modified or not is judged by comparing the MD5 codes of the entire file. The judgment conditions are as follows: the contents of the two files are respectively read to obtain corresponding MD5 codes, whether the MD5 codes of the two files are the same or not is compared, and when the MD5 codes are the same, modification is shown to occur, and when the MD5 codes are not the same, modification is not shown to occur.
S314, determining the optimal modification result of the file according to the initial priority corresponding to the code file of each modified version to obtain the final optimized version of the file.
Specifically, in the present embodiment, the manner adopted is the unmodified auto-sync and the newly added auto-sync. The non-modification automatic synchronization refers to the fact that the files which are judged to be non-modification after the new version and the old version of the original version are compared, and the same files with the highest priority in the optimized version N are directly used as the final optimized version of the files. The newly added automatic synchronization means that when the optimized version N has a newly added file relative to the old original version, the newly added file with the highest priority in the optimized version N is used as the final optimized version of the file. And at this time, the priority is the initial priority corresponding to the file.
For example, if the resource file a in the old version of the original version does not belong to the set file type, it is determined whether the resource file a exists in the new version of the original version. And if the resource file A exists in the original version, further judging whether the resource file A exists in the optimized version N. If the resource file A exists in the optimized version N, a first MD5 code of the resource file A in the old version of the original version and a second MD5 code of the resource file A in the new version of the original version are obtained and compared, and when the two codes are the same, the resource file A with the highest priority in the optimized version N is used as a final optimized version. And if the resource file A does not exist in the original version, directly using the resource file A with the highest priority in the optimized version N as the final optimized version.
The multi-version code upgrading method provided by this embodiment may analyze the modification type and priority of each code line between versions according to a preset synchronization policy (various priorities and other policies may be designed by self-definition) by increasing the comparison between code files of each version, give an optimal modification result, and automatically merge and upgrade to obtain a finally optimized code file. The method can effectively reduce the burden of manual code review in the code version iteration process, and reduce the time cost and the error probability when upgrading the code files of a plurality of versions. Moreover, the file types needing content synchronization can be preset, and a mode of content comparison line by line and MD code comparison of the whole file is adopted for different file types, so that the applicability of the method can be improved, and the efficiency of comparison and synchronization can be improved.
EXAMPLE III
Fig. 9 is a schematic diagram of a hardware architecture of an electronic device 20 according to a third embodiment of the present application. In the present embodiment, the electronic device 20 may include, but is not limited to, a memory 21, a processor 22, and a network interface 23, which are communicatively connected to each other through a system bus. It is noted that fig. 9 only shows the electronic device 20 with components 21-23, but it is to be understood that not all of the shown components are required to be implemented, and that more or fewer components may be implemented instead. In this embodiment, the electronic device 20 may be the server 4.
The memory 21 includes at least one type of readable storage medium including a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc. In some embodiments, the storage 21 may be an internal storage unit of the electronic device 20, such as a hard disk or a memory of the electronic device 20. In other embodiments, the memory 21 may also be an external storage device of the electronic apparatus 20, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), or the like, provided on the electronic apparatus 20. Of course, the memory 21 may also include both an internal storage unit and an external storage device of the electronic apparatus 20. In this embodiment, the memory 21 is generally used for storing an operating system and various application software installed in the electronic device 20, such as program codes of the multi-version code upgrading system 60. Further, the memory 21 may also be used to temporarily store various types of data that have been output or are to be output.
The processor 22 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 22 is generally used to control the overall operation of the electronic device 20. In this embodiment, the processor 22 is configured to run the program codes stored in the memory 21 or process data, for example, run the multi-version code upgrading system 60.
The network interface 23 may include a wireless network interface or a wired network interface, and the network interface 23 is generally used for establishing a communication connection between the electronic apparatus 20 and other electronic devices.
Example four
Fig. 10 is a block diagram of a multi-version code upgrade system 60 according to a fourth embodiment of the present invention. The multi-version code upgrade system 60 may be partitioned into one or more program modules, which are stored in a storage medium and executed by one or more processors to implement the embodiments of the present application. The program modules referred to in the embodiments of the present application refer to a series of computer program instruction segments capable of performing specific functions, and the following description will specifically describe the functions of each program module in the embodiments.
In this embodiment, the multi-version code upgrade system 60 includes:
and a setting module 600, configured to set a path and an initial priority of each version of the code file.
For example, a path of an oldest code file of an original version (original version old) provided by a code provider, a path of a newest code file of an original version (original version new) provided by a code provider, a path of each optimized version (optimized version N, for example, a certain game original version is a japanese version, and an optimized version may include a uniform version, a korean uniform version, a national uniform version, and the like) obtained by a code receiver performing optimization based on the oldest code file of the original version, and a path of a final optimized version (optimized version new, original content is new, and optimized content in each optimized version is provided) (initial path content is empty).
The initial priority of each version of code file is mainly the initial priority corresponding to each code file in the original version new and the optimized version N. And the code file of each optimized version in the optimized versions N corresponds to an initial priority of the code file.
The setting module 600 is further configured to set modification priorities corresponding to the various modification types.
The modification types include a new addition modification (a code line added with respect to the old original version), a content modification (a code line modified with respect to the old content of the original version), and a deletion modification (a code line deleted with respect to the old original version). Thus, the modification priorities include a priority of an newly added modification, a priority of a content modification, and a priority of a deletion modification.
In addition, the embodiment may also set an additional priority for the modified content meeting the preset condition. The additional priority is used for specific content usage, e.g. for code content that is or is not required, by means of which the content usage order can be controlled. The use mode of the additional priority is to judge whether the modified content of the current code line meets the preset condition, if so, the corresponding additional priority is a preset value, and the preset value is usually infinity or infinitesimal; and if not, the additional priority is 0.
The significance of the priority is that when the code files of the two versions conflict with the modified content of the same code line, the modified content with high priority can be used as the optimal modified result, and the modified content with low priority can be abandoned in the finally obtained code file of the optimized version. The size of each priority may be determined according to the code synchronization requirement, for example, the newer version corresponds to the higher initial priority. For another example, assuming that the deletion modification needs to be preferentially used, the priority of the deletion modification is set to be greater than the priority of the content modification.
In a preferred embodiment, the setting of the priority can also ensure that the absolute value of the priority of the optimized version N minus the new priority of the original version is less than any one of the priority values of the new modification, the priority of the content modification and the priority of the deletion modification.
A comparing module 602, configured to compare each code line in the code file of each modified version with each code line in the code file of the oldest original version, to obtain specific modified content and modified type of each code line in the code file of each modified version.
After the setting is completed, in order to obtain the code file of the final optimized version, the code file of each modified version (the original version new and the optimized version N) needs to be compared with the code file of the oldest original version (the original version old) to find out the modified content of the code file of each modified version. And respectively finding the corresponding code lines of the same file under the same path in the code file of each modified version aiming at each code line in all files in the code file of the oldest original version, and comparing the content line by line.
The specific process of the comparison performed by the comparison module 602 refers to the description in the first embodiment, and is not described herein again.
And an optimizing module 604, configured to determine an optimal modification result for each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type, so as to obtain a final optimized version of the code file.
After the comparing module 602 obtains the specific modification content and modification type of each modified version of the code file for each code line, the optimizing module 604 determines whether each modified version of the code file has modifications to the current code line. When only one modified version of the code file modifies the current code line, using the specific modification content of the modified version of the code file on the current code line as the optimal modification result of the current code line. When a plurality of modified versions of code files modify the current code line, the priority of each modified version is calculated respectively, and the specific modified content of the code file of the modified version with the highest priority to the current code line is used as the optimal modified result of the current code line. And the optimal modification results of all the code lines form the code file of the final optimized version.
The specific process of the optimization module 604 for obtaining the code file of the final optimized version refers to the description in the first embodiment, and is not described herein again.
The multi-version code upgrading system provided by this embodiment can analyze the modification type and priority of each code line between versions according to a preset synchronization policy (various priorities and other policies can be designed by self-definition) by increasing the comparison between code files of each version, give an optimal modification result, and automatically merge and upgrade to obtain a finally optimized code file. The method can effectively reduce the burden of manual code review in the code version iteration process, and reduce the time cost and the error probability when upgrading the code files of a plurality of versions.
EXAMPLE five
The present application further provides another embodiment, which is to provide a computer-readable storage medium storing a multi-version code upgrade program, which is executable by at least one processor to cause the at least one processor to perform the steps of the multi-version code upgrade method as described above.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above-mentioned serial numbers of the embodiments of the present application are merely for description and do not represent the merits of the embodiments.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the present application described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different from that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications that can be made by the use of the equivalent structures or equivalent processes in the specification and drawings of the present application or that can be directly or indirectly applied to other related technologies are also included in the scope of the present application.
Claims (10)
1. A method for multi-version code upgrade, the method comprising:
setting a path and an initial priority of each version code file;
setting modification priorities corresponding to various modification types;
comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version; and
and determining the optimal modification result of each code line according to the initial priority corresponding to the code file of each modified version and the modification priority corresponding to each modification type, so as to obtain the code file of the final optimized version.
2. The multi-version code upgrading method according to claim 1, further comprising, after setting modification priorities corresponding to various modification types:
setting additional priority for the modified content meeting the preset condition;
and when the optimal modification result of each code line is determined, carrying out comprehensive judgment according to the initial priority corresponding to the code file of each version, the modification priority corresponding to each modification type and the additional priority.
3. The multi-version code upgrade method according to claim 1 or 2, wherein the modification types include an addition modification, a content modification, and a deletion modification.
4. The multi-version code upgrading method according to any one of claims 1 to 3, wherein the comparing each modified version of the code file with each code line in the oldest original version of the code file to obtain the specific modification content and modification type of each modified version of the code file for each code line comprises:
traversing all files in the code file of the oldest original version, opening the files and acquiring code line contents;
and comparing the code file of each modified version with the code file of the oldest original version under the same path to obtain the specific modified content and modified type of the code file of the modified version aiming at the code lines by calculating the similarity between each code line in the two files through the longest common subsequence algorithm.
5. The multi-version code upgrading method according to any one of claims 1 to 4, wherein the determining an optimal modification result for each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type comprises:
Judging whether the code file of each modified version has modification on the current code line;
when only one modified version of the code file modifies the current code line, using the specific modification content of the modified version of the code file on the current code line as the optimal modification result of the current code line;
when a plurality of modified versions of code files modify the current code line, respectively calculating the priority of each modified version, wherein the priority comprises the initial priority plus the modified priority, and the specific modified content of the code file of the modified version with the highest priority to the current code line is used as the optimal modified result of the current code line.
6. The multi-version code upgrading method according to claim 5, wherein the determining an optimal modification result for each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type further comprises:
and when the current code line is modified by the code files of the multiple modified versions and the priorities are the same, prompting a user to manually process the conflict content, and obtaining the optimal modification result of the current code line according to the processing result of the user.
7. The multi-version code upgrade method according to claim 1, further comprising, before comparing each code line in each modified version of the code file with the oldest original version of the code file:
setting a file type needing content synchronization through a suffix name;
in each modified version of the code file and the oldest original version of the code file, performing a step of comparing each line of code for the file of the file type;
and judging a modification result by comparing the MD5 codes of the files aiming at the files which are not in the file types, and determining the optimal modification result of the files according to the initial priority corresponding to the code files of each modified version.
8. A multi-versioned code upgrade system, the system comprising:
the setting module is used for setting the path and the initial priority of each version code file and setting the modification priority corresponding to various modification types;
the comparison module is used for comparing each code line in the code file of each modified version with each code line in the code file of the oldest original version to obtain the specific modified content and modified type of each code line of the code file of each modified version;
And the optimization module is used for determining the optimal modification result of each code line according to the initial priority corresponding to each modified version of the code file and the modification priority corresponding to each modification type, so as to obtain the code file of the final optimized version.
9. An electronic device, comprising: a memory, a processor, and a multi-version code upgrade program stored on the memory and executable on the processor, the multi-version code upgrade program when executed by the processor implementing the multi-version code upgrade method of any one of claims 1 to 7.
10. A computer-readable storage medium, having stored thereon a multi-version code upgrade program that, when executed by a processor, implements a multi-version code upgrade method as recited in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110836701.9A CN113535206B (en) | 2021-07-23 | 2021-07-23 | Multi-version code upgrading method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110836701.9A CN113535206B (en) | 2021-07-23 | 2021-07-23 | Multi-version code upgrading method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113535206A true CN113535206A (en) | 2021-10-22 |
| CN113535206B CN113535206B (en) | 2024-02-20 |
Family
ID=78088838
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110836701.9A Active CN113535206B (en) | 2021-07-23 | 2021-07-23 | Multi-version code upgrading method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113535206B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116302078A (en) * | 2023-05-19 | 2023-06-23 | 深圳前海环融联易信息科技服务有限公司 | Code file merging method and device, storage medium and computer equipment |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060225040A1 (en) * | 2005-03-30 | 2006-10-05 | Lucent Technologies Inc. | Method for performing conditionalized N-way merging of source code |
| CN102314411A (en) * | 2010-06-30 | 2012-01-11 | 百度在线网络技术（北京）有限公司 | Method for processing vocabulary entry editing and creating conflict and system |
| US20150220332A1 (en) * | 2014-02-05 | 2015-08-06 | International Business Machines Corporation | Resolving merge conflicts that prevent blocks of program code from properly being merged |
| CN106126410A (en) * | 2016-05-26 | 2016-11-16 | 华为技术有限公司 | The reminding method of code conflicts and device |
| CN106406918A (en) * | 2016-11-25 | 2017-02-15 | 华胜信泰信息产业发展有限公司 | Source code automatic merging method and apparatus |
| CN106484606A (en) * | 2015-09-01 | 2017-03-08 | 阿里巴巴集团控股有限公司 | Method and apparatus submitted to by a kind of code |
| CN106569844A (en) * | 2016-09-23 | 2017-04-19 | 北京五八信息技术有限公司 | Processing method, processing device and equipment for program code update |
| CN107832062A (en) * | 2017-09-08 | 2018-03-23 | 上海壹账通金融科技有限公司 | A kind of method for updating program and terminal device |
| CN109446492A (en) * | 2018-10-17 | 2019-03-08 | 南京垂宇网络科技有限公司 | Method for maintaining consistency of document editing data |
| US20190339967A1 (en) * | 2018-05-06 | 2019-11-07 | Methodics, Inc. | Design component dependency tree normalization through automatic conflict resolution and/or contextual dependency |
| CN111176983A (en) * | 2019-10-18 | 2020-05-19 | 华为技术有限公司 | Code conflict resolution system, method, device, equipment and medium |
| CN111221566A (en) * | 2019-12-28 | 2020-06-02 | 华为技术有限公司 | Method and device for combining multiple and changeable versions of software code |
| CN112148329A (en) * | 2020-09-18 | 2020-12-29 | 湖南联盛网络科技股份有限公司 | Code version automatic updating method and device, computer equipment and storage medium |
| CN112612716A (en) * | 2020-12-28 | 2021-04-06 | 上海品顺信息科技有限公司 | Method, system, equipment and storage medium for enhancing marking of coverage rate of difference line codes |
| CN112947986A (en) * | 2020-09-29 | 2021-06-11 | 深圳市明源云科技有限公司 | Multi-version code sign-in control method and device, client and storage medium |
| CN113110871A (en) * | 2021-04-27 | 2021-07-13 | 东南大学 | Multi-version software evolution history static analysis method and system based on text comparison |
-
2021
- 2021-07-23 CN CN202110836701.9A patent/CN113535206B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060225040A1 (en) * | 2005-03-30 | 2006-10-05 | Lucent Technologies Inc. | Method for performing conditionalized N-way merging of source code |
| CN102314411A (en) * | 2010-06-30 | 2012-01-11 | 百度在线网络技术（北京）有限公司 | Method for processing vocabulary entry editing and creating conflict and system |
| US20150220332A1 (en) * | 2014-02-05 | 2015-08-06 | International Business Machines Corporation | Resolving merge conflicts that prevent blocks of program code from properly being merged |
| CN106484606A (en) * | 2015-09-01 | 2017-03-08 | 阿里巴巴集团控股有限公司 | Method and apparatus submitted to by a kind of code |
| CN106126410A (en) * | 2016-05-26 | 2016-11-16 | 华为技术有限公司 | The reminding method of code conflicts and device |
| CN106569844A (en) * | 2016-09-23 | 2017-04-19 | 北京五八信息技术有限公司 | Processing method, processing device and equipment for program code update |
| CN106406918A (en) * | 2016-11-25 | 2017-02-15 | 华胜信泰信息产业发展有限公司 | Source code automatic merging method and apparatus |
| CN107832062A (en) * | 2017-09-08 | 2018-03-23 | 上海壹账通金融科技有限公司 | A kind of method for updating program and terminal device |
| US20190339967A1 (en) * | 2018-05-06 | 2019-11-07 | Methodics, Inc. | Design component dependency tree normalization through automatic conflict resolution and/or contextual dependency |
| CN109446492A (en) * | 2018-10-17 | 2019-03-08 | 南京垂宇网络科技有限公司 | Method for maintaining consistency of document editing data |
| CN111176983A (en) * | 2019-10-18 | 2020-05-19 | 华为技术有限公司 | Code conflict resolution system, method, device, equipment and medium |
| CN111221566A (en) * | 2019-12-28 | 2020-06-02 | 华为技术有限公司 | Method and device for combining multiple and changeable versions of software code |
| CN112148329A (en) * | 2020-09-18 | 2020-12-29 | 湖南联盛网络科技股份有限公司 | Code version automatic updating method and device, computer equipment and storage medium |
| CN112947986A (en) * | 2020-09-29 | 2021-06-11 | 深圳市明源云科技有限公司 | Multi-version code sign-in control method and device, client and storage medium |
| CN112612716A (en) * | 2020-12-28 | 2021-04-06 | 上海品顺信息科技有限公司 | Method, system, equipment and storage medium for enhancing marking of coverage rate of difference line codes |
| CN113110871A (en) * | 2021-04-27 | 2021-07-13 | 东南大学 | Multi-version software evolution history static analysis method and system based on text comparison |
Non-Patent Citations (4)
| Title |
|---|
| BAIQIANTAO: "构建-9 合并清单文件 Merge", pages 1 - 22, Retrieved from the Internet <URL:《https://it.cha138.com/shida/show-166408.html》> * |
| BRAD HART: "Merging Code - How to Automate Merge Strategies", pages 1 - 4, Retrieved from the Internet <URL:《https://www.perforce.com/blog/vcs/merging-code-how-automate-it》> * |
| X. XING等: "Automatic Software Merging using Automated Program Repair", 《2019 IEEE 1ST INTERNATIONAL WORKSHOP ON INTELLIGENT BUG FIXING (IBF)》, pages 11 - 16 * |
| 于晓杰: "机场旅客智能服务系统Android客户端的设计与实现", 《中国优秀硕士学位论文全文数据库信息科技辑》, no. 08, pages 138 - 273 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116302078A (en) * | 2023-05-19 | 2023-06-23 | 深圳前海环融联易信息科技服务有限公司 | Code file merging method and device, storage medium and computer equipment |
| CN116302078B (en) * | 2023-05-19 | 2023-08-01 | 深圳前海环融联易信息科技服务有限公司 | Code file merging method and device, storage medium and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113535206B (en) | 2024-02-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019056540A1 (en) | Test case automation management method and apparatus, device, and storage medium | |
| US20140164391A1 (en) | Data block saving system and method | |
| CN113448862B (en) | Software version testing method and device and computer equipment | |
| CN108920691B (en) | Front-end static resource management method and device, computer equipment and storage medium | |
| CN112416957B (en) | Data increment updating method and device based on data model layer and computer equipment | |
| CN111881150A (en) | Web application program offline data processing method and device | |
| CN108415998B (en) | Application dependency relationship updating method, terminal, device and storage medium | |
| CN111737227A (en) | Data modification method and system | |
| CN113535206B (en) | Multi-version code upgrading method and system | |
| CN114780019A (en) | Electronic device management method and device, electronic device and storage medium | |
| CN110750286A (en) | Management method, device, system, equipment and medium for upgrading Mbn through OTA | |
| CN111488483B (en) | Method, device, terminal and non-transitory computer readable storage medium for updating a library | |
| CN111046316B (en) | Application on-shelf state monitoring method, intelligent terminal and storage medium | |
| CN112416384A (en) | Software upgrading method and device and computer equipment | |
| CN116048609A (en) | Configuration file updating method, device, computer equipment and storage medium | |
| CN115004667B (en) | Information pushing method, device, electronic equipment and computer readable medium | |
| CN114610366A (en) | Difference package upgrading method and system, intelligent electronic equipment and storage medium | |
| CN114466387A (en) | Method and device for updating configuration file of base station, storage medium and electronic device | |
| CN112631646A (en) | Data compatibility method, device and equipment for APP version degradation and storage medium | |
| CN108415814B (en) | Method for automatically recording field change, application server and computer readable storage medium | |
| CN112783866A (en) | Data reading method and device, computer equipment and storage medium | |
| CN112416383A (en) | Hot updating method and device for golang program and computer equipment | |
| CN108595924B (en) | Business authority management method and device, computer equipment and storage medium | |
| CN112417324A (en) | Chrome-based URL (Uniform resource locator) interception method and device and computer equipment | |
| CN108415922B (en) | Database modification method and application server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |