CN115658452A - Buried point checking method, buried point checking device, readable storage medium and electronic equipment - Google Patents

Abstract

The embodiment of the disclosure relates to a buried point checking method, a buried point checking device, a readable storage medium and electronic equipment, and relates to the technical field of computers. The buried point checking method comprises the following steps: receiving buried point reporting information of an application program client, and matching the pit bit information with pit bits in a target pit bit library in response to the fact that the buried point reporting information comprises pit bit information; according to the matching result, based on a target verification rule base, verifying the buried point reported information; and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified. The method and the device can improve efficiency and accuracy of the buried point verification.

Description

Buried point checking method, buried point checking device, readable storage medium and electronic equipment

Technical Field

The embodiment of the disclosure relates to the technical field of computers, and more particularly, to a buried point checking method, a buried point checking device, a computer-readable storage medium and an electronic device.

Background

This section is intended to provide a background or context to the embodiments of the disclosure recited in the claims and the description herein is not admitted to be prior art by inclusion in this section.

The buried point is a process specific in the application that collects some information to track the usage of the application to provide data support for further optimizing the product. And the accuracy of the collected information can be ensured by checking the buried points.

The buried point verification scheme in the prior art is mainly divided into the following 2 types: the first method is that in the development stage, through log real-time uploading, rule matching verification is carried out at a server side or a buried point requirement rule stored on a buried point platform is issued to a client side, and real-time generated buried points are verified at the client side; and the second method is that after the gray scale of the buried point or the full distribution is on-line, comparison and abnormal fluctuation monitoring are carried out on the buried point of the new and old versions to identify whether the buried point data has problems.

Disclosure of Invention

However, the first solution only focuses on whether the buried point is correct or not, and the multi-report or the missing report of the buried point cannot be verified, so the verification accuracy is not sufficient. The second scheme can find problems according to the fluctuation of new and old buried point data after the online check is carried out, the problem finding period is long, the problems can be found accurately according to the fluctuation of the new and old data only when the coverage of a new version of a user reaches a certain ratio, the buried point check efficiency is low, in addition, the problems can be found only after the online check of the buried point, and the defect that the problem finding is delayed exists.

Therefore, an improved buried point verification method is highly needed, which can improve the accuracy of buried point verification and the efficiency of buried point verification, and can find more problems before the buried point is on-line, so as to avoid the hysteresis of problem discovery as much as possible.

In this context, embodiments of the present disclosure are intended to provide a buried point verification method, a buried point verification apparatus, a computer-readable storage medium, and an electronic device.

According to a first aspect of the disclosed embodiments, there is provided a buried point verification method, including: receiving buried point reporting information of an application program client, and matching the pit bit information with pit bits in a target pit bit library in response to the fact that the buried point reporting information comprises pit bit information; according to the matching result, based on a target verification rule base, verifying the buried point reported information; and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

In an optional implementation manner, the verifying, according to the matching result, the information reported by the buried point based on a target verification rule base includes: responding to the matching success, and acquiring a buried object identifier included in the pit bit information; and aiming at each buried point object identifier, verifying the first buried point parameter in the buried point report information based on the verification rule of the first buried point parameter associated with the buried point object identifier in the target verification rule base.

In an optional implementation manner, the verifying, according to the matching result, the information reported by the buried point based on a target verification rule base includes: and responding to the matching failure, and adding a label of the pit bit matching failure to the buried point reporting information.

In an optional implementation manner, after receiving the information reported by the embedded point of the application client, the method further includes: determining a second buried point parameter associated with a buried point reporting event triggering the buried point reporting information, and verifying the second buried point parameter in the buried point reporting information according to a verification rule of the second buried point parameter in the target verification rule base; and/or verifying the public parameters in the information reported by the buried point according to the verification rules corresponding to the public parameters in the target verification rule base.

In an optional implementation manner, in a case that the buried point report information includes buried point report information corresponding to a buried point test task, the to-be-verified buried point task includes a first buried point task in the buried point test task and a second buried point task on-line with an application program targeted by the buried point test task.

In an optional implementation manner, the determining manner of the to-be-verified buried node task includes: acquiring a value of a preset field in the buried point reporting information, and determining the buried point task to be checked according to the value of the preset field; the preset field is used for indicating the version of the application program client, and the buried point tasks to be checked comprise online buried point tasks corresponding to the version of the application program client.

In an alternative embodiment, the method further comprises: updating the first quantity and the second quantity according to the received buried point reporting information; responding to the operation of requesting to display the checking result of the first checking mode, and displaying a first quantity and a second quantity corresponding to the buried point reporting event; the first quantity comprises the quantity of the buried point reporting events indicated by the buried point reporting information, and the second quantity comprises the quantity of the buried point pit bits corresponding to the buried point reporting events indicated by the buried point reporting information.

In an optional embodiment, the method further comprises: and responding to the operation of requesting to display the verification result of the first verification mode, and sequentially displaying the verification result of the information reported by the buried point according to the reporting time of the information reported by the buried point.

In an optional implementation manner, in a case that the buried point reporting information includes buried point reporting information corresponding to a buried point testing task, the method further includes: determining a target buried-point pit position comprising a buried-point parameter of an enumeration type; and under the condition that each enumeration value of each target buried point pit bit is successfully matched, determining that the buried point test task test is completed.

In an optional embodiment, the method further comprises: and aiming at the target buried point parameters which are not in the buried point report information and have passed the check rule description constraint value range, checking the target buried point parameters according to a candidate value library which is associated with the target buried point parameters in advance.

In an alternative embodiment, the method further comprises: updating one or more of a third quantity, a fourth quantity, a fifth quantity, a sixth quantity and a seventh quantity according to the attribution parameter values of the embedded points in the information reported by the embedded points; the third quantity is used for representing the quantity of the buried point reporting information with the empty buried point attribution parameter value, the fourth quantity is used for representing the quantity of the buried point reporting information with the illegal buried point attribution parameter value, the fifth quantity is used for representing the quantity of the buried point reporting information with the unreasonable buried point attribution parameter value, the sixth quantity is used for representing the quantity of the buried point reporting information with the degraded buried point attribution parameter value, and the seventh quantity is used for representing the quantity of each type of buried point attribution parameter value of the buried point reporting event corresponding to the buried point reporting information; under the condition that the pit bit indicated by the pit bit information in the buried point attribution parameter value does not belong to the buried point pit bit, determining that the buried point attribution parameter value is illegal; determining that the buried point attribution parameter values are unreasonable under the condition that the pit bit to be confirmed indicated by the pit bit information in the buried point attribution parameter values is a buried point pit bit, but the pit bit to be confirmed is not matched with the pit bit information in the candidate buried point attribution parameter values of the buried point reporting event corresponding to the buried point reporting information; and determining that the buried point attribution parameter value is degraded under the condition that the buried point attribution parameter value comprises a preset identification field, wherein the preset field identification is used for identifying the buried point attribution parameter value generated after a pit bit without a buried point object in the application program client is triggered.

In an alternative embodiment, the method further comprises: according to the reporting time sequence of the buried point reporting information, recording the buried point reporting information of the application program client side aiming at any application program client side; responding to a query request for target buried point reporting information, and acquiring other buried point reporting information of which the reporting sequence of the target buried point reporting information is within a preset range so as to display the target buried point reporting information and the other buried point reporting information.

In an optional implementation manner, the buried point reporting information includes buried point reporting information generated by triggering the application program client according to a test case of a buried point test task, where the test case is generated based on buried point pit bits to be tested of the buried point test task.

In an optional implementation manner, in a case that the buried point reporting information includes buried point reporting information corresponding to a buried point testing task, the method further includes: and simulating test data corresponding to a test link in the buried point test task through the virtual object so as to carry out integrity verification on the buried point test task based on the test link.

According to a second aspect of the embodiments of the present disclosure, there is provided a buried point verification apparatus, including: the embedded point information receiving module is configured to receive embedded point reporting information of an application program client, and in response to the embedded point reporting information including pit bit information, match the pit bit information with pit bits in a target pit bit library; the verification module is configured to verify the buried point reported information based on a target verification rule base according to a matching result; and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

In an optional implementation manner, the verifying the information reported by the buried point based on a target verification rule base according to the matching result includes: responding to the matching success, and acquiring a buried object identifier included in the pit bit information; and aiming at each buried point object identifier, verifying the first buried point parameter in the buried point report information based on the verification rule of the first buried point parameter associated with the buried point object identifier in the target verification rule base.

In an optional implementation manner, the verifying the information reported by the buried point based on a target verification rule base according to the matching result includes: and responding to the matching failure, and adding a label of the pit bit matching failure for the buried point reporting information.

In an optional implementation manner, the embedded point verification device may further include a second embedded point parameter verification module and/or a third embedded point parameter verification module, where the second embedded point parameter verification module is configured to determine a second embedded point parameter associated with an embedded point reporting event that triggers the embedded point reporting information after receiving the embedded point reporting information of the application client, and verify the second embedded point parameter in the embedded point reporting information according to a verification rule of the second embedded point parameter in the target verification rule base; and the third embedded point parameter checking module is configured to check the public parameters in the embedded point reporting information according to the checking rules corresponding to the public parameters in the target checking rule base.

In an optional implementation manner, when the buried point reporting information includes buried point reporting information corresponding to a buried point test task, the buried point task to be verified includes a first buried point task in the buried point test task and a second buried point task on which an application program targeted by the buried point test task is on line.

In an optional implementation manner, the determining manner of the to-be-verified buried node task includes: acquiring a value of a preset field in the buried point reporting information, and determining the buried point task to be checked according to the value of the preset field; the preset field is used for indicating the version of the application program client, and the buried point tasks to be checked comprise online buried point tasks corresponding to the version of the application program client.

In an optional embodiment, the buried point verification device further includes: the quantity display module comprises an updating unit and a display unit, wherein the updating unit is configured to update the first quantity and the second quantity according to the received buried point reporting information; the display unit is configured to respond to an operation of requesting to display a first verification mode verification result and display a first quantity and a second quantity corresponding to a buried point reporting event; the first quantity comprises the quantity of the buried point reporting events indicated by the buried point reporting information, and the second quantity comprises the quantity of the buried point pit bits corresponding to the buried point reporting events indicated by the buried point reporting information.

In an optional implementation manner, the buried point verification apparatus further includes a sequential display verification result module, where the sequential display verification result module is configured to respond to an operation requesting to display a verification result of the first verification mode, and sequentially display the verification result of the information reported by the buried point according to the reporting time of the information reported by the buried point.

In an optional implementation manner, in a case that the buried point reporting information includes buried point reporting information corresponding to a buried point test task, the apparatus further includes a task completion checking module, where the task completion checking module is configured to determine a target buried point pit bit including an enumeration-type buried point parameter; and under the condition that each enumeration value of each target buried point pit bit is successfully matched, determining that the buried point test task test is completed.

In an optional embodiment, the buried point verification device further comprises a candidate verification module configured to: and aiming at the target buried point parameters which are not in the buried point report information and have passed the check rule description constraint value range, checking the target buried point parameters according to a candidate value library which is associated with the target buried point parameters in advance.

In an optional embodiment, the buried point checking device further comprises a quantity updating module configured to: updating one or more of a third quantity, a fourth quantity, a fifth quantity, a sixth quantity and a seventh quantity according to the attribution parameter values of the embedded points in the information reported by the embedded points; the third quantity is used for representing the quantity of the buried point reported information with empty buried point attribution parameter values, the fourth quantity is used for representing the quantity of the buried point reported information with illegal buried point attribution parameter values, the fifth quantity is used for representing the quantity of the buried point reported information with unreasonable buried point attribution parameter values, the sixth quantity is used for representing the quantity of the buried point reported information with degraded buried point attribution parameter values, and the seventh quantity is used for representing the quantity of the buried point attribution parameter values of various types of buried point reported events corresponding to the buried point reported information; under the condition that the pit bit indicated by the pit bit information in the buried point attribution parameter value does not belong to the buried point pit bit, determining that the buried point attribution parameter value is illegal; determining that the buried point attribution parameter value is unreasonable under the condition that the pit bit to be confirmed indicated by the pit bit information in the buried point attribution parameter value belongs to the buried point pit bit, but the pit bit to be confirmed fails to be matched with the pit bit information in the candidate buried point attribution parameter value of the buried point reporting event corresponding to the buried point reporting information; and determining that the buried point attribution parameter value is degraded under the condition that the buried point attribution parameter value comprises a preset identification field, wherein the preset field identification is used for identifying the buried point attribution parameter value generated after a pit bit without a buried point object in the application program client is triggered.

In an optional embodiment, the buried point verification device further comprises a detail display module configured to: the method comprises the steps of recording buried point reporting information of an application program client according to the reporting time sequence of the buried point reporting information aiming at any application program client, responding to a query request of target buried point reporting information, acquiring other buried point reporting information of which the reporting sequence is within a preset range with the target buried point reporting information, and displaying the target buried point reporting information and the other buried point reporting information.

In an optional implementation manner, the buried point reporting information includes buried point reporting information generated by triggering the application program client according to a test case of a buried point test task, where the test case is generated based on a buried point pit to be tested of the buried point test task.

In an optional implementation manner, in a case that the buried point report information includes buried point report information corresponding to a buried point test task, the buried point checking apparatus further includes an integrity checking module, where the integrity checking module is configured to: and simulating test data corresponding to a test link in the buried point test task through the virtual object so as to carry out integrity verification on the buried point test task based on the test link.

According to a third aspect of the disclosed embodiments, there is provided a computer-readable storage medium, on which a computer program is stored, the computer program, when executed by a processor, implementing the buried point verification method of the first aspect.

According to a fourth aspect of the disclosed embodiments, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the buried point verification method of the first aspect via execution of the executable instructions.

According to the embedded point checking method, the embedded point checking device, the computer readable storage medium and the electronic equipment of the embodiment of the disclosure, under the condition of receiving embedded point reporting information of an application program client, in response to the embedded point reporting information including pit bit information, the pit bit information is matched with pit bits in a target pit bit library; according to the matching result, the buried point reported information can be verified based on a target verification rule base; and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified. On one hand, the embedded point information is verified based on the pit positions, so that the multi-point and the multi-point leakage of the embedded points can be verified, and the accuracy of embedded point verification is improved; on the other hand, the target verification rule base is determined based on the buried point task to be verified, and then the buried point tasks corresponding to all stages after development, integration, gray scale and online release of the buried points can be automatically verified, so that the buried point verification efficiency is improved, and when the buried point task to be verified is the buried point task in the development stage, the buried points can be verified in the development stage, so that the buried point problem can be found as early as possible before the buried points are online.

Drawings

The above and other objects, features and advantages of exemplary embodiments of the present disclosure will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the present disclosure are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:

FIG. 1 shows a schematic diagram of a buried point verification method according to an embodiment of the present disclosure;

fig. 2 is a schematic flow chart illustrating a method for verifying information reported by a buried point according to a pit matching result according to an embodiment of the present disclosure;

FIG. 3 shows a schematic diagram of a buried point parameter configuration page according to an embodiment of the present disclosure;

FIG. 4 shows a schematic flow chart of another method for verifying a buried point according to an embodiment of the present disclosure;

FIG. 5 illustrates a flow diagram of a method of determining whether a buried site test task is test complete in accordance with an embodiment of the present disclosure;

FIG. 6 is a schematic diagram illustrating a multi-terminal interaction flow in performing a buried point verification according to an embodiment of the present disclosure;

FIG. 7 is a schematic flow chart diagram illustrating another method for real-time verification of an online buried point task according to an embodiment of the present disclosure;

FIG. 8 illustrates a flow diagram of a method for manual bill of lading verification with a buried site in accordance with an embodiment of the present disclosure;

FIG. 9 illustrates a schematic diagram of a buried point verification device in accordance with the disclosed embodiments;

FIG. 10 shows a block diagram of an electronic device according to an embodiment of the disclosure.

In the drawings, like or corresponding reference characters designate like or corresponding parts.

Detailed Description

The principles and spirit of the present disclosure will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are presented merely to enable those skilled in the art to better understand and to practice the disclosure, and are not intended to limit the scope of the disclosure in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

As will be appreciated by one of skill in the art, embodiments of the present disclosure may be embodied as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.

According to an embodiment of the disclosure, a buried point checking method, a buried point checking device, a computer readable storage medium and an electronic device are provided.

In this document, any number of elements in the drawings is intended to be illustrative and not restrictive, and any nomenclature is used for distinction only and not for any restrictive meaning.

The principles and spirit of the present disclosure are explained in detail below with reference to several representative embodiments thereof.

Summary of The Invention

The inventor of the present disclosure finds that, in some existing embedded point verification schemes, only whether the embedded point is correct or not is concerned, and multi-report or missing report of the embedded point cannot be verified, so that the verification accuracy is insufficient. In other existing embedded point verification schemes, problems can be found according to fluctuation of new and old embedded point data after the embedded point verification scheme is on line, the problem finding period is long, the problems can be found accurately according to the fluctuation of the new and old data only when the user coverage of a new version reaches a certain ratio, the embedded point verification efficiency is low, in addition, the problems can be found after the embedded point verification scheme is on line, and the defect of problem finding delay exists.

In view of the above, the basic idea of the present disclosure is: under the condition of receiving buried point reporting information of an application program client, responding to the buried point reporting information including pit bit information, and matching the pit bit information with pit bits in a target pit bit library; and according to the matching result, based on a target verification rule base, verifying the buried point reported information, wherein the target pit bit base and the target verification rule base are determined according to the buried points in the buried point task to be verified. On one hand, the embedded point information is verified based on the pit positions, so that the multi-point and the multi-point leakage of the embedded points can be verified, and the accuracy of embedded point verification is improved; on the other hand, the target verification rule base is determined based on the buried point tasks to be verified, and then the buried point tasks corresponding to all stages after development, integration, gray scale and release online of the buried points can be automatically subjected to buried point verification, so that the buried point verification efficiency is improved, and when the buried point tasks to be verified are buried point tasks in the development stage, the buried points can be verified in the development stage, so that the buried point problem can be found as early as possible before the buried points are online.

Having described the general principles of the present disclosure, various non-limiting embodiments of the present disclosure are described in detail below.

Application scene overview

It should be noted that the following application scenarios are merely illustrated for the convenience of understanding the spirit and principles of the present disclosure, and the embodiments of the present disclosure are not limited in any way in this respect. Rather, embodiments of the present disclosure may be applied to any scenario where applicable.

The present disclosure may be applied to scenarios where data is collected, for example: the embedded point verification method provided by the disclosure can be used for verifying the embedded point in the development stage, and then the embedded point is online after the verification is passed so as to collect the use data (such as access number, visitor number, dwell time, page browsing number and the like) of the application, so that the use condition of the application is tracked, and data support is provided for further optimization of the application; in an information recommendation scene, collected historical data related to the behaviors of the user can be verified by using the embedded point verification method provided by the disclosure, so that whether the collected historical data related to the behaviors of the user is accurate or not is determined, and a user portrait is accurately depicted so as to recommend information to the user.

The present disclosure may also be applied to scenarios where an application client is optimized, such as: after the buried point is on line, the buried point information reported by the application program client side can be checked according to the buried point checking method, the checking result is counted, and then the checking result is analyzed to determine which pages or controls in the application program client side need to be optimized, so that the interaction experience of a user is improved.

Exemplary method

According to a buried point verification scheme in the related art, only whether a buried point is correct or not is concerned, and multi-report or missing report of the buried point cannot be verified, so that accuracy of buried point verification is insufficient. In other embedded point verification schemes, problems can be found according to fluctuation of new and old embedded point data after the embedded point verification scheme is on-line, the problem finding period is long, the problems can be found accurately according to the fluctuation of the new and old embedded point data only when the coverage of a new version of a user reaches a certain ratio, the embedded point verification efficiency is low, in addition, the problems can be found only after the embedded point verification scheme is on-line, and the defect that the embedded point problem finding is delayed exists.

Exemplary embodiments of the present disclosure first provide a buried point verification method to overcome at least all or some of the above-mentioned disadvantages of the related art.

Fig. 1 illustrates a buried point verification method in an exemplary embodiment of the present disclosure, which may include:

step S110, receiving buried point reporting information of an application program client, responding to the buried point reporting information including pit bit information, and matching the pit bit information with pit bits in a target pit bit library;

step S120, according to the matching result, based on a target checking rule base, checking the reporting information of the buried point;

and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

Each step in fig. 1 will be described in detail below.

Step S110, receiving buried point reporting information of an application program client, responding to the buried point reporting information including pit bit information, and matching the pit bit information with pit bits in a target pit bit library.

In an exemplary embodiment, the application client in step S110 may include a buried point test task application client. The embedded point testing task application program client can be understood as an application program client used by a developer when testing a developed embedded point task.

When a buried point developer tests a buried point task, the used application program client is the client corresponding to the application program to be tested. For example, a site-embedded developer modifies the site-embedded application program of version 1.0 to complete the development of a new site-embedded task, and after the new site-embedded task is completed, the new site-embedded task and the site-embedded task of the version 1.0 application program can be combined to generate an application program to be tested, and then the generated application program to be tested is installed in any terminal device, so that an application program client to be tested is obtained.

In the case that the application client in step S110 includes an application client used by a developer when testing a developed embedded task, the embedded point reporting information in step S110 may include embedded point reporting information corresponding to the embedded point testing task.

The embedded points are tested and verified in the embedded point testing stage, so that the accuracy and the integrity of newly added embedded points in the embedded point task development process can be ensured to a great extent. However, it is considered that the testing of the embedded point is usually performed on a required development code branch, that is, each developer is responsible for testing the embedded point task branch developed by itself, and it may still be modified after the testing is completed, and in the process of arbitrarily combining with the newly added embedded points of other branches to the trunk release branch, there may also be other conflicts, which may result in modifying the embedded point after the testing is completed. In other words, codes of the distance synthesis, the gray scale and the full on-line of the buried task branch after the test is finished have certain difference and variation possibility. Therefore, after the buried point test is completed, the buried point verification method in the present disclosure can be used to verify the buried point task integration, the gray scale and the state after the on-line.

The gray scale distribution refers to a distribution mode capable of smoothly transitioning between black and white. On which an a/B test may be performed, i.e. a part of the users continue to use product property a and a part of the users start to use product property B, if the users have no objection to B, the scope is gradually enlarged and all users are migrated to B. The gray release can ensure the stability of the whole system, and the problems can be found and adjusted in the initial gray so as to ensure the influence degree, namely, part of users are controlled to use the latest release version. Full publishing refers to when all users access a program after clicking on publishing using the current and up-to-date version of the publication.

Based on this, in another exemplary embodiment, the application client of step S110 may include any application client corresponding to the site-embedded task synthesis, gray scale, or full-scale distribution online. For an application, with continuous optimization upgrade, different versions are generated. Therefore, the versions of the application used by different users may be different, and the application client in step S110 may include any version of the application client.

In other words, the buried point verification method provided by the exemplary embodiment of the present disclosure may verify the buried point in the buried point testing stage, and may also continue to verify the buried point information reported by the application client after the buried point task is synthesized or online, so as to timely detect and make up for the missing of the problem that is not found in the buried point task testing, thereby comprehensively verifying the buried point and improving the accuracy of the information reported by the buried point.

In an exemplary application scenario, when a trigger operation occurs in an application client, the application client may report the buried point information corresponding to the trigger operation. And then, checking the embedded point information reported by the application program client.

For example, it may be determined whether the pit bit information is included in the buried point report information, and the buried point report information is checked according to a determination result.

For example, if the reporting information of the buried point includes the field identifier corresponding to the pit bit information, it may be determined that the reporting information of the buried point includes the pit bit information, or it may be determined that the reporting information of the buried point does not include the pit bit information, that is, the currently reported information of the buried point may be an event buried point. Taking as an example that the embedded point pit information is identified by a field identifier spm (Super Content Model, which refers to a parameter field for expressing a pit in the embedded point report information), when the embedded point report information includes the spm field, it can be determined that the embedded point report information includes the pit information.

Under the condition that the pit bit information is contained in the buried point reporting information, the pit bit information in the buried point reporting information can be matched with the pit bit in the target pit bit library so as to verify the buried point reporting information.

And the target pit bit library is determined according to the buried points in the buried point task to be verified. Namely, the target pit position library is determined according to the pit position corresponding to the buried point in the buried point task to be verified.

In an exemplary embodiment, in the case that the buried point report information in step S110 includes buried point report information corresponding to the buried point test task, the buried point task to be verified includes a first buried point task in the buried point test task and a second buried point task for which an application program targeted by the buried point test task is online.

For example, the embedded point checking method in the disclosure can perform real-time testing and checking of embedded points for embedded point task requirements. The development personnel can carry out real-time test and verification on the embedded point tasks which are in charge of development, namely, the specific embedded point tasks can be selected when the embedded point tests are carried out. For the buried point testing task, when the buried point testing task is verified, a target pit position library can be determined according to all buried points which are already published on line by the application program and the pit positions of the buried points in the buried point task to be tested (not published on line).

For developers, each time a new embedded point task is developed, one or more of operations such as adding, modifying, deleting and the like can be performed on the basis of the embedded point task corresponding to an application program (which is already online) of a certain version. In general, one or more of operations such as adding, modifying, deleting and the like are performed on the basis of the embedded point task corresponding to the application program with the latest version so as to complete the development of the new embedded point task. The embedded point tasks in the application program of the latest version are all released and online, so that the to-be-verified embedded point task comprises a first embedded point task in the embedded point test task and a second embedded point task on which the application program corresponding to the embedded point test task is online under the condition that the embedded point report information comprises the embedded point report information corresponding to the embedded point test task.

Of course, a developer may also develop a new site task based on any historical version of an application program as needed, and this exemplary embodiment is not particularly limited in this respect. When a developer develops a new embedded point task on the basis of any application program of a historical version, the embedded point tasks to be verified can comprise the current embedded point task to be tested and the embedded point task corresponding to the application program of the historical version.

In an exemplary application scenario, after a developer completes development of a new site burying task on a site burying management platform, the developer may select the new site burying task on the site burying management platform, and then use a client code scanning corresponding to an online historical version (e.g., the current latest version) of an application corresponding to the new site burying task to log in the site burying management platform. The method comprises the steps that a developer performs code scanning login, the version of an application program client used by the developer can be obtained when the code scanning login is performed, the buried point task to be verified can be determined according to all on-line buried point tasks corresponding to the version of the application program client used by the developer and the buried point task to be tested (namely the new buried point task completed by the developer) selected manually by the developer, and therefore a target pit position library and a target verification rule library are determined according to the buried point task to be verified so as to perform verification testing on the buried point task to be tested.

In the disclosure, when the embedded point task test is performed, the embedded point tasks to be verified include both the currently newly developed embedded point task and the online historical embedded point task, so that new and old embedded points can be simultaneously verified to test whether the new embedded point task affects the correctness of the old embedded point task, the correct old embedded point is prevented from being changed into the wrong embedded point in the new embedded point task development process, and the accuracy of embedded point verification is further improved.

In another exemplary embodiment, the determining manner of the buried point task to be verified in step S110 may include: and obtaining the value of a preset field in the buried point reporting information, and determining the buried point task to be checked according to the value of the preset field. The preset field is used for indicating the version of the application program client, and the buried point tasks to be checked comprise online buried point tasks corresponding to the version of the application program client.

As described above, in order to ensure the comprehensiveness of the buried point verification, the buried point may be verified at each stage after the code integration, the gray scale issue, and the full scale issue are brought online, so as to find the buried point problem as early as possible, and thus correct the buried point in time. However, for code integration, gray scale release and full scale release, the buried point task to be verified cannot be determined by the method of selecting the buried point task to be tested and actively scanning the code for logging in by a developer in the test stage.

Based on this, in order to ensure that the embedded point can be automatically checked in each stage after the embedded point task is tested, integrated, gray-scale released and fully released, the version of the application program client corresponding to the currently reported embedded point information can be determined by carrying the preset field in the embedded point reporting information and by the value of the preset field.

For example, when the buried point report information is packaged, a Unique UUID (universal Unique Identifier) corresponding to the version of the application client may be embedded in the buried point report information according to the version of the application client. Meanwhile, the mapping relation between each UUID and the corresponding application program client version is stored in the buried point management platform. Therefore, when the buried point management platform (namely the server) receives the buried point report information, the application program client version corresponding to the UUID can be searched according to the UUID in the buried point report information, and the buried point task to be verified is determined according to the buried point task with the application program client version on line.

For the embedded point testing stage, the embedded point tasks to be verified are the determined on-line embedded point tasks corresponding to the application program end version and the embedded point tasks to be tested selected by the developer, and for the stages after the embedded point tasks are integrated, released in gray scale and released in full, the embedded point tasks to be verified are all on-line embedded point tasks corresponding to the determined application program amount client version.

By the method, the buried point tasks to be verified in all stages of testing, integration, gray scale and release of the buried points can be accurately determined, so that the reference of the buried point verification (namely the target pit position library and the target verification rule library) can be accurately determined based on the buried point tasks to be verified, the buried points can be automatically verified in all stages, and the efficiency of the buried point verification is improved.

Illustratively, after the buried point task to be checked is determined, the target pit bit library may be determined according to the pit bits in the buried point task to be checked, and when the buried point information to be reported includes the pit bit information, the pit bit information in the buried point information to be reported and the pit bits in the target pit bit library may be matched, so as to determine the check result of the buried point reporting information according to the matching result.

Referring to fig. 1, in step S120, the information reported by the buried point is verified based on the target verification rule base according to the matching result.

And the target verification rule base is determined according to the buried points in the buried point task to be verified. In other words, the target verification rule base includes a parameter configuration rule corresponding to the buried point in the buried point task to be verified. The determination method of the buried point task to be checked has already been described in detail in step S110, and reference may be made to this method, which is not described herein again.

Fig. 2 is a schematic flow chart illustrating a method for verifying information reported by a buried point according to a pit bit matching result according to an embodiment of the present disclosure. Referring to fig. 2, the method may include steps S210 to S240.

In step S210, the pit bit information in the pit reporting information is matched with the pit bit in the target pit bit library, and in response to a successful matching, the process goes to step S220, and in response to a failed matching, the process goes to step S240.

In step S220, the buried object identifier included in the pit bit information is obtained.

In an exemplary embodiment, a pit bit may be understood as the only one location that can be described in the client application, and the pit bit may be a page or an element, and the complete information of the pit bit may include object information corresponding to multiple levels.

A page may be understood as a whole area displayed exclusively at a certain user interface level, such as a newly opened underlying page, a TAB (TAB/TAB), a channel, etc.; the page is generally used for organizing a plurality of contents to distribute or used as an actual function bearing of a single content, and information such as circulation exposure and dwell time of the page has great significance for application analysis. An element may be understood as a UI component and/or element in a page that may be interacted with by a User, such as a list element, a button, a slideable content module, etc. The lists and modules are generally used for carrying content distribution, the click rate of the lists and modules has analytical significance on content distribution effects, the buttons are generally used for carrying user interaction, and the buttons are generally mounted on a certain content unit or a bottom page of a content function.

Both pages and elements can be buried point objects. One page can comprise sub-pages and elements, for one page, the page itself, the sub-pages and the elements in the page can be used as buried point objects in the page, and a user can perform self-defined setting according to the needs of the user.

For example, in response to a trigger operation for an application client, a page node tree of a target display page exposed by the trigger operation may be determined, and then a buried object tree may be generated according to attribute information of nodes in the page node tree. For example, the buried object tree may be generated from nodes in the page node tree that are configured with buried object identifiers.

After the buried object tree is generated, a buried object identifier chain of the buried object to the root object in the buried object tree may be determined based on the parent-child relationship in the buried object tree and the buried object identifier configured for the buried object in the buried object tree in advance, and the position attribute information of the buried object may be added to the buried object identifier chain to obtain the pit bit information of the buried object.

The buried Object identifier (Object Id, abbreviated as oid) is an identifier of a page or element of a buried point on a client, and the same oid can be used to represent the same UI style, the same content unit, the same interactive form, or a specific location UI on the client. When a developer performs the buried point development, a buried point object identifier can be configured for each buried point object.

Considering the case that some repeated type elements have the same hierarchy within the page, for example, the object id of each list element in the list multiplexing unit is the same and all belong to the same hierarchy, that is, the object id of each list element in the list multiplexing unit is the object id of the list unit, and the hierarchy of each list element is the hierarchy of the list unit, in this case, if the pit bit information of the buried point object is represented by the buried point object id chain only, it is impossible to distinguish the current exposure from the bottom element in the list unit, and the accuracy of reporting the buried point information is affected.

In order to solve this problem, in an optional implementation manner, the location attribute information of the buried point object may be added to the buried point object identification chain to obtain the pit bit information in the buried point reporting information.

For example, the currently exposed buried point object is _ oid1, the buried point object identifier of its parent node in the buried point object tree is oid2, the parent node of its parent node is a root node, and the buried point object identifier of the root node is oid3, where the position attribute information of oid2 is pos2, and the pit bit information in the buried point report information corresponding to the buried point object can be represented as oid1| oid2: pos2| oid3. Then, the current value of the embedded point parameter associated with each embedded point object identifier in the pit bit information can be reported.

When the buried point reporting information is verified, the buried point parameters associated with the buried point object indicated by the buried point object identifier in the pit bit information can be verified. Therefore, the buried object identification included in the pit bit information can be acquired.

In step S230, for each buried point object identifier, the first buried point parameter in the buried point report information is verified based on the verification rule of the first buried point parameter associated with the buried point object identifier in the target verification rule base.

Wherein, the first buried point parameter associated with the buried point object identifier can be understood as a private parameter of the buried point object indicated by the buried point object identifier.

Illustratively, fig. 3 shows a schematic diagram of a buried point parameter configuration page according to an embodiment of the disclosure. As can be seen from fig. 3, for a buried point object, it may be configured with a private parameter (i.e., the first buried point parameter described above), and may also be configured with an event parameter and a global public parameter.

Here, the private parameter may be understood as a parameter belonging to only a buried point object indicated by a certain buried point object identification. The event parameter may be understood as a parameter that needs to be reported when a corresponding event occurs at the client. If the page exposure event is configured as a buried point reporting event in the buried point management platform, the page exposure event is associated with an event parameter 1, and the buried point object 1 is configured with the page exposure event, then, when the buried point object 1 is exposed, the event parameter 1 corresponding to the page exposure event needs to be reported. As shown in fig. 3, a page exposure start event and a page exposure end event are configured for page1, that is, when page1 starts exposure or ends exposure, event parameter 1 associated with the corresponding page exposure start event or page exposure end event needs to be reported. The global common parameter can be understood as a parameter that any buried object in the whole application client can be configured, namely, the parameter is not only a parameter that can belong to a buried object indicated by a specific buried object identification. Such as global public reference V1 in fig. 3.

For example, a buried point developer may configure a corresponding buried point parameter for each buried point object in advance in the buried point management platform, for example, may configure a corresponding buried point parameter for each buried point object in a page shown in fig. 3, and configure a corresponding value rule for each buried point parameter at the same time. The value-taking rule can be used as a check rule of the buried point parameter.

For example, for each buried point object identifier included in the pit bit information, the current value of the first buried point parameter associated with the buried point object identifier may be matched with the value rule of the first buried point parameter in the target verification rule base, and if the matching fails, the verification of the first buried point parameter fails. If the value rule of a certain first buried point parameter is 0 or 1, in the current buried point report information, when the value of the first buried point parameter is any one of 0 and 1, the current verification of the first buried point verification parameter is successful, but if the value of the first buried point parameter is other than 0 or 1, such as 5, the current verification of the first buried point verification parameter fails.

In other words, it may be determined whether a value of each first buried point parameter having a value rule in the current buried point report information is within a range constrained by the corresponding value rule, if yes, the current verification of the first buried point parameter is successful, and if not, the current verification of the first buried point parameter is failed.

In step S240, a tag indicating that the pit matching fails is added to the pit reporting information.

For example, in response to receiving the pit reporting information, it may be determined whether the pit bit information is included in the pit reporting information, and in a case that the pit bit information is included in the pit reporting information, the pit bit included in the pit reporting information may be matched with the pit bit in the target pit bit library. If the matching is successful, the buried point information to be reported is the reported information generated by the pit position in the buried point task, if the matching is failed, the buried point information to be reported is not the reported information generated by the pit position in the buried point task, and a tag of the pit position matching failure can be added to the buried point reported information.

For example, in the case that the pit bit information is successfully matched, a tag indicating that the pit bit matching is successful may also be added to the buried point report information that is successfully matched. Therefore, the number of buried points and the number of missing points can be checked through the pit bit matching and the added tags of which the pit bit matching is successful or the pit bit matching is failed. For example, a pit position which is not successfully matched is an unnecessary buried-point pit position in the buried-point task, that is, a pit position which is buried more, and if a certain pit position in the buried-point task to be tested is not in the successfully matched pit positions after the testing operation of the buried-point task to be tested is completely completed, the pit position is a pit position which is buried less.

As previously mentioned, the parameters of the buried point object may also have one or more of event parameters or common parameters. Based on the above, after the buried point reporting information of the application program client is received, a second buried point parameter associated with a buried point reporting event triggering the buried point reporting information can be determined, and the second buried point parameter in the buried point reporting information is verified according to a verification rule of the second buried point parameter in the target verification rule base; and/or verifying the public parameters in the information reported by the buried point according to the verification rules corresponding to the public parameters in the target verification rule base. The second buried point parameter can be understood as the event parameter.

For example, after the buried point report information of the application client is received, the parameter identification field in the buried point report information may be matched with the event parameter identification field and the global parameter identification field in the target verification rule base to determine the event parameter and the global parameter in the buried point report information. Then, matching the current value of the event parameter or the global parameter determined in the buried point report information with the value rule of the event parameter or the global parameter in the target verification rule base, and determining whether the current value is in the value range constrained by the corresponding value rule, so as to verify the event parameter and the global parameter in the buried point report information. Meanwhile, when the buried point reporting information includes the pit bit information, the private parameter associated with each buried point object in the pit bit information may be further checked according to the foregoing steps S210 to S240.

For example, fig. 4 shows a schematic flow chart of another buried point verification method according to an embodiment of the present disclosure. Referring to fig. 4, the method may include steps S401 to S412. Wherein:

in step S401, receiving buried point reporting information; in step S402, it is determined whether pit bit information exists in the pit reporting information, if so, go to step S403, otherwise go to step S411; in step S403, the pit bit information in the buried point reporting information is matched with the pit bit in the target pit bit library; in step S404, it is determined whether the pit bit information is successfully matched, and if the pit bit information is successfully matched, the process goes to step S405, otherwise, the process goes to step S412; in step S405, a buried point object list corresponding to a buried point object included in pit bit information of the buried point report information is determined; in step S406, it is determined whether the buried object list is empty, if yes, go to step S411, otherwise, go to step S407 to step S410; in step S407, a first buried point object in the buried point object list is acquired; in step S408, it is determined whether the first embedded object is configured with a private parameter rule, if yes, go to step S409, otherwise, go to step S411; in step S409, traversing the private parameter rule of the first buried object to check the private parameter of the first buried object in the buried reporting information; in step S410, after the private parameter of the first buried point object is checked, deleting the first buried point object from the buried point object list, and proceeding to step S406; in step S411, traversing the event parameter and the common parameter, and verifying values of the traversed event parameter and the traversed common parameter according to the target verification rule base; in step S412, a tag indicating that the pit matching fails is added to the reported information of the current buried point.

For example, after receiving the buried point reporting information, it may be determined whether there is pit bit information in the buried point reporting information, and if there is no pit bit information, the event parameter and/or the common parameter in the buried point reporting information are/is directly checked. If the pit bit information exists, matching the pit bit information in the buried point reporting information with the pit bit in a target pit bit library (the target pit bit library is determined based on the buried point pit bit in the buried point task to be checked), and if the matching fails, adding a mark of pit bit matching failure for the buried point reporting information; and if the matching is successful, determining a buried point object list corresponding to the buried point object contained in the pit bit information, traversing each buried point object in the buried point object list, determining whether the buried point object is configured with private parameters or not aiming at the traversed buried point object, if so, checking the private parameters, and if not, checking the public parameters or event parameters configured by the buried point object. After traversing the buried point object list, other event parameters or common parameters in the buried point report information can be continuously checked.

Of course, after the reporting information of the buried point is received, it may also be determined whether the pit bit information exists in the reporting information of the buried point, and the common parameter and/or the event parameter in the reporting information of the buried point is directly checked according to the common parameter and/or the event parameter in the target checking rule base. After the verification of the public parameter and/or the event parameter is completed, whether pit bit information exists in the buried point reporting information is judged, if no pit bit information exists, the verification of the buried point reporting information is finished, if the pit bit information exists, the pit bit information is matched with the pit bit in the target pit bit library, the pit bit information which is successfully matched is obtained, the buried point object in the pit bit information is obtained, the value of each private parameter of each buried point object in the pit bit information in the current buried point reporting information is verified according to the verification rule of the private parameter of the buried point object in the target verification rule library, and the pit bit information which is failed to be matched is directly added with a tag which is failed to be matched with the pit bit information.

In an exemplary embodiment, when the embedded point test is performed, a tester may manually perform an operation to trigger the embedded point report, so as to obtain the embedded point report information. In order to further improve the accuracy of the buried point test, in the buried point test stage, the number of each type of buried point reporting events occurring at the client and the number of the pit positions corresponding to the buried point reporting events can be counted, so that a tester can find the situations of excessive and leaked buried point reporting information.

Based on this, the buried point verification method in the present disclosure may further include: updating the first quantity and the second quantity according to the received buried point reporting information; responding to the operation of requesting to display the verification result of the first verification mode, and displaying a first quantity and a second quantity corresponding to the buried point reporting event; the first quantity comprises the quantity of the buried point reporting events indicated by the buried point reporting information, and the second quantity comprises the quantity of the buried point pit positions corresponding to the buried point reporting events indicated by the buried point reporting information.

For example, when the buried point reporting information is received, the buried point reporting event indicated by the buried point reporting information may be determined, and then the number of the buried point reporting events is updated, that is, 1 is added to the number counted before. The buried point reporting event indicated by the buried point reporting information can be understood as an event causing reporting of current buried point information, and if a page exposure event occurs currently and causes reporting of the current buried point information, the number of the page exposure events is increased by 1. And determining whether the pit positions are contained in the pit reporting information, if so, judging whether the pit positions generate the pit reporting information currently in the test process, if so, not performing any treatment, and if not, updating the number of the pit positions corresponding to the pit reporting event indicated by the pit reporting information, namely adding 1 to the number of the pit positions corresponding to the pit reporting event counted before.

By updating the first quantity and the second quantity of statistics, the accuracy of the time for analyzing the buried points and the accuracy of the number of the buried points can be ensured for a tester. If the point burying is carried out in 7 pit positions for the page exposure event in a certain point burying task, a tester carries out 16 times of operation in the testing process, after the tester finishes the testing operation, the tester can trigger a first verification mode verification result display control, and then a first quantity and a second quantity corresponding to the point burying reporting events in the testing process can be displayed. If the first number is 16 and the second number is 7, the tester can determine that the buried-point timing and the buried-point pit number for the buried-point task are correctly developed.

In an exemplary embodiment, in response to the operation of requesting to display the verification result of the first verification mode, the verification results of the information reported by the embedded point are sequentially displayed according to the reporting time of the information reported by the embedded point.

For example, after the testing operation is completed, the tester may trigger the first verification mode verification result display control, and then display the verification result of the information reported by the embedded point according to the sequence of the reporting time of the information reported by the embedded point. The latest reporting information of the buried point may be displayed at the forefront, and the latest reporting information of the buried point may also be displayed at the rearmost, which is not particularly limited in this exemplary embodiment. The verification result may include results of verification passing, verification failing due to being matched to the pit bit information, and the like. The information that the pit bit is not matched can be understood as that the pit bit information is included in the buried point report information, but the pit bit information is not successfully matched with the pit bit in the target pit bit library.

In other words, in the verification result display page in the first verification mode, one or more of the display lists of the verification results of the first number, the second number, and the sequentially displayed buried point reporting information may be displayed. And under the condition that the display page of the verification result of the first verification mode comprises a display list of the verification results of the sequentially displayed buried point reported information, responding to the triggering operation of a user on the verification result record of any buried point reported information, and displaying the verification details of the buried point reported information. For the information reported by the buried points which fail to pass the verification, error information prompt can be carried out near the parameters which fail to pass the verification in the verification details of the information reported by the buried points, so that the error prompt can be carried out on testers, the testers can find problems as soon as possible and correct the problems, and the testing efficiency is improved.

