CN111190807A - Buried point testing method and device - Google Patents
Buried point testing method and device Download PDFInfo
- Publication number
- CN111190807A CN111190807A CN201811351707.1A CN201811351707A CN111190807A CN 111190807 A CN111190807 A CN 111190807A CN 201811351707 A CN201811351707 A CN 201811351707A CN 111190807 A CN111190807 A CN 111190807A
- Authority
- CN
- China
- Prior art keywords
- buried
- point
- code
- buried point
- embedded
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000012360 testing method Methods 0.000 title claims abstract description 40
- 238000000034 method Methods 0.000 claims description 51
- 238000012545 processing Methods 0.000 claims description 8
- 230000003068 static effect Effects 0.000 claims description 7
- 230000000007 visual effect Effects 0.000 claims description 7
- 230000006870 function Effects 0.000 claims description 6
- 235000014347 soups Nutrition 0.000 claims description 6
- 239000011800 void material Substances 0.000 claims description 6
- 238000009933 burial Methods 0.000 claims 1
- 230000008569 process Effects 0.000 description 4
- 230000006399 behavior Effects 0.000 description 2
- 238000013480 data collection Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 240000007594 Oryza sativa Species 0.000 description 1
- 235000007164 Oryza sativa Nutrition 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 235000009566 rice Nutrition 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
- G06F11/3636—Software debugging by tracing the execution of the program
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application discloses a buried point testing method, which comprises the following steps: analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data; and testing the buried points according to the precise positioning data of the buried points. The application also discloses corresponding embedded point testing equipment, a nonvolatile computer readable storage medium and electronic equipment. By applying the technical scheme disclosed by the application, the buried point can be conveniently and accurately tested.
Description
Technical Field
The application relates to the field of big data processing, in particular to a buried point testing method and equipment.
Background
In the field of big data, the accuracy of buried point data is the source of all data. If the data quality of the source can not be guaranteed, the dish can be made as if, and the rice cooker is skillfully used. A buried point is a term of data collection field (especially of user behavior data collection field) and refers to a related technology and its implementation process for capturing, processing and transmitting specific user behavior or events.
However, in the present stage, since the product needs to be iterated continuously, people often only pay attention to the quality in the aspect of functions, but ignore the quality of the buried points, so that the buried points may be lost or buried incorrectly after each product is upgraded, thereby causing inaccurate data of a data warehouse and influencing decisions or other products using the data.
The buried point may be faulty in two scenarios:
(1) the new buried points are buried wrongly or omitted for the first time, but no one finds the new buried points;
(2) old buried points are lost or modified during the product upgrade process.
The first problem may be solved manually, and the requirement of a newly added buried point is verified every time, but the first problem is often ignored in the actual operation process; the second problem cannot be solved manually.
For product testing, if the quality of all the buried points needs to be tested back each time, the workload is very large. The buried points in a page are usually dozens, and if the whole product is manually regressed, hundreds of the buried points may be processed. It can be seen that if the way of testing the buried point is only by hand, it is almost unrealistic to check one by one.
Therefore, how to quickly return to the buried point before each product release is an urgent technical problem to be solved.
Disclosure of Invention
In view of the above problems, the present application provides a buried point testing method and device to conveniently and accurately test a buried point.
The application discloses a buried point testing method, which comprises the following steps:
analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data;
and testing the buried points according to the precise positioning data of the buried points.
Preferably, the analyzing the codes of the embedded points by the analysis tool, and the collecting the accurate positioning data of the embedded points comprises:
analyzing the embedded point files with different code formats by adopting corresponding analysis tools;
and collecting accurate positioning data of the embedded points from the analysis result by adopting a corresponding method according to different embedded point modes.
Preferably, the analyzing the embedded point files in different code formats by using corresponding analyzing tools includes:
and analyzing the codes into an abstract syntax tree based on an analysis library corresponding to the code format, and outputting the codes and the buried point information.
Preferably, the analyzing the embedded point files in different code formats by using corresponding analyzing tools includes:
for Java-format code, based on a JavaParser library, parsing a JAVA code text into an abstract syntax tree of a CompatitionUnit type through JavaParser.
Preferably, the analyzing the embedded point files in different code formats by using corresponding analyzing tools includes:
for the code with the Kotlin format, the Kotlin code text is analyzed into an abstract syntax tree with a KtFile type through a related class in a Kotlin compiler library, the abstract syntax tree receives a KtTreeVisitorVoid object KtFile, acceptChildren (KtTreeVisitorVoid) to search and traverse on the syntax tree, then a specific callback is called according to the type of the encountered node, and when the callback code exists in a method judged in a void visitNamedFunction (KtNamedFunction function), a packet name, a class name, a method name + parameter + line number, and a buried point KEY + line number + mode are output.
Preferably, the analyzing the embedded point files in different code formats by using corresponding analyzing tools includes:
for the code in the XML format, processing an XML code text based on a Beautiful Soup library to generate a parsing tree, performing search traversal on the tree, outputting attribute values of all sub-nodes meeting conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting a file name, a control ID + line number, a buried point KEY + line number + mode.
Preferably, the collecting the accurate location data of the embedded point from the analysis result by using the corresponding method according to the different embedded point modes includes:
for static code embedded points, judging whether to call an embedded point method, and if so, intercepting embedded point KEY from the loop-back parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
Preferably, the testing of the buried point according to the precise location data of the buried point includes:
confirming whether the new buried point is buried wrongly or missed according to the buried point accurate positioning data, and storing the buried point accurate positioning data as buried point accurate positioning filing data after the test is passed;
and checking the old buried points according to the accurate positioning filing data and the accurate positioning data of the buried points, and determining whether the old buried points are lost or modified.
The application also discloses a bury some test equipment, include: a processor to:
analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data;
and testing the buried points according to the precise positioning data of the buried points.
Preferably, the processor is specifically configured to:
analyzing the embedded point files with different code formats by adopting corresponding analysis tools;
and collecting accurate positioning data of the embedded points from the analysis result by adopting a corresponding method according to different embedded point modes.
Preferably, the processor is specifically configured to:
and analyzing the codes into an abstract syntax tree based on an analysis library corresponding to the code format, and outputting the codes and the buried point information.
Preferably, the processor is specifically configured to:
for Java-format code, based on a JavaParser library, parsing a JAVA code text into an abstract syntax tree of a CompatitionUnit type through JavaParser.
Preferably, the processor is specifically configured to:
for the code with the Kotlin format, the Kotlin code text is analyzed into an abstract syntax tree with a KtFile type through a related class in a Kotlin compiler library, the abstract syntax tree receives a KtTreeVisitorVoid object KtFile, acceptChildren (KtTreeVisitorVoid) to search and traverse on the syntax tree, then a specific callback is called according to the type of the encountered node, and when the callback code exists in a method judged in a void visitNamedFunction (KtNamedFunction function), a packet name, a class name, a method name + parameter + line number, and a buried point KEY + line number + mode are output.
Preferably, the processor is specifically configured to:
for the code in the XML format, processing an XML code text based on a Beautiful Soup library to generate a parsing tree, performing search traversal on the tree, outputting attribute values of all sub-nodes meeting conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting a file name, a control ID + line number, a buried point KEY + line number + mode.
Preferably, the processor is specifically configured to:
for static code embedded points, judging whether to call an embedded point method, and if so, intercepting embedded point KEY from the loop-back parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
Preferably, the device further comprises a memory; wherein:
the processor is specifically configured to:
confirming whether the new buried point is buried wrongly or missed according to the buried point accurate positioning data, and storing the buried point accurate positioning data serving as buried point accurate positioning filing data into a memory after the test is passed;
and checking old buried points according to the buried point accurate positioning filing data stored in the memory and the collected buried point accurate positioning data, and determining whether the old buried points are lost or modified.
The present application also discloses a non-transitory computer readable storage medium storing instructions that, when executed by a processor, cause the processor to perform the steps of the buried point testing method as previously described.
The application also discloses an electronic device comprising the non-volatile computer-readable storage medium as described above, and the processor having access to the non-volatile computer-readable storage medium.
According to the technical scheme, the embedded point testing method and the embedded point testing equipment have the advantages that the embedded point codes are analyzed through the analysis tool, accurate embedded point locating data are collected, the embedded points are tested according to the accurate embedded point locating data, the embedded points can be checked whether to be embedded wrongly or omitted, the old embedded points can be checked through comparison, all regression is not needed, and the system testing time is greatly saved.
Drawings
Fig. 1 is a schematic flow chart illustrating collecting accurate positioning data of a buried point according to the present application;
fig. 2 is a schematic structural diagram of the apparatus of the present buried point testing method.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below by referring to the accompanying drawings and examples.
The embedded point testing method mainly comprises the following steps:
step 1: and analyzing the embedded point codes through an analysis tool, and collecting accurate positioning data of the embedded point.
Wherein, this step can include the following two parts:
1) defining accurate positioning data of the embedded points according to the embedded point mode;
2) and analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data by adopting a corresponding method according to different embedded point modes.
Step 2: and testing the buried points according to the precise positioning data of the buried points.
The test buried point comprises: testing a new buried point and an old buried point specifically comprises the following steps:
1) confirming whether the new buried point is buried wrongly or omitted according to the buried point accurate positioning data;
2) and checking the old buried points according to the accurate positioning filing data and the accurate positioning data of the buried points, and determining whether the old buried points are lost or modified.
The above-mentioned method is described in detail below.
Firstly, a buried point adding mode and a buried point reporting mode.
Taking an android client as an example, there are three ways of adding a buried point:
1) static code embedding: adding a buried point in a java/kotlin code method, and reporting when the method is called;
2) visual point burying: adding a buried point in a control attribute (android: contentDescription) of the xml layout, and reporting when an AOP (Aspect Oriented Programming) cuts into a click event;
3) dynamic code embedding: and adding a buried point in the callback parameter of the user-defined dialog box button, and reporting when the user clicks the button.
The adding and reporting modes of other clients are basically consistent, such as Objective-C and Swift code embedding of the IOS client.
And secondly, analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data.
The process of collecting accurate positioning data of a buried point according to the present application is shown in fig. 1, and mainly includes: and analyzing the embedded point files with different code formats by adopting corresponding analysis tools, and collecting accurate embedded point positioning data from the analysis result by adopting corresponding methods according to different embedded point modes.
Taking an android client as an example, there are three code analysis modes:
1) java code parsing
Parsing a JAVA code text into an abstract syntax tree of a compositionit type through JAVA server.space (File), wherein the tree accepts a voidvisitoradaper object (voidvisitoradaper, null) to search and traverse on the syntax tree, and then calls a specific callback according to the type of the encountered node, and outputs data such as a packet name, a class name, a method name + parameter + line number, a buried point KEY + line number + mode and the like when it is judged that a buried point code exists in a method in the voidsisit (MethodDeclaration n, Objectarg) callback.
2) Kotlin code resolution
The method comprises the steps of analyzing a Kotlin code text into a KtFile-type abstract syntax tree through related classes in a Kotlin compiler library, receiving a KtTreeVisitorVoid object (KtFile. acceptable Children (KtTreeVisitorVoid)) to search and traverse on the syntax tree, calling a specific callback according to the type of an encountered node, and outputting data such as packet names, class names, method names + parameter + line numbers, buried point KEY + line numbers + modes when a buried point code exists in a judgment method in the void visitNamedFunction (KtNamedFunction) callback.
Specific data are shown in table 1 for example:
TABLE 1
3) XML code parsing
Processing the XML code text based on the Beautiful Soup library to generate a parse tree (pars tree), searching and traversing the tree, outputting attribute values of all sub-nodes which meet the conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting data such as file names, control ID + line number, buried point KEY + line number + mode and the like.
Specific data are shown in table 2:
| file class Model (III) | Filename | Control ID | Control ID line Number of | Buried point KEY | Line of buried points Number of | Buried point Means for |
| XML | fingerprints_login_ page.xml | @+id/user_name | 23 | 16118 | 32 | AOP cutting Into |
| XML | fingerprints_login_ page.xml | @+id/ fingerprint_ image | 36 | 16120 | 44 | AOP cutting Into |
TABLE 2
For the three different buried point modes, the application provides three corresponding methods for intercepting the buried point KEY:
for static code embedded points, judging whether to call an embedded point method, if so, intercepting embedded point KEY from callback parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
Here, the buried point KEY is a unique identifier of the buried point, and may be used to index the buried point.
Codes of other clients can be analyzed into an abstract syntax tree based on a corresponding analysis library, codes and buried point information can be output, and for example, Objective-C and Swift codes of IOS clients can be analyzed into the abstract syntax tree based on a Clang library.
Thirdly, testing the embedded point by accurately positioning the embedded point
Through burying the accurate positioning data test of some scenes and can be divided into 3:
1. after newly-added buried points are developed, collecting buried point accurate positioning data of the newly-added buried points to determine whether the newly-added buried points are buried wrongly or omitted.
Specifically, the method comprises the following steps: for example, 100 new buried points are planned to be added, the related information of the buried points needing to be added can be sorted out in advance, after the buried points are newly added, the method of the application is adopted to collect the precise buried point positioning data of the newly buried points, and whether the buried fault or omission exists can be determined by automatically comparing the newly planned buried point data with the collected precise buried point positioning data.
For example: the accurate positioning data of the buried points of 98 buried points is only collected, which means that 2 buried points are omitted, and which 2 buried points are omitted can be accurately positioned through the buried point KEY.
For another example: and (4) finding that the line number of a certain buried point is not in accordance with the original plan through comparison, and confirming that the buried point is buried in a wrong way.
2. After accomplishing newly burying some verification, collect the accurate positioning data of burying some of newly burying some, file it for old buried point data and save, this application is called: and (5) accurately positioning and archiving data by embedding points.
3. After the product is subjected to an iterative process, accurate embedded point positioning data of old embedded points are collected by the method, and are compared with accurate embedded point positioning filing data for verification to determine whether the old embedded points are lost or modified.
Specifically, the method comprises the following steps: as mentioned above, the embedded point can be indexed by the embedded point KEY, and after product iteration, by collecting the accurate embedded point positioning data of the old embedded point and comparing the accurate embedded point positioning data with the stored accurate embedded point positioning filing data, if the number of rows of a certain embedded point is not consistent, the embedded point can be confirmed to be modified. Alternatively, if a buried point KEY does not exist, it can be confirmed that the buried point is lost.
Corresponding to the above method, the present application provides a buried point testing apparatus, which has a structure as shown in fig. 2 and at least includes: a processor to:
analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data;
and testing the buried points according to the precise positioning data of the buried points.
Wherein the processor may be specifically configured to:
analyzing the embedded point files with different code formats by adopting corresponding analysis tools;
and collecting accurate positioning data of the embedded points from the analysis result by adopting a corresponding method according to different embedded point modes.
Wherein the processor may be specifically configured to: and analyzing the codes into an abstract syntax tree based on an analysis library corresponding to the code format, and outputting the codes and the buried point information.
Wherein the processor may be specifically configured to: for Java-format code, based on JavaParser library, parsing Java code text into an abstract syntax tree of the type of completionunit by JavaParser.
Wherein the processor may be specifically configured to: for the code with the Kotlin format, the Kotlin code text is analyzed into an abstract syntax tree with a KtFile type through a related class in a Kotlin compiler library, the abstract syntax tree receives a KtTreeVisitorVoid object KtFile, acceptChildren (KtTreeVisitorVoid) to search and traverse on the syntax tree, then a specific callback is called according to the type of the encountered node, and when the callback code exists in a method judged in a void visitNamedFunction (KtNamedFunction function), a packet name, a class name, a method name + parameter + line number, and a buried point KEY + line number + mode are output.
Wherein the processor may be specifically configured to: for the code in the XML format, processing an XML code text based on a Beautiful Soup library to generate a parsing tree, performing search traversal on the tree, outputting attribute values of all sub-nodes meeting conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting a file name, a control ID + line number, a buried point KEY + line number + mode.
Wherein the processor may be specifically configured to:
for static code embedded points, judging whether to call an embedded point method, and if so, intercepting embedded point KEY from the loop-back parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
The apparatus shown in fig. 2 may further include a memory, and the processor is specifically configured to:
confirming whether the new buried point is buried wrongly or missed according to the buried point accurate positioning data, and storing the buried point accurate positioning data serving as buried point accurate positioning filing data into a memory after the test is passed;
and checking old buried points according to the buried point accurate positioning filing data stored in the memory and the collected buried point accurate positioning data, and determining whether the old buried points are lost or modified.
Further, the present application provides a non-transitory computer readable storage medium storing instructions that, when executed by a processor, cause the processor to perform the steps of the buried point testing method as described above.
Further, the present application provides an electronic device comprising the non-volatile computer-readable storage medium as described above, and the processor having access to the non-volatile computer-readable storage medium.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the scope of protection of the present application.
Claims (18)
1. A method of buried point testing, comprising:
analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data;
and testing the buried points according to the precise positioning data of the buried points.
2. The method of claim 1, wherein analyzing the buried point code with a parsing tool and collecting accurate location data of the buried point comprises:
analyzing the embedded point files with different code formats by adopting corresponding analysis tools;
and collecting accurate positioning data of the embedded points from the analysis result by adopting a corresponding method according to different embedded point modes.
3. The method of claim 2, wherein parsing the buried point files for different code formats with corresponding parsing tools comprises:
and analyzing the codes into an abstract syntax tree based on an analysis library corresponding to the code format, and outputting the codes and the buried point information.
4. The method of claim 3, wherein parsing the buried point files for different code formats with corresponding parsing tools comprises:
for Java-format code, based on JavaParser library, parsing Java code text into an abstract syntax tree of the type of completionunit by JavaParser.
5. The method of claim 3, wherein parsing the buried point files for different code formats with corresponding parsing tools comprises:
for the code with the Kotlin format, the Kotlin code text is analyzed into an abstract syntax tree with a KtFile type through a related class in a Kotlin compiler library, the abstract syntax tree receives a KtTreeVisitorVoid object KtFile, acceptChildren (KtTreeVisitorVoid) to search and traverse on the syntax tree, then a specific callback is called according to the type of the encountered node, and when the callback code exists in a method judged in a void visitNamedFunction (KtNamedFunction function), a packet name, a class name, a method name + parameter + line number, and a buried point KEY + line number + mode are output.
6. The method of claim 3, wherein parsing the buried point files for different code formats with corresponding parsing tools comprises:
for the code in the XML format, processing an XML code text based on a Beautiful Soup library to generate a parsing tree, performing search traversal on the tree, outputting attribute values of all sub-nodes meeting conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting a file name, a control ID + line number, a buried point KEY + line number + mode.
7. The method as claimed in any one of claims 2 to 6, wherein the collecting the buried point accurate positioning data from the analysis result by using the corresponding method according to different buried point modes comprises:
for static code embedded points, judging whether to call an embedded point method, and if so, intercepting embedded point KEY from the loop-back parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
8. The method of any one of claims 1 to 6, wherein said testing the burial point according to the buried point accurate positioning data comprises:
confirming whether the new buried point is buried wrongly or missed according to the buried point accurate positioning data, and storing the buried point accurate positioning data as buried point accurate positioning filing data after the test is passed;
and checking the old buried points according to the accurate positioning filing data and the accurate positioning data of the buried points, and determining whether the old buried points are lost or modified.
9. A buried site testing apparatus, comprising: a processor to:
analyzing the embedded point codes through an analysis tool, and collecting accurate embedded point positioning data;
and testing the buried points according to the precise positioning data of the buried points.
10. The device of claim 9, wherein the processor is specifically configured to:
analyzing the embedded point files with different code formats by adopting corresponding analysis tools;
and collecting accurate positioning data of the embedded points from the analysis result by adopting a corresponding method according to different embedded point modes.
11. The device of claim 10, wherein the processor is specifically configured to:
and analyzing the codes into an abstract syntax tree based on an analysis library corresponding to the code format, and outputting the codes and the buried point information.
12. The device of claim 11, wherein the processor is specifically configured to:
for Java-format code, based on JavaParser library, parsing Java code text into an abstract syntax tree of the type of completionunit by JavaParser.
13. The device of claim 11, wherein the processor is specifically configured to:
for the code with the Kotlin format, the Kotlin code text is analyzed into an abstract syntax tree with a KtFile type through a related class in a Kotlin compiler library, the abstract syntax tree receives a KtTreeVisitorVoid object KtFile, acceptChildren (KtTreeVisitorVoid) to search and traverse on the syntax tree, then a specific callback is called according to the type of the encountered node, and when the callback code exists in a method judged in a void visitNamedFunction (KtNamedFunction function), a packet name, a class name, a method name + parameter + line number, and a buried point KEY + line number + mode are output.
14. The device of claim 11, wherein the processor is specifically configured to:
for the code in the XML format, processing an XML code text based on a Beautiful Soup library to generate a parsing tree, performing search traversal on the tree, outputting attribute values of all sub-nodes meeting conditions, searching all sub-nodes containing android and contentDescription attributes, and outputting a file name, a control ID + line number, a buried point KEY + line number + mode.
15. The apparatus of any of claims 10 to 14, wherein the processor is specifically configured to:
for static code embedded points, judging whether to call an embedded point method, and if so, intercepting embedded point KEY from the loop-back parameters;
for the dynamic code embedded point, judging whether a callback parameter of a user-defined dialog box button has a number, if so, intercepting the number from the callback parameter as an embedded point KEY;
and for the visual buried point, judging whether the android content description attribute exists and is a number, and if so, intercepting the number from the android content description attribute to be the buried point KEY.
16. The apparatus according to any one of claims 9 to 14, further comprising a memory; wherein:
the processor is specifically configured to:
confirming whether the new buried point is buried wrongly or missed according to the buried point accurate positioning data, and storing the buried point accurate positioning data serving as buried point accurate positioning filing data into a memory after the test is passed;
and checking old buried points according to the buried point accurate positioning filing data stored in the memory and the collected buried point accurate positioning data, and determining whether the old buried points are lost or modified.
17. A non-transitory computer readable storage medium storing instructions that, when executed by a processor, cause the processor to perform the steps of the buried point testing method of any one of claims 1 to 8.
18. An electronic device comprising the non-volatile computer-readable storage medium of claim 17, and the processor having access to the non-volatile computer-readable storage medium.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811351707.1A CN111190807B (en) | 2018-11-14 | 2018-11-14 | Buried point testing method and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811351707.1A CN111190807B (en) | 2018-11-14 | 2018-11-14 | Buried point testing method and equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111190807A true CN111190807A (en) | 2020-05-22 |
| CN111190807B CN111190807B (en) | 2023-08-18 |
Family
ID=70710511
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811351707.1A Active CN111190807B (en) | 2018-11-14 | 2018-11-14 | Buried point testing method and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111190807B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112148606A (en) * | 2020-09-22 | 2020-12-29 | 京东数字科技控股股份有限公司 | Embedded point testing method, device, equipment and computer readable medium |
| CN112596978A (en) * | 2020-12-23 | 2021-04-02 | 华人运通(上海)云计算科技有限公司 | Method, device and medium for processing embedded point information |
| CN113641345A (en) * | 2021-08-13 | 2021-11-12 | 网易（杭州）网络有限公司 | Mapping configuration-based point burying method and device, electronic equipment and storage medium |
| CN114331574A (en) * | 2022-03-17 | 2022-04-12 | 北京搜狐新媒体信息技术有限公司 | Verification method, device, storage medium and equipment for reporting buried point |
| CN116680171A (en) * | 2023-05-22 | 2023-09-01 | 前海飞算云智软件科技(深圳)有限公司 | Test method, device, storage medium and electronic equipment |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5850511A (en) * | 1996-10-28 | 1998-12-15 | Hewlett-Packard Company | Computer implemented methods and apparatus for testing a telecommunications management network (TMN) agent |
| CN103530223A (en) * | 2012-07-06 | 2014-01-22 | 百度在线网络技术（北京）有限公司 | Method and device for automatically generating unit test cases |
| CN106502896A (en) * | 2016-10-21 | 2017-03-15 | 武汉斗鱼网络科技有限公司 | A kind of generation method of function test code and device |
| CN106844217A (en) * | 2017-01-26 | 2017-06-13 | 网易（杭州）网络有限公司 | Control to applying bury method and device, readable storage medium storing program for executing a little |
| CN107688530A (en) * | 2017-04-06 | 2018-02-13 | 平安科技（深圳）有限公司 | Method for testing software and device |
| CN107832216A (en) * | 2017-11-08 | 2018-03-23 | 无线生活（杭州）信息科技有限公司 | One kind buries a method of testing and device |
| CN107870860A (en) * | 2017-05-05 | 2018-04-03 | 平安科技（深圳）有限公司 | Bury a checking system and method |
| WO2018113385A1 (en) * | 2016-12-24 | 2018-06-28 | 上海壹账通金融科技有限公司 | Method and system for dynamically tracking application of client, client, and server |
| CN108319552A (en) * | 2018-02-07 | 2018-07-24 | 优信数享（北京）信息技术有限公司 | One kind burying a test method, apparatus and system |
| CN108536589A (en) * | 2018-03-26 | 2018-09-14 | 广州小鹏汽车科技有限公司 | A kind of application program buries point methods and system |
-
2018
- 2018-11-14 CN CN201811351707.1A patent/CN111190807B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5850511A (en) * | 1996-10-28 | 1998-12-15 | Hewlett-Packard Company | Computer implemented methods and apparatus for testing a telecommunications management network (TMN) agent |
| CN103530223A (en) * | 2012-07-06 | 2014-01-22 | 百度在线网络技术（北京）有限公司 | Method and device for automatically generating unit test cases |
| CN106502896A (en) * | 2016-10-21 | 2017-03-15 | 武汉斗鱼网络科技有限公司 | A kind of generation method of function test code and device |
| WO2018113385A1 (en) * | 2016-12-24 | 2018-06-28 | 上海壹账通金融科技有限公司 | Method and system for dynamically tracking application of client, client, and server |
| CN106844217A (en) * | 2017-01-26 | 2017-06-13 | 网易（杭州）网络有限公司 | Control to applying bury method and device, readable storage medium storing program for executing a little |
| CN107688530A (en) * | 2017-04-06 | 2018-02-13 | 平安科技（深圳）有限公司 | Method for testing software and device |
| WO2018184420A1 (en) * | 2017-04-06 | 2018-10-11 | 平安科技（深圳）有限公司 | Software testing method, apparatus, electronic device, and medium |
| CN107870860A (en) * | 2017-05-05 | 2018-04-03 | 平安科技（深圳）有限公司 | Bury a checking system and method |
| CN107832216A (en) * | 2017-11-08 | 2018-03-23 | 无线生活（杭州）信息科技有限公司 | One kind buries a method of testing and device |
| CN108319552A (en) * | 2018-02-07 | 2018-07-24 | 优信数享（北京）信息技术有限公司 | One kind burying a test method, apparatus and system |
| CN108536589A (en) * | 2018-03-26 | 2018-09-14 | 广州小鹏汽车科技有限公司 | A kind of application program buries point methods and system |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112148606A (en) * | 2020-09-22 | 2020-12-29 | 京东数字科技控股股份有限公司 | Embedded point testing method, device, equipment and computer readable medium |
| CN112148606B (en) * | 2020-09-22 | 2024-05-17 | 京东科技控股股份有限公司 | Buried point test method, buried point test device, buried point test equipment and computer readable medium |
| CN112596978A (en) * | 2020-12-23 | 2021-04-02 | 华人运通(上海)云计算科技有限公司 | Method, device and medium for processing embedded point information |
| CN113641345A (en) * | 2021-08-13 | 2021-11-12 | 网易（杭州）网络有限公司 | Mapping configuration-based point burying method and device, electronic equipment and storage medium |
| CN114331574A (en) * | 2022-03-17 | 2022-04-12 | 北京搜狐新媒体信息技术有限公司 | Verification method, device, storage medium and equipment for reporting buried point |
| CN116680171A (en) * | 2023-05-22 | 2023-09-01 | 前海飞算云智软件科技(深圳)有限公司 | Test method, device, storage medium and electronic equipment |
| CN116680171B (en) * | 2023-05-22 | 2024-03-08 | 前海飞算云智软件科技(深圳)有限公司 | Test method, device, storage medium and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111190807B (en) | 2023-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111190807A (en) | Buried point testing method and device | |
| CN109388566B (en) | Code coverage rate analysis method, device, equipment and storage medium | |
| CN109684847B (en) | Automatic repairing method, device, equipment and storage medium for script loopholes | |
| US11176317B2 (en) | Automated file merging through content classification | |
| US9251046B2 (en) | Method and system for generating and processing black box test cases | |
| CN108459954B (en) | Application program vulnerability detection method and device | |
| US8209658B2 (en) | Method of creating signatures for classifying program failures | |
| CN109710810B (en) | Change management method, device, equipment and storage medium | |
| US11074162B2 (en) | System and a method for automated script generation for application testing | |
| CN111078637B (en) | Script file online method and device, computer equipment and storage medium | |
| CN110716866A (en) | Code quality scanning method and device, computer equipment and storage medium | |
| US9390073B2 (en) | Electronic file comparator | |
| CN113688134B (en) | Visual variable management method, system and equipment based on multidimensional data | |
| CN114035789A (en) | Log analysis template generation method, log analysis device and log analysis equipment | |
| CN111767213B (en) | Database check point testing method and device, electronic equipment and storage medium | |
| CN111258562A (en) | Java code quality inspection method, device, equipment and storage medium | |
| CN113031995B (en) | Rule updating method and device, storage medium and electronic equipment | |
| US11740995B2 (en) | Source quality check service | |
| CN114492324A (en) | Component data statistical method and device | |
| CN114356404A (en) | Interface document generating method, system and computer readable storage medium | |
| CN113792017A (en) | Method and system for checking template content imported into excel | |
| CN105765908B (en) | A kind of multi-site automatic update method, client and system | |
| CN109558418B (en) | Method for automatically identifying information | |
| CN113282504A (en) | Incremental code coverage rate detection method and service development method and device | |
| CN113037521A (en) | Method for identifying state of communication equipment, communication system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |