CN117632755A - Buried point event processing method and device, storage medium and electronic equipment - Google Patents

Abstract

The present disclosure provides a method, apparatus, computer program product, non-transitory computer readable storage medium, and electronic device for processing a buried point event. The method comprises the following steps: receiving a first buried point event reported by terminal equipment; under the condition that the first buried point event belongs to a preset initial set, generating a corresponding event link identifier and sending the event link identifier to terminal equipment; receiving a second buried point event carrying an event link identifier, which is reported by terminal equipment; and under the condition that the second buried point event belongs to a preset end set, generating a target event link which comprises at least two buried point events from the beginning of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event. The embodiment of the disclosure can automatically acquire the event link of the terminal equipment, acquire a complete event link set, be favorable for comprehensively testing the embedded point reporting function and ensure the accuracy of embedded point data.

Description

Buried point event processing method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates generally to the field of computer technology, and more particularly, to a method, apparatus, computer program product, non-transitory computer readable storage medium, and electronic device for processing a buried point event.

Background

This section is intended to introduce a few aspects of the art that may be related to various aspects of the present disclosure that are described and/or claimed below. This section is believed to help provide background information to facilitate a better understanding of various aspects of the disclosure. It should therefore be understood that these statements are to be read in this light, and not as admissions of prior art.

Application software typically performs data reclamation of operations or events in the terminal device through buried points. The embedded point generally passes through the stages of demand, embedded point design, development, test, online and data recovery, and after passing through the stages of demand and embedded point design, embedded point reporting is generally carried out in the embedded point development stage by using a development component calling mode, and the packaging of the embedded point component can reduce the problem of artificial calling errors, so that reporting failure or abnormality is caused. In the test stage, a report path scene and a report scene are designed according to the requirements and the design of the technical scheme and are used for reporting the test buried point data.

Because the buried point extends over each step and link of the software like a mesh point, functional links in the software application cannot be exhausted, either in the development stage or the testing stage, and thus the accuracy of the buried point data cannot be ensured.

Therefore, there is a need to propose a new solution to alleviate or solve at least one of the above-mentioned problems.

Disclosure of Invention

The disclosure aims to provide a processing method, a device, a computer program product, a non-transitory computer readable storage medium and an electronic device for a buried point event, so as to automatically acquire an event link of a terminal device, obtain a complete event link set, and be favorable for comprehensively testing a buried point reporting function and ensuring the accuracy of buried point data.

According to a first aspect of the present disclosure, there is provided a method for processing a buried point event, including: receiving a first buried point event reported by terminal equipment; generating a corresponding event link identifier and sending the event link identifier to the terminal equipment under the condition that the first buried point event belongs to a preset initial set, wherein the initial set comprises at least one buried point event which can be used as an event link starting point; receiving a second buried point event carrying the event link identifier, which is reported by terminal equipment; and under the condition that the second buried point event belongs to a preset end set, generating a target event link which comprises at least two buried point events from the beginning of the first buried point event to the ending of the second buried point event according to the first buried point event and the second buried point event, wherein the end set comprises at least one buried point event which can be used as an event link end point.

According to a second aspect of the present disclosure, there is provided a method for processing a buried point event, including: acquiring a first buried point event and sending the first buried point event to a server; receiving an event link identifier returned by the server, wherein the event link identifier is generated by the server when the first buried point event belongs to a preset initial set, and the initial set comprises at least one buried point event capable of being used as an event link starting point; acquiring a second buried point event and sending the second buried point event and the event link identifier to the server, so that the server generates a target event link which comprises at least two buried point events from the beginning of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event under the condition that the second buried point event belongs to a preset end set, wherein the end set comprises at least one buried point event which can be used as an event link end point.