For example, in a case that the buried point reporting information includes buried point reporting information corresponding to a buried point test task, fig. 5 shows a flowchart of a method for determining whether the test of the buried point test task is completed according to an embodiment of the present disclosure. Referring to fig. 5, the method may include steps S510 to S520. Wherein: in step S510, determining a target buried-point pit bit including a buried-point parameter of an enumeration type; in step S520, it is determined that the testing of the buried-point testing task is completed under the condition that each enumerated value of each target buried-point pit bit is successfully matched.

For example, when checking the reported buried-point information in the buried-point testing stage, it is determined that the testing of the buried-point testing task is completed only when each enumerated value of each enumerated type of buried-point parameter in each buried-point pit bit is successfully matched, except for the accuracy of counting the number of buried-point pit bits and avoiding the increase and decrease of the number of buried-point pit bits, and the buried-point task is allowed to be on line. Therefore, the accuracy of the buried point of each buried point task branch can be ensured more completely.

In an exemplary scenario, when performing the buried point verification, not all the buried point parameters may be accurately constrained in value range by the description rule. For example, the value of a certain parameter cannot be null only by rule constraint, but cannot be limited by the range of the value by rule constraint.

Based on this, in an exemplary embodiment, the buried point verification method in the present disclosure may further include: and aiming at the target buried point parameters which do not pass the check rule description constraint value range in the buried point reported information, checking the target buried point parameters according to a candidate value library which is associated with the target buried point parameters in advance.

For example, for a parameter whose value range cannot be described by a simple rule, the parameter can be associated with a relevant correct value pseudo table (i.e., the candidate value library) of the buried point parameter stored by the server, and the correctness of the value of the buried point parameter is verified by including judgment. That is, the parameter is verified by judging whether the value of the parameter is successfully matched with a certain value in the correct value pseudo table.

Taking the internet cloud music client as an example, for a song name parameter, the value of the song name parameter cannot be constrained by a simple rule, but which songs in the internet cloud music song list library can be known, then, for the reported song name parameter, whether the corresponding song name is in the song list library can be judged, if so, the verification is passed, otherwise, the verification of the parameter fails.

Further, in the present disclosure, in each stage of the buried point development test, the buried point integration, the gray scale release, and the full-scale release, besides performing the verification of the value rule of the buried point parameter and performing the statistical verification (such as the verification of the first number, the second number, and the enumerated parameter), the buried point attribution verification may also be performed, that is, whether the value of the attribution parameter in the information reported by the buried point is correct or not may be verified.

Based on this, the buried point verification method in the present disclosure may further include: and updating one or more of a third quantity, a fourth quantity, a fifth quantity, a sixth quantity and a seventh quantity according to the buried point attribution parameter values in the buried point reporting information, wherein the third quantity is used for representing the quantity of the buried point reporting information with empty buried point attribution parameter values, the fourth quantity is used for representing the quantity of the buried point reporting information with illegal buried point attribution parameter values, the fifth quantity is used for representing the quantity of the buried point reporting information with unreasonable buried point attribution parameter values, the sixth quantity is used for representing the quantity of the buried point reporting information with degraded buried point attribution parameter values, and the seventh quantity is used for representing the quantity of each type of buried point attribution parameter values of the buried point reporting events corresponding to the buried point reporting information.

In an exemplary embodiment, in the case where the pit bit indicated by the pit bit information in the buried-point attribution parameter value does not belong to a buried-point pit bit, determining that the buried-point attribution parameter value is illegal; determining that the attribution parameter values of the buried points are unreasonable under the condition that the pit bit to be confirmed indicated by the pit bit information in the attribution parameter values of the buried points belongs to the pit bit of the buried points, but the pit bit to be confirmed and the pit bit information in the attribution parameter values of the candidate buried points of the buried point reporting event corresponding to the reporting information of the buried points fail to be matched; and under the condition that the buried point attribution parameter values comprise preset identification fields, determining that the buried point attribution parameter values are degraded, wherein the preset field identifications are used for identifying the buried point attribution parameter values generated after pit bits without buried point objects in the application program client are triggered.

For example, the situations of attribution being empty, attribution pit bit being illegal, attribution pit bit being unreasonable, attribution degradation, attribution type distribution and the like can be counted and summarized to check the buried point, so that the problems existing in the current buried point are analyzed according to the summarizing result, and the buried point is optimized.

For example, based on the seventh quantity, the distribution of the attribution parameter values of each type of the event reported by the buried point may be determined. Taking a song playing event in the internet cloud music client as an example, after the whole quantity of new buried point tasks is on line, counting the quantity of different types of buried point attribution parameter values corresponding to the song playing event for each version of buried point tasks, for example, the quantity of the buried point attribution parameter values as search types, the quantity of the buried point attribution parameter values as automatic playing types, and the like, and then analyzing the occupation ratio of each type of the buried point attribution parameter values. Comparing the current ratio with the ratio of the previous version to analyze the fluctuation condition of the buried point of the song playing event, determining whether the buried point needs to be optimized or judging whether the buried point has problems according to the fluctuation condition, if the fluctuation exceeds a certain range, determining that the buried point of the song playing event has problems, further analyzing the reasons of the problems, and optimizing and correcting the problems.

By checking the attribute parameters of the buried points, the attribute errors caused by unreasonable business interaction and processing logic and missing of the buried points can be checked, so that the comprehensiveness of the buried point checking is further improved, and the accuracy of subsequent buried point checking is assisted to be improved.

In an exemplary scenario, in any process of an integration stage, gray scale release and full-scale release, a relevant field does not exist when a problem occurs, and the problem is difficult to directly reproduce (when the problem is not in a test stage, a developer locally uses a test packet to test and can reproduce), so that the troubleshooting and confirmation of the buried point problem are usually a pain point and require great workload. Based on this, in the method and the system, before and after the buried point with the problem is taken as the anchor point in the buried point checking process, the query capability of the detailed buried point log detail of the user is provided, so that the problem can be quickly located.

In an exemplary embodiment, the method for checking a buried point in the present disclosure may further include: for any application program client, recording the buried point reporting information of the application program client according to the reporting time sequence of the buried point reporting information; and responding to the query request of the target buried point report information, and acquiring other buried point report information of which the report sequence of the target buried point report information is within a preset range so as to display the target buried point report information and other buried point report information. The preset range can be customized according to requirements, such as the information reported by the front and back 2 buried points.

For example, the target reporting information may include reporting information of the failed verification. If the verification result of the 120 th reported information in the reported information of the buried points is verification failure, when the user log detail control associated with the 120 th reported information of the buried points is clicked, the 118 th to 122 th reported information of the buried points can be displayed. Therefore, the current operation path of the user can be automatically restored, research and development personnel can be assisted in analyzing error reasons, and efficiency of troubleshooting of the buried point problem is improved.

In an exemplary application scenario, the buried point reporting information in the present disclosure may include buried point reporting information that is automatically generated based on a human-triggered operation of a user on an application client.

In another exemplary application scenario, the buried point reporting information in the present disclosure may further include buried point reporting information generated by triggering the application client according to a test case of the buried point test task, where the test case is generated based on a buried point pit bit to be tested of the buried point test task.

For example, in the present disclosure, pit locations for buried points are determined based on a buried point object tree, which can be accurately described to clarify each buried point location. Therefore, in the embedded point test task, a test case can be compiled according to the pit positions of all embedded point tasks to be verified so as to issue a covered user operation path to the application program test client, and the full coverage test before the embedded point task is online is realized through a full traversal mode, so that the problem of incomplete embedded point coverage possibly caused by manual operation is avoided, the accuracy of the embedded point test is improved, and the test efficiency before the embedded point task is online can be improved. In the traversing process, relevant buried points can be automatically distributed to a buried point management platform for verification, so that a verification result is output, and the full automation of buried point test verification is realized.

Meanwhile, in the process of testing based on manual operation, under the condition that the condition judgment such as the existence of parameter value, whether the parameter value accords with the value-taking rule, whether the parameter value is in a candidate value-taking library and the like is correct, the logic of 'whether the parameter value is correct or not or that the parameter value is correct' cannot be automatically and accurately verified. For example, for the related song list recommendation card in the song list detail page of the internet music, even if the content value of the related song list recommendation card can be judged and verified through a song list library (namely a candidate value library) in the internet music, under the condition that the song list 1 and the song list 2 are both in the song list library, whether the current song list is the true song list 1 or not can not be verified, but not the song list 2. And by compiling the test case, absolute correctness check can be carried out on the value of the buried point parameter based on the test case, if the song list 1 is triggered in the test case, the song list reported in the buried point reporting information can be compared with the song list in the test case, and therefore, the absolute correctness of the song list content can be automatically checked.

