CN111026658A

CN111026658A - Debugging method, device and medium for fast application

Info

Publication number: CN111026658A
Application number: CN201911222092.7A
Authority: CN
Inventors: 李建彬
Original assignee: Beijing Xiaomi Mobile Software Co Ltd
Current assignee: Beijing Xiaomi Mobile Software Co Ltd
Priority date: 2019-12-03
Filing date: 2019-12-03
Publication date: 2020-04-17
Anticipated expiration: 2039-12-03
Also published as: CN111026658B

Abstract

The disclosure relates to a debugging method, a debugging device and a debugging medium for fast application, and relates to a fast application technology of a mobile terminal. The debugging method of the fast application provided by the disclosure comprises the following steps: detecting a debug operation for a fast application; searching the search node of each level corresponding to the fast application; when the current searched level contains the target coordinate corresponding to the debugging operation, determining the next level of the current searched level as a continued searched level and searching until the searched level does not contain the target coordinate; determining a search node containing the target coordinate in a level above the level not containing the target coordinate as a target node; and feeding back the node information of the target node to a debugging end of the fast application. Therefore, according to the technical scheme, all nodes of the whole DOM tree do not need to be traversed, the searching time is shortened, and the debugging efficiency of the quick application is improved.

Description

Debugging method, device and medium for fast application

Technical Field

The present disclosure relates to a fast application technology of a mobile terminal, and in particular, to a method, an apparatus, and a medium for debugging a fast application.

Background

The quick application is a novel application form based on a mobile phone hardware platform, a developer writes a set of JS codes, and the quick application can run at multiple ends of Android, IOS, WebView and the like. Developers can develop programs in a form similar to writing traditional HTML. The program can be divided into a component tree (DOM, Document Object Model), a Cascading Style Sheet (CSS), and logic (JS code, JavaScript) from a data point of view. There are a configuration file (manifest. json), a global file (app. js), and a page file (page) in composition. And rpk files are formed after packaging, and the packaged files are apps of the fast application.

The debugging of the fast application generally adopts Devttools as a debugging front-end interface, runs the fast application back end on the mobile phone hardware, and communicates through a data transmission protocol. The fast application back end can be subdivided into a platform and a debugging kernel. The debugging kernel is responsible for debugging the bridge between the front end and the platform.

Disclosure of Invention

To overcome the problems in the related art, the present disclosure provides a method, an apparatus, and a medium for debugging a fast application.

According to a first aspect of the embodiments of the present disclosure, there is provided a method for debugging a fast application, which is applied to a terminal device, and includes:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

when the target coordinate corresponding to the debugging operation is contained in the currently searched level, determining the next level of the currently searched level as a continuously searched level and searching until the target coordinate is not contained in the searched level;

determining a search node containing the target coordinate within a level immediately preceding a level not containing the target coordinate as a target node;

and feeding back the node information of the target node to a debugging end of the fast application.

Optionally, in the above debugging method, the searching for the search node of each level corresponding to the fast application includes:

determining a root node of a node tree corresponding to the fast application as a search node of a first level, and searching the search node of the first level;

determining the next-level child node of the root node as a search node of a second level, and searching the search node of the second level;

and determining a search node of each level according to the level sequence of the node tree, and searching the determined search node of each level.

Optionally, in the debugging method, the determining a next level of the currently searched level as a level for continuing searching and performing searching includes:

when the search node in the current search hierarchy contains the target coordinate, determining the next hierarchy of the current search hierarchy as a continued search hierarchy, and determining the search node in the continued search hierarchy, wherein the search node in the continued search hierarchy is a child node of the search node containing the target coordinate;

and performing a search operation in the search node of the determined search continuation hierarchy.

Optionally, in the debugging method, the determining a search node in the hierarchy of the continued search includes:

and when the structure type of the search node containing the target coordinate in the currently searched hierarchy is determined to be a list structure type, determining the child node displayed on the display screen of the terminal equipment at the current moment in all child nodes of the search node of the list structure type as the search node of the continuously searched hierarchy.

and when the structure type of the search node containing the target coordinate in the current search hierarchy is determined to be the laminated structure type, determining all child nodes of the search node of the laminated structure type as the search nodes of the search hierarchy which is continuously searched.

Optionally, the debugging method further includes:

and when the target coordinate is searched in at least two search nodes, comparing the depths of the search nodes searched to the target coordinate, and determining the search node with the maximum depth value as the search node containing the target coordinate in the continuous search hierarchy.

Optionally, the debugging method further includes:

and when the search node with the maximum depth value comprises at least two nodes, determining one search node in the search nodes with the maximum depth value as the search node containing the target coordinate in the continuous search hierarchy according to a preset rule.

Optionally, the debugging method further includes:

and acquiring coordinate information of a debugging end from the debugging operation, converting the coordinate information of the debugging end into coordinate information in a coordinate system of the terminal equipment, and determining the coordinate information of the debugging end in the coordinate system of the terminal equipment, which is obtained by conversion, as a target coordinate corresponding to the debugging operation.

According to a second aspect of the embodiments of the present disclosure, there is provided a debugging apparatus for a fast application, including:

a first module to detect a debug operation for a fast application;

a second module, configured to search for a search node of each level corresponding to the fast application;

a third module, configured to, when a currently searched level includes a target coordinate corresponding to the debugging operation, determine a next level of the currently searched level as a level to be searched continuously, and perform a search until the searched level does not include the target coordinate;

a fourth module for determining a search node containing the target coordinate within a level immediately preceding a level not containing the target coordinate as a target node;

and the fifth module is used for feeding back the node information of the target node to the debugging end of the fast application.

Optionally, in the foregoing debugging apparatus, the searching for the search node of each tier corresponding to the fast application includes:

Optionally, in the foregoing debugging apparatus, the determining and searching a next level of the currently searched level as a level for continuing searching includes:

Optionally, in the foregoing debugging apparatus, the determining a search node in the hierarchy for continuing the search includes:

Optionally, the debugging apparatus further includes:

and the sixth module is used for comparing the depths of the search nodes which are searched for the target coordinate when the target coordinate is searched for in at least two search nodes, and determining the search node with the largest depth value as the search node which contains the target coordinate in the continuous search level.

Optionally, the debugging apparatus further includes:

and a seventh module, configured to, when the search node with the largest depth value includes at least two nodes, determine, according to a preset rule, one search node of the search nodes with the largest depth value as a search node that includes the target coordinate in the continuous search hierarchy.

Optionally, in the foregoing debugging apparatus, the debugging apparatus further includes:

an eighth module, configured to obtain coordinate information of a debug end from the debug operation, convert the coordinate information of the debug end into coordinate information in a coordinate system of a terminal device, and determine the coordinate information of the debug end obtained through conversion in the coordinate system of the terminal device as a target coordinate corresponding to the debug operation.

According to a third aspect of the embodiments of the present disclosure, there is provided a debugging apparatus for a fast application, including:

a processor;

a memory for storing processor-executable instructions;

wherein the processor is configured to:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

According to a fourth aspect of embodiments of the present disclosure, there is provided a non-transitory computer-readable storage medium having instructions therein, which when executed by a processor of a terminal device, enable the terminal device to perform a method of debugging a fast application, the method comprising:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

The technical scheme provided by the embodiment of the disclosure can have the following beneficial effects:

according to the technical scheme, the target coordinate searching operation is performed layer by layer based on the structural characteristics of the DOM tree. And determining nodes needing to be searched in each hierarchy before the searching operation of each hierarchy, and only performing the searching operation in the determined nodes. Therefore, according to the technical scheme, all nodes of the whole DOM tree do not need to be traversed, the searching time is shortened, and the debugging efficiency of the quick application is improved.

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

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.

Fig. 1 is a schematic flow chart of a method for acquiring a target node according to debugger coordinates in a fast application debugging process in the related art.

FIG. 2 is a flow diagram illustrating a method for debugging a fast application in accordance with an exemplary embodiment.

FIG. 3 is a detailed flow diagram illustrating a method for debugging a fast application in accordance with an illustrative embodiment.

