Test case processing method, device, medium, product
By parsing test cases into structured nodes and managing them using globally unique identifiers, the problem of low test case management efficiency is solved, enabling multi-user collaborative editing and fine-grained management, and improving the maintenance efficiency of baseline test case sets.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- JIN GONG MEN (NAN JING) SHU ZI KE JI YOU XIAN GONG SI
- Filing Date
- 2026-02-27
- Publication Date
- 2026-05-29
AI Technical Summary
During the iteration of software products, test case management is inefficient, multi-user collaborative editing is difficult, baseline test case maintenance is complex and unreliable, and the existing JSON format storage has coarse granularity, leading to management difficulties.
Test cases are parsed into structured data objects, divided into multiple nodes and assigned globally unique identifiers. Mind map and table views can be switched, and recursive matching and online collaborative editing of iterative and baseline test case sets can be achieved. Node management and merging are performed through globally unique identifiers.
It improves the efficiency of test case management, reduces communication costs caused by version conflicts, enables refined management and multi-user collaborative processing, and improves the efficiency of maintaining and updating baseline test case sets.
Smart Images
Figure CN122111857A_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of software testing technology, and in particular to a method, device, medium, or product for processing test cases. Background Technology
[0002] A test case is a set of documents or specifications that include test inputs, execution conditions, and expected results. It is designed to verify specific program logic or confirm whether a specific requirement is met. Test cases can guide test execution, standardize test data, evaluate test results, and analyze the root causes of defects. They are an important benchmark for measuring test coverage and quality.
[0003] When a software product reaches a relatively stable version, the number of test cases expands continuously as requirements iterate, posing a significant obstacle to selecting effective test cases for regression testing, smoke testing, and automated testing. Baseline test cases are designed to address this issue. Baseline test cases describe a set of test cases for all functionalities in a specific version of the software product and are continuously updated and maintained as software requirements change.
[0004] As software product features become increasingly rich and the number of test cases continues to grow, relying on manual selection of test cases and updating them to the baseline test case version makes the maintenance of baseline test cases inefficient and unreliable, often resulting in the following problems:
[0005] When different test case handlers edit test cases, they cannot collaborate in real time. Typically, conflicts are resolved and manually merged only after the test cases have been pushed out, resulting in significant potential communication costs and low efficiency.
[0006] Storing a set of test cases as a whole in JSON format and managing them as code based on JSON text files results in coarse-grained data storage, making it difficult to manage individual test cases. Fine-grained management of individual test cases is needed; any small change requires a commit to the entire JSON file. If changes are frequent, frequent commits and merges of the JSON text files are required.
[0007] Furthermore, the lack of management of baseline test cases, coupled with the ever-increasing number of test cases during software product iterations, makes the maintenance of baseline test cases complex, inefficient, and unreliable, becoming a problem that urgently needs to be solved. Summary of the Invention
[0008] To address the challenges of collaborative processing among multiple users when editing test cases, the need for refined management of individual test cases, and the efficient management of baseline test cases, this application proposes a test case processing method.
[0009] The test case processing method, used in an electronic device, includes the following steps: parsing the mind map format test cases into structured data objects and splitting them into multiple nodes; assigning a globally unique identifier to each node and storing the nodes and their associated relationships in a database; and, in response to a user's selection of a target functional module, displaying test cases in a switchable mind map view and a table view in the user interface based on all nodes stored in the database that are associated with the target functional module.
[0010] Optionally, the structured data object includes data in JSON or XML format.
[0011] Optionally, the node includes a first-level node, a second-level node, and a third-level node, wherein the first-level node includes a functional module, the second-level node includes a test case title, and the third-level node includes execution conditions, execution steps, and expected results.
[0012] Optionally, the third-level nodes can be set into two parallel categories, wherein the first category is the execution conditions, and the second category is the execution steps and the expected results.
[0013] Optionally, the processing method further includes: the test case set consisting of the test cases includes an iterative test case set and a baseline test case set; based on the globally unique identifier, node mapping is performed on the iterative test case set and the baseline test case set, and the nodes of the baseline test case set are recursively matched with the iterative test case set to modify the baseline test case set through the iterative test case set.
[0014] Optionally, the recursive matching includes determining whether the second-level nodes of the baseline test case set match in the iterative test case set when the first-level nodes of the baseline test case set and the iterative test case set are completely matched.
[0015] When matching, it is determined whether the third-level nodes corresponding to the second-level nodes of the iterative test case set and the baseline test case set are the same: if they are the same, the second-level nodes of the baseline test case set are recorded in the first set; if they are different, the position index and update tag of the second-level nodes of the iterative test case set are recorded in the second set.
[0016] When a mismatch occurs, determine whether to use incremental merging or overlay merging for the second-level node: when incremental merging is used, record the second-level node and the position index of the last successful match between the baseline test case set and the iterative test case set in the third set; when overlay merging is used, record the deletion mark, the second-level node, and the position index of the last successful match between the baseline test case set and the iterative test case set in the fourth set.
[0017] Optionally, the processing method further includes: generating a mind map preview of the baseline test case set based on the first set, the second set, the third set, and the fourth set, and rendering corresponding modifications and markings at corresponding positions in the mind map preview; receiving modification instructions from the user, and modifying the baseline test case set based on the mind map preview.
[0018] Optionally, the incremental merging includes adding, updating, and adjusting the order, and the overlay merging includes adding, deleting, updating, and adjusting the order.
[0019] Optionally, the overlay merging is applied only to the third-level nodes.
[0020] Optionally, the processing method further includes: receiving an editing request for the target functional module from an electronic device, establishing a real-time communication connection with a server; sending change operation data generated during the editing process for at least one of the nodes to the server through the real-time communication connection; the server forwarding the change operation data to another electronic device that is editing data associated with the target functional module; the other electronic device locating the corresponding node in the other electronic device based on the globally unique identifier of the corresponding node associated with the change operation contained in the change operation data and the globally unique identifier of the corresponding node, and updating its user interface in real time.
[0021] This application also proposes an electronic device comprising a memory storing computer-executable instructions and a processor; when the instructions are executed by the processor, the device performs the processing method according to any of the preceding claims.
[0022] This application also proposes a computer-readable storage medium storing one or more programs that can be executed by one or more processors to implement the processing method described in any of the preceding claims.
[0023] This application also proposes a computer program product, including a computer program that, when executed by a processor, implements the processing method as described in any of the preceding claims.
[0024] In summary, this application provides a method for processing test cases. By parsing test mind map files into multi-level nodes (functional modules, test case titles, execution conditions, execution steps, and expected results) according to node type and storing them using globally unique identifiers, the method allows for free switching between the mind map (JSON) view and table view of the test case data, enabling the switching and management of nodes for any functional module. Simultaneously, online collaborative editing based on JSON data format resolves version conflicts arising from multi-user editing, reducing communication costs caused by test case version conflicts during the push phase. Furthermore, this method also considers both global management of the global mind map for any functional module node and fine-grained management of individual test cases, allowing for arbitrary expansion of the attributes of individual test cases without frequent submissions and merging. Finally, the method differentiates and manages test case sets and supports merging iterative test case sets with baseline test case sets, thereby improving test case management efficiency and resolving the inefficiencies and unreliability of maintaining and updating baseline test case sets. Attached Figure Description
[0025] Figure 1 This is a schematic diagram of a communication system according to an embodiment of this application.
[0026] Figure 2 This is a flowchart of a test case processing method according to an embodiment of this application.
[0027] Figure 3 This is a schematic diagram of a user interface according to an embodiment of this application.
[0028] Figure 4 This is a structural schematic diagram of a mind map according to an embodiment of this application.
[0029] Figure 5 This is a flowchart of the collaborative processing in the processing method according to the embodiments of this application.
[0030] Figure 6 This is a schematic diagram of an electronic device according to an embodiment of this application. Detailed Implementation
[0031] The following description, with reference to the accompanying drawings, illustrates the method for processing the test cases proposed in this application.
[0032] Figure 1 This is a schematic diagram of a communication system that implements the test case processing method proposed in this application.
[0033] The system 100 includes: a web client 101, a server 102, and a data storage terminal 103. The web client 101 is used for test case management, collaborative editing, viewing and merging of test case sets, and can provide users with mind maps and test case tables in any directory of test cases. It also manages test case sets. The server 102 is used for editing and processing test cases and provides WebSocket message broadcasting capabilities for changes to the test case mind maps in the web client 101. The data storage terminal 103 is used to store test case management data.
[0034] Figure 2 This is a flowchart of the test case processing method proposed in this application.
[0035] In step 21, the test cases in mind map format are parsed into structured data objects and broken down into multiple nodes. The test cases in mind map format can be, for example, XMIND format, and the structured data objects can be, for example, JSON or XML format. In the mind map format, the test cases have a tree structure, including multiple levels of different nodes, and the structured data objects can be broken down according to node type. In one embodiment, the test cases are divided into three levels of nodes. The first level node includes a functional module, indicating which business / application function the test case is specifically used to test, such as login or payment functions. The second level node includes a test case title, indicating the name or specific function of the test case, such as password verification or network connection confirmation. The third level node includes execution conditions, execution steps, and expected results, indicating the specific execution flow of the test case corresponding to the second level node. Execution conditions include, for example, user registration and sufficient account balance; execution steps include, for example, entering a username and clicking login; expected results include, for example, successfully redirecting to the homepage and displaying a password error message. In addition, the third-level nodes can be set into two parallel categories, where the first category is the execution conditions and the second category is the execution steps and expected results.
[0036] In step 22, a globally unique identifier is assigned to each node, and the nodes and their relationships are stored in the database. By assigning a globally unique identifier to each node, the corresponding node can be quickly indexed and located based on that identifier.
[0037] In step 23, in response to the user's selection of the target functional module, test cases for switchable mind map view and table view are displayed in the user interface based on all nodes associated with the target functional module stored in the database.
[0038] The display format of test cases can be switched arbitrarily within the user interface. For example... Figure 3As shown, in the mind map view displayed in the user interface, the test cases corresponding to the selected functional module are restored as JSON data and rendered as a mind map. Users can edit the test cases on the mind map. In this embodiment, the first-level node further refers to the node corresponding to the final-level functional module.
[0039] In the table view, all test cases of the selected functional module and all its subordinate nodes can be displayed as a single test case in multiple columns, with each column representing an attribute of the test case.
[0040] Therefore, by combining node-based and tabular management, attributes can be modified individually or in batches for each node of a test case. Test cases can be updated and expanded freely without generating a large number of commit and merge records, minimizing the impact on the mind map. If new attributes need to be added, a specific identifier can be added to the test case title node (i.e., the second-level node) when creating the mind map file. During updates, only the identified node needs to be parsed, without modifying the entire test case, thus achieving fine-grained management of test cases.
[0041] In one embodiment, the test case set is further divided into an iterative test case set and a baseline test case set to facilitate the management of baseline test cases. The iterative test case set manages test cases for daily iteration requirements, organizing the test cases for each iteration by iteration version. The baseline test case set manages baseline test cases, always containing a full set of test cases for the latest version of the software product's functional requirements, and requires continuous updates and maintenance. When writing test cases for a specific iteration version, the functional modules involved in that iteration version are analyzed, and the functional module hierarchy or a combination of functional modules and test cases is imported from the baseline test case set. Based on this, test cases are added, modified, or deleted. If the iteration version involves functional module changes, the operation is first performed on the baseline test case set to ensure a complete match between the functional module hierarchy in the iterative test case set and the baseline test case set.
[0042] In one embodiment, node mapping is performed between the iterative test case set and the baseline test case set based on globally unique identifiers. The nodes of the baseline test case set are then recursively matched with those of the iterative test case set to modify the baseline test case set. Node mapping essentially maps all nodes in the iterative and baseline test case sets that share the same globally unique identifier. This node mapping, along with the globally unique identifiers corresponding to the nodes, creates an easy-to-lookup data structure.
[0043] Recursive matching includes several scenarios. In this embodiment, since the final-level functional module is used as the first-level node, and the baseline test cases are merged and modified for this final-level functional module, it is necessary to first determine whether the first-level nodes of the baseline test case set and the iterative test case set match, so as to ensure that the merging process is performed only when the first-level nodes are completely matched. When the first-level nodes of the baseline test case set and the iterative test case set are completely matched, it is then determined whether the second-level nodes of the baseline test case set match in the iterative test case set, and corresponding operations are performed based on the matching results. In other words, the second-level nodes and third-level nodes are only processed after the first-level nodes are completely matched. This is because changes to the first-level nodes, i.e., functional modules, are infrequent, and there are usually no significant additions, deletions, or modifications to functional module nodes. If a functional module changes, it can be updated automatically in the baseline test case set. In other embodiments, the matching of nodes at other levels can also be determined. For ease of explanation, the following description is based on the second-level nodes.
[0044] During matching, the complete attributes of the test case title corresponding to the second-level node in both the iterative test case set and the baseline test case set are read from the database using its globally unique identifier. This is used to determine if the third-level nodes corresponding to the second-level nodes in the iterative and baseline test case sets are the same. If they are the same, it is assumed that the test case in the iterative test case set has not been modified and is identical to the baseline test case. In this case, the second-level node in the baseline test case set is directly recorded in the first set. If they are different, it is assumed that the third-level node in the iterative test case set has been updated. Therefore, the position index and update flag of the second-level node in the iterative test case set are recorded in the second set. The update flag indicates that the node needs to be updated. Specifically, the update flag can include flags indicating different update methods.
[0045] When a mismatch occurs, it indicates that the test case (i.e., the test case corresponding to the title of the second-level node) does not exist in the iterative test case set, meaning it has been deleted. In this case, it's necessary to determine whether to use incremental merging or overriding merging for the second-level node to differentiate the processing. Incremental merging includes adding, updating, and adjusting the order, while overriding merging includes adding, deleting, updating, and adjusting the order. Since editing test cases is always complete, when editing a second-level node, merging its subordinate nodes (i.e., third-level nodes) is preferably overriding merging to modify the complete test case flow. When using incremental merging, the test case is retained and requires no further processing; it only needs to be inserted into the iterative test case set. At this time, the index of the second-level node and the last successfully matched position between the baseline test case set and the iterative test case set is recorded in the third set. The index of the previously successfully matched second-level node is the index of the last successfully matched node, thus determining the position of the node to be merged. When using coverage merging, i.e. the test case needs to be deleted from the baseline test case, the deletion mark, the second-level node, and the position index of the last successful match between the baseline test case set and the iterative test case set are recorded in the fourth set.
[0046] It is understandable that the first set, the second set, the third set, and the fourth set are all ordered sets to facilitate index lookup of nodes at each level.
[0047] Next, the iterative test case set is modified based on the four ordered sets obtained. Specifically, at the corresponding node positions in the baseline test case set, the corresponding modifications and corresponding markers recorded in the four sets are inserted. When the index positions of matched nodes in the first set are different in the iterative test case set and the baseline test case set, they are marked as adjusted in the baseline test case set; when the corresponding node is not in the second set, it is marked as added in the baseline test case set; unmatched nodes in the third set are read and inserted into the corresponding positions in the baseline test case set without marking; deleted nodes are read from the fourth set, and deleted nodes are inserted into the corresponding positions in the baseline test case set and marked as deleted.
[0048] After recursively processing and operating on all levels of nodes, these modifications and markers are rendered into a mind map preview as temporary data for merging and previewing. Users can use the mind map preview to check for anomalies. Once the check is complete and error-free, a merge command can be initiated. Based on the modifications and markers in the mind map preview, the merged official application is applied to the baseline test case set, updating and modifying it to ensure the changes take effect and are saved to the database. In this embodiment, the mind map preview is generated and displayed within the baseline test case set. In other embodiments, it can also be generated within the iterative test case set, or a new mind map preview can be generated independently of both the iterative and baseline test case sets.
[0049] It is understandable that in practice, modifications to test cases are always a one-time, complete operation, thus avoiding any increase in operational complexity. In this embodiment, the test case title node and its subordinate nodes are treated as a whole. That is, the four types of operations—adding, deleting, updating, and adjusting the order of subordinate nodes of the test case title—are not restricted by the merging method and are always processed using the overwrite merging method. Therefore, even if the incremental merging method is selected, the subordinate nodes of the test case title node will still be deleted.
[0050] Next, combine Figure 4 The example shown further illustrates the above merging method. Figure 4 (a) is a mind map of the baseline test case set; (b) is a mind map of the iterative test case set; (c) is a preview of the marked mind map when using coverage merging; and (d) is a preview of the marked mind map when using incremental merging. Node A is a first-level node, nodes B, C, D, E, and L are second-level nodes, and nodes F, G, H, I, J, and K are third-level nodes.
[0051] like Figure 4As shown, in the coverage merging method, node D and its subordinate node I are marked as deleted, node L and its subordinate node M are marked as added, and nodes K and J are marked as adjusted order. The index position of node L is determined based on the recursive matching of the iterative test case set and the baseline test case set. When matching node L, since node C was matched last time, the index position starts from 0 (in this embodiment, the index position of node B is 0), and the difference between the index positions of node L and node C is 1. If the index position of the last matched node is set to x (for example, the index position of node C is x=1), then the relative position of the newly added node L inserted into the iterative test case is x+1=2. The moving in and moving out of node H is simplified to adding and deleting, which can reduce the complexity of operation. The order of nodes K and J is only adjusted within their parent nodes, without involving moving in or out of parent nodes, so only their position index needs to be adjusted and marked as adjusted order. In the incremental merging method, deletion operations are not processed. Therefore, node D and its subordinate node I, as well as node C's subordinate node H, will not be marked as deleted; instead, they will remain unmarked to indicate that no deletion processing is needed during the merging process. Furthermore, as shown in the figure, for nodes with corresponding modification markers, their modification can be highlighted by darkening the node color. It is understood that although this embodiment uses corresponding Chinese characters next to the relevant nodes for marking, any form of marking can be applied in other embodiments.
[0052] Therefore, by using the above method to differentiate and manage test case sets and supporting the merging of iterative test case sets and baseline test case sets, the management efficiency of test cases is improved, and the inefficiency and unreliability of maintaining and updating baseline test case sets are solved.
[0053] Finally, the processing method proposed in this application also enables different users to perform online real-time collaborative processing of test cases, supporting multiple users to simultaneously collaborate on editing mind maps with overlapping datasets, and synchronizing user modifications to other users' editing areas in real time.
[0054] Dataset crossover can involve the following situations: complete consistency and inclusion. If the globally unique identifiers (IDs) of functional modules edited by different users are the same, the datasets are considered completely consistent. If a functional module edited by one user is a subset of functional modules edited by another user, then a inclusion relationship is considered. For example... Figure 3 The third-level functional module C shown is contained within the second-level functional module A.
[0055] The flowchart of the collaborative processing is as follows: Figure 5 As shown.
[0056] In step 51, an editing request for the target functional module is received from an electronic device, and a real-time communication connection with the server is established. The electronic device is, for example, the aforementioned web client.
[0057] In step 52, the change operation data generated during the editing process for at least one node is sent to the server via a real-time communication connection.
[0058] When a user enters edit mode and sends an edit request to the selected target function module through their electronic device, the device establishes a real-time communication connection (WebSocket connection) with the server storing test case data. At this time, the server temporarily records the complete JSON data of the user's real-time mind map. When the user adds, deletes, modifies, or moves nodes in the mind map, the electronic device sends detailed JSON data of the operated node to the server via a WebSocket message. For adding nodes, the electronic device automatically generates a globally unique identifier for that node.
[0059] In step 53, the server forwards the change operation data to another electronic device that is editing data associated with the target functional module.
[0060] When other users' electronic devices enter edit mode, the server first determines whether the functional modules edited by other users are completely identical or contain each other. If so, the server obtains the previous user's temporary data through WebSocket messages and broadcasts the dataset of the overlapping area to other users' electronic devices. This allows other users to obtain the latest unsaved data from the previous user when they enter edit mode, without the previous user having to save and upload the changes to the server before synchronizing them to other users.
[0061] In step 54, another electronic device locates the corresponding node in the other electronic device based on the globally unique identifier of the corresponding node associated with the change operation contained in the change operation data and the globally unique identifier of the corresponding node's parent node, and updates its user interface in real time.
[0062] When other users' electronic devices receive a WebSocket message, they can accurately locate the corresponding node within the edited dataset using the globally unique identifier of the manipulated node and its parent node. This allows the previous user's actions on the node to be displayed in real-time within the editing area of the other user's electronic device. The arbitrary node can be of any level, and its data includes both the current node's globally unique identifier and the globally unique identifier of its parent node. For example, when a user adds a node, the front-end assigns it a globally unique identifier in real-time. When this addition is forwarded to another user, since the node is newly added, the other user's electronic device does not yet have its globally unique identifier. Therefore, it is necessary to locate the newly added node in their electronic device using the corresponding globally unique identifier from the change operation data. When a user moves a node, the parent node also changes, so the globally unique identifier of the parent node is needed to locate the moved node.
[0063] Using the above method, when multiple users are editing mind maps of test cases online, the editing content can be synchronized in real time.
[0064] Now for reference Figure 6 The diagram shown is a block diagram of an electronic device 600 according to an embodiment of the present application. The electronic device 600 may include one or more processors 602, system control logic 608 connected to at least one of the processors 602, system memory 604 connected to the system control logic 608, non-volatile memory (NVM) 606 connected to the system control logic 608, and network interface 610 connected to the system control logic 608.
[0065] Processor 602 may include one or more single-core or multi-core processors. Processor 602 may include any combination of general-purpose processors and special-purpose processors (e.g., graphics processors, application processors, baseband processors, etc.). In embodiments herein, processor 602 may be configured to perform one or more embodiments of various embodiments of processing methods for test cases proposed in this application.
[0066] In some embodiments, system control logic 608 may include any suitable interface controller to provide any suitable interface to at least one of the processors 602 and / or any suitable device or component communicating with system control logic 608.
[0067] In some embodiments, system control logic 608 may include one or more memory controllers to provide an interface to system memory 604. System memory 604 may be used to load and store data and / or instructions. In some embodiments, system memory 604 of electronic device 600 may include any suitable volatile memory, such as suitable dynamic random access memory (DRAM).
[0068] The nonvolatile memory 606 may include one or more tangible, non-transitory computer-readable storage media for storing data and / or instructions. In some embodiments, the nonvolatile memory 606 may include any suitable nonvolatile memory such as flash memory and / or any suitable nonvolatile storage device, such as at least one of HDD (Hard Disk Drive), CD (Compact Disc) drive, and DVD (Digital Versatile Disc) drive.
[0069] The non-volatile memory 606 may include a portion of the storage resources installed on the device of the electronic device 600, or it may be accessible by the device but is not necessarily part of the device. For example, the non-volatile memory 606 may be accessed over a network via the network interface 610.
[0070] Specifically, system memory 604 and non-volatile memory 606 may each include a temporary copy and a permanent copy of instructions 620. Instructions 620 may include instructions that, when executed by at least one of processors 602, cause electronic device 600 to implement the methods provided in this application. In some embodiments, instructions 620, hardware, firmware, and / or their software components may additionally / alternatively reside in system control logic 608, network interface 610, and / or processor 602.
[0071] In some embodiments, network interface 610 may be integrated into other components of electronic device 600. For example, network interface 610 may be integrated into at least one of processor 602, system memory 604, non-volatile memory 606, and firmware device (not shown) having instructions that, when at least one of processor 602 executes the instructions, electronic device 600 implements one or more embodiments of various embodiments of the processing methods for test cases described herein. Network interface 610 may further include any suitable hardware and / or firmware to provide a multiple-input multiple-output radio interface.
[0072] In one embodiment, at least one of the processors 602 may be packaged together with the logic of one or more controllers for system control logic 608 to form a system package (SiP). In another embodiment, at least one of the processors 602 may be integrated on the same die with the logic of one or more controllers for system control logic 608 to form a system on chip (SoC).
[0073] Electronic device 600 may further include: input / output (I / O) device 612. Input / output (I / O) device 612 may include a user interface that enables a user to interact with electronic device 600; the design of peripheral component interfaces enables peripheral components to also interact with electronic device 600.
[0074] In some embodiments, the user interface may include, but is not limited to, a display (e.g., a liquid crystal display, a touch screen display, etc.), a speaker, a microphone, one or more cameras (e.g., a still image camera and / or a video camera), a flashlight (e.g., a light-emitting diode flash), and a keyboard.
[0075] In some embodiments, the peripheral component interface may include, but is not limited to, a non-volatile memory port, an audio jack, and a power interface.
[0076] It is understood that the structures illustrated in the embodiments of the present invention do not constitute a specific limitation on the electronic device 600. In other embodiments of this application, the electronic device 600 may include more or fewer components than illustrated, or combine some components, or split some components, or have different component arrangements. The illustrated components may be implemented in hardware, software, or a combination of software and hardware.
[0077] Program code can be applied to input instructions to perform the functions described herein and generate output information. The output information can be applied to one or more output devices in a known manner. For the purposes of this application, the processing system includes any system having a processor such as, for example, a digital signal processor (DSP), a microcontroller, an application-specific integrated circuit (ASIC), or a microprocessor.
[0078] The program code can be implemented using a high-level procedural language or an object-oriented programming language to communicate with the processing system. Assembly language or machine language can also be used when needed. In fact, the mechanisms described in this paper are not limited to any particular programming language. In either case, the language can be a compiled language or an interpreted language.
[0079] One or more aspects of at least one embodiment can be implemented by representational instructions stored on a computer-readable storage medium, the instructions representing various logics in a processor, which, when read by a machine, cause the machine to create logic for performing the techniques described herein. These representations, referred to as “IP cores,” can be stored on a tangible computer-readable storage medium and provided to multiple customers or production facilities for loading into manufacturing machines that actually manufacture the logic or processor.
[0080] One embodiment of this application discloses a computer-readable storage medium storing one or more programs that can be executed by one or more processors to implement the test case processing method of this application.
[0081] One embodiment of this application discloses a computer program product, including a computer program that, when executed by a processor, implements a processing method for test cases of this application.
[0082] The specific embodiments described above illustrate the implementation of this application. Those skilled in the art can easily understand other advantages and effects of this application from the content disclosed in this specification. Although the description of this application is presented in conjunction with preferred embodiments, this does not mean that the features of this invention are limited to these embodiments. Furthermore, to avoid confusion or obscuring the focus of this application, some specific details will be omitted in the description. It should be noted that, unless otherwise specified, the embodiments and features described in this application can be combined with each other.
[0083] Furthermore, the various operations will be described as multiple discrete operations in a manner most conducive to understanding the illustrative embodiments; however, the order of description should not be construed as implying that these operations must depend on the order. In particular, these operations do not need to be performed in the order presented.
[0084] Unless the context otherwise specifies, the terms “contains,” “has,” and “includes” are synonyms. The phrase “A / B” means “A or B.” The phrase “A and / or B” means “(A and B) or (A or B).”
[0085] As used herein, the terms “module” or “unit” may refer to, be, or include: application-specific integrated circuits (ASICs), electronic circuits, (shared, dedicated, or group) processors and / or memories that execute one or more software or firmware programs, combinational logic circuits, and / or other suitable components that provide the described functionality.
[0086] In the accompanying drawings, certain structural or methodological features are shown in a specific arrangement and / or order. However, it should be understood that such a specific arrangement and / or order may not be necessary. In some embodiments, these features may be arranged in a manner and / or order different from that shown in the illustrative drawings. Furthermore, the inclusion of structural or methodological features in a particular figure does not imply that such features are required in all embodiments, and in some embodiments, these features may be omitted or may be combined with other features.
[0087] It should be understood that although terms such as "first," "second," etc., may be used herein to describe various units or data, these units or data should not be limited by these terms. These terms are used merely to distinguish one feature from another. For example, without departing from the scope of the exemplary embodiments, a first feature may be referred to as a second feature, and similarly, a second feature may be referred to as a first feature.
[0088] It should be noted that in this specification, similar reference numerals and letters in the following figures indicate similar items. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures.
[0089] Although the invention has been illustrated and described with reference to certain preferred embodiments thereof, those skilled in the art will understand that various changes in form and detail may be made therein without departing from the spirit and scope of the invention.
Claims
1. A method for processing test cases, used in electronic devices, characterized in that, include: The mind map format test cases are parsed into structured data objects and broken down into multiple nodes; Each node is assigned a globally unique identifier, and the nodes and their associated relationships are stored in a database; In response to the user's selection of the target functional module, test cases for switchable mind map view and table view are displayed in the user interface based on all nodes associated with the target functional module stored in the database.
2. The processing method according to claim 1, characterized in that, The structured data objects include data in JSON or XML format.
3. The processing method according to claim 2, characterized in that, The nodes include first-level nodes, second-level nodes, and third-level nodes. The first-level nodes include functional modules, the second-level nodes include test case titles, and the third-level nodes include execution conditions, execution steps, and expected results.
4. The processing method according to claim 3, characterized in that, The third-level nodes are set into two parallel categories, where the first category is the execution conditions and the second category is the execution steps and the expected results.
5. The processing method according to claim 4, characterized in that, include: The test case set constituted by the test cases includes an iterative test case set and a baseline test case set; Based on the globally unique identifier, node mapping is performed on the iterative test case set and the baseline test case set, and the nodes of the baseline test case set are recursively matched with the iterative test case set to modify the baseline test case set through the iterative test case set.
6. The processing method according to claim 5, characterized in that, The recursive matching includes determining whether the second-level nodes of the baseline test case set match in the iterative test case set when the first-level nodes of the baseline test case set and the iterative test case set are completely matched. During matching, it is determined whether the third-level nodes corresponding to the second-level nodes of the iterative test case set and the baseline test case set are the same: If they are the same, the second-level node of the baseline test case set is recorded in the first set; If they are different, the position index and update tag of the second-level node of the iterative test case set are recorded in the second set; When a mismatch occurs, determine whether to perform an incremental merge or an overwrite merge on the second-level nodes: When the incremental merging is used, the second-level node and the position index of the last successful match between the baseline test case set and the iterative test case set are recorded in the third set; When the coverage merging is used, the deletion marker, the second-level node, and the position index of the last successful match between the baseline test case set and the iterative test case set are recorded in the fourth set.
7. The processing method according to claim 6, characterized in that, Also includes: Based on the first set, the second set, the third set, and the fourth set, a mind map preview of the baseline test case set is generated, and corresponding modifications and markings are rendered at the corresponding positions in the mind map preview. Receive modification instructions from the user and modify the baseline test case set based on the mind map preview.
8. The processing method according to claim 7, characterized in that, The incremental merging includes adding, updating, and adjusting the order, while the overlay merging includes adding, deleting, updating, and adjusting the order.
9. The processing method according to claim 8, characterized in that, The third-level node is only subject to the coverage merging method.
10. The processing method according to claim 9, characterized in that, Also includes: Receive editing requests for the target functional module from electronic devices and establish a real-time communication connection with the server; Change operation data generated during the editing process for at least one of the nodes is sent to the server via the real-time communication connection; The server forwards the change operation data to another electronic device that is editing data associated with the target functional module; The other electronic device locates the corresponding node in the other electronic device based on the globally unique identifier of the corresponding node associated with the change operation contained in the change operation data and the globally unique identifier of the parent node of the corresponding node, and updates its user interface in real time.
11. An electronic device, characterized in that, The device includes a memory storing computer-executable instructions and a processor; when the instructions are executed by the processor, the device performs the processing method according to any one of claims 1-10.
12. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores one or more programs, which can be executed by one or more processors to implement the processing method according to any one of claims 1-10.
13. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, it implements the processing method as described in any one of claims 1-10.