In an exemplary embodiment, in the case that the buried point reporting information includes buried point reporting information corresponding to a buried point test task, the buried point verification method in the present disclosure may further include: and simulating test data corresponding to a test link in the embedded point test task through the virtual object so as to carry out integrity verification on the embedded point test task based on the test link.

For example, although the usage data of the user is personalized and the result of the burying point may be non-fixed and endless, the pages, pit locations and logic corresponding to the generating of the burying point in the client are limited and can be maintained. Based on this, for some more important scenes, specific data can be issued through the MOCK (simulation, in the test process, for some objects which are not easy to construct or obtain, a test method of simulation test is bought in a mode of creating virtual objects), and then the buried point results of all pit positions in the scene can be obtained, so that a corresponding complete check link is constructed, and the absolute accuracy of the index caliber of the core scene is guaranteed. Of course, for any scenario, the integrity of its link may be checked based on the MOCK, and this exemplary embodiment is not particularly limited in this respect.

Next, fig. 6 shows a schematic diagram of a multi-terminal interaction flow when performing a buried point verification according to an embodiment of the present disclosure. Firstly, a client packing process is performed, as shown in fig. 6, in step S611, when the client packs the embedded point reporting information, a unique UUID is generated according to the version of the client; in step S612, the UUID is added to the package; in step S613, the package UUID, the package information, and the buried node task to be checked are uploaded to the package information database of the server.

Secondly, a log reporting process is performed by the client, for example, in step S621, the client acquires the UUID in the packet; in step S622, the buried point reporting information and the UUID are reported to the server.

After receiving the information reported by the embedded point, the server can start the embedded point checking process of the server. For the server-side buried point verification process, in step S631, the server may determine, according to the package UUID in the buried point report information, a buried point task to be verified corresponding to the buried point report information from the package information database, so as to determine a target verification rule base and a target pit bit base according to the buried point task to be verified; in step S632, the rule check is performed on the reporting information of the buried point according to the target check rule base and the target pit bit base, and meanwhile, a statistical check, an attribution check, and a parameter value coverage check may also be performed. After the verification is completed, the server side can store the UUID package, the buried point reporting information and the verification result into a log database.

The log database and the packet information database can assist the server side in inquiring logs and reports. For example, the complex conditions can be converted into a packet list according to the screening conditions of the packets, so that a large amount of complex packet information can be prevented from being input into the client packet. Based on the query statement including the packet UUID, filtering query can be performed in the log database, so that logs satisfying the auxiliary packet screening condition can be acquired.

Fig. 7 is a schematic flow chart illustrating another method for real-time verification of an online buried point task according to an embodiment of the present disclosure. Referring to fig. 7, in step S701, the received log format of the reporting information of the embedded point is analyzed; in step S702, a package UUID in the reporting information of the buried point is extracted; in step S703, a local cache of the verification rule is obtained according to the package UUID; in step S704, a verification result is calculated, which includes rule verification, cause verification, statistical verification (the first quantity, the second quantity, the third quantity, the fourth quantity, the fifth quantity, the sixth quantity, and the seventh quantity, as described above), and parameter value coverage verification (enumeration value coverage verification is performed on the enumeration type parameter, as described above); in step S705, submitting the verification result to the queue; in step S706, the single thread processing flow obtains the verification result and submits the verification result to the queue; in step S707, write the private to-be-submitted list in the thread; in step S708, it is determined whether the number in the list to be submitted is greater than a preset value or whether the last writing time occurs before a preset duration, if so, go to step S709, otherwise, go to step S710; in step S709, data in the to-be-submitted list is written into the database in batch, and the to-be-submitted list is cleared; in step S710, no processing is performed.

In the above steps S701 to S705, the processing may be performed by computing threads, and each computing thread corresponds to a partition (part) of a message queue, so that multiple message queues or multiple partitions of a single thread may be processed simultaneously in multiple threads. In step S703, the packet UUID may be used as a key, and the rule is used as a value corresponding to the key, so that the check rule is cached in the local public storage area. The check result in step S705 may be stored in the public memory area, and then, in step S706, the single thread acquires the check result from the queue in the public memory area.

By writing a plurality of verification results into the log database in batch after accumulation, the number of writing concurrence can be reduced, and the writing stability is improved.

As described above, the method and the device can realize the embedded point verification from different stages such as the embedded point task development stage, the embedded point task integration stage, the embedded point task gray stage and the embedded point task online stage, and ensure the comprehensiveness of the embedded point verification. In the requirement development stage, the real-time uploading and automatic checking capability of the log can be provided through a buried point management platform through a webscolet (Protocol for performing full-duplex communication on a single TCP (Transmission Control Protocol)) connection, and the timely checking test of the demand-oriented increment and the historical stock buried point is provided; in the demand integration stage, the task to be verified is determined by establishing the accurate incidence relation between the integrated product and the incorporated branches and tasks, and the automatic verification of the relevant buried points is realized by utilizing the internal manual use and the automatic traversal of a machine of the integrated product; in the gray level requirement and online stage, the embedded points are further verified by shunting the identifiers (namely UUIDs) of online logs, and meanwhile, the fluctuation condition of the embedded points is counted, so that the fluctuation condition is accurately verified. However, this may still not guarantee that 100% of all problems are found before going online.

Based on the method, a closed-loop manual bill raising and follow-up process can be established for the buried point problem which cannot be found through automatic verification. As shown in fig. 8, in step S801, the service party and the algorithm party may analyze whether there is a problem in the reported data table according to their own experience; in step S802, if it is clear that the data table has a problem, a data problem list may be listed; in step S803, the developer of the data warehouse may analyze the cause of the problem occurrence in the problem list, such as which one of a task exception, a buried point exception, a version problem, and the like. For the data problem determined to be abnormal, the data problem lists corresponding to the gray level version and the full online version can be sorted out. In step S804, the problem may be confirmed, developed and repaired, and the new and old burial points may be self-tested.

Through the process shown in fig. 8, the problem of the embedded point discovered after the online process can be confirmed and repaired in time, and the accuracy of the embedded point is further ensured.

The embedded point verification method can effectively realize forward movement guarantee of data embedded point quality, find the embedded point problem as early as possible, form effective problem finding and interception in various stages of demand development, integration regression, gray level online, full online and the like, and achieve the purposes of reducing the data embedded point problem, accelerating the problem finding speed, and improving the problem positioning and solving speed.

Furthermore, the embedded point checking method in the disclosure is to check the embedded point object, has good expansibility and universality, and is suitable for any service and large front-end platform framework.

Meanwhile, the buried point verification method can verify the buried points at each stage, and comprehensively guarantees the accuracy of the buried point data.

Exemplary devices

The exemplary embodiment of the present disclosure also provides a buried point verification device. Referring to fig. 9, the buried point verification apparatus 900 may include: a buried point information receiving module 910 and a checking module 920. Wherein:

a buried point information receiving module 910 configured to receive buried point report information of an application client, and in response to the buried point report information including pit bit information, match the pit bit information with a pit bit in a target pit bit library;

and the checking module 920 is configured to check the buried point reporting information based on a target checking rule base according to the matching result.

In an alternative implementation manner, based on the foregoing embodiment, the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

In an optional implementation manner, based on the foregoing embodiment, the verification module 920 may be specifically configured to: responding to the matching success, and acquiring a buried object identifier included in the pit bit information; and for each buried point object identifier, verifying the first buried point parameter in the buried point report information based on the verification rule of the first buried point parameter associated with the buried point object identifier in the target verification rule base.

In an optional implementation manner, based on the foregoing embodiment, the verification module 920 may be specifically configured to: and responding to the matching failure, and adding a label of the pit bit matching failure for the buried point reporting information.

In an optional implementation manner, the embedded point checking apparatus 900 may further include a second embedded point parameter checking module and/or a third embedded point parameter checking module, where the second embedded point parameter checking module is configured to determine a second embedded point parameter associated with an embedded point reporting event that triggers the embedded point reporting information after receiving the embedded point reporting information of the application client, and check the second embedded point parameter in the embedded point reporting information according to a checking rule of the second embedded point parameter in the target checking rule base; and the third embedded point parameter checking module is configured to check the public parameters in the embedded point reporting information according to the checking rules corresponding to the public parameters in the target checking rule base.

In an optional implementation manner, in a case that the buried point reporting information includes buried point reporting information corresponding to a buried point testing task, the buried point tasks to be verified include a first buried point task in the buried point testing task and a second buried point task on which an application program targeted by the buried point testing task is on line.

In an optional implementation manner, the determining manner of the to-be-verified buried point task includes: acquiring a value of a preset field in the buried point reporting information, and determining a buried point task to be checked according to the value of the preset field; the preset field is used for indicating the version of the application program client, and the buried point tasks to be checked comprise online buried point tasks corresponding to the version of the application program client.

In an alternative embodiment, the buried point checking apparatus 900 may further include: the quantity display module comprises an updating unit and a display unit, wherein the updating unit is configured to update the first quantity and the second quantity according to the received buried point reporting information; the display unit is configured to respond to an operation of requesting to display a first verification mode verification result and display a first quantity and a second quantity corresponding to a buried point reporting event; the first quantity comprises the quantity of the buried point reporting events indicated by the buried point reporting information, and the second quantity comprises the quantity of the buried point pit positions corresponding to the buried point reporting events indicated by the buried point reporting information.