Fig. 4 is a block diagram illustrating a debugging apparatus for a fast application according to an example embodiment.

Fig. 5 is a block diagram illustrating a debugging apparatus for a fast application according to an example embodiment.

Detailed Description

Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present invention. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the invention, as detailed in the appended claims.

In the related art, when the structure of a page is described by tags (similar to conventional HTML tags) in a page file of a fast application, each tag corresponds to a DOM node of the fast application. Each DOM node occupies a rectangular display area, and the range of the rectangular display area can be represented by the vertex coordinates of the upper left corner of the rectangular display area corresponding to the DOM node and the width and height of the rectangular display area.

And the structure of the DOM node described by the page file of the fast application is the DOM tree corresponding to the fast application.

When the quick application is tested, the mobile phone terminal can capture the screen of the quick application at regular time, and the screen capture data is compressed and then sent to the debugging front end through the network protocol. The image is displayed in a specified browser window after decompression of the debugging front end, and the image coordinate of any point on the browser can be called as a debugger coordinate. The coordinate system of a general debugger is based on the top left vertex of the window as the origin, and horizontally extending from the origin to the right as the horizontal axis, and vertically extending from the origin to the bottom as the vertical axis. .

When debugging the fast application, when a developer clicks a certain position of the screenshot in the front end of the debugging, the mobile phone terminal is expected to return the actual fast application node information corresponding to the position. At this time, the debugging front end sends the coordinates of the debugger to the mobile phone terminal. The mobile phone terminal needs to process and return the corresponding node information. The process can be divided into two steps, namely finding the corresponding DOM node according to the debugger coordinates. And describing a BOX model according to the DOM node and returning to the front end of the debugger.

At present, in a debugging process of a fast application, a target node corresponding to a debugger coordinate is generally obtained by using a method flow as shown in fig. 1. As can be seen from fig. 1, in the related art, after the mobile phone terminal receives the debugger coordinate and converts the debugger coordinate into the real coordinate on the mobile phone, all nodes of the DOM tree corresponding to the fast application are traversed. All nodes containing the real coordinates are aggregated and the depth of the aggregated nodes is calculated. And determining the node with the deepest depth as the target node.

The application provides a debugging method of quick application, which can be used in terminal equipment. The method is shown in fig. 2 and comprises the following steps.

In step S21, a debugging operation for the fast application is detected;

in step S22, search nodes of each hierarchy corresponding to the fast application are searched;

in step S23, when the target coordinate corresponding to the debugging operation is included in the currently searched hierarchy, determining the next hierarchy of the currently searched hierarchy as the hierarchy to be searched continuously, and searching until the target coordinate is not included in the searched hierarchy;

in step S24, a search node containing the target coordinate in a level immediately preceding the level not containing the target coordinate is determined as a target node;

in step S25, the node information of the target node is fed back to the debug side of the fast application.

In step S21, the format of the detected debugging operation of the fast application may be a data packet, a message, an instruction, or the like. The debug operation may include target coordinates transmitted from an initiator of the debug operation (for example, a debug side of the fast application), other coordinate information corresponding to the target coordinates, and the like. The terminal equipment only needs to achieve the effect of triggering the process of searching the target node after receiving the debugging operation.

In the step S22, the process of searching for the target coordinate corresponding to the debugging operation from the search node of each hierarchy may be to search whether the target coordinate is included in an area range corresponding to the search node of each hierarchy, that is, an area range occupied by the search node in the display interface of the terminal device, which is configured in advance.

In step S23, the next level of the currently searched level is determined as the level to be searched continuously, and the search is performed until the target coordinate is not included in the searched level, and the search may be stopped when the search node including the target coordinate is not searched.

In step S25, the manner in which the terminal device feeds back the node information of the target node to the initiator of the debugging operation may include multiple manners. For example, a data packet or message containing node information of the target node, etc. may be sent to the initiator of the debug operation (e.g., the debug peer of the fast application). Herein, the node information of the target node includes any one or more kinds of information that can determine the position of the node in the DOM tree corresponding to the fast application. For example, the node name of the target node, the identifier of the target node, or other attribute information of the target node may be used.

