CN111090591B

CN111090591B - Test method and device, electronic equipment and computer readable storage medium

Info

Publication number: CN111090591B
Application number: CN201911340915.6A
Authority: CN
Inventors: 郭怡清
Original assignee: Guizhou Yidu Cloud Technology Co ltd
Current assignee: Guizhou Yidu Cloud Technology Co ltd
Priority date: 2019-12-23
Filing date: 2019-12-23
Publication date: 2023-05-05
Anticipated expiration: 2039-12-23
Also published as: CN111090591A

Abstract

The present disclosure provides a test method, apparatus, and electronic device and computer-readable storage medium, the method comprising: acquiring a target thinking guide graph; acquiring a root node of the target thinking guide graph and a child node of the root node, wherein the child node of the root node comprises a first node and a second node; calling a first test interface of a target test program according to the root node and the first node to perform a first test; if the first test passes and the first node is not a leaf node, acquiring a child node of the first node; invoking a second test interface of the target test program according to the root node, the first node and the child nodes of the first node to perform a second test; and if the first test fails or the first node is a leaf node, calling a first test interface of a target test program according to the root node and the second node to perform a third test.

Description

Test method and device, electronic equipment and computer readable storage medium

Technical Field

The disclosure relates to the technical field of software testing, and in particular relates to a testing method and device, electronic equipment and a computer readable storage medium.

Background

With the progress of computer science and technology, the rapid development of software industry, software testing work is also getting more and more attention. In practical work, the use of test cases to perform exception testing on software is a very important link in software testing. However, the software is tested through the test cases, and a tester is required to write the test cases according to the test requirements. When the software is released at high frequency, a tester needs to write test cases according to each test version, so that a large amount of manpower and material resources are consumed, and the test efficiency is reduced.

It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the present disclosure and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The embodiment of the disclosure provides a testing method and device, electronic equipment and a computer readable storage medium, which can directly complete software testing according to a target thinking guide graph and improve testing efficiency.

Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.

The embodiment of the disclosure provides a testing method, which comprises the following steps: acquiring a target thinking guide graph; acquiring a root node of the target thinking guide graph and a child node of the root node, wherein the child node of the root node comprises a first node and a second node; calling a first test interface of a target test program according to the root node and the first node to perform a first test; if the first test passes and the first node is not a leaf node, acquiring a child node of the first node; invoking a second test interface of the target test program according to the root node, the first node and the child nodes of the first node to perform a second test; and if the first test fails or the first node is a leaf node, calling a first test interface of a target test program according to the root node and the second node to perform a third test.

In some embodiments, invoking a first test interface of a target test program according to the root node, the first node, to perform a first test, includes: determining the first test interface in the target test program according to the root node and the first node; and calling the first test interface according to the root node and the first node to perform a first test.

In some embodiments, the test method further comprises: if the third test passes and the second node is not a leaf node, acquiring a child node of the second node; and calling a second test interface of the target test program according to the root node, the second node and the child node of the second node so as to perform a fourth test.

In some embodiments, if the first test passes and the first node is not a leaf node, obtaining a child node of the first node comprises: determining a first test expected value in a target database according to the root node and the first node; and if the test result of the first test is matched with the first test expected value, the first test is passed.

In some embodiments, the test method further comprises: generating a test report according to the test result of the first test, the test result of the second test and the test result of the third test; and displaying the test report.

In some embodiments, generating a test report from the test results of the first test, the test results of the second test, and the test results of the third test includes: and if the third test fails, the test report comprises a second node which fails the test, so as to locate a test fault according to the second node which fails the test.

In some embodiments, obtaining the target mind map comprises: and generating target test Json data according to the target thinking guide graph so as to finish the test of the target test program according to the target test Json data.

The present disclosure provides a test apparatus, the test apparatus comprising: the system comprises a thinking guide diagram acquisition module, a first node acquisition module, a first test module, a first node sub-first node acquisition module, a second test module and a third test module.

Wherein the mind map acquisition module may be configured to acquire a target mind map; the first node obtaining module may be configured to obtain a root node of the target mind map and a child node of the root node, the child node of the root node including a first node and a second node; the first test module may be configured to invoke a first test interface of a target test program according to the root node and the first node to perform a first test; the first node sub-first node obtaining module may be configured to obtain a sub-node of the first node if the first test passes and the first node is not a leaf node; the second test module may be configured to invoke a second test interface of the target test program according to the root node, the first node, and a child node of the first node to perform a second test; the third test module may be configured to invoke a first test interface of a target test program according to the root node and the second node to perform a third test if the first test fails or the first node is a leaf node.

The embodiment of the disclosure provides an electronic device, which comprises: one or more processors; and a storage device for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to implement the test method of any of the above.

The presently disclosed embodiments provide a computer readable storage medium having stored thereon a computer program which when executed by a processor implements a test method as described in any of the above.

According to the testing method, the testing device, the electronic equipment and the computer readable storage medium, which are provided by certain embodiments of the present disclosure, each interface of the target testing program is called according to each node of the mind map to complete the testing of the target testing program, and the automatic testing can be completed in a continuous integration manner, so that the test case does not need to be written, the testing efficiency is improved, and the manpower and material resources are saved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. The drawings described below are merely examples of the present disclosure and other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.

FIG. 1 shows a schematic diagram of an exemplary system architecture that may be applied to a test method or test apparatus of an embodiment of the present disclosure.

Fig. 2 is a schematic diagram showing a structure of a computer system applied to a testing apparatus according to an exemplary embodiment.

Fig. 3 is a schematic diagram of a target thought map, according to an example embodiment.

FIG. 4 is a flow chart illustrating a test method according to an exemplary embodiment.

Fig. 5 is a schematic diagram of another target thought map shown according to an example embodiment.

Fig. 6 is a flow chart of step S1 of fig. 4 in an exemplary embodiment. Referring to fig. 6, the above step S1 may include the following steps.

Fig. 7 is a flow chart of step S3 of fig. 4 in an exemplary embodiment.

Fig. 8 is a flow chart of step S4 of fig. 4 in an exemplary embodiment.

Fig. 9 is another test method shown according to an exemplary embodiment of the present disclosure.

Fig. 10 is a diagram illustrating yet another test method according to an exemplary embodiment of the present disclosure.

FIG. 11 is a flow chart illustrating another test method according to an exemplary embodiment.

Fig. 12 is a schematic diagram of another target thought map shown according to an example embodiment.

Fig. 13 is a diagram illustrating yet another test method according to an exemplary embodiment of the present disclosure.

Fig. 14 is a block diagram illustrating a test apparatus according to an exemplary embodiment.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments can be embodied in many forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted.

The described features, structures, or characteristics of the disclosure may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present disclosure. However, those skilled in the art will recognize that the aspects of the present disclosure may be practiced with one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.

The drawings are merely schematic illustrations of the present disclosure, in which like reference numerals denote like or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.

The flow diagrams depicted in the figures are exemplary only, and not necessarily all of the elements or steps are included or performed in the order described. For example, some steps may be decomposed, and some steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.

In the present specification, the terms "a," "an," "the," "said" and "at least one" are used to indicate the presence of one or more elements/components/etc.; the terms "comprising," "including," and "having" are intended to be inclusive and mean that there may be additional elements/components/etc., in addition to the listed elements/components/etc.; the terms "first," "second," and "third," etc. are used merely as labels, and do not limit the number of their objects.

The following describes example embodiments of the present disclosure in detail with reference to the accompanying drawings.

As shown in fig. 1, a system architecture 100 may include

terminal devices

101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links 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 may interact with the server 105 via the network 104 using the

terminal devices

101, 102, 103 to receive or send messages or the like. 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, wearable devices, virtual reality devices, smart homes, etc.

The server 105 may be a server providing various services, such as a background management server providing support for devices operated by users with the

terminal devices

101, 102, 103. The background management server can analyze and process the received data such as the request and the like, and feed back the processing result to the terminal equipment.

The server 105 may, for example, obtain a target mind map; the server 105 may, for example, obtain a root node of the target mind map and a child node of the root node, the child node of the root node including a first node and a second node; server 105 may invoke a first test interface of a target test program, e.g., according to the root node, the first node, to perform a first test; if the first test passes and the first node is not a leaf node, acquiring a child node of the first node; server 105 may invoke a second test interface of the target test program, e.g., according to the root node, the first node, and a child node of the first node, to perform a second test; the server 105 may, for example, call a first test interface of a target test program according to the root node, the second node for a third test if the first test fails or the first node is a leaf node.

It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative, and that the server 105 may be a server of one entity, or may be composed of a plurality of servers, and may have any number of terminal devices, networks and servers according to actual needs.

Referring now to FIG. 2, a schematic diagram of a computer system 200 suitable for use in implementing the terminal device of an embodiment of the present application is shown. The terminal device shown in fig. 2 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiments of the present application.

As shown in fig. 2, the computer system 200 includes a Central Processing Unit (CPU) 201, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 202 or a program loaded from a storage section 208 into a Random Access Memory (RAM) 203. In the RAM 203, various programs and data required for the operation of the system 200 are also stored. The CPU 201, ROM 202, and RAM 203 are connected to each other through a bus 204. An input/output (I/O) interface 205 is also connected to bus 204.

