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

Abstract

The disclosure provides a case execution method, device, equipment, medium and program product, relates to the technical field of computers, and can be applied to the technical field of finance. The case execution method comprises the following steps: acquiring a historical execution result of each case to be executed in a case set to be executed; determining a first case set according to a first historical execution result, wherein the first historical execution result represents that the latest M times of historical execution results of the cases to be executed comprise at least one execution failure; scheduling the first case set to a case set to be executed to obtain a target case set, wherein the target case set comprises at least one target case; and executing each target case in the target case set to obtain a historical execution result of the target case.

Description

Case execution method, device, equipment and medium

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to the field of test technologies, and more particularly, to a method, an apparatus, a device, a medium, and a program product for executing a case.

Background

During the course of version updating, etc., the test cases of stock will be kept. In the next test, what test cases can achieve good test effect is an urgent problem to be solved.

The current case execution method comprises the following steps: executing the full number of cases and manually selecting and executing the partial cases. The first case execution method has higher regression quality but higher cost, and the second case execution method is too dependent on manual experience, so the current case execution method is low in efficiency.

Disclosure of Invention

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

According to a first aspect of the present disclosure, there is provided a case execution method including: acquiring a historical execution result of each case to be executed in a case set to be executed; determining a first case set according to a first historical execution result, wherein the first historical execution result represents that the latest M times of historical execution results of the cases to be executed comprise at least one execution failure; scheduling the first case set to a case set to be executed to obtain a target case set, wherein the target case set comprises at least one target case; and executing each target case in the target case set to obtain a historical execution result of the target case.

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, wherein the second historical execution result represents that the latest M times of historical execution results of the to-be-executed cases are successful in execution, and the failure rate of the N times of historical execution results of the to-be-executed cases is greater than a first threshold, wherein N is greater than M, and N, M is a positive integer; and scheduling the second case set to the case set to be executed to obtain a target case set.

According to the embodiment of the 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 category labels; determining a third case set according to the total failure rate of the label scheduling case set; and scheduling the third case set to the case set to be executed to obtain a target case set.

According to the embodiment of the disclosure, the case to be executed comprises a category label, and the case execution method further comprises: dividing the case set to be executed into at least one category of label case sets to be executed according to the category labels; and responding to the selected category label, and scheduling the to-be-executed label case set corresponding to the category label to the to-be-executed case set to obtain a target case set.

According to an embodiment of the present disclosure, the case execution method further includes: and at the updating time, determining R latest cases for updating the historical execution result from the stock case set to obtain a case set to be executed.

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

According to the embodiment of the disclosure, the case to be executed further includes test range information, and the case execution method further includes: dividing the case set to be executed into a case set to be executed in at least one test range according to the test range information; and responding to the selected test range, and scheduling the case set of the range to be executed corresponding to the test range to the case set to be executed to obtain a target case set.

A second aspect of the present disclosure provides a case execution apparatus including: the system comprises a history execution result determining and acquiring module, a first case set determining module, a target case set first determining module and a case first executing module. The historical execution result determining and acquiring module is used for acquiring the historical execution result of each case to be executed in the case set to be executed; the first case set determining module is used for determining a first case set according to a first historical execution result, wherein the first historical execution result represents that the historical execution results of the latest M times of cases to be executed comprise at least one execution failure; the target case set first determining module is used for scheduling the first case set to a case set to be executed to obtain a target case set, and the target case set comprises at least one target case; the first case execution module is used for executing each target case in the target case set to obtain a historical execution result of the target case.

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

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

The fifth aspect of the present disclosure also provides a computer program product comprising a computer program stored on at least one of a readable storage medium and an electronic device, which when executed by a processor implements the method of an embodiment of the present disclosure.

Drawings

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

fig. 1 schematically illustrates an application scenario diagram of a case execution method, apparatus, device, medium and program product in accordance with an embodiment of the present disclosure;

fig. 2 schematically illustrates a flow diagram of a case execution method according to an embodiment of the present disclosure;

fig. 3 schematically illustrates a flow diagram of a case execution method according to another embodiment of the present disclosure;