As can be seen from the above description, according to the technical solution of this embodiment, the search operation of the target coordinates is performed layer by layer based on the structural features of the DOM tree. And before the search operation of each hierarchy, determining the nodes needing to be searched in the hierarchy, and only performing the search operation in the determined nodes. Therefore, compared with the mode of traversing all nodes of the whole DOM tree to search the target coordinate in the related technology, the technical scheme of the disclosure greatly reduces the number of searched nodes, thereby shortening the searching time and improving the debugging efficiency of the quick application.

This embodiment provides another method for debugging a fast application, where the searching for a search node of each level corresponding to the fast application includes:

and determining a searching node of each level according to the level sequence of the node tree, and searching the determined searching node of each level.

In this embodiment, the target coordinates are sequentially searched from the search node of each hierarchy in the hierarchical order of the node tree. For example, the first search is from the level of the root node, which may be referred to as the first level. Since there is only one node in the first hierarchy, the root node is the search node of the first hierarchy. The target coordinates are searched from the root node. When the root node contains the target coordinate, the next hierarchy, which may be referred to as a second hierarchy, continues to be searched. Prior to searching the second hierarchical level, search nodes within the second hierarchical level may be determined. Herein, a next-level child node of a search node of a currently searched hierarchy is determined as a search node of a next searched hierarchy. That is, the next level child node of the root node is a search node of the second hierarchy. According to the above description, the target nodes can be searched layer by layer according to the hierarchical order of the node tree.

Therefore, the searching operation of the target coordinates is performed layer by layer based on the hierarchical characteristics of the node tree, the searching process is more logical, and the searching efficiency is improved, namely the debugging efficiency of the quick application is improved.

The embodiment provides another debugging method for fast application, in which determining a next level of a current search level as a search continuation level and performing a search includes:

when the search node in the current search hierarchy contains the target coordinate, determining the next hierarchy of the current search hierarchy as a continuous search hierarchy, and determining the search node in the continuous search hierarchy, wherein the search node in the continuous search hierarchy is a child node of the search node containing the target coordinate;

and performing a search operation in the search node of the determined hierarchy for continuing the search.

As can be seen from the above description, the present embodiment performs the search operation of the target coordinates layer by layer based on the characteristics of the node tree. And before the search operation of each hierarchy, determining the next-level child node of the search node in the currently searched hierarchy as the search node in the hierarchy which is continuously searched according to the characteristic of the overlapping of the regions between the parent node and the child nodes in the upper and lower hierarchies. That is, a node that may contain the target coordinates, i.e., a search node, is screened from each hierarchy. The searching operation is only carried out on the searching nodes, so that the number of the searching nodes is greatly reduced, the times of the searching operation are reduced, and the searching efficiency of the target coordinate is improved.

The present embodiment provides another method for debugging a fast application, where determining a search node in a hierarchy for continuing a search includes:

and when the structure type of the search node containing the target coordinate in the current search hierarchy is determined to be the list structure type, determining the child node displayed on the display screen of the terminal equipment at the current moment in all the child nodes of the search node of the list structure type as the search node of the search hierarchy which is continuously searched.

Herein, the structure type of a node refers to at least the distribution structure of the child nodes of the node.

For example, a List of nodes represents an ordered List of nodes, which may be useful for long lists or scrolling through a screen in a page of a fast application. That is, the structure type of the node List is a List structure. By analyzing the list structure type, the child nodes can be distributed in the whole page of the application quickly, and the range is wide. However, since the display screen of the terminal device is limited, only a part of the child nodes of the node list can be displayed on the display screen of the terminal device at a time. The debugging operation of the fast application is initiated aiming at the current display interface of the terminal equipment, namely, the target node fed back to the debugging front end by the terminal equipment is certainly contained in the current display interface. Therefore, according to the characteristics of the list structure type, when the target coordinate is searched from the child node of the node list, only the child node displayed in the current display interface needs to be searched.

