CN115080434A - Case execution method, apparatus, equipment and medium - Google Patents

Abstract

The present disclosure provides a case execution method, apparatus, device, medium and program product, which relate to the field of computer technology and can be applied to the field of financial technology. The case execution method includes: obtaining a historical execution result of each to-be-executed case in a case set to be executed; determining a first case set according to a first historical execution result, and the first historical execution result represents the history of the latest M times of the to-be-executed case The execution result includes at least one execution failure; schedule the first case set to the to-be-executed case set to obtain the target case set, where the target case set includes at least one target case; and execute each target case in the target case set to obtain the history of the target case Results of the.

Description

Case execution method, apparatus, equipment and medium

technical field

The present disclosure relates to the field of computer technology, in particular to the field of testing technology, and more particularly to a case execution method, apparatus, device, medium and program product.

Background technique

During the version update and other processes, the existing test cases will be retained. In the next test, which test cases to execute to achieve a good test effect is an urgent problem to be solved.

The current case execution methods include: execution of all cases and manual selection of partial cases. The first case execution method has higher regression quality, but the cost is higher, and the second case execution method relies too much on human experience, so the current case execution method is inefficient.

SUMMARY OF THE INVENTION

In view of the above problems, the present disclosure provides a case execution method, apparatus, device, medium and program product for improving case execution efficiency.

According to a first aspect of the present disclosure, there is provided a case execution method, comprising: obtaining a historical execution result of each to-be-executed case in a case set to be executed; The historical execution result indicates that the latest M times of historical execution results of the case to be executed include at least one execution failure; schedule the first case set to the to-be-executed case set to obtain a target case set, where the target case set includes at least one target case; and execute the target case For each target case in the collection, the historical execution results of the target case are obtained.

According to an embodiment of the present disclosure, the case execution method further includes: determining a second case set according to a second historical execution result, where the second historical execution result indicates that the latest M times of historical execution results of the case to be executed are all successfully executed and to be executed The failure rate of N historical execution results of the case is greater than the first threshold, where N is greater than M, and N and M are positive integers; and the second case set is scheduled to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the case to be executed includes a category label, and the case execution method further includes: dividing the first case set and the second case set into at least one category label scheduling case set according to the category label; scheduling the case set according to the label determine the third case set; and schedule the third case set to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the to-be-executed case includes a category label, and the case execution method further includes: dividing the to-be-executed case set into at least one category of to-be-executed labeled case sets according to the category label; The to-be-executed label case set corresponding to the category label is dispatched to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the case execution method further includes: at the update time, determining R cases with the latest updated historical execution results from the existing case set, to obtain a to-be-executed case set.

According to an embodiment of the present disclosure, the case execution method further includes: when the number of cases in the to-be-executed case set is less than R, executing each to-be-executed case in the to-be-executed case set.

According to an embodiment of the present disclosure, the case to be executed further includes test scope information, and the case execution method further includes: according to the test scope information, dividing the set of cases to be executed into at least one scope case set to be executed of the test scope; and in response to selecting the test Scope, schedule the to-be-executed range case set corresponding to the test scope to the to-be-executed case set to obtain the target case set.

A second aspect of the present disclosure provides a case execution apparatus, including: a historical execution result determination and acquisition module, a first case set determination module, a first target case set determination module, and a first case execution module. The historical execution result determination and acquisition module is used to acquire the historical execution result of each to-be-executed case in the to-be-executed case set; the first case set determination module is used to determine the first case set, the first historical execution result according to the first historical execution result The execution result indicates that the latest M times of historical execution results of the to-be-executed case include at least one execution failure; the first determination module of the target case set is used to schedule the first case set to the to-be-executed case set to obtain the target case set, and the target case set includes At least one target case; the case first execution module is used to execute each target case in the target case set, and obtain the historical execution result of the target case.

A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more programs, wherein when the one or more programs are executed by the one or more programs When executed by the processors, one or more processors are caused to execute the methods of the embodiments of the present disclosure.

A fourth aspect of the present disclosure also provides a computer-readable storage medium having executable instructions stored thereon, the instructions, when executed by a processor, cause the processor to perform the method of an embodiment of the present disclosure.

A fifth aspect of the present disclosure further provides a computer program product, including a computer program, where the computer program is stored on at least one of a readable storage medium and an electronic device, and when the computer program is executed by a processor, implements the functions of the embodiments of the present disclosure. method.

Description of drawings

The foregoing and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:

FIG. 1 schematically shows an application scenario diagram of a case execution method, apparatus, device, medium and program product according to an embodiment of the present disclosure;

FIG. 2 schematically shows a flowchart of a case execution method according to an embodiment of the present disclosure;

FIG. 3 schematically shows a flowchart of a case execution method according to another embodiment of the present disclosure;

FIG. 4 schematically shows a flowchart of a case execution method according to yet another embodiment of the present disclosure;

FIG. 5 schematically shows a flowchart of a case execution method according to yet another embodiment of the present disclosure;

FIG. 6 schematically shows a flowchart of a case execution method according to yet another embodiment of the present disclosure;

FIG. 7 schematically shows a flowchart of a case execution method according to yet another embodiment of the present disclosure;

FIG. 8 schematically shows a block diagram of a case execution apparatus according to an embodiment of the present disclosure; and

FIG. 9 schematically shows a block diagram of an electronic device suitable for implementing the case execution method of the embodiment of the present disclosure according to the embodiment of the present disclosure.

Detailed ways

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood, however, that these descriptions are exemplary only, and are not intended to limit the scope of the present disclosure. In the following detailed description, for convenience of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the present disclosure. It will be apparent, however, that one or more embodiments may be practiced without these specific details. Also, in the following description, descriptions of well-known structures and techniques are omitted to avoid unnecessarily obscuring the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the present disclosure. The terms "comprising", "comprising" and the like as used herein indicate the presence of stated features, steps, operations and/or components, but do not preclude the presence or addition of one or more other features, steps, operations or components.

All terms (including technical and scientific terms) used herein have the meaning as commonly understood by one of ordinary skill in the art, unless otherwise defined. It should be noted that terms used herein should be construed to have meanings consistent with the context of the present specification and should not be construed in an idealized or overly rigid manner.

Where expressions like "at least one of A, B, and C, etc.," are used, they should generally be interpreted in accordance with the meaning of the expression as commonly understood by those skilled in the art (eg, "has A, B, and C") At least one of the "systems" shall include, but not be limited to, systems with A alone, B alone, C alone, A and B, A and C, B and C, and/or A, B, C, etc. ).

Software testing is an important link in the current software development process, and work quality and efficiency are very important. A test case (hereinafter referred to as a test case) is a description of the testing task for a specific software product, reflecting the test plan and method. , technology and strategy.

Regression test verification can be understood as retesting after modifying the old code to confirm that the modification did not introduce new errors or cause errors in other code. Test regression verification can reduce the cost of system testing, maintenance and upgrade stages.

The execution method of the case (that is, how to choose the case to be executed for testing) is very important for the test regression verification.

The case execution method of some embodiments is to directly execute the full amount of cases without any screening. This case execution method can guarantee the quality of regression, but it takes a long time, increases the input cost of manpower and resources, and is inefficient.

The case execution method of some embodiments is to selectively execute some cases by relying on human experience to analyze the importance of the function under test. The execution method of this case relies too much on expert experience, there is a certain uncertainty, and the result measurement of test regression verification has a certain degree of subjectivity.

It should be noted that the methods and apparatuses determined in the embodiments of the present disclosure can be used in the financial field, and can also be used in any field except the financial field, and the present disclosure does not limit the application fields of the case execution method and the corresponding apparatus.

In the technical solution of the present disclosure, the collection, storage, use, processing, transmission, provision, disclosure and application of the user's personal information involved are all in compliance with the relevant laws and regulations, and necessary confidentiality measures have been taken, and do not violate the Public order and good customs.

In the technical solution of the present disclosure, the authorization or consent of the user is obtained before the user's personal information is obtained or collected.

An embodiment of the present disclosure provides a case execution method, including: acquiring a historical execution result of each to-be-executed case in a case set to be executed; determining a first case set according to a first historical execution result, and the first historical execution result represents The latest M times of historical execution results of the to-be-executed case include at least one execution failure; schedule the first case set to the to-be-executed case set to obtain a target case set, where the target case set includes at least one target case; and execute each of the target case sets Target case, get the historical execution result of the target case. The case execution method of the embodiment of the present disclosure has higher test accuracy and case execution efficiency.

FIG. 1 schematically shows an application scenario diagram of a case execution method and apparatus thereof according to an embodiment of the present disclosure.

As shown in FIG. 1 , an application scenario 100 according to this embodiment may include terminal devices 101 , 102 , 103 , a network 104 , and a server 105 . The network 104 is a medium used to provide a communication link between the terminal devices 101 , 102 , 103 and the server 105 . The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The user can use the terminal devices 101, 102, 103 to interact with the server 105 through the network 104 to receive or send messages and the like. Various communication client applications may be installed on the terminal devices 101 , 102 and 103 , such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only examples).

The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

The server 105 may be a server that provides various services, such as a background management server (just an example) that provides support for websites browsed by users using the terminal devices 101 , 102 , and 103 . The background management server can analyze and process the received user requests and other data, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

It should be noted that, the case execution method provided by the embodiment of the present disclosure may generally be executed by the server 105 . Correspondingly, the case execution apparatus provided by the embodiment of the present disclosure may generally be provided in the server 105 . The case execution method provided by the embodiment of the present disclosure may also be executed by a server or server cluster different from the server 105 and capable of communicating with the terminal devices 101 , 102 , 103 and/or the server 105 . Correspondingly, the case execution apparatus provided by the embodiment of the present disclosure may also be provided in a server or a server cluster that is different from the server 105 and can communicate with the terminal devices 101 , 102 , 103 and/or the server 105 .

It should be understood that the numbers of terminal devices, networks and servers in FIG. 1 are merely illustrative. There can be any number of terminal devices, networks and servers according to implementation needs.

In the technical solution of the present disclosure, the authorization or consent of the user is obtained before the user's personal information is obtained or collected.

Based on the scenario described in FIG. 1 , the case execution method of the embodiment of the present disclosure will be described in detail below with reference to FIGS. 2 to 7 .

FIG. 2 schematically shows a flowchart of a case execution method according to an embodiment of the present disclosure.

As shown in FIG. 2 , the case execution method 200 of this embodiment includes operations S210 to S240.

In operation S210, a historical execution result of each to-be-executed case in the to-be-executed case set is acquired.

The historical execution result may include execution success or execution failure.

In operation S220, a first case set is determined according to the first historical execution result.

The first historical execution result indicates that the latest M times of historical execution results of the case to be executed include at least one execution failure. "According to the first historical execution result, determine the first case set" can be understood as: for each to-be-executed case, the latest M historical execution results including at least one execution-failed to-be-executed case are regarded as the cases in the first case set, Get the first case set.

In operation S230, the first case set is scheduled to the to-be-executed case set to obtain the target case set.

The target case set includes at least one target case.

In operation S240, each target case in the target case set is executed to obtain a historical execution result of the target case.

Cases, and the systems against which they are tested, are constantly being updated. The first historical execution result indicates that the latest M times of historical execution results include at least one execution failure, which can accurately reflect that at least part of the relevant tests of the system corresponding to the to-be-executed case have failed (subsequently, for example, it is necessary to determine the specific reason for the failure of the test, and test again. and solving related problems, etc.), the first case set determined by the first historical execution result collects all the cases that at least part of the relevant tests failed, so the case execution method of the embodiment of the present disclosure executes the target including the first case set by executing Case set with higher test accuracy and case execution efficiency. In addition, the case execution method of the embodiment of the present disclosure is executed by a computer, and the case can be executed automatically, accurately and efficiently, and has higher case execution efficiency.

