CN114185805A - Embedded point verification method, device, equipment and storage medium - Google Patents

Embedded point verification method, device, equipment and storage medium Download PDF

Info

Publication number
CN114185805A
CN114185805A CN202111550519.3A CN202111550519A CN114185805A CN 114185805 A CN114185805 A CN 114185805A CN 202111550519 A CN202111550519 A CN 202111550519A CN 114185805 A CN114185805 A CN 114185805A
Authority
CN
China
Prior art keywords
buried point
data
buried
code
list
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111550519.3A
Other languages
Chinese (zh)
Inventor
黄涛
杨升迁
赵仁辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Youzhuju Network Technology Co Ltd
Original Assignee
Beijing Youzhuju Network Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Youzhuju Network Technology Co Ltd filed Critical Beijing Youzhuju Network Technology Co Ltd
Priority to CN202111550519.3A priority Critical patent/CN114185805A/en
Publication of CN114185805A publication Critical patent/CN114185805A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/36Preventing errors by testing or debugging software
    • G06F11/3668Software testing
    • G06F11/3672Test management
    • G06F11/3684Test management for test design, e.g. generating new test cases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/36Preventing errors by testing or debugging software
    • G06F11/3668Software testing
    • G06F11/3672Test management
    • G06F11/3688Test management for test execution, e.g. scheduling of test suites

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Stored Programmes (AREA)

Abstract

The embodiment of the disclosure provides a buried point verification method, a buried point verification device and a storage medium, wherein the method comprises the following steps: if a trigger action on an interface of a target program is detected, collecting buried point data corresponding to the trigger action; if the buried point data corresponds to the data in the buried point list, judging that the corresponding buried point code in the target program is correct; and if the buried point data does not correspond to the data in the buried point list, judging that the corresponding buried point code in the target program is wrong. The technical scheme provided by the embodiment of the disclosure can automatically verify the data of the buried point, can automatically verify the code of the buried point and can improve the verification efficiency.

Description

