Device for shortening time for application to enter publishable state under multiple requirements

Obtain the list of applications to be published and requirements to be tested through processors and storage media, sort them according to the number of requirements, and test and release them first with higher priority requirements, solving the problem of uncertainty in pre-issue test time in agile development environment and reducing the number of operations Dimension waiting time and improve testing efficiency.

CN119065959APending Publication Date: 2024-12-03HENAN ZHONGYUAN CONSUMER FINANCE CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410940866.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-15
Publication Date
2024-12-03

AI Technical Summary

Technical Problem

In an agile development environment, the relationship between multiple requirements and multiple applications leads to uncertainty in pre-issue test time, resulting in too long waiting time for operation and maintenance and testers, and frequent releases may affect the stability of online applications.

Method used

Through the processor and storage medium, obtain the list of applications to be published and requirements to be tested, sort according to the number of requirements, and test and release requirements with higher priority first, reduce operation and maintenance waiting time and improve release efficiency.

Benefits of technology

The test needs to be tested with higher priority are first tested, thereby reducing the waiting time for operation and maintenance and improving the efficiency of operation and maintenance release. Testers do not need to wait for all applications to complete release to transfer to verification, improving testing efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119065959A_ABST
    Figure CN119065959A_ABST
Patent Text Reader

Abstract

The invention provides a device for shortening the time for an application to enter a publishable state under multiple demands, and relates to the technical field of application publication, and the device comprises the steps: obtaining each to-be-published application to obtain a Qth to-be-published application list AQ; obtaining a to-be-tested demand corresponding to each to-be-published application in the AQ to obtain a to-be-tested demand list BQ corresponding to the AQ; sorting the to-be-published applications in the AQ to obtain a sorted to-be-published application list CQ corresponding to the AQ; if g (1) is less than g (2), testing a to-be-tested demand corresponding to the CQ, 1, and issuing the CQ, 1; according to the method, the to-be-tested requirements with higher priorities are firstly tested, so that the efficiency of operation and maintenance publishers is maximized; and after the application is published by operation and maintenance, the demand capable of being verified online can be calculated through the association relationship between the demand and the application, and a tester can transfer to verification without waiting for all the applications to be published, so that the test efficiency is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of application publishing, and in particular to a device for shortening the time it takes for an application to enter a publishable state under multiple demands. Background Art

[0002] In the context of agile development, many R&D teams have a fixed release date each week, releasing one iteration each week, and specifying a series of requirements to be released in each iteration. A single requirement can involve many applications, so there is a many-to-many relationship between requirements and applications. The final step in general testing is pre-release testing, which is the final step in the release process. Only after the application passes the pre-release test can it enter a releasable state. Each requirement varies in size, and the pre-release tests end in a specific order. Releases are conducted online based on the application dimension, and each application involves multiple requirements. Often, the final round of pre-release testing will only be conducted on the release date if many requirements are met. This uncertainty can lead to disputes between operations and maintenance regarding whether a single application can be released for online testing. Operations and maintenance prefer that each application be released only once, while testing requires that requirements be released online for verification after pre-release testing is complete, minimizing the time spent waiting for other testers to complete pre-release testing.

[0003] In practice, there are generally two approaches. One is to wait until all pre-release requirements for this iteration are tested before notifying operations and maintenance to launch the product. This results in a lot of waiting time for operations and maintenance personnel, and each launch day ends very late. The other is to release the application involved in the requirement as soon as the requirement testing is completed. This leads to frequent releases on the release day, which can have a certain impact on the stability of the online application. Summary of the Invention

[0004] In view of the above technical problems, the technical solution adopted by the present invention is:

[0005] The present application provides a device for shortening the time it takes for an application to enter a releasable state under multiple requirements. The device includes: a processor and a storage medium; wherein the storage medium stores at least one instruction or at least one program segment, and the at least one instruction or at least one program segment is loaded and executed by the processor to implement the following steps:

[0006] S100, obtaining a first preset value Q=1;

[0007] S200, if Q < n, then obtain each application to be released to obtain the Qth application list A to be released Q =(A Q,1 , A Q,2 ,…,A Q,i ,…,A Q,f(Q) ), i=1, 2, ..., f(Q); otherwise, exit the current process; where A Q,iis the i-th application to be released obtained for the Q-th time, and f(Q) is the number of applications to be released obtained for the Q-th time;

[0008] S300, get A Q Each application to be released corresponds to the test requirements to obtain A Q Corresponding list of requirements to be tested B Q =(B Q,1 , B Q,2 ,…,B Q,i ,…,B Q,f(Q) ); among them, B Q,i A Q,i Corresponding list of requirements to be tested; B Q,i =(B Q i,1 , B Q i,2 ,…,B Q i,j ,…,B Q i,g(i) ), j=1, 2,..., g(i); B Q i,j is the jth test requirement corresponding to the i-th application to be released obtained for the Q-th time, and g(i) is the number of test requirements corresponding to the i-th application to be released obtained for the Q-th time;

[0009] S400, according to A Q The number of requirements to be tested corresponding to each application to be tested in A Q Sort the applications to be released in order to get A Q The corresponding sorted list of applications to be released C Q =(C Q,1 , C Q,2 ,…,C Q,i ,…,C Q,f(Q) ); among them, C Q,i For A Q The i-th application to be released is obtained by sorting the applications to be released in ; g(r)≤g(r+1); r=1, 2, …, f(Q)-1;

[0010] S500, if g(1)<g(2), then for C Q,1 Test the corresponding requirements to be tested and Q,1 Publish; enter S600;

[0011] S600, update Q=Q+1, and enter S200.

[0012] Furthermore, step S500 further includes the following steps:

[0013] S510, if g(1)=g(2), then obtain C Q,1 Each corresponding requirement to be tested and C Q,2 Each corresponding requirement to be tested;

[0014] S511, for C Q,1 Each corresponding requirement to be tested and C Q,2 Each corresponding requirement to be tested is deduplicated to obtain C Q,1 and C Q,2 Corresponding intermediate requirements to be tested;

[0015] S512, obtaining the number of applications to be released corresponding to each intermediate requirement to be tested;

[0016] S513 , for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first. After each test completes one intermediate requirement to be tested, the process proceeds to S600 .

[0017] Furthermore, step S500 further includes the following steps:

[0018] S520, if C Q If the number of requirements to be tested corresponding to the first P applications to be tested in the test is the same, then obtain C Q Each requirement to be tested corresponding to the first P applications to be tested in ;

[0019] S521, for C Q Remove duplicates from each of the requirements to be tested corresponding to the first P applications to be tested in order to obtain C Q The intermediate requirements to be tested corresponding to the first P applications to be tested in ;

[0020] S522 , for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first. After each test completes one intermediate requirement to be tested, the process proceeds to S600 .

[0021] The present invention has at least the following beneficial effects:

[0022] The device for shortening the time for applications to enter the publishable state under multiple requirements of the present invention obtains a first preset value Q=1; if Q<n, each application to be published is obtained to obtain the Qth application list A to be published Q ; Get A Q Each application to be released corresponds to the test requirements to obtain A Q Corresponding list of requirements to be tested B Q According to A Q The number of requirements to be tested corresponding to each application to be tested in A Q Sort the applications to be released in order to get A Q The corresponding sorted list of applications to be released CQ ; If g(1)<g(2), then for C Q,1 Test the corresponding requirements to be tested and Q,1 Release; in the present invention, through the above method, the requirements to be tested with higher priority are tested first, thereby reducing ineffective waiting for operation and maintenance and maximizing the efficiency of operation and maintenance release personnel; after the operation and maintenance releases the application, the requirements that can be verified online can be calculated through the association between requirements and applications, and testers can switch to verification without waiting for all applications to be released, thereby improving testing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0024] Figure 1 A flowchart of steps executed by a processor of an apparatus for shortening the time it takes for an application to enter a releasable state under multiple requirements provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0025] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making any creative efforts shall fall within the scope of protection of the present invention.

[0026] It should be noted that, based on this disclosure, those skilled in the art will appreciate that an aspect described herein can be implemented independently of any other aspect, and that two or more of these aspects can be combined in various ways. For example, any number of the aspects described herein can be used to implement an apparatus and / or practice a method. In addition, other structures and / or functionalities other than one or more of the aspects described herein can be used to implement such an apparatus and / or practice such a method.

[0027] The following will refer to Figure 1 The flowchart of the steps executed by the processor of the device for shortening the time for an application to enter a releasable state under multiple requirements is shown, and an device for shortening the time for an application to enter a releasable state under multiple requirements is introduced.

[0028] The apparatus for shortening the time it takes for an application to enter a releasable state under multiple requirements includes: a processor and a storage medium; wherein the storage medium stores at least one instruction or at least one program segment, and the at least one instruction or the at least one program segment is loaded and executed by the processor to implement the following steps:

[0029] S100, obtaining a first preset value Q=1.

[0030] S200, if Q < n, then obtain each application to be released to obtain the Qth application list A to be released Q =(A Q,1 , A Q,2 ,…,A Q,i ,…,A Q,f(Q) ), i=1, 2, ..., f(Q); otherwise, exit the current process; where A Q,i is the i-th application to be released obtained for the Q-th time, and f(Q) is the number of applications to be released obtained for the Q-th time.

[0031] In this embodiment, one application to be released corresponds to multiple requirements to be tested. At the same time, one requirement to be tested also corresponds to multiple applications to be released. Therefore, each test that completes one requirement to be tested may affect multiple applications to be released.

[0032] It can be understood that, since in this embodiment, the number of responses to be published obtained each time is different, in this embodiment, f(Q) does not refer to a specific function or function result value, but refers to a possible value that varies with the specific value of Q. For example, when Q=1, f(Q)=10; when Q=2, f(Q)=9; when Q=3, f(Q)=7.

[0033] S300, get A Q Each application to be released corresponds to the test requirements to obtain A Q Corresponding list of requirements to be tested B Q =(B Q,1 , B Q,2 ,…,B Q,i ,…,B Q,f(Q) ); among them, B Q,i A Q,i Corresponding list of requirements to be tested; B Q,i =(B Q i,1 , B Q i,2 ,…,B Q i,j ,…,B Q i,g(i) ), j=1, 2,..., g(i); B Q i,jis the jth requirement to be tested corresponding to the i-th application to be released obtained for the Q-th time, and g(i) is the number of requirements to be tested corresponding to the i-th application to be released obtained for the Q-th time.

[0034] In this embodiment, the test requirements corresponding to each application to be released can be obtained, thereby obtaining A Q Corresponding list of requirements to be tested B Q .

[0035] It can be understood that, since in this embodiment, the number of requirements to be tested corresponding to the i-th application to be released obtained each time is different, in this embodiment, f(i) does not refer to a specific function or function result value, but refers to a possible value that varies with the specific value of Q. For example, when i=1, f(i)=5; when i=2, f(i)=4; when i=3, f(i)=2.

[0036] S400, according to A Q The number of requirements to be tested corresponding to each application to be tested in A Q Sort the applications to be released in order to get A Q The corresponding sorted list of applications to be released C Q =(C Q,1 , C Q,2 ,…,C Q,i ,…,C Q,f(Q) ); among them, C Q,i For A Q The i-th application to be released is obtained by sorting the applications to be released in ; g(r)≤g(r+1); r=1, 2, ..., f(Q)-1.

[0037] In this embodiment, A Q In the process of sorting the applications to be released, there may be a situation where two applications to be released have the same number of test requirements. In this case, the two applications can be sorted randomly.

[0038] S500, if g(1)<g(2), then for C Q,1 Test the corresponding requirements to be tested and Q,1 Publish; enter S600.

[0039] In this embodiment, if g(1)<g(2), it means C Q,1 The number of corresponding requirements to be tested is less than C Q,2 The number of requirements to be tested can be calculated by first Q,1 After all the tests are completed for the corresponding requirements to be tested, C Q,1Release; It is understandable that since one requirement to be tested may correspond to multiple applications to be released, C Q,1 After all the corresponding requirements to be tested are tested, the process enters S600 and then enters S200 to re-execute the application sorting process, thereby greatly reducing the waiting time for the published applications and improving the publishing efficiency of the applications to be published.

[0040] Furthermore, step S500 may further include the following steps:

[0041] S510, if g(1)=g(2), then obtain C Q,1 Each corresponding requirement to be tested and C Q,2 Corresponding to each requirement to be tested.

[0042] S511, for C Q,1 Each corresponding requirement to be tested and C Q,2 Each corresponding requirement to be tested is deduplicated to obtain C Q,1 and C Q,2 The corresponding intermediate requirements to be tested.

[0043] S512: Obtain the number of to-be-released applications corresponding to each intermediate to-be-tested requirement.

[0044] S513 , for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first. After each test completes one intermediate requirement to be tested, the process proceeds to S600 .

[0045] In this embodiment, g(1)=g(2), that is, C Q,1 The number of corresponding requirements to be tested is equal to C Q,2 The number of requirements to be tested is corresponding to this. At this time, according to C Q,1 Each corresponding requirement to be tested and C Q,2 The number of applications to be released corresponding to each requirement to be tested is used to sort the test priorities of the requirements to be tested. Requirements with higher priorities, i.e., requirements with larger numbers of applications to be released, are tested first, thereby further improving the release efficiency of applications to be released.

[0046] Furthermore, step S500 may further include the following steps:

[0047] S520, if C Q If the number of requirements to be tested corresponding to the first P applications to be tested in the test is the same, then obtain C Q Each requirement to be tested corresponding to the first P applications to be tested in .

[0048] S521, for C QRemove duplicates from each of the requirements to be tested corresponding to the first P applications to be tested in order to obtain C Q The intermediate requirements to be tested corresponding to the first P applications to be tested in .

[0049] S522 , for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first. After each test completes one intermediate requirement to be tested, the process proceeds to S600 .

[0050] In this embodiment, there will be C Q If the number of requirements to be tested corresponding to the first P applications to be tested is the same, then C Q Remove duplicates from each of the requirements to be tested corresponding to the first P applications to be tested in order to obtain C Q The first P intermediate requirements to be tested correspond to the applications to be tested in the test; for each intermediate requirement to be tested, the one corresponding to the number of applications to be released is tested first, and after each test completes one intermediate requirement to be tested, enter S600 to first test the requirements to be tested with a higher priority, that is, the one corresponding to the number of applications to be released is larger, thereby further improving the release efficiency of the applications to be released.

[0051] S600, update Q=Q+1, and enter S200.

[0052] The following is an explanation with specific examples:

[0053] Assume that there are three requirements to be tested, A, B, and C, corresponding to six applications to be released, namely user, risk, finance, shop, item, and stock. The mapping is shown in Table 1:

[0054] Table 1

[0055]

[0056] For testers, the shortest path for pre-release verification is automatically calculated. Testers can release related applications in the shortest time by following the shortest path. For operation and maintenance, the applications that can be released are automatically calculated to reduce operation and maintenance waiting time.

[0057] The shortest path for pre-launch verification:

[0058] Aggregate requirements based on the application dimensions to be released and generate a mapping as shown in Table 2:

[0059] Table 2

[0060] Applications to be released Requirements to be tested Required quantity user A, C 2 risk A 1 finance A, B, D 3 shop A, B 2 item A, B, C 3 stock C 1

[0061] According to the mapping in the figure above, the requirements to be tested are arranged in ascending order according to the number of requirements to be tested. The smaller the number, the higher the priority. Applications A and C are tested first. If the number is the same, they are arranged in descending order according to the number of applications to be released involved in the requirements to be tested. The larger the number, the higher the priority. The priority of pre-release testing is AC. After removing A and C from Table 2, the following is shown in Table 3:

[0062] Table 3

[0063]

[0064]

[0065] According to Table 3, the number of requirements is 0, which means that the corresponding requirements to be tested have been tested and the application to be released can be released.

[0066] After excluding the unreleased application with 0 requirements, the one with the least number of requirements is requirement B. The pre-release test priority is ACB. After removing B, as shown in Table 4:

[0067] Table 4

[0068] application need Required quantity user 0 risk 0 finance D 1 shop 0 item 0 stock 0

[0069] According to Table 4, applications with a requirement count of 0 are now ready for release. Notify operations and maintenance of the addition of two new releasable applications: shop and item. This brings the total number of releasable applications to user, risk, stock, shop, and item. Once user, risk, stock, shop, and item are released, all applications involved in requirement C are also released. Testers can then verify the content of requirement C online without having to wait for all applications to be released.

[0070] When the D pre-release test is completed, the finance application finally enters the releasable state, and the pre-release test priority order ACBD is finally generated. After each requirement test is completed in this order, the application enters the releasable state, reducing the ineffective waiting time of operation and maintenance personnel. At the same time, each application release triggers the calculation of online verifiable requirements. As long as the applications involved in the requirement are released online, the requirement can be verified online.

[0071] By continuously generating and cutting mapping diagrams, and then doubly sorting them according to the number of requirements involved in the application and the number of applications involved in the requirements, we can generate pre-release test priorities, reduce ineffective O&M waiting, and maximize the efficiency of O&M release personnel. After O&M releases the application, the online verifiable requirements can be calculated through the relationship between requirements and applications. Testers can start verification without waiting for all applications to be released, which improves testing efficiency.

[0072] The device for shortening the time for applications to enter the publishable state under multiple requirements of this embodiment obtains a first preset value Q=1; if Q<n, each application to be published is obtained to obtain the Qth application list A to be published. Q ; Get A Q Each application to be released corresponds to the test requirements to obtain A Q Corresponding list of requirements to be tested B Q According to A Q The number of requirements to be tested corresponding to each application to be tested in A Q Sort the applications to be released in order to get A Q The corresponding sorted list of applications to be released C Q ; If g(1)<g(2), then for C Q,1 Test the corresponding requirements to be tested and Q,1 Release; in the present invention, through the above method, the requirements to be tested with higher priority are tested first, thereby reducing ineffective waiting for operation and maintenance and maximizing the efficiency of operation and maintenance release personnel; after the operation and maintenance releases the application, the requirements that can be verified online can be calculated through the association between requirements and applications, and testers can switch to verification without waiting for all applications to be released, thereby improving testing efficiency.

[0073] Furthermore, although the steps of the method of the present disclosure are described in a particular order in the accompanying drawings, this does not require or imply that the steps must be performed in this particular order, or that all steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0074] An embodiment of the present invention also provides a non-transitory computer-readable storage medium, which can be set in an electronic device to store at least one instruction or at least one program related to implementing a method in a method embodiment. The at least one instruction or the at least one program is loaded and executed by the processor to implement the method provided in the above embodiment.

[0075] The program product may be implemented in any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or component, or any combination thereof. More specific examples (a non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.

[0076] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, which carries readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A readable signal medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0077] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0078] The program code for performing the operations of the present application can be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (e.g., via the Internet using an Internet service provider).

[0079] An embodiment of the present invention further provides an electronic device including a processor and the aforementioned non-transitory computer-readable storage medium.

[0080] The electronic device is merely an example and should not limit the functions and scope of use of the embodiments of the present application.

[0081] The electronic device is implemented as a general-purpose computing device. Components of the electronic device may include, but are not limited to, the at least one processor, the at least one memory, and a bus connecting different system components (including the memory and the processor).

[0082] The memory stores program codes, which can be executed by the processor, so that the processor performs the steps of various embodiments described in this specification.

[0083] The memory may include readable media in the form of volatile memory, such as random access memory (RAM) and / or cache memory, and may further include read-only memory (ROM).

[0084] The memory may also include a program / utility having a set (at least one) of program modules, such program modules including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0085] The bus may represent one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0086] The electronic device may also communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device, and / or any device that enables the electronic device to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface. Furthermore, the electronic device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter. The network adapter communicates with other modules of the electronic device via a bus. It should be understood that, although not shown in the figures, other hardware and / or software modules may be used in conjunction with the electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0087] Through the description of the above embodiments, it is easy for those skilled in the art to understand that the example embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.

[0088] An embodiment of the present invention further provides a computer program product comprising program code. When the program product is run on an electronic device, the program code is used to enable the electronic device to execute the steps of the method according to various exemplary embodiments of the present invention described above in this specification.

[0089] Although some specific embodiments of the present invention have been described in detail by way of examples, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It should also be understood by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention.

Claims

1. A device for shortening the time it takes for an application to enter a publishable state under multiple requirements, It is characterized in that The device includes: a processor and a storage medium; wherein the storage medium stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by the processor to implement the following steps: S100, obtaining a first preset value Q=1; S200, if Q < n, obtain each application to be released to obtain the Qth application list A to be released Q =(A Q,1 , A Q,2 , …, A Q,i , …, A Q,f(Q) ), i=1, 2, …, f(Q); otherwise, jump out of the current process; where A Q,i is the i-th application to be released obtained for the Q-th time, and f(Q) is the number of applications to be released obtained for the Q-th time; S300, get A Q The test requirements corresponding to each application to be released in A are obtained Q Corresponding list of requirements to be tested B Q =(B Q,1 , B Q,2 , …, B Q,i , …, B Q,f(Q) ); where B Q,i A Q,i Corresponding list of requirements to be tested; B Q,i =(B Q i,1 , B Q i,2 , …, B Q i,j , …, B Q i,g(i) ),j=1,2,…,g(i);B Q i,j is the jth requirement to be tested corresponding to the i-th application to be released obtained for the Q-th time, and g(i) is the number of requirements to be tested corresponding to the i-th application to be released obtained for the Q-th time; S400, according to A Q The number of requirements to be tested corresponding to each application to be tested in A Q Sort the applications to be released in order to obtain A Q The corresponding sorted list of applications to be released C Q =(C Q,1 , C Q,2 , …, C Q,i , …, C Q,f(Q) ); where C Q,i For A Q The i-th application to be released is obtained by sorting the applications to be released in ; g(r)≤g(r+1); r=1, 2, …, f(Q)-1; S500, if g(1)<g(2), then for C Q,1 Test the corresponding requirements to be tested and Q,1 Publish; Enter S600; S600, update Q=Q+1, and enter S200.

2. The device for shortening the time for an application to enter a releasable state under multiple demands according to claim 1, It is characterized in that Step S500 also includes the following steps: S510, if g(1)=g(2), then obtain C Q,1 Each corresponding requirement to be tested and C Q,2 Corresponding to each requirement to be tested; S511, for C Q,1 Each corresponding requirement to be tested and C Q,2 Each corresponding requirement to be tested is deduplicated to obtain C Q,1 and C Q,2 The corresponding intermediate requirements to be tested; S512, obtaining the number of applications to be released corresponding to each intermediate requirement to be tested; S513, for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first, and after each test completes one intermediate requirement to be tested, the process proceeds to S600.

3. The device for shortening the time for an application to enter a releasable state under multiple demands according to claim 1, It is characterized in that Step S500 also includes the following steps: S520, if C Q If the number of requirements to be tested corresponding to the first P applications to be tested in the same, then obtain C Q Each requirement to be tested corresponding to the first P applications to be tested in; S521, for C Q Each of the requirements to be tested corresponding to the first P applications to be tested in , is deduplicated to obtain C Q The intermediate requirements to be tested corresponding to the first P applications to be tested in ; S522, for each intermediate requirement to be tested, the one with the largest number of applications to be released is tested first, and after each test completes one intermediate requirement to be tested, the process proceeds to S600.