fig. 4 schematically illustrates a flow diagram of a case execution method according to yet another embodiment of the present disclosure;

fig. 5 schematically illustrates a flow chart of a case execution method according to yet another embodiment of the present disclosure;

fig. 6 schematically illustrates a flow diagram of a case execution method according to yet another embodiment of the present disclosure;

fig. 7 schematically illustrates a flow diagram of a case execution method according to yet another embodiment of the present disclosure;

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

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

Detailed Description

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

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify 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 same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

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

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

The method of executing the case (i.e., how to select the executed case for testing) is important for testing regression verification.

The case execution method of some embodiments is to execute the full number of cases directly without any screening. The case execution method can ensure regression quality, but the time consumption is long, the input cost of manpower and resources is increased, and the efficiency is low.

The case execution method of some embodiments relies on the importance of manual empirical analysis of the function under test to selectively execute some cases. The case execution method is too dependent on expert experience, certain uncertainty exists, and certain subjectivity is provided for measuring the result of test regression verification.

It should be noted that the method and apparatus determined by the embodiments of the present disclosure may be used in the financial field, and may also be used in any field other than the financial field.

In the technical scheme of the disclosure, the collection, storage, use, processing, transmission, provision, disclosure, application and other processing of the personal information of the related user are all in accordance with the regulations of related laws and regulations, necessary confidentiality measures are taken, and the customs of the public order is not violated.

In the technical scheme of the disclosure, before the personal information of the user is acquired or collected, the authorization or the consent of the user is acquired.

An embodiment of the present disclosure provides a case execution method, including: acquiring a historical execution result of each case to be executed in a case set to be executed; determining a first case set according to a first historical execution result, wherein the first historical execution result represents the latest M times of historical execution results of the cases to be executed and comprises at least one execution failure; scheduling the first case set to a case set to be executed to obtain a target case set, wherein the target case set comprises at least one target case; and executing each target case in the target case set to obtain a historical execution result of the target case. The case execution method has higher test accuracy and case execution efficiency.

Fig. 1 schematically illustrates an application scenario diagram of a case execution method and an 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. Network 104 is the medium used to provide communication links between terminal devices 101, 102, 103 and server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

A user may use terminal devices 101, 102, 103 to interact with a server 105 over a network 104 to receive or send messages or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

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 portable computers, desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the terminal devices 101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.

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

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

In the technical scheme of the disclosure, before the personal information of the user is acquired or collected, the authorization or the consent of the user is acquired.

A case execution method of the embodiment of the present disclosure will be described in detail through fig. 2 to 7 based on the scenario described in fig. 1.

Fig. 2 schematically shows a flow diagram 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 case to be executed in the case set to be executed is obtained.

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

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

The first historical execution result represents that the historical execution results of the latest M times of the cases to be executed comprise at least one execution failure. "determining the first case set according to the first historical execution result" may be understood as: and aiming at each case to be executed, taking the latest M times of historical execution results including at least one execution failure case to be executed as a case in the first case set to obtain the first case set.

In operation S230, the first case set is scheduled to a case set to be executed, so as to obtain a 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 for which case tests are directed, are constantly being updated. The first historical execution result represents that the latest M times of historical execution results include at least one execution failure, and may accurately reflect that at least part of the relevant tests of the system corresponding to the case to be executed fail (for example, a specific reason for the test failing needs to be determined, retesting is performed again, and a relevant problem is solved, etc.), and the first case set determined by the first historical execution result sets all the cases for which at least part of the relevant tests fail, so the case execution method according to the embodiment of the present disclosure has higher test accuracy and case execution efficiency by executing the target case set including the first case set. In addition, the case execution method of the embodiment of the disclosure is executed by a computer, so that the case can be automatically, accurately and efficiently executed, and higher case execution efficiency is achieved.

Fig. 3 schematically illustrates a flow diagram 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 an embodiment of the present disclosure may further include: operation S310 to operation S320.

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

The second historical execution result represents that the historical execution results of the latest M times of the to-be-executed cases are all executed successfully, and the failure rate of the historical execution results of the latest N times of the to-be-executed cases is greater than a first threshold, wherein N is greater than M, and N, M is a positive integer. The value "N" of the "N times historical execution results of the case to be executed" should be understood as the number of all the historical execution results of the case to be executed for each case to be executed.