According to a third aspect of the present disclosure, there is provided a processing apparatus for a buried point event, including: the first receiving module is used for receiving a first buried point event reported by the terminal equipment; the sending module is used for generating a corresponding event link identifier and sending the event link identifier to the terminal equipment under the condition that the first buried point event belongs to a preset initial set, wherein the initial set comprises at least one buried point event which can be used as an event link starting point; the second receiving module is used for receiving a second buried point event which is reported by the terminal equipment and carries the event link identifier; the generating module is configured to generate, according to the first buried point event and the second buried point event, a target event link including at least two buried point events from a start of the first buried point event to an end of the second buried point event, where the end set includes at least one buried point event capable of being used as an event link end, when the second buried point event belongs to a preset end set.

According to a fourth aspect of the present disclosure, there is provided a processing apparatus for a buried point event, including: the first acquisition module is used for acquiring a first buried point event and sending the first buried point event to the server; the receiving module is used for receiving an event link identifier returned by the server, wherein the event link identifier is generated by the server when the first buried point event belongs to a preset initial set, and the initial set comprises at least one buried point event which can be used as an event link starting point; the second acquisition module is configured to acquire a second buried point event and send the second buried point event together with the event link identifier to the server, so that the server generates, according to the first buried point event and the second buried point event, a target event link including at least two buried point events from the start of the first buried point event to the end of the second buried point event when the second buried point event belongs to a preset end set, where the end set includes at least one buried point event capable of being used as an event link end.

According to a fifth aspect of the present disclosure there is provided a computer program product comprising program code instructions which, when the program product is executed by a computer, cause the computer to perform the method according to the first or second aspect of the present disclosure.

According to a sixth aspect of the present disclosure, there is provided a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method according to the first or second aspect of the present disclosure.

According to a seventh aspect of the present disclosure, there is provided an electronic device comprising: a processor, a memory in electronic communication with the processor; and instructions stored in the memory and executable by the processor to cause the electronic device to perform the method according to the first or second aspect of the present disclosure.

In the embodiment of the disclosure, the starting point and the ending point of the event link are determined by utilizing the starting set and the ending set of the event link, the event link is identified, the event link can be automatically acquired, a complete event link set is obtained, the embedded point reporting function is comprehensively tested according to the event link set, and the accuracy of embedded point data is ensured.

It should be understood that what is described in this section is not intended to identify key or essential features of the claimed subject matter, nor is it intended to be used solely to determine the scope of the claimed subject matter.

Drawings

In order to more clearly illustrate the embodiments of the present disclosure or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present disclosure, and other drawings may be obtained according to these drawings without inventive effort to a person of ordinary skill in the art. Throughout the drawings, identical reference numerals designate similar, but not necessarily identical, elements.

FIG. 1 illustrates a system architecture diagram of one embodiment of a method of processing a buried point event according to the present disclosure;

FIG. 2A illustrates a flow chart of one embodiment of a method of processing a buried point event according to the present disclosure;

FIG. 2B illustrates a flow chart of another embodiment of a method of processing a buried point event according to the present disclosure;

FIG. 3A illustrates a schematic diagram of a directed graph of one embodiment of a method of processing a buried point event according to the present disclosure;

FIG. 3B illustrates a schematic diagram of one specific example of a method of processing a buried point event according to the present disclosure;

FIG. 4A illustrates an exemplary block diagram of one embodiment of a processing device for a buried point event according to the present disclosure;

FIG. 4B illustrates an exemplary block diagram of another embodiment of a processing device for a buried point event according to the present disclosure;

fig. 5 shows a schematic diagram of an example electronic device 500 that may be used to implement embodiments of the present disclosure.

Detailed description of the preferred embodiments

The present disclosure will be described more fully hereinafter with reference to the accompanying drawings. However, the present disclosure may be embodied in many alternate forms and should not be construed as limited to the embodiments set forth herein. Thus, while the disclosure is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that there is no intention to limit the disclosure to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, equivalents, and alternatives falling within the spirit and scope of the disclosure as defined by the appended claims.

It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element. For example, a first element could be termed a second element, and, similarly, a second element could be termed a first element, without departing from the teachings of the present disclosure.

Some examples are described herein in connection with block diagrams and/or flow charts, wherein each block represents a portion of circuit elements, module, or code that comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in other implementations, the functions in the blocks may occur out of the order. 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.

Reference herein to "an embodiment according to … …" or "in an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one implementation of the disclosure. The appearances of the phrase "in accordance with an embodiment" or "in an embodiment" in various places herein are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments necessarily mutually exclusive of other embodiments.

Fig. 1 illustrates an exemplary system architecture 100 to which embodiments of a method, apparatus, terminal device, and storage medium of processing a buried point event of the present disclosure may be applied.

As shown in fig. 1, a system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.

The user may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications, such as a voice interaction type application, a video conference type application, a short video social type application, a web browser application, a shopping type application, a search type application, an instant messaging tool, a mailbox client, social platform software, etc., may be installed on the terminal devices 101, 102, 103.

The terminal devices 101, 102, 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, various electronic devices with microphones and speakers may be available, including but not limited to smartphones, tablet computers, e-book readers, MP3 players (Moving Picture Experts Group Audio Layer III, dynamic video expert compressed standard audio layer 3), MP4 (Moving Picture Experts Group Audio Layer IV, dynamic video expert compressed standard audio layer 4) players, portable computers and desktop computers, etc. When the terminal devices 101, 102, 103 are software, they can be installed in the above-listed electronic devices. Which may be implemented as a plurality of software or software modules, or as a single software or software module. The present invention is not particularly limited herein.

The server 105 may be a server providing various services, and for example, the server 105 may be a background server processing requests of buried events transmitted by the terminal devices 101, 102, 103.

In some cases, the method for processing a buried point event provided by the present disclosure may be performed by the terminal devices 101, 102, 103, and correspondingly, the processing apparatus for a buried point event may also be disposed in the terminal devices 101, 102, 103, where the system architecture 100 may not include the server 105.

In some cases, the method for processing the embedded point event provided by the present disclosure may be executed by the server 105, and correspondingly, the processing apparatus for the embedded point event may also be disposed in the server 105, where the system architecture 100 may not include the terminal devices 101, 102, 103.

In some cases, the processing method of the buried point event provided by the present disclosure may be executed jointly by the terminal devices 101, 102, 103 and the server 105. Accordingly, the processing means of the buried event may also be provided in the terminal devices 101, 102, 103 and the server 105, respectively.

The server 105 may be hardware or software. When the server 105 is hardware, it may be implemented as a distributed server cluster formed by a plurality of servers, or as a single server. When server 105 is software, it may be implemented as a plurality of software or software modules (e.g., to provide distributed services), or as a single software or software module. The present invention is not particularly limited herein.

It should be understood that the number of terminal devices, networks and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

FIG. 2A illustrates a flow chart of one embodiment of a method of processing a buried point event according to the present disclosure. The method in this embodiment may be implemented by the server in fig. 1.

As shown in fig. 2A, the method 210 includes the steps of:

step 211, receiving a first buried point event reported by the terminal equipment.

In this embodiment, the buried point event is buried point data captured by the terminal device, which corresponds to a specific operation or behavior occurring at the terminal device. Buried events may be defined according to specific business requirements. Different application software or different business functions may correspond to different buried point events.

In this embodiment, after the terminal device collects the first buried point event, it sends the first buried point event to the server.

Step 212, in the case that the first buried point event belongs to a preset initial set, generating a corresponding event link identifier and sending the event link identifier to the terminal device, where the initial set includes at least one buried point event that can be used as a starting point of the event link.

In this embodiment, the event links may correspond to a sequence of ordered operations or actions occurring at the terminal device.

In this embodiment, the start set is composed of buried events that can be the start of an event link. Alternatively, the start set is formed by all the set of function entries. Each element in the starting set may serve as a starting point for a business function. Taking video clip software as an example, the corresponding start set may include an "enter clip entry" event, an "enter activity entry" event, an "enter shooting entry" event, an "enter draft editing entry" event, and so on.

In this embodiment, when the first buried point event belongs to the preset initial set, the server generates an event link identifier corresponding to the first buried point event, and returns the event link identifier to the terminal device. Wherein the event link identification has uniqueness. In alternative embodiments, the event link identification may be randomly generated. In an alternative embodiment, the time link identification may be hashed (hashed).

And step 213, receiving a second buried point event carrying an event link identifier, which is reported by the terminal equipment.

In this embodiment, after the terminal device receives the event link identifier sent by the server, the reported buried point events all carry the event link identifier until the corresponding event link is finished.

Step 214, in the case that the second buried point event belongs to a preset end set, generating a target event link including at least two buried point events from the beginning of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event, wherein the end set includes at least one buried point event capable of being used as an end point of the event link.

In this embodiment, the end set is composed of buried events that can be the end points of the event links. Alternatively, the end set is formed by all the function exit sets. Each element in the ending set may be an endpoint of a business function. Taking video editing software as an example, the corresponding ending set may include a "release video" event, a "save to draft box" event, an "exit edit" event, a "return to last step" event, and so on.

In this embodiment, when the second buried point event belongs to the preset end set, a series of buried point events with the first buried point event as a start point and the second buried point event as an end point are sequentially generated to generate a corresponding target event link. For example, the terminal device reports a buried point event a, a buried point event B, a buried point event C and a buried point event D sequentially, wherein the buried point event a belongs to the initial set, the buried point event D belongs to the end set, and the corresponding target event links are a→b→c→d.

In this embodiment, the first buried event and the second buried event point to different functional states, so as to ensure that the target event link is not closed loop. For example, taking video editing software as an example, a buried event sequence is "open draft box" - > start edit "- > preview" - > clip confirm "- > return to draft box", and since the "open draft box" event and the "return to draft box" event point to the same functional state (i.e., open state of draft box), the event sequence is closed loop, and cannot form an event link.

In the above embodiment, the target event link is not closed-loop, so that the service function corresponding to the target event link can be ensured to have complete logic function and logic end point.

In an alternative embodiment, the method in the present disclosure may be applied to extend an event link so as to obtain a complete set of event links, thereby forming a test case for performing a software test.

In the above embodiment, after generating the target event link, the method further includes:

first, it is determined whether a target event link exists in the first directed graph.

Second, in the event that there is no target event link in the first directed graph, the target event link is added to the first directed graph to complete the first directed graph.

In this embodiment, each node in the directed graph represents a buried point event, each directed edge in the directed graph represents an adjacent sequence of two adjacent buried point events, and the first directed graph is the directed graph to be completed. As shown in fig. 3A, an event link is formed by starting and ending at a time, and a plurality of event links have function convergence points and function divergence points, so that a directed node gateway network diagram is formed.

The first directed graph may be generated based on an existing test case. After the first directed graph is completed, the added event links can be supplemented into the existing test cases, so that the test cases cover various possible event links.

In an alternative embodiment, the occurrence frequency of each event link can be counted based on the perfect directed graph and displayed to a developer, so that reference basis is provided for function or product design.

In the above embodiment, after generating the target event link, the method further includes:

first, it is determined whether a target event link exists in a second directed graph, wherein the second directed graph is a refined directed graph.

And in the case that the target event link exists in the second directed graph, updating the occurrence frequency of the target event link in the second directed graph.

And obtaining the service conditions of the service functions corresponding to each event link by counting the occurrence frequency of each event link in the second directed graph.

In alternative embodiments, the methods of the present disclosure may be applied to software testing.

In the above embodiment, the first buried point event is triggered by a test case executed when the target software is tested. After generating the target event link, the method further comprises:

first, comparing a target event link with an event link corresponding to a test case to obtain a first comparison result.

And secondly, under the condition that the first comparison result is inconsistent, determining that the embedded point of the target software reports the function abnormality.

Further, the server may receive the event log sent by the terminal device, and compare the target event link with the event link corresponding to the event log, to obtain a second comparison result. And under the condition that the second comparison result is inconsistent, determining that the embedded point of the terminal equipment reports the abnormal function.

It is easy to understand that the event links corresponding to the target event links, the test cases and the event links corresponding to the event logs are consistent, so that the report function of the embedded point of the target software or the terminal equipment is normal, otherwise, the report function of the embedded point is abnormal.

In the above embodiment, the embedded point event reported by the terminal device carries a timestamp, and it may be determined, based on the timestamp, which event link in the test case corresponds to the target event link, and which event link in the event log corresponds to the target event link. The event links in the test cases and the event links in the event log described above may be determined based on the start set and the end set as well.

In an alternative embodiment, the method in this embodiment may be used to determine program anomalies of the terminal device.

In the above embodiment, after generating the corresponding event link identification and transmitting the event link identification to the terminal device, the method further includes:

firstly, receiving a third buried point event which is reported by terminal equipment and carries an event link identifier;

secondly, determining that the terminal equipment is abnormal under the condition that the event link corresponding to the event link identification is ended at a third buried point event and the third buried point event does not belong to the ending set.

After determining that the terminal equipment is abnormal, the corresponding alarm information can be sent to the developer. In addition, the recording of the event links in the present disclosure can also provide references for developers to replicate anomalies and solve problems.

Fig. 3B illustrates a schematic diagram of one specific example of a method of processing a buried point event according to the present disclosure.

In this example, as shown in fig. 3B, a start point and an end point (i.e., a start set and an end set) are first defined, the start set including, for example, "editor primary entry", "editor secondary entry", and "editor tertiary entry", and the end set including, for example, "release", "deposit draft", "exit edit", and "close operation", and the like.

Second, a relationship path graph (i.e., a directed graph) is drawn. In the drawing process, the steps of determining key start and end operations, performing next state analysis, tracking until no next state and marking as end operation are sequentially performed, while ensuring no ring link.

Thereafter, a unique tag is generated at the entry (i.e., start point) of the event link, upon which the event link is tracked. If the event link is in the existing use case, comparing the reported data with the existing data of the platform to update the frequency of the event link. If the event link is not in the existing use case, the event link is supplemented to the use case library. If the event link is found to be abnormally ended in the tracking process, judging that risk, breakdown (crash) or abnormality exists.

Fig. 2B illustrates a flow chart of another embodiment of a method of processing a buried point event according to the present disclosure. The method in this embodiment may be implemented by the server in fig. 1.

As shown in fig. 2B, the method 220 includes the steps of:

step 221, acquiring a first buried point event and sending the first buried point event to a server;

step 222, receiving an event link identifier returned by the server, wherein the event link identifier is generated by the server when the first buried point event belongs to a preset initial set, and the initial set comprises at least one buried point event capable of being used as a starting point of the event link;

step 223, obtaining a second buried point event and sending the second buried point event and the event link identifier to the server, so that the server generates a target event link including at least two buried point events from the beginning of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event when the second buried point event belongs to a preset end set, wherein the end set includes at least one buried point event capable of being used as an end point of the event link.

Specific details and technical effects in this embodiment may be referred to the description of the embodiment in fig. 2A, and will not be repeated here.

Fig. 4A illustrates an exemplary block diagram of a processing device for a buried point event according to an embodiment of the present disclosure. As shown in fig. 4A, the processing device 410 for a buried point event includes: a first receiving module 411, configured to receive a first buried point event reported by a terminal device; a sending module 412, configured to generate a corresponding event link identifier and send the event link identifier to the terminal device when the first buried point event belongs to a preset initial set, where the initial set includes at least one buried point event that can be used as a start point of an event link; a second receiving module 413, configured to receive a second buried point event carrying the event link identifier reported by the terminal device; the generating module 414 is configured to generate, when the second buried point event belongs to a preset end set, a target event link including at least two buried point events from the start of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event, where the end set includes at least one buried point event that can be used as an end point of the event link.