The following components are connected to the I/O interface 205: an input section 206 including a keyboard, a mouse, and the like; an output portion 207 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 208 including a hard disk or the like; and a communication section 209 including a network interface card such as a LAN card, a modem, and the like. The communication section 209 performs communication processing via a network such as the internet. The drive 210 is also connected to the I/O interface 205 as needed. A removable medium 211 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed on the drive 210 as needed, so that a computer program read therefrom is installed into the storage section 208 as needed.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 209, and/or installed from the removable medium 211. The above-described functions defined in the system of the present application are performed when the computer program is executed by a Central Processing Unit (CPU) 201.

It should be noted that the computer readable storage medium shown in the present application may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, 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), an optical fiber, 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 context of this document, 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. In the present application, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable storage medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable storage medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.

The flowcharts 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 application. 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.

The modules and/or units involved in the embodiments of the present application may be implemented in software, or may be implemented in hardware. The described modules and/or units may also be provided in a processor, e.g., may be described as: a processor includes a transmitting unit, an acquiring unit, a determining unit, and a first processing unit. Wherein the names of the modules and/or units do not in some cases constitute limitations on the modules and/or units themselves.

As another aspect, the present application also provides a computer-readable storage medium that may be contained in the apparatus described in the above embodiments; or may be present alone without being fitted into the device. The computer-readable storage medium carries one or more programs which, when executed by a device, cause the device to perform functions including: acquiring a target thinking guide graph; acquiring a root node of the target thinking guide graph and a child node of the root node, wherein the child node of the root node comprises a first node and a second node; calling a first test interface of a target test program according to the root node and the first node to perform a first test; if the first test passes and the first node is not a leaf node, acquiring a child node of the first node; invoking a second test interface of the target test program according to the root node, the first node and the child nodes of the first node to perform a second test; and if the first test fails or the first node is a leaf node, calling a first test interface of a target test program according to the root node and the second node to perform a third test.

In the technical field of insurance, an insurance company can independently develop application software for initiating claims for users so that the users fill in the claims information in the application software. It will be appreciated that the application software should be able to determine the next level of claims questions based on the previous level of claims information filled in by the user. For example, when a user fills in a thyroid nodule at a disease information, the application software should be able to push the user out of the user's existing insurance categories related to the thyroid nodule for selection by the user; when the user selects the life risk, the application software may push the user an option of whether to surgically remove the nodule, the user may select "surgically remove the nodule" or "not surgically remove the nodule", and so on.

Thus, the insurance company can give a demand mental map as shown in fig. 3 when designing the above application software. A developer can develop and design application software according to the demand thought chart shown in fig. 3.

In the test stage, a tester can test the target test program according to the demand thought map shown in fig. 3, so as to test whether the output of the interface of the target software is consistent with the demand thought map, and whether the flow trend of the target test program is consistent with the demand thought map, namely, the test can be performed: when a user fills in ' thyroid nodule or thyroid benign tumor ' at the disease type information, the software shows the user whether the dangerous types of ' life risk ', ' serious disease risk ', medical risk ' and the like are displayed; when the user further selects the dangerous seed of 'medical risk', the software can show the user the options of whether to remove the nodule or not, namely, the options of 'surgical removal of the nodule', 'non-surgical removal of the nodule', and the like; when the user further selects the "surgical excision nodule" option, the software will show the user whether "post-operative pathology: benign "," post-operative pathological outcome: malignant "post-operative pathological outcome: not in detail.

When the target software does not display information to a user according to the demand thinking guide diagram or returns a test error during testing, a tester can perform error positioning according to a test result so as to modify the software.

In the related art, a tester can write test cases according to the thought guide graph, and then test the software according to the test cases. However, there are some drawbacks to testing software according to test cases:

1. the test personnel need write the test case by hand, and is time consuming and laborious. 2. When the test requirement thinking graphs are changed or the levels of the test requirement thinking graphs continue to increase, the testers need to rewrite the test cases, so that time and labor are wasted, and the test efficiency is low.

Therefore, the embodiment of the disclosure provides a testing method to improve testing efficiency and save testing resources.

FIG. 4 is a flow chart illustrating a test method according to an exemplary embodiment. The method provided in the embodiments of the present disclosure may be processed by any electronic device having computing processing capability, for example, the server 105 and/or the

terminal devices

102 and 103 in the embodiment of fig. 1, and in the following embodiments, the server 105 is taken as an example to illustrate the execution subject, but the present disclosure is not limited thereto.

Referring to fig. 4, a test method provided by an embodiment of the present disclosure may include the following steps.

In step S1, a target mind map is acquired.

In some embodiments, the target mind map may be a demand mind map of the software to be tested provided by a developer.

In some embodiments, the target mind map may be a mind map as shown in fig. 5, which may include at least two levels. As shown in fig. 5, the target mind map may include five

levels

501, 502, 503, 504, 505, each of which may include at least one node, and as shown in fig. 5, the level 502 may include three nodes of life, heavy illness, and medical insurance.

In some embodiments, each level of the target mind map may correspond one-to-one with interfaces in the target test program. It will be appreciated that there may be multiple interfaces to be tested in the target test program.

For example, the hierarchy 502 shown in fig. 5 may correspond to the disease risk query interface in the target test program, that is, the disease risk query interface may be called as an entry through the node information in the hierarchy 501 and the node information in the hierarchy 502, so as to complete the test of the disease risk query interface, and of course, the disease risk query interface may also be called as an entry through only the node information in the hierarchy 502.

In step S2, a root node of the target mind map and a child node of the root node are obtained, where the child node of the root node includes a first node and a second node.

As shown in fig. 5, information of the root node of the target mind map, such as "thyroid nodule" or "thyroid benign tumor", may be acquired; the child nodes of the root node may also be obtained, such as the "life risk" node, the "serious disease risk" node, and the "medical risk" node shown in fig. 5.

It may be understood that there is one and only one root node of the target mind map, and the child nodes of the root node may include at least one node, that is, the child nodes of the root node may include not only the first node, the second node, but also the third node, the fourth node, and so on.

It is to be understood that the present disclosure does not limit the number of levels of the target mind map nor the number of nodes under each level.

In step S3, a first test interface of a target test program is called according to the root node and the first node, so as to perform a first test.

In some embodiments, the correspondence between each test interface in the visual test program and each node in the target mind map may be pre-stored in a configuration file, i.e., the correspondence between the call parameters of each interface in the target test program and each node in the target mind map may be pre-stored in the configuration file, i.e., after a node is determined in the target mind map, the interface corresponding to the node may be determined. For example, after determining the life risk (or serious illness or medical risk) node in the level 502 in the target mind map as shown in fig. 5, the disease risk query interface may be correspondingly determined in the target test program, and then the disease risk query interface is called according to the life risk (or serious illness or medical risk) node in the level 502 to complete the test of the disease risk query interface in the target test program

In some embodiments, nodes at the same level in the target mind map may be of the same attribute or of the same category. For example, as shown in fig. 5, various risk categories are included in hierarchy 502, information about whether a thyroid nodule is surgically resected is included in hierarchy 503, and various post-operative pathological outcome information is included in hierarchy 504.

In some embodiments, nodes of the same hierarchy may correspond to the same interface in the target test program. For example, the "life risk" node, the "serious risk" node, and the "medical risk" node in the hierarchy 502 may all correspond to the first interface in the target test program, that is, the information of each node in the hierarchy 502 may be used as the reference of the first interface, so as to complete the test on the first interface in the target program.

It will be appreciated that in software testing, it is necessary to test a target test program with different entries in order to test the correctness and robustness of the target test program.

In some embodiments, the first test interface may be determined in the target test program from the root node and the first node.

In some embodiments, the first test may be performed by calling a first test interface in the target test program with values of the root node and the first node as entries.

In step S4, if the first test passes and the first node is not a leaf node, a child node of the first node is obtained.

In the related art, a node without a child node (i.e., a degree of 0) in the mind map is called a leaf node, which is called a leaf for short. A leaf is a node that indicates a degree of 0, also called a termination node.

In some embodiments, the child node of the first node may be one node or may be multiple nodes, which is described by taking the child node of the first node as an example, but this disclosure is not limited thereto.

In step S5, a second test interface of the target test program is called according to the root node, the first node, and the child node of the first node, so as to perform a second test.

In some embodiments, a second test interface of the target test program may be invoked to perform the second test according to the root node, the first node, and a child node of the first node.

In step S6, if the first test fails or the first node is a leaf node, a first test interface of a target test program is called according to the root node and the second node to perform a third test.

In some embodiments, the first test may be deemed failed if the first interface returns a test error message, or the first test interface is inconsistent with an expected test result.

In some embodiments, if the first test fails or the first node is a leaf node, the test of the branch where the first node is located in the target mind map may be considered to be completed, and the test of the branch where the second node is located may be continued.

In other embodiments, the target test program may also be tested according to the hierarchy of the target mind map. The target mind map shown in fig. 5 may include

levels

502, 503, 504, etc., and the interfaces in the target test program may be tested sequentially according to the nodes in the level 502; if different nodes are tested, returning the node information, and stopping testing of the child nodes corresponding to the nodes; if the nodes with different tests do not exist, the next-level test is continued.

For example, the first interface of the target test program is invoked according to "life risk", "heavy illness risk" and "medical risk" in the hierarchy 502, respectively; if the test of the "life risk" node passes, the test of the node of the "serious risk" and the "medical risk" fails, the test of the node on the branch corresponding to the "serious risk" and the "medical risk" is stopped, and the target test program is tested according to the child node on the branch where the "life risk" is located in the hierarchy 503 (namely, the node in the target thinking guide graph is traversed according to the hierarchy, if the test fails, the branch corresponding to the node which does not pass the test is deleted); and so on.

According to the testing method provided by the embodiment, each interface of the target testing program is called according to each node of the mind map so as to complete testing of the target testing program, automatic testing can be completed in a continuous integration mode, test cases do not need to be written, testing efficiency is improved, and manpower and material resources are saved.

In step S11, a lightweight data exchange format of the target test Json is generated according to the target mind map).

In some embodiments, the target mind map is typically written in an xml (Extensible Markup Language ) document, but xml documents do not facilitate the transfer of data.

Thus, the data in the target mind map may be stored as json data in the form of the target mind map.

In step S12, the test of the target test program is completed according to the target test Json data.

According to the technical scheme provided by the embodiment, the values of all nodes in the target mind map are stored in Json (data in a form of the mind map, so that the data are easy to read, write and analyze, the occupied memory is small, the transmission speed is high, and the data transmission efficiency is greatly improved.

Fig. 7 is a flow chart of step S3 of fig. 4 in an exemplary embodiment. Referring to fig. 7, the above step S3 may include the following steps.

In step S31, the first test interface is determined in the target test program according to the root node and the first node.

In some embodiments, the correspondence between each test interface in the visual test program and each node in the target mind map may be pre-stored in a configuration file, that is, the correspondence between the call parameters of each interface in the target test program and each node in the target mind map may be pre-stored in the configuration file. Thus, after a node is determined in the target mind map, the interfaces that the node can invoke can be determined. For example, after determining the life risk (or serious risk or medical risk) node in the hierarchy 502 in the target mind map as shown in fig. 5, the disease risk query interface may be correspondingly determined in the target test program, and then the disease risk query interface may be called according to the node and the hierarchy 502 to complete the test of the disease risk query interface

In some embodiments, a corresponding first test interface may be determined in the target test program from the root node and the first node.

In step S32, the first test interface is called according to the root node and the first node to perform a first test.

In this embodiment, by storing in advance the correspondence between each node in the target mind map and each interface in the target test program, the interface to be tested may be directly determined by the node in the target mind map.

Fig. 8 is a flow chart of step S4 of fig. 4 in an exemplary embodiment. Referring to fig. 8, the above step S4 may include the following steps.

In step S41, if the third test passes and the second node is not a leaf node, a child node of the second node is obtained.

In step S42, a second test interface of the target test program is called according to the root node, the second node, and a child node of the second node, so as to perform a fourth test.

Fig. 9 is another test method shown according to an exemplary embodiment of the present disclosure. Referring to fig. 9, the above-described test method includes the following steps.

In step S7, a first test expected value is determined in a target database according to the root node and the first node.

In some embodiments, the test expected value may refer to an expected value that may be obtained by a developer after inputting a test node to a test interface.

In some embodiments, the test expected values corresponding to the respective nodes may be pre-stored in the destination database.

In step S8, if the test result of the first test matches the first test expected value, the first test passes.

In some embodiments, a first test interface may be obtained after the first interface is invoked according to the root node and the first node, and if the first test interface matches the first test expected value, the first test passes.

For example, the test expected value corresponding to the "life risk" node shown in fig. 5 includes information such as "surgical excision nodule" and "non-surgical excision nodule", and if the test result obtained after the first interface is called according to the root node "thyroid nodule" and the first node "life risk" information includes the test expected value, the first test passes, and if the test result does not include the test expected value, the first test does not pass.

According to the technical scheme provided by the embodiment, the test result is matched with the expected value of the expected test, so that whether the test passes or not is determined.

Fig. 10 is a diagram illustrating yet another test method according to an exemplary embodiment of the present disclosure. Referring to fig. 10, the above-described test method includes the following steps.

In step S9, a test report is generated according to the test result of the first test, the test result of the second test, and the test result of the third test.

In some embodiments, the test report may include node information that the test failed, through which a tester may locate problems with the target test program for modification. For example, if the third test fails, the test report includes a second node that fails the test to locate a test failure based on the second node that fails the test.

For another example, if the test result obtained by calling the first interface according to the "life risk" node information shown in fig. 5 does not match with the expected test expected value, the test report may show that the "thyroid nodule-life risk" branch of the target thinking guide chart is wrong when the first interface is called, and the tester may determine a test problem according to the test report, so as to modify the target test program.

In step S10, the test report is displayed.

According to the technical scheme provided by the embodiment, the test report can be automatically generated according to the test results of all the nodes, so that a tester can position the test problem, and the modification of the target test program is realized.

FIG. 11 is a flow chart illustrating another test method according to an exemplary embodiment. Referring to fig. 11, the above-described test method may include the following steps.

In step S1101, a target mind map is acquired.

In some embodiments, a target mind map as shown in FIG. 12 may be obtained.

In step S1102, a disease risk query interface is invoked according to the "thyroid nodule", "life risk" of the target mind map.

In fig. 12, the root node information of the target mind map is "thyroid nodule" or "thyroid benign tumor", and the child nodes of the root node include a first node "life risk" and a second node "heavy risk".

In some embodiments, the first interface of the target test program corresponding to the first level information of the target mind map may be called according to the first node "life risk" and the root node "thyroid nodule" information on the first branch in the target mind map, and the test of the target test program may be performed.

In step S1103, it is determined whether the above test passes, and the "life risk" node is not a leaf node, a terminal node.

In some embodiments, if the test for the first interface passes through the "thyroid nodule" and "life" information, and the "life" node is not a leaf node nor a final node in the mind map (i.e., is not the last node in the mind map), then step S1104 is performed.

In step S1104, a post-operation result query interface is invoked according to "thyroid nodule", "life-span", "surgical excision nodule" of the target mind map.

In some embodiments, the children of the "life-risk" node include a first child "surgically resected nodule" and a second child "non-surgically resected nodule".

In some embodiments, the second interface in the target test program corresponding to the third level information of the target mind map may be called according to the first sub-node (i.e., "surgical excision nodule") and the first node (i.e., "life insurance" node) and the root node (i.e., "thyroid nodule") on the first sub-branch of the branch where "life insurance" in the mind map is located, so that the test of the target test program is performed.

In step S1105, the test passes and the "surgical excision nodule" node is not a leaf node, a terminal node.

In some embodiments, if the test in step S1104 passes and the "surgical resection nodule" node is not a leaf node, a terminal node, step S1106 is performed.

In step S1106, testing of the target test program continues with the child node of the "surgical excision nodule" of the target mind map.

In some embodiments, the target mind map may further include child nodes, grandchild nodes, etc. of the "surgical excision nodule" node, which the present disclosure does not limit.

In some embodiments, the interface of the target test program may also be tested according to child nodes of the "surgical excision nodule" node, sun Zu node, etc.

It will be appreciated that, since the target mind map is a demand mind map of the target test program, if the "surgical excision node" has a child node or a grandchild node, the target test program will also have an interface corresponding thereto.

In some embodiments, if the test in step S1104 fails, or the "surgical excision nodule" node is a leaf node or the "surgical excision nodule" is a terminal node of the target mind map, then the node of the first branch of the target mind map has been tested, then step S1107 may be performed to continue testing the target test program according to the node on the second branch of the target mind map.

In step S1107, the test of the target test program is continued according to the child node of the "non-surgically resected nodule" of the target mind map.

In step S1108, the test passes and the "non-resected nodule" node is not a leaf node, a terminal node.

In some embodiments, if the test for the second interface in the target test program in step S1107 above passes, and the "non-resected nodule" node is not a leaf node nor a terminal node of the target mind map, then step S1109 is continued.

In step S1109, testing of the target test program is continued according to the child node of the "non-surgically resected nodule" of the target mind map.

In some embodiments, if the test of the second interface in the target test procedure in step S1107 is not passed, or the "non-resected nodule" node is a leaf node, or the end node of the target mind map when the "non-resected nodule" node is the same, step S1110 is continued.

In step S1110, a disease risk query interface is invoked according to the "thyroid nodule", "serious disease risk" of the target mind map.

In some embodiments, the child nodes of the root node include a first node "life risk" and a second node "heavy risk".

In some embodiments, a first interface (e.g., a basic risk query interface) of a target test program corresponding to the first level information of the target mind map may be invoked according to the second node "life risk" and the root node "thyroid nodule" information on the second branch in the target mind map, so as to perform a test of the target test program.

In step S1111, the test passes and the "heavy risk" node is not a leaf node, a final node.

In some embodiments, if the test for the first interface passes through the "thyroid nodule" and "heavy risk" information, and the "heavy risk" node is not a leaf node nor a final node in the mind map (i.e., is not the last node in the mind map), step S1112 is performed.

In some embodiments, if the test of the first interface by the "thyroid nodule" and "heavy risk" information fails, or the "heavy risk" node is a leaf node, or the "heavy risk" is a final node in the mind map (i.e., not the last node in the mind map), step S1113 is performed.

In step S1112, the test of the target test program is continued according to the child node of the "heavy risk" of the target mind map.

In step S1113, the test is ended.

Fig. 13 is a flow chart illustrating yet another test method according to an exemplary embodiment. Referring to fig. 13, the above-described test method may include the following steps.

In some embodiments, the target mind map includes a first level and a second level, such as level 1201 and level 1202 described in fig. 12.

In step S1301, a first test interface of the target test program is called according to the nodes in the first hierarchy, so as to perform a test.

In some embodiments, the first level may include multiple nodes, for example, as shown in fig. 12, the level 1201 may include two nodes of "life-time" and "heavy-disease", and the second level may include two nodes of "surgical-cut-off" and "non-surgical-cut-off" (in this embodiment, the artificial nucleus represents the next flow, not a node), where the "surgical-cut-off" and "non-surgical-cut-off" nodes in the second level are on the same branch as the "life-time" nodes in the first level.

In some embodiments, a first test interface of the target test program may be invoked for testing according to nodes in the first hierarchy, respectively.

For example, a first test interface in the target test program may be invoked for testing according to the "life" node and the "heavy illness" node in the first level 1201 shown in fig. 12, respectively.

In step S1302, if there is a node that fails the test in the first hierarchy, the test of the node on the branch where the node that fails the test in the target mind map is located is stopped.

For example, if the test corresponding to the "life" node fails, the test of the node on the branch where the "life" is located is stopped. For example, the testing of the nodes of the "surgically removed nodule" and the "non-surgically removed nodule" corresponding to "life-threatening" in the second level 1202 of the target mind map shown in fig. 12 is stopped.

In step S1303, a second test interface of the target test program is called according to the nodes in the second hierarchy, respectively, to perform a test.

In some embodiments, if there are testable nodes in the second hierarchy, a second test interface of the target test program is called to perform the test according to the nodes in the second hierarchy, respectively.

For example, if the test corresponding to the "life" node passes, then the "surgical excision node" in the second hierarchy. And the "non-resected nodule" node invokes the second test interface to perform a test.

In some embodiments, if there are no testable nodes in the second hierarchy, the testing is stopped.

For example, if the test corresponding to the "life insurance" node fails, no testable node exists in the second level, and the test is ended.

Fig. 14 is a block diagram illustrating a test apparatus according to an exemplary embodiment. Referring to fig. 14, a test apparatus 1400 provided by an embodiment of the present disclosure may include: the system comprises a mind map acquisition module 1401, a first node acquisition module 1402, a first test module 1403, a first node sub-first node acquisition module 1404, a second test module 1405 and a third test module 1406.

Wherein, the mind map acquisition module 1401 may be configured to acquire a target mind map; the first node obtaining module 1402 may be configured to obtain a root node of the target mind map and a child node of the root node, the child node of the root node including a first node and a second node; the first test module 1403 may be configured to invoke a first test interface of a target test program according to the root node, the first node, to perform a first test; the first node child first node obtaining module 1404 may be configured to obtain a child node of the first node if the first test passes and the first node is not a leaf node; the second test module 1405 may be configured to invoke a second test interface of the target test program according to the root node, the first node, and a child node of the first node to perform a second test; the third test module 1406 may be configured to invoke a first test interface of a target test program according to the root node, the second node, to perform a third test if the first test fails or the first node is a leaf node.

The first test module 1403 may include: the device comprises a first test interface determining unit and a first test unit.

Wherein the first test interface determining unit may be configured to determine the first test interface in the target test program according to the root node, the first node; the first test unit may be configured to invoke the first test interface according to the root node, the first node, to perform a first test.

In some embodiments, the test apparatus 1400 further comprises: the second node child node acquisition module and the fourth test module.

The second node child node obtaining module may be configured to obtain a child node of the second node if the third test passes and the second node is not a leaf node; the fourth test module may be configured to invoke a second test interface of the target test program according to the root node, the second node, and a child node of the second node to perform a fourth test.

The first node sub-first node obtaining module 1404 may include: and the expected value test acquisition unit and the matching unit.

The test expected value obtaining unit can be configured to determine a first test expected value in a target database according to the root node and the first node; the matching unit may be configured to pass the first test if the test result of the first test matches the first test expected value.

In some embodiments, the test apparatus 1400 may further comprise: and the test report generation module and the display module are used for generating test reports.

The test report generating module may be configured to generate a test report according to the test result of the first test, the test result of the second test, and the test result of the third test; the display module may be configured to display the test report.

In some embodiments, the test report generating module may be further configured to include a second node that fails the test if the third test fails, so as to locate a test failure according to the second node that fails the test.

In some embodiments, the mind map acquisition module 1401 may be further configured to generate target test Json data according to the target mind map, so as to complete a test of the target test program according to the target test Json data.

Since the respective functional modules of the test apparatus 1400 of the exemplary embodiment of the present disclosure correspond to the steps of the exemplary embodiment of the test method described above, a detailed description thereof will be omitted.

From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, aspects of the disclosed embodiments may be embodied in a software product, which may be stored on a non-volatile storage medium (which may be a CD-ROM, a U-disk, a mobile hard disk, etc.), comprising instructions for causing a computing device (which may be a personal computer, a server, a mobile terminal, or a smart device, etc.) to perform a method according to embodiments of the disclosure, such as one or more of the steps shown in fig. 4.

Furthermore, the above-described figures are only schematic illustrations of processes included in the method according to the exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.

Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It is to be understood that the disclosure is not to be limited to the details of construction, the manner of drawing, or the manner of implementation, which has been set forth herein, but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims

1. A method of testing, comprising:

Acquiring a target thinking guide graph;

acquiring a root node of the target thinking graph and at least one sub-node of the root node, wherein the at least one sub-node of the root node comprises a first node and a second node, the nodes in the same level in the target thinking graph are of the same category or the same attribute, and the nodes in the same level in the target thinking graph correspond to the same test interface in the target test program;

determining a first test interface in the target test program according to at least one child node of the root node, wherein node information of each child node of the root node is a test entry of the first test interface;

invoking a first test interface of a target test program according to the node information of the root node and the first node to perform a first test to determine whether a test result of invoking the first test interface through the node information of the first node corresponds to at least one child node of the first node, and if the test result of invoking the first test interface through the node information of the first node corresponds to the node information of at least one child node of the first node, the first test is passed;

If the first test passes and the first node is not a leaf node, acquiring at least one child node of the first node;

determining a second test interface in the target test program according to at least one child node of the first node;

invoking a second test interface of the target test program according to the root node, the first node and at least one child node of the first node to perform a second test on the second test interface;

if the first test fails or the first node is a leaf node, continuing to call a first test interface of a target test program according to the root node and the second node so as to continue to perform a third test on the first test interface, so that the first test interface is tested according to at least one node of the root node in sequence;

and determining whether the first test interface of the target test program passes the test according to the test results of the first test and the second test.

2. The method of claim 1, wherein invoking the first test interface of the target test program based on the node information of the root node, the first node, for performing the first test comprises:

Determining the first test interface in the target test program according to the root node and the first node;

and calling the first test interface according to the root node and the first node to perform a first test.

3. The method as recited in claim 1, further comprising:

if the third test passes and the second node is not a leaf node, acquiring a child node of the second node;

and calling a second test interface of the target test program according to the root node, the second node and the child node of the second node so as to perform a fourth test.

4. The method of claim 1, wherein if the first test passes and the first node is not a leaf node, obtaining a child node of the first node comprises:

determining a first test expected value in a target database according to the root node and the first node;

and if the test result of the first test is matched with the first test expected value, the first test is passed.

5. The method as recited in claim 1, further comprising:

generating a test report according to the test result of the first test, the test result of the second test and the test result of the third test;

And displaying the test report.

6. The method of claim 5, wherein generating a test report based on the test results of the first test, the test results of the second test, and the test results of the third test comprises:

and if the third test fails, the test report comprises a second node which fails the test, so as to locate a test fault according to the second node which fails the test.

7. The method of claim 1, wherein the target mind map comprises a first hierarchy and a second hierarchy; wherein, the test method further comprises:

calling a first test interface of the target test program according to the nodes in the first hierarchy respectively so as to test;

if the nodes which do not pass the test exist in the first hierarchy, stopping the test of the nodes on the branch where the nodes which do not pass the test in the target thinking guide graph are located;

and respectively calling a second test interface of the target test program according to the nodes in the second hierarchy so as to test.

8. A test device, comprising:

the thinking guide image acquisition module is configured to acquire a target thinking guide image;

The first node acquisition module is configured to acquire a root node of the target mind map and at least one child node of the root node, wherein the at least one child node of the root node comprises a first node and a second node, nodes under the same level in the target mind map are of the same category or the same attribute, and the nodes of the same level in the target mind map correspond to the same test interface in the target test program;

the first test module is configured to call a first test interface of a target test program according to the node information of the root node and the first node so as to perform a first test, determine whether a test result of calling the first test interface through the node information of the first node corresponds to at least one child node of the first node, and pass the first test if the test result of calling the first test interface through the node information of the first node corresponds to the node information of at least one child node of the first node;

A first node sub-first node obtaining module configured to obtain at least one sub-node of the first node if the first test passes and the first node is not a leaf node; determining a second test interface in the target test program according to at least one child node of the first node; the second test module is configured to call a second test interface of the target test program according to the root node, the first node and at least one child node of the first node so as to perform a second test on the second test interface;

the third test module is configured to continuously call a first test interface of a target test program according to the root node and the second node if the first test fails or the first node is a leaf node so as to continuously perform a third test on the first test interface to test the first test interface according to at least one node of the root node in sequence;

9. An electronic device, comprising:

One or more processors;

storage means for storing one or more programs,

the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-7.

10. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-7.