In an optional implementation manner, the buried point verification apparatus 900 may further include a sequential display verification result module, where the sequential display verification result module is configured to respond to an operation of requesting to display a verification result of the first verification mode, and sequentially display the verification result of the buried point report information according to the report time of the buried point report information.

In an optional implementation manner, in a case that the buried point report information includes buried point report information corresponding to a buried point test task, the apparatus 900 may further include a task completion degree checking module, where the task completion degree checking module is configured to determine a target buried point pit position including an enumerated type of buried point parameter; and under the condition that each enumeration value of each target buried point pit bit is successfully matched, determining that the buried point test task test is completed.

In an optional implementation manner, the buried point verification apparatus may further include a candidate verification module, where the candidate verification module is configured to: and aiming at the target buried point parameters which are not in the buried point report information and have passed the check rule description constraint value range, checking the target buried point parameters according to a candidate value library which is associated with the target buried point parameters in advance.

In an optional embodiment, the buried point checking apparatus may further include a quantity updating module configured to: updating one or more of a third quantity, a fourth quantity, a fifth quantity, a sixth quantity and a seventh quantity according to the attribution parameter values of the embedded points in the information reported by the embedded points; the third quantity is used for representing the quantity of the buried point reporting information with the empty buried point attribution parameter value, the fourth quantity is used for representing the quantity of the buried point reporting information with the illegal buried point attribution parameter value, the fifth quantity is used for representing the quantity of the buried point reporting information with the unreasonable buried point attribution parameter value, the sixth quantity is used for representing the quantity of the buried point reporting information with the degraded buried point attribution parameter value, and the seventh quantity is used for representing the quantity of each type of buried point attribution parameter value of the buried point reporting event corresponding to the buried point reporting information; under the condition that the pit bit indicated by the pit bit information in the buried point attribution parameter value does not belong to the buried point pit bit, determining that the buried point attribution parameter value is illegal; determining that the buried point attribution parameter value is unreasonable under the condition that the pit bit to be confirmed indicated by the pit bit information in the buried point attribution parameter value belongs to the buried point pit bit, but the pit bit to be confirmed fails to be matched with the pit bit information in the candidate buried point attribution parameter value of the buried point reporting event corresponding to the buried point reporting information; and determining that the buried point attribution parameter values are degraded under the condition that the buried point attribution parameter values comprise preset identification fields, wherein the preset field identifications are used for identifying the buried point attribution parameter values generated after pit bits without buried point objects in the application program client are triggered.

In an optional embodiment, the buried point checking device may further include a detail display module configured to: the method comprises the steps of recording buried point reporting information of an application program client according to the reporting time sequence of the buried point reporting information aiming at any application program client, responding to a query request of target buried point reporting information, acquiring other buried point reporting information of which the reporting sequence is within a preset range with the target buried point reporting information, and displaying the target buried point reporting information and the other buried point reporting information.

In an optional implementation manner, the buried point reporting information includes buried point reporting information generated by triggering the application program client according to a test case of a buried point test task, where the test case is generated based on buried point pit bits to be tested of the buried point test task.

In an optional implementation manner, in a case that the buried point report information includes buried point report information corresponding to a buried point test task, the buried point checking apparatus may further include an integrity checking module, where the integrity checking module is configured to: and simulating the correspondence of a test link in a buried point test task through the virtual object.

In addition, other specific details of the embodiments of the present disclosure have been described in detail in the embodiments of the invention of the above method, and are not described herein again.

Exemplary storage Medium

Storage media of exemplary embodiments of the present disclosure are explained below.

In the present exemplary embodiment, the above-described method may be implemented by a program product, such as a portable compact disc read only memory (CD-ROM) and including program code, and may be executed on a device, such as a personal computer. However, the program product of the present disclosure is not so limited, and in this document, a 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.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a 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 readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RE, etc., or any suitable combination of the foregoing.

Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user computing device, partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).

Exemplary electronic device

An electronic device of an exemplary embodiment of the present disclosure is explained with reference to fig. 10. The electronic device may be a client or a server.

The electronic device 1000 shown in fig. 10 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 10, the electronic device 1000 is embodied in the form of a general purpose computing device. The components of the electronic device 1000 may include, but are not limited to: at least one processing unit 1010, at least one memory unit 1020, a bus 1030 that couples various system components including the memory unit 1020 and the processing unit 1010, and a display unit 1040.

Wherein the memory unit stores program code that may be executed by the processing unit 1010 to cause the processing unit 1010 to perform the steps according to various exemplary embodiments of the present disclosure as described in the "exemplary methods" section above in this specification. For example, the processing unit 1010 may perform the method steps, etc., as shown in fig. 1.

The memory unit 1020 may include volatile memory units such as a random access memory unit (RAM) 1021 and/or a cache memory unit 1022, and may further include a read only memory unit (ROM) 1023.

Storage unit 1020 may also include a program/utility 1024 having a set (at least one) of program modules 1025, such program modules 1025 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 1030 may include a data bus, an address bus, and a control bus.

The electronic device 1000 may also communicate with one or more external devices 1100 (e.g., keyboard, pointing device, bluetooth device, etc.), which may be through an input/output (I/O) interface 1050. The electronic device 1000 further comprises a display unit 1040 connected to the input/output (I/O) interface 1050 for displaying. Also, the electronic device 1000 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the internet) via the network adapter 1060. As shown, the network adapter 1060 communicates with the other modules of the electronic device 1000 over the bus 1030. It should be understood that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 1000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, to name a few.

It should be noted that although in the above detailed description several modules or sub-modules of the apparatus are mentioned, such a division is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the units/modules described above may be embodied in one unit/module, in accordance with embodiments of the present disclosure. Conversely, the features and functions of one unit/module described above may be further divided into embodiments by a plurality of units/modules.

Further, while the operations of the disclosed methods are depicted in the drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.

While the spirit and principles of the present disclosure have been described with reference to several particular embodiments, it is to be understood that the present disclosure is not limited to the particular embodiments disclosed, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.

Claims (10)

1. A buried point verification method is characterized by comprising the following steps:

receiving buried point reporting information of an application program client, and matching the pit bit information with pit bits in a target pit bit library in response to the fact that the buried point reporting information comprises pit bit information;

according to the matching result, based on a target verification rule base, verifying the buried point reported information;

and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

2. The method for verifying the buried point according to claim 1, wherein the verifying the information reported by the buried point based on a target verification rule base according to the matching result comprises:

responding to the matching success, and acquiring a buried object identifier included in the pit bit information;

and for each buried point object identifier, verifying the first buried point parameter in the buried point report information based on the verification rule of the first buried point parameter associated with the buried point object identifier in the target verification rule base.

3. The method for verifying the buried point according to claim 1, wherein the verifying the information reported by the buried point based on a target verification rule base according to the matching result comprises:

and responding to the matching failure, and adding a label of the pit bit matching failure to the buried point reporting information.

4. The site-based verification method of claim 1, wherein after receiving the site-based reporting information of the application client, the method further comprises:

determining a second embedded point parameter associated with an embedded point reporting event triggering the embedded point reporting information, and verifying the second embedded point parameter in the embedded point reporting information according to a verification rule of the second embedded point parameter in the target verification rule base; and/or

And verifying the public parameters in the buried point reporting information according to the verification rules corresponding to the public parameters in the target verification rule base.

5. The method according to claim 1, wherein in a case that the buried point report information includes buried point report information corresponding to a buried point test task, the buried point task to be verified includes a first buried point task of the buried point test task and a second buried point task for which an application program targeted by the buried point test task is online.

6. The buried point verification method of claim 1, wherein the determination manner of the buried point task to be verified comprises:

acquiring a value of a preset field in the buried point reporting information, and determining the buried point task to be checked according to the value of the preset field;

the preset field is used for indicating the version of the application program client, and the buried point tasks to be checked comprise online buried point tasks corresponding to the version of the application program client.

7. The buried point verification method of claim 1, further comprising:

updating the first quantity and the second quantity according to the received buried point reporting information;

responding to the operation of requesting to display the checking result of the first checking mode, and displaying a first quantity and a second quantity corresponding to the buried point reporting event;

the first quantity comprises the quantity of the buried point reporting events indicated by the buried point reporting information, and the second quantity comprises the quantity of the buried point pit bits corresponding to the buried point reporting events indicated by the buried point reporting information.

8. A buried point verification device, comprising:

the embedded point information receiving module is configured to receive embedded point reporting information of an application program client, and in response to the embedded point reporting information including pit bit information, match the pit bit information with pit bits in a target pit bit library;

the checking module is configured to check the buried point reporting information based on a target checking rule base according to a matching result;

and the target pit bit library and the target verification rule library are determined according to the buried points in the buried point task to be verified.

9. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 7.

10. An electronic device, comprising:

one or more processors;

storage means for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to carry out the method of any one of claims 1 to 7.

Images