It should be appreciated that the various modules of the apparatus 410 shown in fig. 4A may correspond to the various steps in the method 210 described with reference to fig. 2A. Thus, the operations, features, and advantages described above with respect to method 210 apply equally to apparatus 410 and the modules included therein. For brevity, certain operations, features and advantages are not described in detail herein.

In an alternative embodiment, the first buried point event and the second buried point event point to different functional states to ensure that the target event link is not closed loop.

In an alternative embodiment, the generating module 414 is further configured to: determining whether the target event link exists in a first directed graph, wherein each node in the directed graph represents a buried point event, each directed edge in the directed graph represents an adjacent sequence of two adjacent buried point events, and the first directed graph is a directed graph to be perfected; and adding the target event link to the first directed graph to perfect the first directed graph when the target event link does not exist in the first directed graph.

In an alternative embodiment, the generating module 414 is further configured to: determining whether the target event link exists in a second directed graph, wherein each node in the directed graph represents a buried point event, each directed edge in the directed graph represents an adjacent sequence of two adjacent buried point events, and the second directed graph is a perfect directed graph; and updating the occurrence frequency of the target event link in the second directed graph when the target event link exists in the second directed graph.

In an alternative embodiment, the first embedding event is triggered by a test case executed when testing the target software, and the generating module 414 is further configured to: comparing the target event link with the event link corresponding to the test case to obtain a first comparison result; and under the condition that the first comparison result is inconsistent, determining that the embedded point of the target software reports the function abnormality.

In an alternative embodiment, the first receiving module 411 is further configured to: receiving an event log sent by the terminal equipment; the generating module 414 is further configured to: comparing the target event link with the event link corresponding to the event log to obtain a second comparison result; and under the condition that the second comparison result is inconsistent, determining that the embedded point of the terminal equipment reports the function abnormality.

In an alternative embodiment, the generating module 414 is further configured to: receiving a third buried point event carrying the event link identifier and reported by terminal equipment; and determining that the terminal equipment is abnormal when the event link corresponding to the event link identifier is ended at the third buried point event and the third buried point event does not belong to the ending set.

Fig. 4B illustrates an exemplary block diagram of a processing device for a buried point event according to an embodiment of the present disclosure. As shown in fig. 4B, the processing device 420 for a buried point event includes: a first receiving module 421, configured to receive a first buried point event reported by a terminal device; a sending module 422, configured to generate a corresponding event link identifier and send the event link identifier to the terminal device when the first buried point event belongs to a preset initial set, where the initial set includes at least one buried point event that can be used as a start point of an event link; a second receiving module 423, configured to receive a second buried point event that is reported by a terminal device and carries the event link identifier; the generating module is configured to generate, when the second buried point event belongs to a preset end set, a target event link including at least two buried point events from a start of the first buried point event to an end of the second buried point event according to the first buried point event and the second buried point event, where the end set includes at least one buried point event that can be used as an event link end point.

It should be appreciated that the various modules of the apparatus 420 shown in fig. 4B may correspond to the various steps in the method 220 described with reference to fig. 2B. Thus, the operations, features, and advantages described above with respect to method 220 apply equally to apparatus 420 and the modules included therein. For brevity, certain operations, features and advantages are not described in detail herein.

Fig. 5 illustrates a schematic block diagram of an example electronic device 500 that may be used to implement embodiments of the present disclosure. Referring to fig. 5, a block diagram of an electronic device 500 that may be a server or a client of the present disclosure, which is an example of a hardware device that may be applied to aspects of the present disclosure, will now be described. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein. As shown in fig. 5, the electronic device 500 includes a computing unit 501 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 502 or a computer program loaded from a storage unit 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the device 500 can also be stored. The computing unit 501, ROM 502, and RAM 503 are connected to each other by a bus 504. An input/output (I/O) interface 505 is also connected to bus 504. Various components in the device 500 are connected to the I/O interface 505, including: an input unit 706 such as a keyboard, a mouse, etc.; an output unit 507 such as various types of displays, speakers, and the like; a storage unit 508 such as a magnetic disk, an optical disk, or the like; and a communication unit 509 such as a network card, modem, wireless communication transceiver, etc. The communication unit 509 allows the device 500 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.

The computing unit 501 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 501 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 501 performs the various methods and processes described above, such as the processing of buried point events. For example, in some embodiments, the method of processing a buried point event may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 508. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 500 via the ROM 502 and/or the communication unit 509. When the computer program is loaded into RAM 503 and executed by the computing unit 501, one or more steps of the above-described method of processing a buried point event may be performed. Alternatively, in other embodiments, the computing unit 501 may be configured to perform the processing of the buried point event in any other suitable way (e.g., by means of firmware).

The various illustrative logics, logical blocks, modules, circuits, and algorithm processes described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. The interchangeability of hardware and software has been described generally in terms of functionality, and is illustrated in the various illustrative components, blocks, modules, circuits, and processes described above. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.

The hardware and data processing apparatus used to implement the various illustrative logics, logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose single or multi-chip processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor or any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. In some aspects, particular processes and methods may be performed by circuitry specific to a given function.

In one or more aspects, the functions described may be implemented in hardware, digital electronic circuitry, computer software, firmware (including the structures disclosed in this specification and their equivalents), or in any combination thereof. Aspects of the subject matter described in this specification can also be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on a computer storage medium for execution by, or to control the operation of, data processing apparatus.

If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. The processes of the methods or algorithms disclosed herein may be implemented in software modules executable by a processor, which may reside on a computer readable medium. Computer-readable media includes both computer storage media and communication media including any medium that can transfer a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Further, any connection is properly termed a computer-readable medium. Disk (Disk) and disc (Disk) as used herein include high-density optical discs (CDs), laser discs, optical discs, digital Versatile Discs (DVDs), floppy disks, and blu-ray discs where disks (disks) usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media. Additionally, the operations of a method or algorithm may be embodied as one or any combination or set of codes and instructions on a machine-readable medium and computer-readable medium, which may be incorporated into a computer program product.

The various embodiments in this disclosure are described in a related manner, and identical and similar parts of the various embodiments are all referred to each other, and each embodiment is mainly described in terms of differences from the other embodiments. In particular, for apparatus embodiments, device embodiments, computer-readable storage medium embodiments, and computer program product embodiments, the description is relatively simple, as relevant to the method embodiments in part.

Claims (13)

1. A method for processing a buried point event, comprising:

receiving a first buried point event reported by terminal equipment;

generating a corresponding event link identifier and sending the event link identifier to the terminal equipment under the condition that the first buried point event belongs to a preset initial set, wherein the initial set comprises at least one buried point event which can be used as an event link starting point;

receiving a second buried point event carrying the event link identifier, which is reported by terminal equipment;

and under the condition that the second buried point event belongs to a preset end set, generating a target event link which comprises at least two buried point events from the beginning of the first buried point event to the ending of the second buried point event according to the first buried point event and the second buried point event, wherein the end set comprises at least one buried point event which can be used as an event link end point.

2. The method of claim 1, wherein the first and second buried point events are directed to different functional states to ensure that the target event link is not closed loop.

3. The method of claim 2, wherein after generating the target event link, the method further comprises:

determining whether the target event link exists in a first directed graph, wherein each node in the directed graph represents one buried point event, each directed edge in the directed graph represents an adjacent sequence of two adjacent buried point events, and the first directed graph is a directed graph to be perfected;

and adding the target event link to the first directed graph to perfect the first directed graph in the condition that the target event link does not exist in the first directed graph.

4. The method of claim 2, wherein after generating the target event link, the method further comprises:

determining whether the target event link exists in a second directed graph, wherein each node in the directed graph represents one buried point event, each directed edge in the directed graph represents an adjacent sequence of two adjacent buried point events, and the second directed graph is a perfect directed graph;

And updating the occurrence frequency of the target event link in the second directed graph under the condition that the target event link exists in the second directed graph.

5. The method of claim 1, wherein the first embedded event is triggered by a test case executing at a time of testing the target software, and

after generating the target event link, the method further comprises:

comparing the target event link with the event link corresponding to the test case to obtain a first comparison result;

and under the condition that the first comparison result is inconsistent, determining that the embedded point of the target software reports the function abnormality.

6. The method of claim 1, wherein the method further comprises:

receiving an event log sent by the terminal equipment; and

after generating the target event link, the method further comprises:

comparing the target event link with the event link corresponding to the event log to obtain a second comparison result;

and under the condition that the second comparison result is inconsistent, determining that the embedded point of the terminal equipment reports the function abnormality.

7. The method of claim 1, wherein after generating the respective event link identification and transmitting the event link identification to the terminal device, the method further comprises:

Receiving a third buried point event carrying the event link identifier, which is reported by terminal equipment;

and determining that the terminal equipment is abnormal under the condition that the event link corresponding to the event link identifier is ended at the third buried point event and the third buried point event does not belong to the ending set.

8. A method for processing a buried point event, comprising:

acquiring a first buried point event and sending the first buried point event to a server;

receiving an event link identifier returned by the server, wherein the event link identifier is generated by the server when the first buried point event belongs to a preset initial set, and the initial set comprises at least one buried point event capable of being used as an event link starting point;

acquiring a second buried point event and sending the second buried point event and the event link identifier to the server, so that the server generates a target event link which comprises at least two buried point events from the beginning of the first buried point event to the end of the second buried point event according to the first buried point event and the second buried point event under the condition that the second buried point event belongs to a preset end set, wherein the end set comprises at least one buried point event which can be used as an event link end point.

9. A point-buried event processing apparatus, comprising:

the first receiving module is used for receiving a first buried point event reported by the terminal equipment;

the sending module is used for generating a corresponding event link identifier and sending the event link identifier to the terminal equipment under the condition that the first buried point event belongs to a preset initial set, wherein the initial set comprises at least one buried point event which can be used as an event link starting point;

the second receiving module is used for receiving a second buried point event which is reported by the terminal equipment and carries the event link identifier;

the generating module is configured to generate, according to the first buried point event and the second buried point event, a target event link including at least two buried point events from a start of the first buried point event to an end of the second buried point event, where the end set includes at least one buried point event capable of being used as an event link end, when the second buried point event belongs to a preset end set.

10. A point-buried event processing apparatus, comprising:

the first acquisition module is used for acquiring a first buried point event and sending the first buried point event to the server;

the receiving module is used for receiving an event link identifier returned by the server, wherein the event link identifier is generated by the server when the first buried point event belongs to a preset initial set, and the initial set comprises at least one buried point event which can be used as an event link starting point;

The second acquisition module is configured to acquire a second buried point event and send the second buried point event together with the event link identifier to the server, so that the server generates, according to the first buried point event and the second buried point event, a target event link including at least two buried point events from the start of the first buried point event to the end of the second buried point event when the second buried point event belongs to a preset end set, where the end set includes at least one buried point event capable of being used as an event link end.

11. A computer program product comprising program code instructions which, when the program product is executed by a computer, cause the computer to carry out the method of at least one of claims 1-8.

12. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of at least one of claims 1-8.

13. An electronic device, comprising:

the processor may be configured to perform the steps of,

a memory in electronic communication with the processor; and

instructions stored in the memory and executable by the processor to cause the electronic device to perform the method according to at least one of claims 1-8.