FIG. 3 schematically shows a flowchart of a case execution method 300 according to another embodiment of the present disclosure.

As shown in FIG. 3 , the case execution method 300 according to the embodiment of the present disclosure may further include: operations S310 to S320.

In operation S310, a second case set is determined according to the second historical execution result.

The second historical execution result indicates that the latest M times of historical execution results of the case to be executed are all successful executions, and the failure rate of the N times of historical execution results of the case to be executed is greater than the first threshold, where N is greater than M, and N and M are positive integer. The value "N" of "N times of historical execution results of the case to be executed" should be understood as the number of all historical execution results of the case to be executed for each case to be executed.

For example, if the case C1 to be executed has been executed 30 times in total, and there are 3 historical execution results of execution failure, the value of N is 30, and the failure rate of the 30 historical execution results of the case C1 to be executed is 10%. For example, if the first threshold is 5%, the value of M is 5, and the three historical execution results are the first, second, and third execution failures, respectively, the last five historical execution results are all successful executions. , the second historical execution result of the case C1 to be executed can be determined from the above information. Moreover, the pending case C1 will not be selected into the second case set.

Exemplarily, the value of M and the value of the first threshold may be predetermined. The value of M and the value of the first threshold can also be adjusted and maintained by relevant personnel.

In operation S320, the second case set is scheduled to the to-be-executed case set to obtain the target case set.

In the case execution method of the embodiment of the present disclosure, on the basis that the latest M times of historical execution results of the case to be executed are the successful execution results, the failure rate of the N times of historical execution results of the case to be executed is also considered, and the test accuracy is higher. performance and case execution efficiency.

FIG. 4 schematically shows a flowchart of a case execution method 400 according to yet another embodiment of the present disclosure.

The case to be executed includes a category label. As shown in FIG. 4 , the case execution method 400 according to an embodiment of the present disclosure may further include: operations S410 to S430 .

In operation S410, according to the category labels, the first case set and the second case set are divided into at least one category of label scheduling case sets.

"Dividing the first case set and the second case set into at least one category of label scheduling case sets" can be understood as: the merged case set obtained by summing the first case set and the second case set, the merged case set will be A set of label scheduling cases divided into at least one class according to the class label.

Illustratively, category tags may include priority tags, function tags, and the like, for example. Wherein, the priority label may include, for example, high priority, medium priority, and low priority, and the function label may include, for example, interface, batch, interface design, and the like.

In operation S420, a third case set is determined according to the total failure rate of the tag scheduling case set.

For a specific class label CL1, the total failure rate F of the label scheduling case set LS can be understood as: the number FS of execution failure cases with the specific class label in the first case set and the second case set The ratio of the total number of cases S for a particular class label. That is, F=FS/S. For example, an execution failure case can be understood as: for each case in the first case set and the second case set, the N times of historical execution results include at least one case in which the historical execution result is an execution failure.

For example, in the first case set and the second case set, a certain case C2 has been executed 30 times in history, of which 29 historical execution results are successful execution, 1 historical execution result is execution failure, then the case TC2 is an execution failure case.

For example, for the category label CL1, the label scheduling case set LS includes a total of 100 cases, of which 15 fail to be executed, and the total failure rate of the label scheduling case set is 15%.

"Determining the third case set according to the total failure rate of the tag scheduling case set" may include, for example: comparing the total failure rate of the tag scheduling case set with the second threshold, and if the total failure rate of the tag scheduling case set is greater than the second threshold When , the label scheduling case set is determined as the third case set.

Exemplarily, the second threshold may be predetermined, and the value of the second threshold may also be adjusted and maintained by relevant personnel.

In operation S430, the third case set is scheduled to the to-be-executed case set to obtain the target case set.

In the case execution method of the embodiment of the present disclosure, the parameter of the total failure rate of the scheduling case set can be used to determine the third case set from different dimensions, and the target case set determined by the third case set has a higher test. accuracy.

FIG. 5 schematically shows a flowchart of a case execution method 500 according to yet another embodiment of the present disclosure.

As shown in FIG. 5 , the case execution method 500 according to the embodiment of the present disclosure may further include: operations S510 to S520.

In operation S510, the to-be-executed case set is divided into at least one class of to-be-executed labeled case sets according to the category labels.

In operation S520, in response to the selection of the category tag, the to-be-executed tag case set corresponding to the category tag is scheduled to the to-be-executed case set to obtain the target case set.

Cases with the same class label have higher correlation. For example, in some cases, only a part of a specific function needs to be tested. In this case, the label scheduling case set with the corresponding function label can be searched for by the function label, and the label scheduling case set can be executed.

The case scheduling method of the embodiment of the present disclosure can quickly, accurately and efficiently determine the relevant cases to be executed according to the tags, so as to adapt to a certain range of tests, and has higher case execution efficiency.

FIG. 6 shows a schematic diagram of a case execution method 600 according to yet another embodiment of the present disclosure.

As shown in FIG. 6 , the case execution method 600 according to still another embodiment of the present disclosure may further include: operation S610.

In operation S610, at the time of updating, the R cases with the latest updated historical execution results are determined from the existing case set to obtain a to-be-executed case set.

R is a positive integer.

Exemplarily, the update time may be predetermined, and the update frequency may also be set and maintained by relevant personnel, and the update time may be determined by the update frequency.

For example, the stock case set may include all stock cases. Since the cases are updated iteratively, and the system is also updated iteratively, the latest case execution results have greater reference significance for determining which cases need to be executed again. The case execution method of the embodiment of the present disclosure can determine the case with the latest updated historical execution result based on the update time, and obtain a case set to be executed, which has higher case execution accuracy and case execution efficiency.

Exemplarily, as shown in FIG. 6 , a case execution method according to still another embodiment of the present disclosure.

As shown in FIG. 6 , the case execution method 600 according to still another embodiment of the present disclosure may further include: operation S620.

In operation S610, when the number of cases in the to-be-executed case set is less than R, each to-be-executed case in the to-be-executed case set is executed.

The value of R can reflect the test coverage of the case set to be executed to a certain extent. For example, if the number of cases in the to-be-executed case set is less than R, it can be considered that the to-be-executed case set has less test coverage. In the case execution method of the embodiment of the present disclosure, the number of cases in the to-be-executed case set may be used as the case of whether to selectively execute the to-be-executed case set. Test quality.

FIG. 7 shows a schematic diagram of a case execution method 700 according to yet another embodiment of the present disclosure.

As shown in FIG. 7 , the case to be executed may further include test scope information, and the case execution method 700 may include: operations S710 to S720.

In operation S710, according to the test scope information, the to-be-executed case set is divided into to-be-executed case sets of at least one test scope.

In operation S720, in response to selecting the test scope, schedule the to-be-executed scope case set corresponding to the test scope to the to-be-executed case set to obtain the target case set.

The case execution method of the embodiment of the present disclosure also supports determining a case set of a range to be executed according to the selected test range, and scheduling the case set of the range to be executed to the case set to be executed, so that a specific case can be selected and executed subsequently. That is, the cases that support the execution of custom scopes can be applied to a variety of application scenarios.

Based on the above case execution method, the present disclosure also provides a case execution device. The device will be described in detail below with reference to FIG. 8 .

FIG. 8 schematically shows a structural block diagram of a case execution apparatus according to an embodiment of the present disclosure.

As shown in FIG. 8 , the case execution apparatus 800 of this embodiment includes a historical execution result determination and acquisition module 810 , a first case set determination module 820 , a target case set first determination module 830 , and a case first execution module 840 .

The historical execution result determination and acquisition module 810 is configured to acquire the historical execution result of each to-be-executed case in the to-be-executed case set. In one embodiment, the historical execution result determination and acquisition module 810 may be configured to perform the operation S210 described above, which will not be repeated here.

The first case set determination module 820 is configured to determine a first case set according to the first historical execution result, where the first historical execution result indicates that the latest M historical execution results of the case to be executed include at least one execution failure. In an embodiment, the first case set determination module 820 may be configured to perform the operation S220 described above, which will not be repeated here.

The target case set first determination module 830 is configured to schedule the first case set to the to-be-executed case set to obtain a target case set, where the target case set includes at least one target case. In an embodiment, the first determination module 830 of the target case set may be configured to perform the operation S230 described above, which will not be repeated here.

The first case execution module 840 is configured to execute each target case in the target case set to obtain historical execution results of the target case. In an embodiment, the case first execution module 840 may be configured to perform the operation S240 described above, which will not be repeated here.

According to an embodiment of the present disclosure, the case execution apparatus may further include: a second case set determination module and a second target case set determination module.

The second case set determination module is used to determine the second case set according to the second historical execution result. The second historical execution result indicates that the latest M times of historical execution results of the case to be executed are all executed successfully, and the N times of the case to be executed are executed successfully. The failure rate of the historical execution result is greater than the first threshold, where N is greater than M, and N and M are positive integers.

The second determination module of the target case set is used for scheduling the second case set to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the case to be executed includes a category label, and the case execution apparatus may further include: a label case set determination module, a third case set determination module, and a third target case set determination module.

The label case set determination module is configured to divide the first case set and the second case set into at least one type of label scheduling case set according to the category labels.

The third case set determination module is used for determining the third case set according to the total failure rate of the scheduling case set according to the label.

The third determination module of the target case set is used for scheduling the third case set to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the to-be-executed case includes a category label, and the case execution apparatus may further include: a fourth determination module for a to-be-executed label case set and a target case set.

The to-be-executed labeled case set is used to divide the to-be-executed case set into at least one category of the to-be-executed labeled case set according to the category label.

The fourth determination module of the target case set is configured to, in response to selecting the category label, schedule the to-be-executed label case set corresponding to the category label to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, the case execution apparatus may further include: a to-be-executed case set determination module.

The to-be-executed case set determination module is configured to, at the time of update, determine the R latest updated historical execution results from the stock case set to obtain the to-be-executed case set.

According to an embodiment of the present disclosure, the case execution apparatus may further include: a case second execution module.

The second case execution module is configured to execute each to-be-executed case in the to-be-executed case set when the number of cases in the to-be-executed case set is less than R.

According to an embodiment of the present disclosure, the case to be executed further includes test scope information, and the case execution device may further include:

The to-be-executed range case set determination module is configured to divide the to-be-executed case set into at least one to-be-executed range case set of the test range according to the test range information.

The fifth determination module of the target case set is configured to, in response to selecting the test scope, schedule the to-be-executed case set corresponding to the test scope to the to-be-executed case set to obtain the target case set.

According to an embodiment of the present disclosure, any number of modules among the historical execution result determination and acquisition module 810 , the first case set determination module 820 , the target case set first determination module 830 , and the case first execution module 840 may be combined into one module implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the historical execution result determination acquisition module 810 , the first case set determination module 820 , the target case set first determination module 830 , and the case first execution module 840 may be at least partially implemented as hardware Circuits, such as Field Programmable Gate Arrays (FPGA), Programmable Logic Arrays (PLA), System on Chip, System on Substrate, System on Package, Application Specific Integrated Circuit (ASIC), or a It can be implemented in any other reasonable manner, such as hardware or firmware, or in any one of the three implementation manners of software, hardware and firmware, or in an appropriate combination of any of them. Alternatively, at least one of the historical execution result determination acquisition module 810, the first case set determination module 820, the target case set first determination module 830, and the case first execution module 840 may be implemented at least in part as a computer program module, when the When the computer program modules are executed, they can perform corresponding functions.

FIG. 9 schematically shows a block diagram of an electronic device suitable for implementing a case execution method according to an embodiment of the present disclosure.

As shown in FIG. 9 , an electronic device 900 according to an embodiment of the present disclosure includes a processor 901 that can be loaded into a random access memory (RAM) 903 according to a program stored in a read only memory (ROM) 902 or from a storage portion 908 program to perform various appropriate actions and processes. The processor 901 may include, for example, a general-purpose microprocessor (eg, a CPU), an instruction set processor and/or a related chipset, and/or a special-purpose microprocessor (eg, an application-specific integrated circuit (ASIC)), and the like. The processor 901 may also include on-board memory for caching purposes. The processor 901 may include a single processing unit or multiple processing units for performing different actions of the method flow according to the embodiments of the present disclosure.

In the RAM 903, various programs and data necessary for the operation of the electronic device 900 are stored. The processor 901 , the ROM 902 and the RAM 903 are connected to each other through a bus 904 . The processor 901 performs various operations of the method flow according to the embodiment of the present disclosure by executing the programs in the ROM 902 and/or the RAM 903 . Note that the program may also be stored in one or more memories other than the ROM 902 and the RAM 903 . The processor 901 may also perform various operations of the method flow according to the embodiments of the present disclosure by executing programs stored in the one or more memories.

According to an embodiment of the present disclosure, the electronic device 900 may also include an input/output (I/O) interface 905 that is also connected to the bus 904 . Electronic device 900 may also include one or more of the following components connected to I/O interface 905: input portion 906 including keyboard, mouse, etc.; including components such as cathode ray tube (CRT), liquid crystal display (LCD), etc., and An output section 907 of speakers and the like; a storage section 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, and the like. The communication section 909 performs communication processing via a network such as the Internet. A drive 910 is also connected to the I/O interface 905 as needed. A removable medium 911, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is mounted on the drive 910 as needed so that a computer program read therefrom is installed into the storage section 908 as needed.

The present disclosure also provides a computer-readable storage medium. The computer-readable storage medium may be included in the device/apparatus/system described in the above embodiments; it may also exist alone without being assembled into the device/system. device/system. The above-mentioned computer-readable storage medium carries one or more programs, and when the above-mentioned one or more programs are executed, implement the method according to the embodiment of the present disclosure.

According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, such as, but not limited to, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM) , erasable programmable read only memory (EPROM or flash memory), portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In this disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include one or more memories other than ROM 902 and/or RAM 903 and/or ROM 902 and RAM 903 described above.

Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flowchart. When the computer program product runs in the computer system, the program code is used to make the computer system implement the case execution method provided by the embodiments of the present disclosure.

When the computer program is executed by the processor 901, the above-described functions defined in the system/apparatus of the embodiment of the present disclosure are performed. According to embodiments of the present disclosure, the systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules.

In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal over a network medium, and downloaded and installed through the communication section 909, and/or installed from a removable medium 911. The program code embodied by the computer program may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In such an embodiment, the computer program may be downloaded and installed from the network via the communication portion 909, and/or installed from the removable medium 911. When the computer program is executed by the processor 901, the above-described functions defined in the system of the embodiment of the present disclosure are performed. According to embodiments of the present disclosure, the above-described systems, apparatuses, apparatuses, modules, units, etc. can be implemented by computer program modules.

According to the embodiments of the present disclosure, the program code for executing the computer program provided by the embodiments of the present disclosure may be written in any combination of one or more programming languages, and specifically, high-level procedures and/or object-oriented programming may be used. programming language, and/or assembly/machine language to implement these computational programs. Programming languages include, but are not limited to, languages such as Java, C++, python, "C" or similar programming languages. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (eg, using an Internet service provider business via an Internet connection).

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams or flowchart illustrations, and combinations of blocks in the block diagrams or flowchart illustrations, can be implemented in special purpose hardware-based systems that perform the specified functions or operations, or can be implemented using A combination of dedicated hardware and computer instructions is implemented.

Those skilled in the art will appreciate that various combinations and/or combinations of features recited in various embodiments and/or claims of the present disclosure are possible, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments of the present disclosure and/or in the claims may be made without departing from the spirit and teachings of the present disclosure. All such combinations and/or combinations fall within the scope of this disclosure.

Embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only, and are not intended to limit the scope of the present disclosure. Although the various embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. The scope of the present disclosure is defined by the appended claims and their equivalents. Without departing from the scope of the present disclosure, those skilled in the art can make various substitutions and modifications, and these substitutions and modifications should all fall within the scope of the present disclosure.

Claims (11)

1. A case execution method, comprising: Obtain the historical execution results of each to-be-executed case in the to-be-executed case set; determining a first case set according to a first historical execution result, wherein the first historical execution result indicates that the historical execution results of the latest M times of the to-be-executed case include at least one execution failure; Scheduling the first case set to the to-be-executed case set to obtain a target case set, the target case set including at least one target case; and Execute each target case in the target case set, and obtain the historical execution result of the target case. 2. The method of claim 1, further comprising: A second case set is determined according to the second historical execution result. The second historical execution result indicates that the latest M times of the historical execution results of the to-be-executed case are all executed successfully, and all N times of the to-be-executed case are executed successfully. The failure rate of the historical execution result is greater than the first threshold, wherein N is greater than M, and N and M are positive integers; and The second case set is scheduled to the to-be-executed case set to obtain the target case set. 3. The method according to claim 2, wherein the case to be executed comprises a category label, and the case execution method further comprises: According to the category label, the first case set and the second case set are divided into at least one category of label scheduling case sets; determining a third case set based on the total failure rate of the tag scheduling case set; and The third case set is scheduled to the to-be-executed case set to obtain the target case set. 4. The method according to claim 1, wherein the case to be executed comprises a category label, and the case execution method further comprises: According to the category labels, the to-be-executed case set is divided into at least one category of to-be-executed labeled case sets; and In response to selecting the category tag, the to-be-executed tag case set corresponding to the category tag is scheduled to the to-be-executed case set to obtain the target case set. 5. The method of any one of claims 1 to 4, further comprising: At the update moment, the R latest cases for updating the historical execution result are determined from the existing case set to obtain the to-be-executed case set. 6. The method of claim 5, further comprising: When the number of cases in the to-be-executed case set is less than R, each of the to-be-executed cases in the to-be-executed case set is executed. 7. The method according to any one of claims 1 to 4, wherein the case to be executed further comprises test scope information, and the case execution method further comprises: According to the test scope information, the to-be-executed case set is divided into a to-be-executed case set of at least one test scope; and In response to selecting the test scope, the to-be-executed scope case set corresponding to the test scope is scheduled to the to-be-executed case set to obtain the target case set. 8. A case execution device, comprising: The historical execution result determination acquisition module is used to acquire the historical execution result of each to-be-executed case in the to-be-executed case set; a first case set determination module, configured to determine a first case set according to a first historical execution result, where the first historical execution result indicates that the historical execution results of the latest M times of the to-be-executed case include at least one execution failure; a first determination module for a target case set, configured to schedule the first case set to the to-be-executed case set to obtain a target case set, where the target case set includes at least one target case; and The first execution module of the case is configured to execute each target case in the target case set, and obtain the historical execution result of the target case. 9. An electronic device comprising: one or more processors; storage means for storing one or more programs, Wherein, when the one or more programs are executed by the one or more processors, the one or more processors are caused to perform the method according to any one of claims 1-7. 10. A computer-readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1-7. 11. A computer program product, comprising a computer program, the computer program being stored on at least one of a readable storage medium and an electronic device, the computer program being executed by a processor to implement any one of claims 1 to 7 method described in item.

Images