As can be seen, in the present embodiment, when the node of the list structure type includes the target coordinate, and when the search node of the hierarchy for continuing the search is determined, it is not necessary to traverse all the child nodes of the node of the list structure type, that is, it is not necessary to determine all the child nodes of the node of the list structure type as the search node. The target coordinates can be searched only in the range of the visible child nodes, that is, only the child nodes which can be displayed on the current display screen of the terminal device in the child nodes of the nodes with the list structure type are determined as the search nodes of the continuous search level, and the search operation of the target coordinates is carried out. The processing mode provided by aiming at the characteristics of the nodes with the list structure type can eliminate the child nodes which cannot contain the target coordinates, reduce the number of searching nodes and the searching times and further improve the efficiency.

Herein, a node of a hierarchy type may comprise a node stack in a DOM tree corresponding to a fast application. The sub-nodes of the node stack are arranged in a stacked mode, all the sub-nodes are stacked in sequence, and each sub-node covers the previous sub-node. In the laminated structure, each child node covers the previous child node, that is, the area range corresponding to each child node and the area range corresponding to the previous child node may partially overlap or completely overlap. That is, two or more child nodes may exist in the next-level child node of the search node of the hierarchical structure type, and each of the two or more child nodes includes the target coordinate. Based on this, the present embodiment proposes that after all child nodes of the node of the stacked structure type including the target coordinate are determined as the search node of the next hierarchy, the target coordinate can be more accurately located according to the depth of the search node.

The embodiment provides another debugging method for fast application, which further includes:

and when the target coordinate is searched in at least two search nodes, comparing the depths of the search nodes of which the target coordinate is searched, and determining the search node with the largest depth value as the search node containing the target coordinate in the continuous search hierarchy.

Here, the depth of a search node may be a path depth from a parent node of the search node to the search node, a path depth from a root node to the search node, or the like.

The method for more accurately locating the target coordinate according to the depth of the search node proposed in this embodiment is based on the structural characteristics of the nodes of the stacked structure type, that is, all the child nodes are stacked in sequence, and each child node covers the area range corresponding to the previous child node. For a plurality of search nodes which search for the target coordinates, if the depth of the node is not the deepest, the target coordinates may be searched from the search nodes which cover the area range corresponding to other search nodes which really contain the target coordinates. For this case, all search nodes searched for the target coordinates may be sorted according to the node depth, and the search node with the largest node depth value (which may also be referred to as the search node with the deepest node depth) may be found. And regarding the search node with the largest depth value as the search node really containing the target coordinate, namely determining the search node as the search node containing the target coordinate in the hierarchy.

As can be seen from the above analysis, in the processing method provided by this embodiment for the characteristics of the nodes of the stacked structure type, the plurality of search nodes searched for the target coordinate are screened according to the depth of the node, and only the search node with the largest depth value among the plurality of search nodes searched for the target coordinate is determined as the search node really including the target coordinate, so that the search accuracy is improved. In addition, when the operation of specifying the search node of the hierarchy for which the search is continued is performed, it is not necessary to specify all the child nodes of the plurality of search nodes for which the target coordinates are searched as the search node of the next hierarchy, and only the child node of the search node actually including the target coordinates is specified as the search node of the next hierarchy. Therefore, the number of searching nodes of the next level and the searching times of the next level are obviously reduced, and the searching efficiency is improved.

and when the search node with the maximum depth value comprises at least two nodes, determining one search node in the search nodes with the maximum depth value as a search node containing the target coordinate in the continuous search hierarchy according to a preset rule.

In the present embodiment, it is considered that, among a plurality of search nodes searched for target coordinates, there may be a plurality of search nodes in the search node having the largest depth value. In this case, in order to improve the search effect, one of the search nodes may be determined as a search node including the target coordinate in the hierarchy in which the search is continued according to a preset rule. In this way, when the determination operation of the search node of the hierarchy for continuing the search is performed, it is not necessary to determine all the child nodes of the search node having the largest depth value as the search node of the next hierarchy, and only one child node of the search node including the target coordinate determined according to the preset rule is used as the search node of the next hierarchy. Therefore, the effect of reducing the number of searching nodes of the next level and the searching times of the next level is achieved, and the searching efficiency is improved.

This embodiment provides another debugging method for fast application, in which the preset rule may include any one of the following:

randomly selecting;

and selecting according to the ranking order of the sibling nodes.

As described above, among the plurality of search nodes searched for the target coordinates, there may be a plurality of search nodes in the search node having the largest depth value. In this case, since the node depths of the plurality of search nodes are the same and are all the maximum values, it can be considered that the plurality of search nodes are all the search nodes that actually include the target coordinates. It is not obvious to specifically determine which search node is the search node containing the target coordinates in the hierarchy. Based on this, the present embodiment proposes that the preset rule may be a random selection, that is, any search node with the largest depth value among the plurality of search nodes searched for the target coordinate is determined as the search node containing the target coordinate in the hierarchy. The search node may be selected according to the arrangement order of the sibling nodes, that is, the search node closest to or closest to the sibling node among the plurality of search nodes searched for the target coordinate, or the search node at a specified arrangement position (for example, the arrangement order is 2 nd bit) may be determined as the search node including the target coordinate in the hierarchy.

The embodiment provides another debugging method for fast application, which further includes the following operations:

and obtaining coordinate information of the debugging end from the debugging operation, converting the coordinate information of the debugging end into coordinate information in a coordinate system of the terminal equipment, and determining the coordinate information of the debugging end obtained by conversion in the coordinate system of the terminal equipment as a target coordinate corresponding to the debugging operation.

The embodiment describes a process of determining a target coordinate corresponding to a debugging operation after the terminal device receives the debugging operation of the fast application. Since the debug operation is initiated by an initiator (e.g., a test front end) of the debug operation, coordinate information of a debug end corresponding to the debug operation, such as debugger coordinate information, may be a certain coordinate position in a coordinate system used by the initiator of the debug operation. In the present embodiment, when performing the debugging operation, the coordinate information corresponding to the debugging operation needs to be converted into the coordinate position in the coordinate system used by the terminal device. Namely, the coordinate information of the debugger is converted into the coordinate information in the coordinate system of the terminal equipment, so that the coordinate information in the coordinate system of the terminal equipment is determined as the target coordinate corresponding to the debugging operation.

FIG. 3 is a detailed flow diagram illustrating a method for debugging a fast application in accordance with an illustrative embodiment. The method can be applied to a mobile terminal, and as shown in fig. 3, the method comprises the following operation steps:

in step S301, the debugger coordinate sent by the debugging front end is received, the debugger coordinate is converted into the coordinate of the mobile terminal, and the converted coordinate of the mobile terminal is determined as the target coordinate.

In this step, the received debugger coordinates may be considered a received debug operation.

In step S302, the root node in the DOM tree corresponding to the fast application is determined as the search node of the first hierarchy, and the target coordinates are searched.

In this step, the process of searching for the target coordinate may be to search for the target coordinate within the area range corresponding to the search node.

In step S303, it is determined whether the search node in the current hierarchy includes the target coordinate, if yes, the process proceeds to step S306, otherwise, the process proceeds to step 304.

In step 304, it is determined whether there is a search node in the previous hierarchy, if yes, step 305 is entered, otherwise, a response that the target coordinate is not searched for is returned to the debugging front end, and the process is ended.

Step 305, the search node containing the target coordinates in the previous level is determined as the target node, and the process proceeds to step 313.

In step S306, it is determined whether the search node containing the target coordinates is a node of the list structure type, if so, step S307 is performed, otherwise, step S308 is performed;

in step S307, acquiring a region range of a child node of a currently displayed list structure type node in the display screen of the terminal device, determining the child node of the list structure type node in the region range as a search node of the current level, traversing the search node of the current level, searching for a target coordinate, and returning to step 303;

in step S308, it is determined whether the search node containing the target coordinates is a node of the stacked structure type, if so, step 309 is performed, otherwise, step S311 is performed;

in step S309, recording a node of the stacked structure type including the target coordinate as a search node including the target coordinate in the current hierarchy, and ending the search operation of the current hierarchy;

in step S310, determining all child nodes of the node of the stacked structure type including the target coordinate as search nodes of the current level, traversing the search nodes of the current level, searching the target coordinate, recording the depths of all the search nodes searched for the target coordinate, recording the search node with the largest depth value as the search node including the target coordinate in the current level, ending the search operation of the current level, and returning to step 312;

in this step, when the search node with the largest depth value includes a plurality of nodes, one of the nodes may be selected at random or according to the arrangement order of the sibling nodes, and recorded as the search node including the target coordinate in the current hierarchy.

In step S311, recording the search node including the target coordinate determined in step 303 as a search node including the target coordinate in the current hierarchy, and ending the search operation of the current hierarchy;

in step S312, all child nodes of the search node including the target coordinate in the previous level are determined as search nodes of the current level, the search nodes of the current level are traversed, the target coordinate is searched, and the process returns to step 303;

in step S313, the information of the target node described by the Box model is returned to the debug front end.

In the above method, steps 306 and 307 are operations on nodes of a list structure type, and steps 308 to 310 are operations on nodes of a stack structure type, and the order of operations on the nodes of the structure type can be changed. That is, after the related operations of the nodes of the stacked structure type are performed, the operations of the nodes of the list structure type are performed.

FIG. 4 is a block diagram illustrating a debugging apparatus for a fast application according to an example embodiment. Referring to fig. 4, the apparatus includes a first module 41, a second module 42, a third module 43, a fourth module 44, and a fifth module 45.

A first module 41 for detecting a debugging operation for a fast application;

a second module 42, configured to perform a search from a search node of each level corresponding to the fast application;

a third module 43, configured to, when a target coordinate is included in the currently searched hierarchy, determine a next hierarchy of the currently searched hierarchy as a hierarchy to be searched continuously, and perform a search until the target coordinate is not included in the searched hierarchy;

a fourth module 44, configured to determine a search node containing the target coordinate in a level immediately preceding the level not containing the target coordinate as a target node;

and a fifth module 45, configured to feed back node information of the target node to the debugging end of the fast application.

The embodiment provides another debugging apparatus for a fast application, in which searching for a search node of each level corresponding to the fast application includes:

The present embodiment provides another debugging apparatus for fast application, in which determining a level next to a level currently searched as a level to be searched continuously and performing a search includes:

The present embodiment provides another debugging apparatus for fast application, in which determining a search node in a hierarchy for continuing a search includes:

This embodiment provides another debugging device for fast application, and the device further includes:

and the sixth module is used for comparing the depths of the search nodes with the target coordinates when the target coordinates are searched in at least two search nodes, and determining the search node with the largest depth value as the search node containing the target coordinates in the continuous search hierarchy.

and the seventh module is used for determining one searching node in the searching nodes with the maximum depth values as the searching node containing the target coordinates in the continuous searching hierarchy according to a preset rule when the searching node with the maximum depth values comprises at least two nodes.

The present embodiment provides another debugging apparatus for fast application, in which the preset rule includes any one of the following:

randomly selecting;

and selecting according to the ranking order of the sibling nodes.

and the eighth module is used for acquiring the coordinate information of the debugging end from the debugging operation, converting the coordinate information of the debugging end into the coordinate information in the coordinate system of the terminal equipment, and determining the coordinate information of the debugging end obtained by conversion in the coordinate system of the terminal equipment as a target coordinate corresponding to the debugging operation.

With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Fig. 5 is a block diagram illustrating a debugging apparatus 500 for a fast application according to an example embodiment. For example, the apparatus 500 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like.

Referring to fig. 5, the apparatus 500 may include one or more of the following components: processing component 502, memory 504, power component 506, multimedia component 508, audio component 510, input/output (I/O) interface 512, sensor component 514, and communication component 516.

The processing component 502 generally controls overall operation of the device 500, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing components 502 may include one or more processors 520 to execute instructions to perform all or a portion of the steps of the methods described above. Further, the processing component 502 can include one or more modules that facilitate interaction between the processing component 502 and other components. For example, the processing component 502 can include a multimedia module to facilitate interaction between the multimedia component 508 and the processing component 502.

The memory 504 is configured to store various types of data to support operation at the device 500. Examples of such data include instructions for any application or method operating on device 500, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 504 may be implemented by any type or combination of volatile or non-volatile memory devices such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.

The power supply component 506 provides power to the various components of the device 500. The power components 506 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power supplies for the apparatus 500.

The multimedia component 508 includes a screen that provides an output interface between the device 500 and the user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 508 includes a front facing camera and/or a rear facing camera. The front-facing camera and/or the rear-facing camera may receive external multimedia data when the device 500 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

The audio component 510 is configured to output and/or input audio signals. For example, audio component 510 includes a Microphone (MIC) configured to receive external audio signals when apparatus 500 is in an operating mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signals may further be stored in the memory 504 or transmitted via the communication component 516. In some embodiments, audio component 510 further includes a speaker for outputting audio signals.

The I/O interface 512 provides an interface between the processing component 502 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.

The sensor assembly 514 includes one or more sensors for providing various aspects of status assessment for the device 500. For example, the sensor assembly 514 may detect an open/closed state of the device 500, the relative positioning of the components, such as a display and keypad of the apparatus 500, the sensor assembly 514 may also detect a change in the position of the apparatus 500 or a component of the apparatus 500, the presence or absence of user contact with the apparatus 500, orientation or acceleration/deceleration of the apparatus 500, and a change in the temperature of the apparatus 500. The sensor assembly 514 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 514 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 514 may also include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

The communication component 516 is configured to facilitate communication between the apparatus 500 and other devices in a wired or wireless manner. The apparatus 500 may access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 516 receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 516 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.

In an exemplary embodiment, the apparatus 500 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components for performing the above-described methods.

In an exemplary embodiment, a non-transitory computer-readable storage medium comprising instructions, such as the memory 504 comprising instructions, executable by the processor 520 of the apparatus 500 to perform the above-described method is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

A non-transitory computer readable storage medium, instructions in which, when executed by a processor of a mobile terminal, enable the mobile terminal to perform a debugging method of a fast application, comprising:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

when the current searched level contains the target coordinate corresponding to the debugging operation, determining the next level of the current searched level as a continued searched level and searching until the searched level does not contain the target coordinate;

determining a search node containing the target coordinate in a level above the level not containing the target coordinate as a target node;

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

It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.

Claims

1. A debugging method of fast application is applied to terminal equipment, and is characterized by comprising the following steps:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

2. The debugging method according to claim 1, wherein the searching for the search node of each level corresponding to the fast application comprises:

3. The debugging method according to claim 1 or 2, wherein the determining and searching the next level of the current search as the level of the continued search comprises:

4. The debugging method according to claim 3, wherein the determining a search node within the hierarchy of the continued search comprises:

5. The debugging method according to claim 3, wherein the determining a search node within the hierarchy of the continued search comprises:

6. The debugging method of claim 5, further comprising:

7. The debugging method of claim 6, further comprising:

8. The debugging method of claim 1, further comprising:

9. A debugging device for fast application is characterized by comprising:

a first module to detect a debug operation for a fast application;

10. The debugging device according to claim 9, wherein the searching for the search node of each level corresponding to the fast application comprises:

11. The debugging device according to claim 9 or 10, wherein the determining and searching for a next level of the current search as a level of the continued search comprises:

12. The debugging apparatus according to claim 11, wherein the determining a search node within the hierarchy of the follow-up search comprises:

13. The debugging apparatus according to claim 11, wherein the determining a search node within the hierarchy of the follow-up search comprises:

14. The debugging apparatus according to claim 13, wherein the apparatus further comprises:

15. The debugging apparatus according to claim 14, wherein the debugging apparatus further comprises:

16. The debugging apparatus according to claim 9, wherein the debugging apparatus further comprises:

17. A debugging device for fast application is characterized by comprising:

a processor;

a memory for storing processor-executable instructions;

wherein the processor is configured to:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;

18. A non-transitory computer readable storage medium having instructions therein which, when executed by a processor of a terminal device, enable the terminal device to perform a method of debugging a fast application, the method comprising:

detecting a debug operation for a fast application;

searching the search node of each level corresponding to the fast application;