For example, the to-be-executed case C1 is executed 30 times in total, and the execution results of the history of 3 times are execution failures, so the value of N is 30, and the failure rate of the execution results of the history of 30 times of the to-be-executed case C1 is 10%. For example, the first threshold is 5%, the value of M is 5, the 3 times of execution failure of the historical execution results are the first time, the second time and the third time, respectively, and the historical execution results of the last 5 times are all execution success, and the second historical execution result of the case C1 to be executed can be determined according to the above information. And, case C1 to be executed is not selected into the second set of cases.

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

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

The case execution method of the embodiment of the disclosure further considers the failure rate of the N times of historical execution results of the case to be executed on the basis that the latest M times of historical execution results of the case to be executed are the execution success results, and has higher test accuracy and case execution efficiency.

Fig. 4 schematically illustrates a flow diagram of a case execution method 400 according to yet another embodiment of the present disclosure.

The case to be executed includes a category label, and as shown in fig. 4, the case execution method 400 according to the embodiment of the present disclosure may further include: operation S410 to operation S430.

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

"a set of labeled scheduling cases that divides a first set of cases and a second set of cases into at least one category" may be understood as: and dividing the merged case set into at least one category label scheduling case set according to the category labels.

Illustratively, the category labels may include, for example, priority labels, function labels, and the like. The priority labels may include, for example, high priority, medium priority, and low priority, and the function labels 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 label scheduling case set.

For a particular category label CL1, the total failure rate F of the label scheduling case set LS can be understood as: a ratio of the number of failed execution cases FS having the particular category label to the total number of cases S having the particular category label in the first case set and the second case set. That is, F is FS/S. The 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 cases in which at least one time of the historical execution results is failed to execute.

For example, in the first case set and the second case set, a case C2 is executed 30 times in history, where the execution result of 29 times in history is execution success, and the execution result of 1 time in history 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, wherein 15 execution failure cases, the total failure rate of the label scheduling case set is 15%.

"determining the third set of cases according to the total failure rate of the tagged scheduling case set" may include, for example: and comparing the total failure rate of the label scheduling case set with a second threshold value, and determining the label scheduling case set as a third case set when the total failure rate of the label scheduling case set is greater than the second threshold value.

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

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

The case execution method of the embodiment of the disclosure can determine the third case set from different dimensions by using the parameter of the total failure rate of the label scheduling case set, and has higher test accuracy when executing the target case set determined by the third case set.

Fig. 5 schematically illustrates a flow diagram 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 an 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 category to-be-executed tab case set according to the category tabs.

In operation S520, in response to the selection of the category label, the to-be-executed labeled case set corresponding to the category label is scheduled to the to-be-executed case set, so as to obtain a target case set.

Cases with the same category label have higher relevance. For example, in some cases, only a portion of a specific function needs to be tested, and at this time, a set of tagged scheduling cases with corresponding function tags can be searched for by the function tags and executed.

The case scheduling method of the embodiment of the disclosure can quickly, accurately and efficiently determine the relevant case to be executed according to the label so as to adapt to a test in a certain range, 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 update time, R cases of the latest update history execution result are determined from the inventory case set, resulting in a to-be-executed case set.

R is a positive integer.

For example, the update time may be predetermined, or the update frequency may be set and maintained by a relevant person, and from the update frequency, the update time may be determined.

The inventory case set may include all inventory cases, for example, and since cases are updated iteratively, the system is also updated iteratively, and the latest case execution results have a greater reference meaning for determining which cases need to be executed again. The case execution method of the embodiment of the disclosure can determine the case of the latest update history execution result by taking the update time as a reference, obtain the case set to be executed, and has higher case execution accuracy and case execution efficiency.

Illustratively, as shown in fig. 6, a case execution method 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 S620.

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

The value of R may reflect the test coverage of the set of cases to be executed to some extent. For example, if the number of cases of the case set to be executed is less than R, the test coverage of the case set to be executed can be considered to be smaller. The case executing method of the embodiment of the disclosure can take the number of cases in the case set to be executed as the case whether to selectively execute the case set to be executed, and when the number of cases in the case set to be executed is small, the cases in the case set to be executed are executed in full, so that the test quality is ensured.

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 range information, and the case execution method 700 may include: operation S710 to operation S720.

In operation S710, the set of cases to be executed is divided into a set of cases to be executed in at least one test range according to the test range information.

In operation S720, in response to the selection of the test range, the case set of the range to be executed corresponding to the test range is scheduled to the case set to be executed, so as to obtain a target case set.

The case execution method of the embodiment of the disclosure further supports determining a case set of the 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 as to select and execute specific cases in the following. That is, the case supporting execution of the custom range can be applied to various application scenarios.

The present disclosure also provides a case execution device based on the case execution method. The apparatus will be described in detail below with reference to fig. 8.

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

As shown in fig. 8, the case performing apparatus 800 of this embodiment includes a historical performance result determination acquiring module 810, a first case set determining module 820, a target case set first determining module 830, and a case first performing module 840.

The historical execution result determination obtaining module 810 is configured to obtain a historical execution result of each to-be-executed case in the to-be-executed case set. In an embodiment, the history execution result determination and acquisition module 810 may be configured to perform the operation S210 described above, which is not described herein again.

The first case set determining module 820 is 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 cases to be executed include at least one execution failure. In an embodiment, the first case set determining module 820 may be configured to perform the operation S220 described above, which is not described herein again.

The target case set first determining module 830 is configured to schedule the first case set to a case set to be executed, so as to obtain a target case set, where the target case set includes at least one target case. In an embodiment, the target case set first determining module 830 may be configured to perform the operation S230 described above, and will not be described herein again.

The case first executing module 840 is configured to execute each target case in the target case set to obtain a historical executing result of the target case. In an embodiment, the case first execution module 840 may be configured to execute the operation S240 described above, which is not described herein again.

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

And the second case set determining module is used for determining a second case set according to a second historical execution result, wherein the second historical execution result represents that the latest M times of historical execution results of the to-be-executed cases are successful in execution, and the failure rate of the N times of historical execution results of the to-be-executed cases is greater than a first threshold, wherein N is greater than M, and N, M is a positive integer.

And the second determining module of the target case set is used for scheduling the second case set to the case set to be executed 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 executing apparatus may further include: the system comprises a label case set determining module, a third case set determining module and a target case set third determining module.

And the label case set determining module is used for dividing the first case set and the second case set into at least one category label scheduling case set according to the category labels.

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

And the third determining module of the target case set is used for scheduling the third case set to the case set to be executed 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 executing apparatus may further include: and a fourth determining module for the label case set and the target case set to be executed.

And the to-be-executed label case set is used for dividing the to-be-executed case set into at least one category to-be-executed label case set according to the category labels.

And the target case set fourth determining module is used for responding to the selected category label and scheduling 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 performing apparatus may further include: and a determination module for case set to be executed.

And the to-be-executed case set determining module is used for determining R cases of the latest updating historical execution result from the stock case set at the updating time to obtain the to-be-executed case set.

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

And the case second execution module is used for executing each case to be executed in the case set to be executed when the number of cases in the case set to be executed is less than R.

According to the embodiment of the disclosure, the case to be executed further includes test range information, and the case executing apparatus may further include:

and the to-be-executed range case set determining module is used for dividing 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.

And the target case set fifth determining module is used for responding to the selection of the test range, and scheduling the case set of the range to be executed corresponding to the test range to the case set to be executed to obtain the target case set.

According to an embodiment of the present disclosure, any multiple modules of the historical execution result determination obtaining module 810, the first case set determining module 820, the target case set first determining module 830, and the case first executing module 840 may be combined into one module to be implemented, or any one of the modules may 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 obtaining 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 a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or by a suitable combination of any of them. Alternatively, at least one of the historical execution result determination obtaining 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 a computer program module that, when executed, may perform a corresponding function.

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 apparatus 900 according to an embodiment of the present disclosure includes a processor 901 which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage portion 908 into a Random Access Memory (RAM) 903. Processor 901 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 901 may also include on-board memory for caching purposes. The processor 901 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.

In the RAM 903, various programs and data necessary for the operation of the electronic apparatus 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 flows according to the embodiments of the present disclosure by executing programs in the ROM 902 and/or the RAM 903. Note that the programs 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 flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.

Electronic device 900 may also include input/output (I/O) interface 905, input/output (I/O) interface 905 also connected to bus 904, according to an embodiment of the present disclosure. The electronic device 900 may also include one or more of the following components connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 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, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.

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

According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 902 and/or the RAM 903 described above and/or one or more memories other than the ROM 902 and the RAM 903.

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 flow chart. The program code is for causing a computer system to implement the case execution methods provided by the embodiments of the present disclosure when the computer program product is run on the computer system.

The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 901. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, and the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, and downloaded and installed through the communication section 909 and/or installed from the removable medium 911. The computer program containing program code 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 a network through the communication section 909, and/or installed from the removable medium 911. The computer program, when executed by the processor 901, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user's computing device, partly on the user's 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 (e.g., through the internet using an internet service provider).

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, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block 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 will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

It will be appreciated by a person skilled in the art that various combinations or/and combinations of features recited in the various embodiments of the disclosure and/or in the claims may be made, even if such combinations or combinations are not explicitly recited in the disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The 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 embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (11)

1. A case execution method, comprising:

acquiring a historical execution result of each case to be executed in a case set to be executed;

determining a first case set according to a first historical execution result, wherein the first historical execution result represents that the historical execution result of the latest M times of the cases to be executed comprises at least one execution failure;

scheduling the first case set to the case set to be executed to obtain a target case set, wherein the target case set comprises at least one target case; and

and executing each target case in the target case set to obtain a historical execution result of the target case.

2. The method of claim 1, further comprising:

determining a second case set according to a second historical execution result, wherein the second historical execution result represents that the historical execution results of the latest M times of the to-be-executed cases are all executed successfully, and the failure rate of the historical execution results of the N times of the to-be-executed cases is greater than a first threshold, wherein N is greater than M, and N, M is a positive integer; and

and scheduling the second case set to the case set to be executed to obtain the target case set.

3. The method of claim 2, the case to be executed comprising a category label, the case execution method further comprising:

according to the category labels, dividing the first case set and the second case set into at least one category label scheduling case set;

determining a third case set according to the total failure rate of the label scheduling case set; and

and scheduling the third case set to the case set to be executed to obtain the target case set.

4. The method of claim 1, the case to be executed comprising a category label, the case execution method further comprising:

dividing the case set to be executed into at least one category of case set to be executed with labels according to the category labels; and

and responding to the selection of the category label, and scheduling 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.

5. The method of any of claims 1 to 4, further comprising:

and at the updating time, determining R latest cases for updating the historical execution result from the stock case set to obtain the case set to be executed.

6. The method of claim 5, further comprising:

and when the number of the cases in the case set to be executed is less than R, executing each case to be executed in the case set to be executed.

7. The method of any of claims 1 to 4, the case to be executed further comprising test scope information, the case execution method further comprising:

dividing the case set to be executed into a case set to be executed in at least one test range according to the test range information; and

and responding to the selection of the test range, and scheduling the case set of the range to be executed corresponding to the test range to the case set to be executed to obtain the target case set.

8. A case execution apparatus, comprising:

the historical execution result determining and acquiring module is used for acquiring the historical execution result of each case to be executed in the case set to be executed;

the first case set determining module is used for determining a first case set according to a first historical execution result, wherein the first historical execution result represents that the historical execution result of the latest M times of the cases to be executed comprises at least one execution failure;

a target case set first determining module, configured to schedule the first case set to the case set to be executed to obtain a target case set, where the target case set includes at least one target case; and

and the first case execution module is used for executing each target case in the target case set to obtain a historical execution result of the target case.

9. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any 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 to 7.

11. A computer program product comprising a computer program stored on at least one of a readable storage medium and an electronic device, the computer program when executed by a processor implementing the method according to any one of claims 1 to 7.

Images