Embedded point verification method, device, equipment and storage medium
Technical Field
The embodiment of the disclosure relates to the technical field of embedded points, in particular to an embedded point verification method, device, equipment and storage medium.
Background
In order to facilitate understanding of the operation behavior of the user in the interface, a buried point code is usually inserted into the interface, and when the buried point code runs, buried point data can be collected and reported, and data analysis can be performed by using the buried point data.
At present, whether the inserted embedded point code is correct or not needs to be verified, and the verification mode in the related technology needs to consume more time and has lower efficiency.
Disclosure of Invention
The embodiment of the disclosure provides a buried point verification method, a buried point verification device and a storage medium, which can automatically verify buried point data, can automatically verify buried point codes and can improve verification efficiency.
In a first aspect, an embodiment of the present disclosure provides a buried point verification method, including:
if a trigger action on an interface of a target program is detected, collecting buried point data corresponding to the trigger action;
if the buried point data corresponds to the data in the buried point list, judging that the corresponding buried point code in the target program is correct;
and if the buried point data does not correspond to the data in the buried point list, judging that the corresponding buried point code in the target program is wrong.
In a second aspect, an embodiment of the present disclosure provides a buried point verification apparatus, including:
the data acquisition module is used for acquiring buried point data corresponding to a trigger action if the trigger action on the interface of the target program is detected;
the first judgment module is used for judging that the corresponding embedded point code in the target program is correct if the embedded point data corresponds to the data in the embedded point list;
and the second judgment module is used for judging that the corresponding embedded point code in the target program is wrong if the embedded point data does not correspond to the data in the embedded point list.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including:
one or more processors;
a storage device for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the methods provided by the embodiments of the present disclosure.
In a fourth aspect, the present disclosure provides a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the method provided by the embodiments of the disclosure.
According to the technical scheme provided by the embodiment of the disclosure, if the trigger action on the interface of the target program is detected, the buried point data corresponding to the trigger action is acquired, if the buried point data corresponds to the data in the buried point list, the buried point code in the target program is judged to be correct, and if the buried point data does not correspond to the data in the buried point list, the corresponding buried point code in the target program is judged to be wrong, so that the buried point data can be automatically verified, the buried point code can be automatically verified, and the verification efficiency can be improved.
Drawings
Fig. 1 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure;
fig. 2 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure;
fig. 3 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure;
fig. 4 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure;
fig. 5 is a block diagram of a buried point verification apparatus according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of an electronic device provided in an embodiment of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the disclosure and are not limiting of the disclosure. It should be further noted that, for the convenience of description, only some of the structures relevant to the present disclosure are shown in the drawings, not all of them.
Fig. 1 is a flowchart of a method for verifying a buried point, which may be performed by a buried point verification apparatus, which may be implemented by software and/or hardware, and which may be configured in an automatic verification platform, according to an embodiment of the present disclosure, and the method may be applied in a scenario of verifying a buried point in a developed target program.
As shown in fig. 1, the technical solution provided by the embodiment of the present disclosure includes:
s110: and if the trigger action on the interface of the target program is detected, acquiring buried point data corresponding to the trigger action.
In the embodiment of the disclosure, in the development process of the target program, a buried point code may be inserted into the target program, when the buried point code runs, buried point data may be collected, and data analysis may be performed through the buried point data. After the target program is developed, the target program can be operated on the terminal, in the operation process of the target program, a user can perform a trigger action on the interface, and if the trigger action on the interface is detected, buried point data corresponding to the trigger action is generated and collected. For example, a buried point code is inserted into a query button of the interface, and when a user triggers the query button, corresponding buried point data is generated, which may include the name of the trigger button, the time of the trigger button, and the like.
S120: and judging whether the buried point data corresponds to the data in the buried point list.
If yes, go to S130, otherwise go to S140.
In the disclosed embodiment, the data in the buried point list is standard buried point data. The user can select a plurality of programs in the verification platform, each program has corresponding demand information, and the buried point list can be generated based on the demand information. The data in the buried point list may include buried point location, trigger action, relationship of trigger action to buried point, trigger time, etc.
In the embodiment of the present disclosure, since the data in the buried point list includes the standard buried point data corresponding to the trigger action, the generated buried point data is compared with the data in the buried point list, and whether the buried point code is correct is determined based on the comparison result.
S130: and judging that the corresponding embedded point code in the target program is correct.
S140: and judging the corresponding embedded point code error in the target program.
In the embodiment of the present disclosure, if the collected buried point data does not correspond to the data in the buried point list, it is determined that the buried point code corresponding to the trigger action in the target program is incorrect, so that the collected buried point data is incorrect. And if the acquired buried point data corresponds to the data in the buried point list, judging that the buried point code corresponding to the trigger action in the target program is correct, so that correct buried point data can be acquired.
According to the technical scheme provided by the embodiment of the disclosure, if the trigger action on the interface of the target program is detected, the buried point data corresponding to the trigger action is generated, if the buried point data corresponds to the data in the buried point list, the buried point code in the target program is judged to be correct, and if the buried point data does not correspond to the data in the buried point list, the corresponding buried point code in the target program is judged to be wrong, so that the buried point data can be automatically verified, the buried point code can be automatically verified, and the verification efficiency can be improved.
Fig. 2 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure, and in this embodiment, a scheme in this embodiment may be combined with one or more alternatives in the foregoing embodiments.
Optionally, the method provided by the embodiment of the present disclosure may further include:
and repairing the embedded point codes or generating corresponding repair opinions.
As shown in fig. 2, the technical solution provided by the embodiment of the present disclosure includes:
s210: and if the trigger action on the interface of the target program is detected, acquiring buried point data corresponding to the trigger action.
S220: and judging whether the buried point data corresponds to the data in the buried point list.
If yes, go to S230, otherwise go to S240.
S230: and judging that the corresponding embedded point code in the target program is correct.
S240: and judging the corresponding embedded point code error in the target program.
S250: and repairing the wrong embedded point code or generating a corresponding repair suggestion.
In the embodiment of the present disclosure, if it is determined that the embedded point code is wrong, the wrong embedded point code is repaired, or a corresponding repair suggestion is generated. Specifically, the corresponding data in the buried point list may be converted into a buried point code, and the buried point code may replace the wrong buried point code. Or comparing the converted embedded point code with the wrong embedded point code, and taking the difference between the two as the corresponding repair suggestion, thereby realizing the repair of the wrong embedded point code.
In an implementation manner of the embodiment of the present disclosure, optionally, the repairing the buried point code includes: and replacing the buried point codes which are judged to be wrong with the buried point codes which are converted from the corresponding data in the buried point list. Specifically, the error buried point code may be compared with the buried point code converted from the corresponding data in the buried point list to find a difference therebetween, and the buried point code having the difference in the error buried point code may be replaced with the error buried point code, so as to restore the error buried point code to the correct buried point code.
In an implementation manner of the embodiment of the present disclosure, optionally, the generating the corresponding repair suggestion includes: and determining the difference between the buried point code judged to be wrong and the buried point code converted from the corresponding data in the buried point list, and taking the difference as a repair suggestion. Specifically, the difference between the error buried point code and the buried point code converted from the corresponding data in the buried point list is used as a repair suggestion, so that a user can know the difference between the error buried point code and the buried point code, the error position is convenient to locate, and the user can repair the buried point code conveniently.
In the related art, if a buried point code error is found, a phenomenon of extracting the buried point data error occurs, in this case, the error data needs to be analyzed manually, and a source of the erroneous buried point code needs to be found, so that the error data is repaired. According to the technical scheme provided by the embodiment of the disclosure, the embedded point codes are automatically verified, and the wrong embedded point codes are repaired or corresponding repair suggestions are generated, so that the repair efficiency of the wrong embedded point codes can be improved, the repair efficiency of the embedded point codes can be improved, the working efficiency of users can be improved, and the accuracy of the embedded point codes can be ensured.
Fig. 3 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure, and in this embodiment, a scheme in this embodiment may be combined with one or more alternatives in the foregoing embodiments.
Optionally, before determining that the corresponding buried point code in the target program is incorrect if the buried point data does not correspond to the data in the buried point list, the method further includes:
generating a buried point list according to the requirement information of each program in the verification platform;
converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
As shown in fig. 3, the technical solution provided by the embodiment of the present disclosure includes:
s310: and generating a buried point list according to the requirement information of each program in the verification platform.
In the embodiment of the disclosure, a user can select a plurality of programs in a verification platform, and the demand information corresponding to each program can generate a buried point list based on the demand information. The requirement information may include interface requirement information that needs to be implemented in the running process of each program, and may include: the requirement of button display when the page is opened, the requirement of jumping to a target page when the button is triggered, and the like. The data in the buried point list may be standard buried point data, and may include a buried point position, a trigger action, a relationship between the trigger action and the buried point, a trigger time, and the like.
S320: converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
In the embodiment of the present disclosure, the data generated by the requirement information of each program is included in the buried point list, and for the target program, the data generated by the requirement information of the target program in the buried point list is converted into a buried point code, and the converted buried point code is added to a corresponding position in the target program according to an addition rule. The adding rule of the buried point code can be determined according to the name of the module in the interface. For example, if a buried point appears when a search module of a home page is required to be displayed, a buried point code is added to the search module of the home page according to the name of the search module, and when a user triggers the search module, corresponding buried point data can be collected. The rule for adding the code of the buried point is not limited to the above-described method.
In an implementation manner of the embodiment of the present disclosure, optionally, the converting the data in the buried point list into a corresponding buried point code includes: and converting the data in the buried point list into corresponding buried point codes through a preset template or an automatic conversion program. Specifically, when the data in the buried point list is converted into the corresponding buried point list through the predetermined template, the parameters may be extracted from the data in the buried point list, and the parameters are filled into the predetermined template according to the preset filling rule to form the corresponding buried point code. In the case of converting the data in the buried point list into the buried point list by the automatic conversion program, parameters meeting the requirements may be added to the template to realize the conversion of the data in the buried point list into the buried point code.
Therefore, the data in the buried point list is converted into the corresponding buried point codes through a preset template or an automatic conversion program, and the buried point codes are added to the corresponding positions, so that the efficiency of generating the buried point codes can be improved, and the correctness of the buried point codes can be ensured.
S330: and if the trigger action on the interface of the target program is detected, acquiring buried point data corresponding to the trigger action.
S340: and judging whether the buried point data corresponds to the data in the buried point list.
If yes, go to S350, otherwise, go to S360.
S350: and judging that the corresponding embedded point code in the target program is correct.
S360: and judging the corresponding embedded point code error in the target program.
Fig. 4 is a flowchart of a method for verifying a buried point according to an embodiment of the present disclosure, where in this embodiment, a scheme in this embodiment may be combined with one or more alternatives in the foregoing embodiments.
Optionally, the method further includes: and reporting the information of the embedded point code error or carrying out error prompt.
As shown in fig. 4, the technical solution provided by the embodiment of the present disclosure includes:
s410: and if the trigger action on the interface of the target program is detected, acquiring buried point data corresponding to the trigger action.
S420: and judging whether the buried point data corresponds to the data in the buried point list.
If yes, go to S430; if not, go to S440.
S430: and judging that the corresponding embedded point code in the target program is correct.
S440: and judging the corresponding embedded point code error in the target program.
S450: and reporting the information of the embedded point code error or carrying out error prompt.
In the embodiment of the disclosure, the verification platform may report the information of the embedded point error, so that the user repairs the embedded point code, or performs error prompt on the terminal. Optionally, the error prompt mode may be a voice alarm prompt mode or a text prompt mode. Optionally, the position of the error code in the embedded point code may be displayed on the terminal, so that the user can conveniently locate the error code, and the efficiency of repairing the embedded point code is improved. After the user repairs the wrong embedded point code, if the verification work is not finished, the embedded point code can be continuously verified, and if the embedded point code is wrong, the method is used for prompting to repair the wrong embedded point code.
In the embodiment of the present disclosure, optionally, the position of the currently verified buried point code (for example, the number of lines where the buried point code is located) and information on whether the currently verified buried point code passes verification may also be displayed, or the progress of the verified buried point code may also be displayed, so that a user can know information related to the verification work conveniently.
Therefore, by reporting the information of the embedded point code error or carrying out error prompt, the user can find the error code in time and be reminded to check and repair the embedded point code in time, the working efficiency of the user is improved, and the accuracy of the embedded point code is ensured.
Fig. 5 is a block diagram of a buried point verification apparatus provided in an embodiment of the present disclosure, and as shown in fig. 5, the apparatus includes a data acquisition module 510, a first determination module 520, and a second determination module 530.
The data acquisition module 510 is configured to, if a trigger action on an interface of a target program is detected, acquire buried point data corresponding to the trigger action;
a first determining module 520, configured to determine that a corresponding embedded point code in the target program is correct if the embedded point data corresponds to data in an embedded point list;
a second determining module 530, configured to determine that a corresponding embedded point code in the target program is incorrect if the embedded point data does not correspond to the data in the embedded point list.
Optionally, the apparatus further includes a repair module, configured to repair the error embedded point code, or generate a corresponding repair suggestion.
Optionally, the apparatus further includes a conversion module, configured to generate a buried point list according to the requirement information of each program in the verification platform before determining that the corresponding buried point code in the target program is correct if the buried point data corresponds to the data in the buried point list;
converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
Optionally, the converting the data in the buried point list into corresponding buried point codes includes:
and converting the data in the buried point list into corresponding buried point codes through a preset template or an automatic conversion program.
Optionally, the repairing the faulty buried point code includes:
and replacing the wrong embedded point codes with the embedded point codes converted from the corresponding data in the embedded point list.
Optionally, the generating the corresponding repair suggestion includes:
and determining the difference between the buried point code judged to be wrong and the buried point code converted from the corresponding data in the buried point list, and taking the difference as a repair suggestion.
Optionally, the apparatus further includes a reporting/prompting module, configured to report the information of the embedded point code error, or perform error prompting.
The device can execute the method provided by any embodiment of the disclosure, and has the corresponding functional modules and beneficial effects of the execution method.
Referring now to fig. 6, a block diagram of an electronic device (e.g., a terminal device) 400 suitable for use in implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 6 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. 6, the electronic device 400 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 401 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)402 or a program loaded from a storage means 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the electronic apparatus 400 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other via a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.
Generally, the following devices may be connected to the I/O interface 405: input devices 406 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 408 including, for example, tape, hard disk, etc.; and a communication device 409. The communication means 409 may allow the electronic device 400 to communicate wirelessly or by wire with other devices to exchange data. While fig. 6 illustrates an electronic device 400 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication device 409, or from the storage device 408, or from the ROM 402. The computer program performs the above-described functions defined in the methods of the embodiments of the present disclosure when executed by the processing device 401.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer 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 of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either 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 computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to:
if a trigger action on an interface of a target program is detected, collecting buried point data corresponding to the trigger action;
if the buried point data corresponds to the data in the buried point list, judging that the corresponding buried point code in the target program is correct;
and if the buried point data does not correspond to the data in the buried point list, judging that the corresponding buried point code in the target program is wrong.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. The modules and units described in the embodiments of the present disclosure may be implemented by software or hardware. The names of the modules and units do not limit the modules or units in some cases.
According to one or more embodiments of the present disclosure, [ example 1 ] there is provided a buried point verification method, comprising:
if a trigger action on an interface of a target program is detected, collecting buried point data corresponding to the trigger action;
if the buried point data corresponds to the data in the buried point list, judging that the corresponding buried point code in the target program is correct;
and if the buried point data does not correspond to the data in the buried point list, judging that the corresponding buried point code in the target program is wrong.
According to one or more embodiments of the present disclosure, [ example 2 ] there is provided the method of example 1,
and repairing the wrong embedded point code or generating a corresponding repair suggestion.
According to one or more embodiments of the present disclosure, [ example 3 ] there is provided the method of example 1, further including, before determining that a corresponding buried point code in the target program is correct if the buried point data corresponds to data in the buried point list:
generating a buried point list according to the requirement information of each program in the verification platform;
converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
According to one or more embodiments of the present disclosure, [ example 4 ] there is provided the method of example 3, said converting data in said buried point list into corresponding buried point codes, comprising:
and converting the data in the buried point list into corresponding buried point codes through a preset template or an automatic conversion program.
According to one or more embodiments of the present disclosure, [ example 5 ] there is provided the method of example 4, the repairing the corrupted buried point code, comprising:
and replacing the buried point codes which are judged to be wrong with the buried point codes which are converted from the corresponding data in the buried point list.
According to one or more embodiments of the present disclosure, [ example 6 ] there is provided the method of example 2, the generating corresponding repair opinions, comprising:
and determining the difference between the wrong buried point code and the buried point code converted from the corresponding data in the buried point list, and taking the difference as a repair opinion.
In accordance with one or more embodiments of the present disclosure, [ example 7 ] there is provided the method of example 1, further comprising:
and reporting the information of the embedded point code error or carrying out error prompt.
According to one or more embodiments of the present disclosure, [ example 8 ] there is provided a buried point verification device, comprising:
the data acquisition module is used for acquiring buried point data corresponding to a trigger action if the trigger action on the interface of the target program is detected;
the first judgment module is used for judging that the corresponding embedded point code in the target program is correct if the embedded point data corresponds to the data in the embedded point list;
and the second judgment module is used for judging that the corresponding embedded point code in the target program is wrong if the embedded point data does not correspond to the data in the embedded point list.
According to one or more embodiments of the present disclosure, [ example 9 ] there is provided the apparatus of example 8, further comprising a repair module for repairing the buried point code that is erroneous or generating a corresponding repair opinion.
According to one or more embodiments of the present disclosure, [ example 10 ] there is provided the apparatus of example 8, further including a conversion module, configured to generate a buried point list according to requirement information of each program in a verification platform before determining that a corresponding buried point code in the target program is correct if the buried point data corresponds to data in the buried point list;
converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
According to one or more embodiments of the present disclosure, [ example 11 ] there is provided the apparatus of example 10, the converting data in the buried point list into corresponding buried point codes, comprising:
and converting the data in the buried point list into corresponding buried point codes through a preset template or an automatic conversion program.
According to one or more embodiments of the present disclosure, [ example 12 ] there is provided the apparatus of example 8, the repairing the corrupted buried point code, comprising:
and replacing the buried point codes which are judged to be wrong with the buried point codes which are converted from the corresponding data in the buried point list.
According to one or more embodiments of the present disclosure, [ example 13 ] there is provided the apparatus of example 8, the generating corresponding repair opinions, comprising:
and determining the difference between the buried point code judged to be wrong and the buried point code converted from the corresponding data in the buried point list, and taking the difference as a repair suggestion.
According to one or more embodiments of the present disclosure, [ example 14 ] there is provided the apparatus of example 8, further including a reporting/prompting module, configured to report the information of the embedded point code error, or perform error prompting.
According to one or more embodiments of the present disclosure, [ example 15 ] there is provided a server comprising a memory, a processing device, and a computer program stored on the memory and executable on the processing device, the processing device implementing the buried point verification method as in any of examples 1-7 when executing the program.
According to one or more embodiments of the present disclosure, [ example 16 ] there is provided a storage medium containing computer-executable instructions for performing the buried point verification method as in any of examples 1-7 when executed by a computer processor.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present disclosure and the technical principles employed. Those skilled in the art will appreciate that the present disclosure is not limited to the particular embodiments described herein, and that various obvious changes, adaptations, and substitutions are possible, without departing from the scope of the present disclosure. Therefore, although the present disclosure has been described in greater detail with reference to the above embodiments, the present disclosure is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present disclosure, the scope of which is determined by the scope of the appended claims.

