Method, device and electronic equipment for processing multi-branch game configuration table identification

Abstract

The present disclosure provides a processing method, device and electronic equipment for multi-branch game configuration table identification, determining at least two branches and a reference branch specified from the at least two branches; obtaining configuration tables of each branch, and extracting data in the configuration tables of each branch to construct an entry set corresponding to each branch; determining at least one candidate identification based on a first entry set of the reference branch, a second entry set of a target branch to be newly added with an identification, and a global identification set containing all identifications of each branch; determining a target identification newly added to the target branch from the at least one candidate identification, and adding the target identification to a target configuration table corresponding to the target branch. In this way, the efficiency of identification addition and configuration table updating can be improved.

Description

Technical Field

[0001] This disclosure relates to the field of game data processing technology, and in particular to a method, apparatus, and electronic device for processing multi-branch game configuration table identifiers. Background Technology

[0002] In the development of large-scale game projects, configuration tables serve as a crucial bridge connecting design and programming. Modern game projects commonly employ a multi-branch parallel development model, with each branch corresponding to a different version stage and each branch maintaining an independent copy of the configuration table. When designers add a configuration entry to the main development branch, this change needs to be synchronized to all other branches sequentially.

[0003] Because multiple planners work on different branches simultaneously, and version merging is not always performed promptly, inconsistencies in configuration table identifiers across branches are a frequent issue. Furthermore, when a new identifier needs to be added to a branch, planners must manually find a value that does not conflict with existing identifiers in other branches, a cumbersome and error-prone process that impacts the efficiency of configuration table updates. Summary of the Invention

[0004] In view of this, the purpose of this disclosure is to provide a method, apparatus, and electronic device for processing multi-branch game configuration table identifiers. By obtaining the configuration table of each branch and extracting the entry set corresponding to each branch, when determining the new identifier, the method directly compares the entry set of the base branch, the entry set of the target branch to be added, and the global identifier set containing all identifiers of each branch to determine the target new identifier that does not conflict with the base branch. This reduces the steps of searching for existing identifiers of each branch one by one, and helps to improve the efficiency of adding identifiers and updating the configuration table.

[0005] In a first aspect, embodiments of this disclosure provide a method for processing multi-branch game configuration table identifiers, the method comprising: Identify at least two branches and a base branch specified from said at least two branches; Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch; Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, at least one candidate identifier is determined; Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0006] Secondly, this disclosure also provides a processing apparatus for identifying a multi-branch game configuration table, the processing apparatus comprising: A branch determination module is used to determine at least two branches and a base branch specified from the at least two branches; The item set determination module is used to obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the item set corresponding to each branch; The candidate identifier determination module is used to determine at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to which the identifier is to be added, and the global identifier set containing all identifiers of each branch. The identifier addition module is used to determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0007] Thirdly, embodiments of this disclosure also provide an electronic device, including: a processor, a storage medium, and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor communicates with the storage medium via the bus, and the processor executes the machine-readable instructions to perform the processing method for the multi-branch game configuration table identifier as described in the first aspect.

[0008] Fourthly, embodiments of this disclosure also provide a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the processing method for identifying a multi-branch game configuration table as described in the first aspect.

[0009] The multi-branch game configuration table identifier processing method, apparatus, and electronic device provided in this disclosure determine at least two branches and a base branch specified from the at least two branches; obtain the configuration table of each branch and extract data from the configuration table of each branch to construct an entry set corresponding to each branch; determine at least one candidate identifier based on the first entry set of the base branch, the second entry set of the target branch to which the identifier is to be added, and a global identifier set containing all identifiers of each branch; determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch. In this way, by obtaining the configuration table of each branch and extracting the entry set corresponding to each branch, when determining the new identifier, the target new identifier that does not conflict with the base branch is determined by directly comparing the entry set of the base branch, the entry set of the target branch to which the identifier is to be added, and the global identifier set containing all identifiers of each branch. This reduces the step of searching for existing identifiers of each branch one by one, and helps to improve the efficiency of identifier addition and configuration table update.

[0010] Furthermore, by iterating through the entry sets of each branch, the occurrence of each identifier in different branches can be identified, and the missing identifiers can be displayed to the user so that the user can make subsequent corrections, reducing errors caused by manual checking and improving the accuracy of synchronization of configuration tables in each branch.

[0011] To make the above-mentioned objects, features and advantages of this disclosure more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0012] To more clearly illustrate the technical solutions of the embodiments of this disclosure, the accompanying drawings used in the embodiments will be briefly described below. It should be understood that the following drawings only show some embodiments of this disclosure and should not be regarded as a limitation of the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0013] Figure 1 A flowchart illustrating a method for processing multi-branch game configuration table identifiers provided in this embodiment of the disclosure; Figure 2 One of the structural schematic diagrams of a processing device for identifying a multi-branch game configuration table provided in an embodiment of this disclosure; Figure 3 A second schematic diagram of a processing device for identifying a multi-branch game configuration table provided in an embodiment of this disclosure; Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this disclosure. Detailed Implementation

[0014] To make the objectives, technical solutions, and advantages of the embodiments of this disclosure clearer, the technical solutions of the embodiments of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this disclosure, and not all of them. The components of the embodiments of this disclosure described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of this disclosure provided in the accompanying drawings is not intended to limit the scope of the claimed disclosure, but merely represents selected embodiments of this disclosure. Based on the embodiments of this disclosure, every other embodiment obtained by those skilled in the art without inventive effort falls within the scope of protection of this disclosure.

[0015] First, the applicable application scenarios of this disclosure will be introduced.

[0016] In the development of large-scale game projects, configuration tables serve as a crucial bridge connecting design and programming. Modern game projects commonly employ a multi-branch parallel development model, with each branch corresponding to a different version stage and each branch maintaining an independent copy of the configuration table. When designers add a configuration entry to the main development branch, this change needs to be synchronized to all other branches sequentially.

[0017] Because multiple planners work on different branches simultaneously, and version merging is not always performed promptly, inconsistencies in configuration table identifiers across branches are a frequent issue. Furthermore, when a new identifier needs to be added to a branch, planners must manually find a value that does not conflict with existing identifiers in other branches, a cumbersome and error-prone process that impacts the efficiency of configuration table updates.

[0018] Specifically, manual line-by-line comparison is used: planners open multiple branch Excel files simultaneously and visually compare IDs line by line to check for consistency. Alternatively, a general diff tool, such as Beyond Compare, is used to export the Excel files to CSV for text comparison. Version control system merge detection relies on SVN / Git merge conflict alerts to identify inconsistencies. Manual assignment of new identifiers: when adding new configurations, planners manually check the end of each branch table and manually select an unused identifier value.

[0019] However, manual comparison is extremely inefficient in the above methods. Cross-comparison of four branches is a huge workload (requiring checking if each identifier exists in all branches), often taking several hours and prone to oversight due to attentional fatigue. General-purpose Diff tools cannot understand ID semantics: text comparison tools report numerous formatting differences (cell styles, blank rows, column width changes), drowning out crucial information like "a certain identifier is missing in a certain branch," and failing to distinguish "column A identifier" from other column content. Version control merge detection coverage is incomplete: SVN / Git conflict detection is only triggered during merge execution and can only detect conflicts where "the same row has been modified by two parties," failing to detect situations where "a row has been added to one branch but not another." New identifier allocation lacks intelligent assistance: manually searching for free identifiers requires referencing data from multiple branches simultaneously, easily leading to identifiers already occupied by other branches and causing conflicts during subsequent merges.

[0020] Based on this, the present disclosure provides a method for processing multi-branch game configuration table identifiers to improve the efficiency of adding identifiers and updating the configuration table.

[0021] Please see Figure 1 , Figure 1 This is a flowchart illustrating a method for processing a multi-branch game configuration table identifier, as provided in an embodiment of this disclosure. Figure 1As shown in the embodiments of this disclosure, the method for processing the multi-branch game configuration table identifier includes: S101, Determine at least two branches and a base branch specified from the at least two branches.

[0022] S102. Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch.

[0023] S103. Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, determine at least one candidate identifier.

[0024] S104. Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0025] The method for processing multi-branch game configuration table identifiers provided in this embodiment obtains the configuration table of each branch and extracts the entry set corresponding to each branch. When determining the new identifier, it directly compares the entry set of the base branch, the entry set of the target branch to be added, and the global identifier set containing all identifiers of each branch to determine the target new identifier that does not conflict with the base branch. This reduces the step of searching for existing identifiers of each branch one by one, and helps to improve the efficiency of adding identifiers and updating the configuration table.

[0026] The exemplary steps of the embodiments of this disclosure are described below: S101, Determine at least two branches and a base branch specified from the at least two branches.

[0027] In one alternative implementation, at least two branches (e.g., 2-4 branches) and their mappings to configuration file paths can be determined by the user's branch selection in the graphical user interface and input of configuration file paths. Simultaneously, a base branch is determined from the at least two branches through the user's selection of a base branch.

[0028] Specifically, different selection controls can be set in the input area of ​​each branch in each graphical user interface. In response to the user's trigger operation on the selection control, the corresponding branch is set as the base branch, which serves as the reference benchmark for determining the consistency of the identifier and calculating the new identifier.

[0029] In one alternative implementation, the branch includes at least one of the following: a main development branch, a gray-scale testing branch, a pre-release branch, and a formal release branch.

[0030] The development branches are divided into four main branches: Trunk Branch (Trunk), which contains the latest development content; Gray Branch (Gray), which is a version for a small group of test users; Pre-release Branch (Pre-release), which is the final verification version before release; and Release Branch (Release), which is the online version for all players.

[0031] Here, the main development branch, the gray-scale testing branch, the pre-release branch, and the official release branch are different branches in the multi-branch parallel development mode commonly used in game projects. Different branches correspond to different version stages, and each branch maintains its own configuration table independently.

[0032] Furthermore, after determining each branch and the base branch, the configuration table corresponding to each branch can be obtained, thereby determining the set of entries corresponding to each branch.

[0033] S102. Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch.

[0034] Here, the configuration table is a data table stored in Excel format (.xlsx) in the game project, maintained by the planners. Each row is mapped to in-game resources through a unique numerical identifier (ID).

[0035] For example, the configuration table can be a sound effects table, an item table, a task table, etc.

[0036] In one alternative implementation, the configuration table of each branch can be obtained through the configuration table file path corresponding to each branch. It is necessary to perform a batch update operation on each configuration table according to the configuration table file path to ensure that each configuration table is the latest version, thereby improving the accuracy of subsequent configuration table identification processing.

[0037] Specifically, the step "Obtain the configuration tables for each branch" includes: a1: Based on the configuration table file path of each branch, read the initial configuration table located in each configuration table file path, update each initial configuration table to the latest version, and then obtain the configuration table of each branch table.

[0038] In one alternative implementation, the configuration table file paths corresponding to each branch can be merged into a single update request, and the update operation can be performed on the configuration tables under each branch, which can improve the efficiency of configuration table updates and retrieval.

[0039] For example, the configuration table file paths corresponding to each branch can be merged into a single update request by calling the TortoiseSVN interface.

[0040] In one alternative implementation, an update control can be set in the graphical user interface, responding to trigger operations on the update control and issuing an update request. The specific update process can be as follows: traverse all configuration table file paths, extract the directories where each file is located and remove duplicates; check if the local TortoiseSVN installation path is available; if available, concatenate all directories with "*" characters and call TortoiseProc.exe / command:update / path: <paths>A graphical update window will pop up, prompting the user to update the configuration file. If this is not available, a manual update prompt message can be displayed in the graphical user interface to prompt the user to update manually.

[0041] Furthermore, after obtaining the configuration tables for each branch, a preset range of identifier values ​​can be set.

[0042] Specifically, each configuration table contains at least column A: Identifier; column B: Name; and column C: Trigger Event. When setting the preset identifier value range, it can be set according to the identifier values ​​corresponding to all identifier items in column A of each configuration table.

[0043] Among them, the trigger event is used to identify the in-game trigger condition corresponding to the identifier in column A.

[0044] For example, taking the audio configuration table as an example, the name of identifier 1 is the game victory sound effect, and the trigger condition can be set to: the player wins the game.

[0045] Here, the start and end identifiers of the preset identifier value range are both optional parameters; specifically, both can be empty: indicating a full scan with no range limit; or only the start identifier value can be filled: scanning all entries from the start identifier value to the end; both can be filled: scanning entries within the closed interval of [start identifier value, end identifier value].

[0046] In one alternative implementation, for each branch, the set of entries corresponding to that branch can be obtained according to the corresponding configuration table.

[0047] Specifically, for each branch, the set of entries for that branch is constructed through the following steps: b1: For each branch, check if the target configuration item exists in the configuration table of that branch.

[0048] b2: If it does not exist, determine that the set of entries for this branch is empty.

[0049] b3: If it exists, read the data corresponding to the target configuration item in the configuration table in sequence, and determine the set of at least one combination of items after filtering out the data that meets the data filtering conditions of the item set as the item set of this branch.

[0050] In one alternative implementation, for each branch, the target configuration item of the corresponding configuration table can be read in read-only mode. Here, the target configuration item refers to the data area to be parsed in the configuration table, such as a worksheet or a specific set of columns in a game sound effect configuration table. An item set is constructed by extracting column A (identifier), column B (name), and column C (specific numerical value of the triggering event) from the configuration data item.

[0051] Here, each entry in the entry set should contain an identifier value, a name value, and a trigger event. Therefore, it is necessary to check the configuration items in the configuration table to determine whether there are identifier items, name items, and trigger event items. If they do not exist, it is determined that the entry set corresponding to that branch is an empty set.

[0052] In this way, by pre-filtering data with empty identifiers or names, non-numeric values, or values ​​exceeding the preset range during the construction of the entry set, it can be ensured that only valid entries with complete structure and compliant values ​​are included in the entry set, thereby avoiding dirty data from participating in subsequent set operations and improving the input quality and reliability of cross-branch data comparison and new identifier calculation.

[0053] Furthermore, if the configuration table contains an identifier, a name, and a trigger event, the specific data in the configuration table can be read. When reading the data, the header of the configuration table needs to be automatically skipped. Therefore, starting from the second row of the configuration table, the specific values ​​corresponding to the identifier, name, and trigger event in each row can be read one by one. The identifier, name, and trigger event of a row constitute an entry. After reading all rows in the configuration table, the set of entries for this branch is determined.

[0054] Here, it is necessary to filter out entries that cannot participate in subsequent data processing in order to determine the set of entries corresponding to each branch.

[0055] In one optional implementation: the data filtering criteria for the item set include at least one of the following: The identifier or name item in the configuration table is empty; the value type corresponding to the identifier item in the configuration table is non-numeric; or the value corresponding to the identifier item in the configuration table exceeds the preset identifier value range.

[0056] Specifically, it is necessary to filter out entry data where the identifier or name field in the configuration table is empty, or entry data where the value type corresponding to the identifier field in the configuration table is non-numeric. That is, in this embodiment of the disclosure, the numeric identifier is detected; or it is necessary to filter out the value corresponding to the identifier field in the configuration table that exceeds the preset identifier value range, and thus it is necessary to detect data that exists within the preset identifier value range.

[0057] In another optional implementation, for the trigger event item in the configuration table, if the value of the trigger event item is None, the corresponding trigger event item is stored as an empty string; otherwise, it is converted to a string with leading and trailing whitespace removed.

[0058] For example, each entry is a triplet of (ID integer, name string, event string). The triplets corresponding to each entry are added to the set of the branch to obtain the set of entries for the branch.

[0059] Furthermore, if any branch requires a new identifier, the first set of entries with the baseline score and the set of entries with the target score for which a new identifier needs to be added can be compared to determine the candidate identifiers that do not conflict.

[0060] S103. Determine at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added, and the global identifier set containing all identifiers of each branch.

[0061] Here, after obtaining the first set of entries for the base branch, it is necessary to sort the various identifiers contained in the first entry in ascending order of identifier value from low to high; at the same time, obtain the global identifier set composed of the entry sets of all branches, and sort the various identifiers contained in the global identifier set in ascending order of identifier value from low to high.

[0062] In one alternative implementation, a candidate starting value can be determined by comparing the identifiers contained in the first set of entries with the entries contained in the second set of entries, and then a search can be started based on the candidate starting value to determine at least one candidate identifier.

[0063] Specifically, the step "determine at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the identifier, and the global identifier set containing all identifiers of each branch" includes: c1: Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, determine the candidate starting value.

[0064] c2: Search using the candidate starting value to determine at least one candidate identifier.

[0065] In one alternative implementation, the identifiers contained in the first set of entries and the entries contained in the second set of entries can be compared to determine at least one identifier that exists in the first set of entries but not in the second set of entries, thereby constructing a baseline exclusive identifier set. Then, the candidate starting value can be determined based on whether the baseline exclusive identifier set is an empty set.

[0066] Specifically, the step "determine candidate starting values ​​based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch" includes: d1: Based on the first set of entries and the second set of entries, determine a base-specific set of identifiers that exist in the first set of entries but do not exist in the second set of entries.

[0067] d2: Detect whether the set of reference-specific identifiers is an empty set.

[0068] d3: If the baseline exclusive identifier set is empty, the sum of the maximum identifier value in the global identifier set and the preset value is determined as the candidate starting value.

[0069] d4: If the benchmark-specific identifier set is not empty, the sum of the maximum identifier value in the benchmark-specific identifier set and the preset value is determined as the candidate starting value.

[0070] Here, the identifiers that exist in the first set of entries but not in the second set of entries are identifiers that already exist in the baseline branch but have not been synchronized to the target molecule. These identifiers constitute the baseline-specific identifier set.

[0071] In one alternative implementation, if the baseline exclusive identifier set is empty, it is determined that there is no baseline exclusive identifier set at present. The maximum identifier value in the global identifier set can be determined, and the value obtained by adding a preset value (e.g., 1) to the maximum identifier value in the global identifier set can be determined as the candidate initial value.

[0072] In one optional implementation, if the baseline exclusive identifier set is not empty, then it is determined that a baseline exclusive identifier set currently exists, the maximum identifier value in the baseline exclusive identifier set is determined, and the value obtained by adding a preset value (e.g., 1) to the maximum identifier value in the baseline exclusive identifier set is determined as a candidate initial value.

[0073] In this way, by using the maximum value of the base-specific identifier set plus a preset value as the candidate starting value when the base-specific identifier set is not empty, the newly added identifier can be preferentially allocated after the identifier range of the base branch that has not yet been synchronized to the target branch, thereby filling the identifier gap caused by version lag. This avoids the problem of large-scale skipping of identifiers caused by directly using the global maximum identifier value plus 1 for searching, and can make the identifier distribution between branches more compact, thereby reducing the probability of conflict during subsequent merging.

[0074] Furthermore, after identifying the base-specific identifier set that exists in the first entry set but not in the second entry set, the identifiers in the base-specific identifier set can be displayed to the user to indicate that the identifiers that have not yet been synchronized to the target branch are not currently being used.

[0075] Specifically, the processing method further includes: e1: If the set of reference-specific identifiers is not empty, display at least one reference-specific identifier located in the set of reference-specific identifiers.

[0076] In one alternative implementation, a preset number of identifiers from the baseline exclusive identifier set can be displayed, where the preset number can be 15.

[0077] Furthermore, after determining the candidate starting value, the search can be performed incrementally based on the candidate starting point to determine at least one candidate identifier.

[0078] Specifically, the step "searching using the candidate starting value to determine at least one candidate identifier" includes: f1: Starting from the candidate initial value, search incrementally according to the preset numerical growth threshold, and after filtering the identifiers existing in the first entry set, determine at least one candidate identifier.

[0079] In one alternative implementation, starting from a candidate initial value, the search is performed incrementally according to a preset numerical growth threshold (e.g., 1), skipping the identifier values ​​already occupied by the baseline branch, to determine at least one candidate identifier.

[0080] Here, the number of candidate identifiers can be set according to requirements; for example, it can be set to 5.

[0081] Furthermore, after identifying at least one candidate identifier, it can be displayed to the user. Through the user's selection and confirmation, the target identifier is determined, and then the identifier addition and update of the target configuration table of the target branch is completed based on the target identifier.

[0082] S105. Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0083] In one alternative implementation, the target identifier is typically selected as the one with the smallest value among at least one candidate identifier; alternatively, the target identifier is determined based on the user's selection. After the user confirms the selection, the user-confirmed target identifier, the corresponding name entered by the user, and the triggering event are synchronously written into the target configuration table of the target branch, thus completing the addition of the identifier and the update of the target configuration table.

[0084] Specifically, the processing method further includes: g1: In response to the configuration table information input operation, determine the target name information and target trigger event corresponding to the target identifier.

[0085] In this embodiment of the disclosure, after the user selects the target branch, integer target identifier, name, and trigger event through input operations, the user verifies the completeness of the input. After the target branch is selected, the ID is a valid integer, and the name and trigger event are not empty, a confirmation dialog box can pop up in the graphical user interface to display the complete information to be written. After the user performs the confirmation operation, the target configuration table is updated.

[0086] Specifically, the step "adding the target identifier to the target configuration table corresponding to the target branch" includes: h1: After the target identifier, target name information and target trigger event are verified, the target identifier, the target name information and the target trigger event are written into the target configuration table.

[0087] In this embodiment of the disclosure, after receiving the user's confirmation operation, the target configuration file of the target branch is opened in read-write mode; the target configuration item is located; a new row of data [ID integer, name string, trigger event string] is appended to the last row of the target configuration item; the alignment of the cells in column A is set to horizontal center + vertical center; after setting, the file is saved and closed; and the writing success status is updated in the graphical user interface to prompt the user that the target configuration table of the current target branch has been updated.

[0088] Furthermore, in response to the user's report export operation, each different branch, along with its corresponding identifier, name, and triggering event, can be written into the inspection report table, and the inspection report table can be displayed.

[0089] Specifically, a file save dialog box can be popped up in the graphical user interface to create a new workbook, write the header row: Identifier, Name, Triggering Event, Trunk, Gray, Pre-release, Release; write all rows of data in the current results table one by one; and save the corresponding inspection report table file.

[0090] In an alternative implementation, the occurrence information of each identifier in different branches in each item set can be traversed, and the identifiers with missing anomalies can be found and displayed to prompt the user of the current abnormal situation.

[0091] Specifically, the processing method further includes: i1: Based on the set of entries in each branch, determine the multiple identifiers contained in all branches, and determine the occurrence information of each identifier in each branch.

[0092] i2: Based on the occurrence information of each identifier in each branch, identify at least one missing abnormal identifier that appears in at least one branch but not in all branches.

[0093] i3: Displays at least one missing anomaly identifier.

[0094] Here, the missing exception is an identifier that appears in at least one branch but not in all branches. The missing exception may cause the resource indexing to fail during game runtime, so it is necessary to prompt the user.

[0095] Specifically, for each identifier in each set of entries, it is determined in which set of entries the identifier appears, and at least one missing anomaly identifier that appears in at least one branch but not in all branches is identified, and then the missing anomaly identifier is displayed.

[0096] Here, when performing anomaly detection for missing identifiers, only the identifier items in the entry are used as the benchmark, and whether the identifier appears in each branch is irrelevant to the differences in name and triggering conditions.

[0097] In one optional implementation, the detection results of the missing identifier can be displayed in tabular form, with each row containing the identifier, name, triggering event, and the existence status of each branch. The row containing the missing identifier is highlighted in red; alternatively, the row containing the missing identifier can be displayed in a larger font size than other rows; or a prompt identifier can be displayed in the row containing the missing identifier to indicate its absence.

[0098] Furthermore, in response to the user's missing identifier filtering operation, the missing identifier, along with the name, triggering event, and existence status of each branch, can be displayed only in the table.

[0099] The following will use a specific example to illustrate the processing of the multi-branch game configuration table identifier in this embodiment of the disclosure. Taking the game sound effect configuration table as an example, column A of the game sound effect configuration table is the sound effect ID (integer), column B is the sound effect name (string), and column C is the trigger event name (string).

[0100] Step 1: System Initialization and Configuration Recovery When the system starts, it reads the previously saved operation parameters from the local configuration file ~ / .table_check_config.json (JSON format, UTF-8 encoding). The configuration content includes: the configuration table file paths for the four branches, the selection of the base branch (master field), the name of the target configuration item (Sheet), and the preset identifier value range (start and end values ​​of the ID range). If the configuration file does not exist or fails to parse, it starts with the default values ​​(the base branch defaults to the trunk development branch, and the others are empty).

[0101] For example, the configuration file structure can be: { "trunk": "D: / project / trunk / sound_table.xlsx", "gray": "D: / project / gray / sound_table.xlsx", "pre-release": "D: / project / pre-release / sound_table.xlsx", "release": "D: / project / release / sound_table.xlsx", "sheet_name": "SFX", "id_min": "3001", "id_max": "3050", "master": "trunk } Step 2: Multi-branch file configuration and base branch setting: The system's graphical user interface provides four file path input areas, corresponding to Trunk, Gray, Pre-release, and Release, respectively. Each input area has a selection control (Radio) before it; users select a branch by clicking the selection control before that branch and set it as the base branch. The base branch means that its ID set serves as an authoritative reference, avoiding conflicts with that branch when calculating suggested IDs. A minimum of two file paths must be configured to perform the comparison.

[0102] Step 3: SVN Batch Update: After a user triggers a one-click update, the system performs the following steps: 1. Traverse all selected configuration file paths, extract the directories containing each file, and remove duplicates; 2. Check the local TortoiseSVN installation path (check C:\Program Files\TortoiseSVN\bin\TortoiseProc.exe and C:\Program Files (x86)\TortoiseSVN\bin\TortoiseProc.exe); 3. If available, concatenate all directories with "*" characters and call TortoiseProc.exe / command:update / path: <paths>A graphical update window will pop up; 4. If it is unavailable, prompt the user to update manually.

[0103] Step 4: Sheet Selection and ID Range Setting: After clicking the refresh button, the system loads the workbook from the first valid file in read-only mode (read_only=True), extracts all its sheet names, and populates them into the drop-down selection box.

[0104] Step 5: Extraction and Standardization of Multi-Branch Data For each selected branch file, perform the following: 1. Open the Excel workbook in read-only mode; 2. Check if the target sheet exists; if not, the data set for that branch is empty; 3. Read the first 3 columns row by row, starting from row 2 (min_row=2, max_col=3, values_only=True); 4. Filter the values; 6. Add the triplet (ID integer, name string, event string) to the set for that branch.

[0105] Step Six: Cross-branch consistency comparison: Construct an ID value existence mapping `id_num_presence`: Iterate through the item sets of all branches, and for each item's ID value, add its corresponding branch name to the set. The data structure is `dict[int, set[str]]`. Merge the item sets of all branches into a global identifier set `all_ids`, sorted in ascending order by ID value. For each sorted item, query `id_num_presence` based on its ID value to determine whether each selected branch possesses that ID.

[0106] Abnormal conditions: The ID appears in at least one selected branch but not in all selected branches (0 < number of missing branches < total number of selected branches).

[0107] Step 7: Candidate ID Calculation: When the user specifies the target branch and triggers the calculation: Get the set of all ID values ​​of the base branch (master_key), master_id_nums, sorted in ascending order; get the set of all ID values ​​of the target branch (target), target_id_nums; calculate the base-only ID: master_only = sorted(set(master_id_nums) - target_id_nums), which is the ID that exists in the base branch but not in the target branch; get the global maximum ID: max_id = max(all_id_nums); determine the candidate starting value start_from: if master_only is not empty: start_from = max(master_only) + 1; otherwise: start_from = max_id + 1.

[0108] Furthermore, starting from start_from, the search increments upwards. If the current candidate value already exists in master_id_nums, it is skipped (while candidate in set(master_id_nums): candidate += 1); five non-conflicting candidate IDs are found in turn and output as suggestions; at the same time, a list of baseline-specific IDs is displayed (up to the last 15), for users to refer to which IDs have not yet been synchronized to the target branch.

[0109] Step 8: Write the new entry: After the user fills in the target branch, column A ID (must be an integer), column B name, and column C trigger event, the write process is triggered as follows: 1. Verify input completeness: target branch selected, ID is a valid integer, name and event are not empty; 2. Pop up a confirmation dialog box, displaying the complete information to be written; 3. After user confirmation, open the target branch's xlsx file in read-write mode; 4. Locate the target sheet; 5. Append a new row of data [ID integer, name string, event string] to the last row of the sheet; 6. Set the alignment of column A cells to horizontal center + vertical center; 7. Save and close the file; 8. Update the write success status in the graphical user interface.

[0110] Step Nine: Report Export After the user triggers the export: 1. A file save dialog box pops up, with the default file name "ID Inspection Report.xlsx"; 2. A new workbook is created, and the sheet name is "Inspection Report"; 3. The header row is written: ID, Name, Trigger Event, Trunk, Gray, Pre-release, Release; 4. All rows of data in the current result table are written one by one; 5. The Excel file is saved.

[0111] Step 10: Save Configuration When a user shuts down the system, all current parameters (four file paths, Sheet name, ID range start and end, and base branch selection) are automatically written to ~ / .table_check_config.json in JSON format.

[0112] The method for processing multi-branch game configuration table identifiers provided in this disclosure involves: determining at least two branches and a base branch specified from the at least two branches; obtaining the configuration table of each branch and extracting data from the configuration table of each branch to construct an entry set corresponding to each branch; determining at least one candidate identifier based on the first entry set of the base branch, the second entry set of the target branch to which the identifier is to be added, and a global identifier set containing all identifiers of each branch; determining the target identifier to be added to the target branch from the at least one candidate identifier, and adding the target identifier to the target configuration table corresponding to the target branch. In this way, by obtaining the configuration table of each branch and extracting the entry set corresponding to each branch, when determining the new identifier, the method directly compares the entry set of the base branch, the entry set of the target branch to which the identifier is to be added, and the global identifier set containing all identifiers of each branch to determine the target new identifier that does not conflict with the base branch. This reduces the step of searching for existing identifiers in each branch one by one, and helps improve the efficiency of identifier addition and configuration table update.

[0113] Based on the same inventive concept, this disclosure also provides a processing device for a multi-branch game configuration table identifier, which corresponds to the processing method for the multi-branch game configuration table identifier. Since the principle of the device in this disclosure for solving the problem is similar to the processing method for the multi-branch game configuration table identifier described above, the implementation of the device can refer to the implementation of the method, and the repeated parts will not be described again.

[0114] Please see Figure 2 , Figure 3 , Figure 2 This is one of the structural schematic diagrams of a processing device for identifying a multi-branch game configuration table provided in an embodiment of this disclosure. Figure 3 This is a second schematic diagram of a processing device for identifying a multi-branch game configuration table, provided in an embodiment of this disclosure. Figure 2 As shown, the processing device 200 includes: Branch determination module 210 is used to determine at least two branches and a base branch specified from the at least two branches; The item set determination module 220 is used to obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the item set corresponding to each branch; The candidate identifier determination module 230 is used to determine at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added identifier, and the global identifier set containing all identifiers of each branch. The identifier addition module 240 is used to determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0115] In one alternative implementation, such as Figure 3 As shown, the processing device 200 further includes a vacancy anomaly detection module 250, which is used for: Based on the set of entries for each branch, identify the multiple identifiers contained in all branches, and determine the occurrence information of each identifier in each branch; Based on the occurrence information of each identifier in each branch, identify at least one missing anomaly identifier that appears in at least one branch but not in all branches. Display at least one missing anomaly identifier.

[0116] In one alternative implementation, for each branch, the entry set determination module 220 is used to construct the entry set for that branch through the following steps: For each branch, check if the target configuration item exists in the configuration table of that branch; If it does not exist, determine that the set of entries for that branch is an empty set; If it exists, read the data corresponding to the target configuration item in the configuration table in sequence, and determine the set of at least one combination of items after filtering out the data that meets the data filtering conditions of the item set as the item set of this branch.

[0117] In one optional implementation, the data filtering criteria for the item set include at least one of the following: The identifier or name item in the configuration table is empty; the value type corresponding to the identifier item in the configuration table is non-numeric; or the value corresponding to the identifier item in the configuration table exceeds the preset identifier value range.

[0118] In an optional implementation, when the candidate identifier determination module 230 determines at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to which the new identifier is to be added, and the global identifier set containing all identifiers of each branch, the candidate identifier determination module 230 is configured to: Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, a candidate starting value is determined; The candidate starting value is used to search and at least one candidate identifier is determined.

[0119] In an optional implementation, when the candidate identifier determination module 230 determines the candidate starting value based on the first set of entries of the baseline branch, the second set of entries of the target branch to which the new identifier is to be added, and the global identifier set containing all identifiers of each branch, the candidate identifier determination module 230 is used to: Based on the first set of entries and the second set of entries, determine a base-specific set of identifiers that exist in the first set of entries but do not exist in the second set of entries; Detect whether the set of reference-specific identifiers is an empty set; If the baseline-specific identifier set is empty, the sum of the maximum identifier value in the global identifier set and a preset value is determined as the candidate starting value; If the benchmark-specific identifier set is not empty, the sum of the maximum identifier value in the benchmark-specific identifier set and the preset value is determined as the candidate starting value.

[0120] In an optional implementation, when the candidate identifier determination module 230 is used to search for and determine at least one candidate identifier using the candidate starting value, the candidate identifier determination module 230 is used to: Starting from the candidate initial value, the search is performed incrementally according to a preset numerical growth threshold, and after filtering the identifiers existing in the first set of entries, at least one candidate identifier is determined.

[0121] In one alternative implementation, such as Figure 3 As shown, the processing device 200 further includes a benchmark-specific identifier display module 260, which is used for: If the set of benchmark-specific identifiers is not empty, display at least one benchmark-specific identifier located in the set of benchmark-specific identifiers.

[0122] In an optional embodiment, the processing device 200 further includes an information input module 270, the information input module 270 being used for: In response to the configuration table information input operation, the target name information and target trigger event corresponding to the target identifier are determined.

[0123] In an optional implementation, when the identifier addition module 240 adds the target identifier to the target configuration table corresponding to the target branch, the identifier addition module 240 is used to: After the target identifier, target name information, and target trigger event are verified, the target identifier, target name information, and target trigger event are written into the target configuration table accordingly.

[0124] In one optional implementation, when the entry set determination module 220 is used to obtain the configuration table for each branch, the entry set determination module 220 is used to: Based on the configuration table file paths of each branch, the initial configuration table located in each configuration table file path is read, and each initial configuration table is updated to the latest version before obtaining the configuration table of each branch.

[0125] In one alternative implementation, the branch includes at least one of the following: a main development branch, a gray-scale testing branch, a pre-release branch, and a formal release branch.

[0126] The multi-branch game configuration table identifier processing apparatus provided in this embodiment determines at least two branches and a base branch specified from the at least two branches; obtains the configuration table of each branch and extracts data from the configuration table of each branch to construct an entry set corresponding to each branch; determines at least one candidate identifier based on the first entry set of the base branch, the second entry set of the target branch to which the identifier is to be added, and a global identifier set containing all identifiers of each branch; determines the target identifier to be added to the target branch from the at least one candidate identifier, and adds the target identifier to the target configuration table corresponding to the target branch. In this way, by obtaining the configuration table of each branch and extracting the entry set corresponding to each branch, when determining the new identifier, the apparatus directly compares the entry set of the base branch, the entry set of the target branch to which the identifier is to be added, and the global identifier set containing all identifiers of each branch to determine the target new identifier that does not conflict with the base branch, reducing the step of searching for existing identifiers of each branch one by one, and helping to improve the efficiency of identifier addition and configuration table update.

[0127] Please see Figure 4 , Figure 4 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this disclosure. Figure 4 As shown, the electronic device 400 includes a processor 410, a memory 420, and a bus 430.

[0128] Identify at least two branches and a base branch specified from said at least two branches; Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch; Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, at least one candidate identifier is determined; Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0129] In one optional implementation, the instructions executed by the processor 410 further include: Based on the set of entries for each branch, identify the multiple identifiers contained in all branches, and determine the occurrence information of each identifier in each branch; Based on the occurrence information of each identifier in each branch, identify at least one missing anomaly identifier that appears in at least one branch but not in all branches. Display at least one missing anomaly identifier.

[0130] In one alternative implementation, for each branch of instructions executed by processor 410, the set of entries for that branch is constructed through the following steps: For each branch, check if the target configuration item exists in the configuration table of that branch; If it does not exist, determine that the set of entries for that branch is an empty set; If it exists, read the data corresponding to the target configuration item in the configuration table in sequence, and determine the set of at least one combination of items after filtering out the data that meets the data filtering conditions of the item set as the item set of this branch.

[0131] In one optional implementation, the data filtering conditions for the item set include at least one of the following: The identifier or name item in the configuration table is empty; the value type corresponding to the identifier item in the configuration table is non-numeric; or the value corresponding to the identifier item in the configuration table exceeds the preset identifier value range.

[0132] In one optional implementation, the instructions executed by the processor 410, which determine at least one candidate identifier based on the first set of entries of the base branch, the second set of entries of the target branch to be added with the identifier, and the global identifier set containing all identifiers of each branch, include: Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, a candidate starting value is determined; The candidate starting value is used to search and at least one candidate identifier is determined.

[0133] In one optional implementation, the instructions executed by processor 410, which determine the candidate starting value based on the first set of entries of the base branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, include: Based on the first set of entries and the second set of entries, determine a base-specific set of identifiers that exist in the first set of entries but do not exist in the second set of entries; Detect whether the set of reference-specific identifiers is an empty set; If the baseline-specific identifier set is empty, the sum of the maximum identifier value in the global identifier set and a preset value is determined as the candidate starting value; If the benchmark-specific identifier set is not empty, the sum of the maximum identifier value in the benchmark-specific identifier set and the preset value is determined as the candidate starting value.

[0134] In one optional implementation, the instructions executed by processor 410, wherein searching with the candidate starting value to determine at least one candidate identifier, include: Starting from the candidate initial value, the search is performed incrementally according to a preset numerical growth threshold, and after filtering the identifiers existing in the first set of entries, at least one candidate identifier is determined.

[0135] In one optional implementation, the instructions executed by the processor 410 further include: If the set of benchmark-specific identifiers is not empty, display at least one benchmark-specific identifier located in the set of benchmark-specific identifiers.

[0136] In one optional implementation, the instructions executed by the processor 410 further include: In response to the configuration table information input operation, the target name information and target trigger event corresponding to the target identifier are determined.

[0137] In an optional implementation, the instruction executed by processor 410, which involves adding the target identifier to the target configuration table corresponding to the target branch, includes: After the target identifier, target name information, and target trigger event are verified, the target identifier, target name information, and target trigger event are written into the target configuration table accordingly.

[0138] In one optional implementation, the instruction executed by processor 410, wherein obtaining the configuration table of each branch, includes: Based on the configuration table file paths of each branch, the initial configuration table located in each configuration table file path is read, and each initial configuration table is updated to the latest version before obtaining the configuration table of each branch.

[0139] In one optional implementation, the branch includes at least one of the following: a main development branch, a gray-scale testing branch, a pre-release branch, and a formal release branch.

[0140] By obtaining the configuration tables of each branch and extracting the corresponding set of entries for each branch, when determining the addition of a new identifier, the system directly compares the set of entries of the base branch, the set of entries of the target branch to which the new identifier is to be added, and the global identifier set containing all identifiers of each branch. This determines the target new identifier that does not conflict with the base branch, reducing the step of searching for existing identifiers in each branch one by one, and helping to improve the efficiency of adding identifiers and updating the configuration table. At the same time, by traversing the entry sets of each branch and checking the occurrence of each identifier in different branches, the system identifies any missing or abnormal identifiers and displays them to the user so that the user can make subsequent corrections. This reduces errors caused by manual checking and improves the accuracy of synchronizing the configuration tables of each branch.

[0141] This disclosure also provides a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the following instructions: Identify at least two branches and a base branch specified from said at least two branches; Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch; Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, at least one candidate identifier is determined; Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

[0142] In one optional implementation, the instructions executed by the computer-readable storage medium further include: Based on the set of entries for each branch, identify the multiple identifiers contained in all branches, and determine the occurrence information of each identifier in each branch; Based on the occurrence information of each identifier in each branch, identify at least one missing anomaly identifier that appears in at least one branch but not in all branches. Display at least one missing anomaly identifier.

[0143] In one alternative implementation, for each branch of the instructions executable by the computer-readable storage medium, the set of entries for that branch is constructed through the following steps: For each branch, check if the target configuration item exists in the configuration table of that branch; If it does not exist, determine that the set of entries for that branch is an empty set; If it exists, read the data corresponding to the target configuration item in the configuration table in sequence, and determine the set of at least one combination of items after filtering out the data that meets the data filtering conditions of the item set as the item set of this branch.

[0144] In one optional implementation, the data filtering conditions for the item set include at least one of the following: The identifier or name item in the configuration table is empty; the value type corresponding to the identifier item in the configuration table is non-numeric; or the value corresponding to the identifier item in the configuration table exceeds the preset identifier value range.

[0145] In one optional implementation, the instructions executed by the computer-readable storage medium, wherein determining at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the identifier, and the global identifier set containing all identifiers of each branch, includes: Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, a candidate starting value is determined; The candidate starting value is used to search and at least one candidate identifier is determined.

[0146] In one optional implementation, the instructions executed by the computer-readable storage medium, wherein determining the candidate starting value based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the identifier, and the global identifier set containing all identifiers of each branch, includes: Based on the first set of entries and the second set of entries, determine a base-specific set of identifiers that exist in the first set of entries but do not exist in the second set of entries; Detect whether the set of reference-specific identifiers is an empty set; If the baseline-specific identifier set is empty, the sum of the maximum identifier value in the global identifier set and a preset value is determined as the candidate starting value; If the benchmark-specific identifier set is not empty, the sum of the maximum identifier value in the benchmark-specific identifier set and the preset value is determined as the candidate starting value.

[0147] In one optional implementation, the instructions executable by the computer-readable storage medium, wherein the search for at least one candidate identifier based on the candidate starting value, includes: Starting from the candidate initial value, the search is performed incrementally according to a preset numerical growth threshold, and after filtering the identifiers existing in the first set of entries, at least one candidate identifier is determined.

[0148] In one optional implementation, the instructions executed by the computer-readable storage medium further include: If the set of benchmark-specific identifiers is not empty, display at least one benchmark-specific identifier located in the set of benchmark-specific identifiers.

[0149] In one optional implementation, the instructions executed by the computer-readable storage medium further include: In response to the configuration table information input operation, the target name information and target trigger event corresponding to the target identifier are determined.

[0150] In one optional implementation, the instructions executable by the computer-readable storage medium, wherein adding the target identifier to the target configuration table corresponding to the target branch, includes: After the target identifier, target name information, and target trigger event are verified, the target identifier, target name information, and target trigger event are written into the target configuration table accordingly.

[0151] In one optional implementation, the instructions executable by the computer-readable storage medium include, in part, obtaining the configuration table for each branch, comprising: Based on the configuration table file paths of each branch, the initial configuration table located in each configuration table file path is read, and each initial configuration table is updated to the latest version before obtaining the configuration table of each branch.

[0152] In one optional implementation, the branch includes at least one of the following: a main development branch, a gray-scale testing branch, a pre-release branch, and a formal release branch.

[0153] By obtaining the configuration tables of each branch and extracting the corresponding set of entries for each branch, when determining the addition of a new identifier, the system directly compares the set of entries of the base branch, the set of entries of the target branch to which the new identifier is to be added, and the global identifier set containing all identifiers of each branch. This determines the target new identifier that does not conflict with the base branch, reducing the step of searching for existing identifiers in each branch one by one, and helping to improve the efficiency of adding identifiers and updating the configuration table. At the same time, by traversing the entry sets of each branch and checking the occurrence of each identifier in different branches, the system identifies any missing or abnormal identifiers and displays them to the user so that the user can make subsequent corrections. This reduces errors caused by manual checking and improves the accuracy of synchronizing the configuration tables of each branch.

[0154] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0155] In the several embodiments provided in this disclosure, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. The apparatus embodiments described above are merely illustrative. For example, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. Furthermore, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Additionally, the shown or discussed mutual couplings, direct couplings, or communication connections may be through some communication interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0156] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0157] In addition, the functional units in the various embodiments of this disclosure can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0158] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a processor-executable, non-volatile, computer-readable storage medium. Based on this understanding, the technical solution of this disclosure, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0159] Finally, it should be noted that the above-described embodiments are merely specific implementations of this disclosure, used to illustrate the technical solutions of this disclosure, and not to limit it. The protection scope of this disclosure is not limited thereto. Although this disclosure has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features, within the scope of the technology disclosed in this disclosure; and these modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this disclosure, and should all be covered within the protection scope of this disclosure. Therefore, the protection scope of this disclosure should be determined by the protection scope of the claims.< / paths> < / paths>

Claims

1. A method for processing multi-branch game configuration table identifiers, characterized in that, The processing method includes: Identify at least two branches and a base branch specified from said at least two branches; Obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the entry set corresponding to each branch; Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, at least one candidate identifier is determined; Determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

2. The processing method according to claim 1, characterized in that, The processing method further includes: Based on the set of entries for each branch, identify the multiple identifiers contained in all branches, and determine the occurrence information of each identifier in each branch; Based on the occurrence information of each identifier in each branch, identify at least one missing anomaly identifier that appears in at least one branch but not in all branches. Display at least one missing anomaly identifier.

3. The processing method according to claim 1, characterized in that, For each branch, construct the set of entries for that branch using the following steps: For each branch, check if the target configuration item exists in the configuration table of that branch; If it does not exist, determine that the set of entries for that branch is an empty set; If it exists, read the data corresponding to the target configuration item in the configuration table in sequence, and determine the set of at least one combination of entries after filtering out the data that meets the data filtering conditions of the entry set as the entry set of this branch.

4. The processing method according to claim 3, characterized in that, The data filtering criteria for the item set include at least one of the following: The identifier or name item in the configuration table is empty; the value type corresponding to the identifier item in the configuration table is non-numeric; or the value corresponding to the identifier item in the configuration table exceeds the preset identifier value range.

5. The processing method according to claim 1, characterized in that, Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with the new identifier, and the global identifier set containing all identifiers of each branch, at least one candidate identifier is determined, including: Based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, a candidate starting value is determined; The candidate starting value is used to search and at least one candidate identifier is determined.

6. The processing method according to claim 5, characterized in that, The candidate starting value is determined based on the first set of entries of the baseline branch, the second set of entries of the target branch to be added with new identifiers, and the global identifier set containing all identifiers of each branch, including: Based on the first set of entries and the second set of entries, determine a base-specific set of identifiers that exist in the first set of entries but do not exist in the second set of entries; Detect whether the set of reference-specific identifiers is an empty set; If the baseline-specific identifier set is empty, the sum of the maximum identifier value in the global identifier set and a preset value is determined as the candidate starting value; If the benchmark-specific identifier set is not empty, the sum of the maximum identifier value in the benchmark-specific identifier set and the preset value is determined as the candidate starting value.

7. The processing method according to claim 5, characterized in that, The step of searching using the candidate starting value to determine at least one candidate identifier includes: Starting from the candidate initial value, the search is performed incrementally according to a preset numerical growth threshold, and after filtering the identifiers existing in the first set of entries, at least one candidate identifier is determined.

8. The processing method according to claim 6, characterized in that, The processing method further includes: If the set of benchmark-specific identifiers is not empty, display at least one benchmark-specific identifier located in the set of benchmark-specific identifiers.

9. The processing method according to claim 1, characterized in that, The processing method further includes: In response to the configuration table information input operation, determine the target name information and target trigger event corresponding to the target identifier; Adding the target identifier to the target configuration table corresponding to the target branch includes: After the target identifier, target name information, and target trigger event are verified, the target identifier, target name information, and target trigger event are written into the target configuration table accordingly.

10. The processing method according to claim 1, characterized in that, The process of obtaining the configuration tables for each branch includes: Based on the configuration table file paths of each branch, the initial configuration table located in each configuration table file path is read, and each initial configuration table is updated to the latest version before obtaining the configuration table of each branch.

11. The processing method according to claim 1, characterized in that, The branches include at least one of the following: main development branch, gray-scale testing branch, pre-release branch, and official release branch.

12. A processing device for identifying multi-branch game configuration tables, characterized in that, The processing device includes: A branch determination module is used to determine at least two branches and a base branch specified from the at least two branches; The item set determination module is used to obtain the configuration table of each branch, extract the data from the configuration table of each branch, and construct the item set corresponding to each branch; The candidate identifier determination module is used to determine at least one candidate identifier based on the first set of entries of the baseline branch, the second set of entries of the target branch to which the identifier is to be added, and the global identifier set containing all identifiers of each branch. The identifier addition module is used to determine the target identifier to be added to the target branch from the at least one candidate identifier, and add the target identifier to the target configuration table corresponding to the target branch.

13. An electronic device, characterized in that, include: The device includes a processor, a memory, and a bus, wherein the memory stores machine-readable instructions executable by the processor, and when the electronic device is running, the processor communicates with the memory via the bus, and the processor executes the machine-readable instructions to perform the steps of the processing method for a multi-branch game configuration table identifier as described in any one of claims 1 to 11.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, performs the steps of the processing method for the multi-branch game configuration table identifier as described in any one of claims 1 to 11.

Images