Claims (10)

1. A buried point verification method is characterized by comprising the following steps:
if a trigger action on an interface of a target program is detected, collecting buried point data corresponding to the trigger action;
if the buried point data corresponds to the data in the buried point list, judging that the corresponding buried point code in the target program is correct;
and if the buried point data does not correspond to the data in the buried point list, judging that the corresponding buried point code in the target program is wrong.
2. The method of claim 1, further comprising:
and repairing the wrong embedded point code or generating a corresponding repair suggestion.
3. The method of claim 1, further comprising, before determining that the corresponding buried point code in the target program is correct if the buried point data corresponds to data in the buried point list,:
generating a buried point list according to the requirement information of each program in the verification platform;
converting the data in the buried point list into corresponding buried point codes, and adding the converted buried point codes to corresponding positions in the target program.
4. The method of claim 3, wherein said converting data in said list of buried points into corresponding buried point codes comprises:
and converting the data in the buried point list into corresponding buried point codes through a preset template or an automatic conversion program.
5. The method of claim 2, wherein the repairing the corrupted buried point code comprises:
and replacing the buried point codes which are judged to be wrong with the buried point codes which are converted from the corresponding data in the buried point list.
6. The method of claim 2, wherein generating the corresponding repair opinions comprises:
and determining the difference between the wrong buried point code and the buried point code converted from the corresponding data in the buried point list, and taking the difference as a repair opinion.
7. The method of claim 1, further comprising:
and reporting the information of the embedded point code error or carrying out error prompt.
8. A buried point verification device, comprising:
the data acquisition module is used for acquiring buried point data corresponding to a trigger action if the trigger action on the interface of the target program is detected;
the first judgment module is used for judging that the corresponding embedded point code in the target program is correct if the embedded point data corresponds to the data in the embedded point list;
and the second judgment module is used for judging that the corresponding embedded point code in the target program is wrong if the embedded point data does not correspond to the data in the embedded point list.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. 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.
CN202111550519.3A 2021-12-17 2021-12-17 Embedded point verification method, device, equipment and storage medium Pending CN114185805A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111550519.3A CN114185805A (en) 2021-12-17 2021-12-17 Embedded point verification method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111550519.3A CN114185805A (en) 2021-12-17 2021-12-17 Embedded point verification method, device, equipment and storage medium

Publications (1)

Publication Number Publication Date
CN114185805A true CN114185805A (en) 2022-03-15

Family

ID=80544311

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111550519.3A Pending CN114185805A (en) 2021-12-17 2021-12-17 Embedded point verification method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN114185805A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114944942A (en) * 2022-04-28 2022-08-26 平安壹钱包电子商务有限公司 Data reporting method and device based on effective buried points, computer equipment and medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114944942A (en) * 2022-04-28 2022-08-26 平安壹钱包电子商务有限公司 Data reporting method and device based on effective buried points, computer equipment and medium
CN114944942B (en) * 2022-04-28 2024-04-05 平安壹钱包电子商务有限公司 Data reporting method and device based on effective buried points, computer equipment and medium

Similar Documents

Publication Publication Date Title
CN111401228B (en) Video target labeling method and device and electronic equipment
CN109376419B (en) Data model generation method and device, electronic equipment and readable medium
CN110795472A (en) Address standardization method, system, equipment and medium based on fuzzy matching
CN111897827B (en) Data updating method and system for data warehouse and electronic equipment
CN111552640A (en) Code detection method, device, equipment and storage medium
CN110781658A (en) Resume analysis method and device, electronic equipment and storage medium
CN112905262A (en) Configuration method and device of aerospace measurement and control system
CN111124541B (en) Configuration file generation method, device, equipment and medium
CN109902726B (en) Resume information processing method and device
CN114185805A (en) Embedded point verification method, device, equipment and storage medium
CN110286776A (en) Input method, device, electronic equipment and the storage medium of character combination information
CN112461244A (en) Express cabinet positioning method and device based on longitude and latitude and electronic equipment
CN109542743B (en) Log checking method and device, electronic equipment and computer readable storage medium
CN110716859A (en) Method for automatically pushing test cases for modified codes and related device
CN110858143B (en) Installation package generation method, device, equipment and storage medium
CN113849416A (en) Test method, test device, storage medium and electronic equipment
CN111626045A (en) Character length calculation method and device and electronic equipment
CN111399902A (en) Client source file processing method and device, readable medium and electronic equipment
CN111625243B (en) Cross-language task processing method and device and electronic equipment
CN117609029A (en) Software failure data fusion method and system based on data acquisition
CN118778925A (en) Function point estimation method, device, equipment, storage medium and product
CN117669534A (en) File comparison method, device, equipment and storage medium
CN118886681A (en) Product management method based on product library and related equipment
CN116820989A (en) Test coverage rate determining method and device, readable medium and electronic equipment
CN116243904A (en) Component configuration data verification method, device, equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination