CN111026658B - Quick application debugging method, device and medium - Google Patents
Quick application debugging method, device and medium Download PDFInfo
- Publication number
- CN111026658B CN111026658B CN201911222092.7A CN201911222092A CN111026658B CN 111026658 B CN111026658 B CN 111026658B CN 201911222092 A CN201911222092 A CN 201911222092A CN 111026658 B CN111026658 B CN 111026658B
- Authority
- CN
- China
- Prior art keywords
- searching
- node
- search
- level
- hierarchy
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/362—Software debugging
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3684—Test management for test design, e.g. generating new test cases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3688—Test management for test execution, e.g. scheduling of test suites
Abstract
The disclosure relates to a debugging method, device and medium of a quick application, and relates to a quick application technology of a mobile terminal. The debugging method of the quick application provided by the disclosure comprises the following steps: detecting a debug operation for a fast application; searching the search nodes of each level corresponding to the quick application; when the currently searched hierarchy contains target coordinates corresponding to debugging operation, determining the next hierarchy of the currently searched hierarchy as a hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates; determining a search node containing the target coordinates in the previous hierarchy of the hierarchy not containing the target coordinates as a target node; and feeding back node information of the target node to a debugging end of the fast application. Therefore, the technical scheme disclosed by the invention does not need to traverse all nodes of the whole DOM tree, shortens the search time and improves the debugging efficiency of the fast application.
Description
Technical Field
The disclosure relates to a fast application technology of a mobile terminal, and in particular relates to a method, a device 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 set of JS codes are written by a developer, and the quick application can run in Android, IOS, webView and other ends. A developer may develop a program in a form similar to writing conventional HTML. The program can be divided into component trees (DOM, document Object Model, document object model), cascading style sheets (CSS, cascading Style Sheets), logic (JS code, javaScript) from a data perspective. Can be divided into configuration files (manifest. Json), global files (app. Js), and page files (pages) from composition. After packaging, a rpk file is formed, and the packaged file is the app of the fast application.
The debugging of the fast application generally adopts Devtools as a debugging front-end interface, and the mobile phone hardware runs the fast application back-end and communicates through a data transmission protocol. The fast application backend may be subdivided into a platform and a debug kernel. The debugging kernel is responsible for debugging the bridge between the front end and the platform.
Disclosure of Invention
In order 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 an embodiment of the present disclosure, there is provided a method for debugging a fast application, applied to a terminal device, including:
detecting a debug operation for a fast application;
searching the search nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
and feeding back the node information of the target node to the debugging end of the fast application.
Optionally, in the above debugging method, the searching the search node of each level corresponding to the fast application includes:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining a next level child node of the root node as a second level searching node, and searching the second level searching node;
and determining search nodes of each level according to the level sequence of the node tree, and searching the determined search nodes of each level.
Optionally, in the above debugging method, the determining the next level of the current search as the level of the continued search and searching includes:
when the search node in the current search level contains the target coordinate, determining the next level of the current search level as a level for continuous search, and determining the search node in the level for continuous search, wherein the search node in the level for continuous search is a child node of the search node containing the target coordinate;
and in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
Optionally, in the above 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 current search level 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 as the search node of the level for continuing the search from all child nodes of the search node of the list structure type.
Optionally, in the above 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 coordinates in the current search hierarchy is determined to be a stacked structure type, determining all child nodes of the search node of the stacked structure type as search nodes of the hierarchy for continuing the search.
Optionally, the above debugging method further includes:
and comparing the depths of the search nodes searching 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 hierarchy of continuous searching.
Optionally, the above debugging method further includes:
And when the search node with the largest depth value comprises at least two nodes, determining one of the search nodes with the largest depth value as the search node containing the target coordinates in the hierarchy for continuous searching according to a preset rule.
Optionally, the above 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 terminal equipment, and determining the coordinate information of the debugging end, which is obtained by conversion, in the coordinate system of the terminal equipment as target coordinates corresponding to the debugging operation.
According to a second aspect of the embodiments of the present disclosure, there is provided a debugging device for a fast application, including:
a first module for detecting a debug operation for a fast application;
the second module is used for searching the search nodes of each level corresponding to the quick application;
a third module, configured to determine a next level of the currently searched level as a level to continue searching and perform searching when the currently searched level includes the target coordinate corresponding to the debug operation, until the searched level does not include the target seat;
A fourth module configured to determine, as a target node, a search node that includes the target coordinate within a level immediately preceding the level that does not include the target coordinate;
and a fifth module, configured to feed back node information of the target node to the debug end of the fast application.
Optionally, in the above debugging device, the searching the search node of each level corresponding to the fast application includes:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining a next level child node of the root node as a second level searching node, and searching the second level searching node;
and determining search nodes of each level according to the level sequence of the node tree, and searching the determined search nodes of each level.
Optionally, in the above debugging device, the determining the next level of the current search as the level of the continued search and searching includes:
when the search node in the current search level contains the target coordinate, determining the next level of the current search level as a level for continuous search, and determining the search node in the level for continuous search, wherein the search node in the level for continuous search is a child node of the search node containing the target coordinate;
And in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
Optionally, in the above debugging device, 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 current search level 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 as the search node of the level for continuing the search from all child nodes of the search node of the list structure type.
Optionally, in the above debugging device, 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 coordinates in the current search hierarchy is determined to be a stacked structure type, determining all child nodes of the search node of the stacked structure type as search nodes of the hierarchy for continuing the search.
Optionally, the above-mentioned debugging device further includes:
and a sixth module, configured to compare depths of the search nodes searching for the target coordinates when the target coordinates are searched for in at least two search nodes, and determine the search node with the largest depth value as the search node containing the target coordinates in the hierarchy of continuous searching.
Optionally, the above-mentioned debugging device further includes:
and a seventh module, configured to determine, when the search node with the largest depth value includes at least two nodes, one of the search nodes with the largest depth value as a search node that includes the target coordinate in the hierarchy for continuing the search according to a preset rule.
Optionally, in the above debugging device, the debugging device further includes:
and 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 coordinate information of the debug end obtained by 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 device 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 nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
Determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
and feeding back the node information of the target node to the debugging end of the fast application.
According to a fourth aspect of embodiments of the present disclosure, there is provided a non-transitory computer-readable storage medium, which when executed by a processor of a terminal device, causes the terminal device to perform a debugging method of a quick application, the method comprising:
detecting a debug operation for a fast application;
searching the search nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
and feeding back the node information of the target node to the debugging end of the fast application.
The technical scheme provided by the embodiment of the disclosure can comprise the following beneficial effects:
According to the technical scheme, the search operation of the target coordinates is performed layer by layer based on the structural characteristics of the DOM tree. And determining the nodes needing searching in each hierarchy before the searching operation of the hierarchy, and performing the searching operation only in the determined nodes. Therefore, the technical scheme disclosed by the invention does not need to traverse all nodes of the whole DOM tree, shortens the search time and improves the debugging efficiency of the fast application.
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 flowchart of a method for acquiring a target node according to a debugger coordinate in a fast application debugging process in the related art.
FIG. 2 is a flowchart illustrating a method of debugging a fast application, according to an example embodiment.
FIG. 3 is a specific flow diagram illustrating a method of debugging a fast application, according to an example 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 in accordance with an exemplary embodiment.
Detailed Description
Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numbers in different drawings refer to the same or similar elements, unless otherwise indicated. The implementations described in the following exemplary examples do not represent all implementations consistent with the invention. Rather, they are merely examples of apparatus and methods consistent with aspects of the invention as detailed in the accompanying 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 rectangular display area range can be represented by the upper left corner vertex coordinates of the rectangular display area corresponding to the DOM node and the width and height of the rectangular display area.
The structure of the DOM node described by the page file of the quick application is the DOM tree corresponding to the quick application.
When the quick application is tried, the mobile phone terminal can periodically screen-shot the quick application, compress the screen-shot data and then send the compressed screen-shot data to the debugging front end through a network protocol. After decompression, the debugging front end displays the image in a designated browser window, and at this time, the image coordinates of any point on the browser can be called as debugger coordinates. The coordinate system of the general debugger takes the top left vertex of the window as an origin, takes a horizontal axis extending from the origin to the right, and takes a vertical axis extending downwards from the origin. .
When debugging of the quick application is carried out, when a developer clicks a certain position of the screenshot in the front end of debugging, the mobile phone terminal is expected to return the actual quick application node information corresponding to the position. At this time, the debugging front end transmits the debugger coordinates 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 secondly, describing a BOX model of the DOM according to the DOM node and returning to the front end of the debugger.
Currently, the debugging process of the fast application generally adopts the method flow shown in fig. 1 to obtain the target node corresponding to the debugger coordinate. As can be seen from fig. 1, in the related art, after receiving the debugger coordinate and converting the debugger coordinate into the real coordinate on the mobile phone, the mobile phone terminal traverses all nodes of the DOM tree corresponding to the fast application. All nodes containing the true coordinates are summarized and the depth of the summarized nodes is calculated. The node with the deepest depth is determined as the target node.
The application provides a debugging method of a fast application, which can be used in terminal equipment. The method is shown in fig. 2 and comprises the following steps.
In step S21, a debug operation for the fast application is detected;
In step S22, searching is performed on the search nodes of each level corresponding to the fast application;
in step S23, when the currently searched hierarchy includes the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy of the continued search and searching until the searched hierarchy does not include the target coordinates;
in step S24, a search node including the target coordinates within the previous hierarchy of the hierarchy not including the target coordinates is determined as a target node;
in step S25, node information of the target node is fed back to the debugging end of the fast application.
In step S21, the detected debug operation of the fast application may be in the form of a packet, a message, an instruction, or the like. The debug operation may also include target coordinates sent by an initiator of the debug operation (e.g. a debug end of the fast application) or other coordinate information corresponding to the target coordinates. Only the terminal equipment receives the debugging operation and achieves the effect of triggering the process of searching the target node.
In the step S22, the process of searching the target coordinates corresponding to the debugging operation from the search nodes of each level may be searching whether the target coordinates are included or not from the area range corresponding to the search node of each level, that is, the area range occupied by the search node configured in advance in the display interface of the terminal device.
In the step S23, the next level of the level currently searched is determined as the level to be searched continuously, and the search is performed until the target coordinates are not included in the searched level, and the search may be stopped when the search node including the target coordinates is not searched.
In the step S25, the manner in which the terminal device feeds back the node information of the target node to the initiator of the debug operation may include various manners. For example, a data packet or message containing node information of the target node may be sent to an initiator of the debug operation (e.g., the debug end of the fast application), and so on. 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 may be the identifier of the target node, or other attribute information of the target node.
As can be seen from the above description, the technical solution of this embodiment performs the search operation of the target coordinates layer by layer based on the structural features of the DOM tree. And before the searching operation of each level, determining the nodes which need to be searched in the level, and only performing the searching operation in the determined nodes. Compared with the mode of searching the target coordinates by traversing all nodes of the whole DOM tree in the related art, the technical scheme of the invention greatly reduces the number of searched nodes, thereby shortening the searching time and improving the debugging efficiency of quick application.
The embodiment provides another method for debugging a fast application, in which searching is performed on search nodes of each level corresponding to the fast application, including:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining the next level child node of the root node as a second level searching node, and searching the second level searching node;
according to the hierarchical sequence of the node tree, determining the search nodes of each hierarchy, and searching the determined search nodes of each hierarchy.
In this embodiment, the target coordinates are searched from the search nodes of each hierarchy in turn according to the hierarchy order of the node tree. For example, the first search starts from the level at which the root node is located, which may be referred to simply as the first level. Since there is only one node of the root node in the first hierarchy, the root node is the search node of the first hierarchy. And searching the target coordinates from the root node. When the root node contains the target coordinates, the search continues for the next level, which may be referred to simply as the second level. Prior to searching the second hierarchy, search nodes within the second hierarchy may be determined. Herein, a next level child node of a search node of a hierarchy of a current search is determined as a search node of a hierarchy of a next search. That is, the next level child node of the root node is the search node of the second hierarchy. According to the description, the target nodes can be searched layer by layer according to the hierarchical order of the node tree.
Therefore, the search operation of the target coordinates is performed layer by layer based on the hierarchical characteristics of the node tree, so that the search process is more logical, the search efficiency is improved, and the debugging efficiency of the fast application is improved.
The present embodiment provides another fast-application debugging method, in which a next level of a currently searched level is determined as a level of a continued search and the search is performed, including:
when the search node in the currently searched hierarchy contains the target coordinate, determining the next hierarchy of the currently searched hierarchy as a hierarchy for continuous searching, and determining the search node in the hierarchy for continuous searching, wherein the search node in the hierarchy for continuous searching is a child node of the search node containing the target coordinate;
and in the determined search nodes of the hierarchy which continue searching, performing a search operation.
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 searching operation of each level, determining the next level of child nodes of the searching nodes in the level of the current searching as the searching nodes in the level of the continuous searching according to the characteristic of overlapping areas between the father nodes and the child nodes in the upper and lower levels. That is, nodes that may contain the target coordinates, i.e., search nodes, are screened out from each hierarchy. The searching operation is only carried out on the searching nodes, so that the number of the searched nodes is greatly reduced, the frequency of the searching operation is reduced, and the searching efficiency of the target coordinates is improved.
The embodiment provides another fast application debugging method, in which a search node in a hierarchy for continuing searching is determined, including:
when the structure type of the search node containing the target coordinates in the currently searched 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 as the search node of the hierarchy which continues searching from all child nodes of the search node of the list structure type.
Herein, the structure type of a node refers to at least the distribution structure of children of the node.
For example, the node List represents an ordered List of nodes, and effects such as long List or screen scrolling are achieved in the pages of the fast application. That is, the structure type of the node List is a List structure. Analysis of the list structure type shows that the child nodes are widely distributed in the whole page of the fast application. 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 necessarily contained in the current display interface. Therefore, aiming at the characteristics of the list structure type, when searching the target coordinates from the child nodes of the node list, only the child nodes displayed in the current display interface are required to be searched.
It can be seen that, in this embodiment, when the node of the list structure type includes the target coordinates, when determining the search node of the hierarchy that continues to search, all the child nodes of the node of the list structure type do not need to be traversed, that is, all the child nodes of the node of the list structure type do not need to be determined as the search node. The searching operation of the target coordinates can be performed by searching the target coordinates only in the visible child node range, namely, only determining the child node which can be displayed on the current display screen of the terminal equipment from the child nodes of the nodes with the list structure type as the searching node of the hierarchy for continuing searching. The processing mode provided for the characteristics of the nodes of the list structure type eliminates the child nodes which cannot possibly contain the target coordinates, and can reduce the number of searching nodes and the searching times, thereby improving the efficiency.
The embodiment provides another fast application debugging method, in which a search node in a hierarchy for continuing searching is determined, including:
when the structure type of the search node containing the target coordinates in the currently searched hierarchy is determined to be the stacked structure type, all child nodes of the search node of the stacked structure type are determined to be the search nodes of the hierarchy which continues searching.
Herein, the nodes of the hierarchical structure type may include node stack in the DOM tree corresponding to the fast application. The children of the node stack are arranged in a stacked manner, all the children are stacked in sequence, and each child covers the previous child. Since each child node covers the previous child node in the stacked structure, that is, the area range corresponding to each child node and the area range corresponding to the previous child node may be partially overlapped or fully overlapped. That is, there may be two or more child nodes each including the target coordinates in the next level child node of the search node of the hierarchical structure type. Based on this, the present embodiment proposes that after all child nodes of the node of the stacked structure type including the target coordinates are determined as the search nodes of the next level, the target coordinates can be more accurately located according to the depth of the search nodes.
The embodiment provides another method for debugging a fast application, and the method further includes:
and comparing the depths of the search nodes searching for 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 hierarchy for continuous searching.
Herein, the depth of the search node may be a path depth from the parent node of the search node to the node, or a path depth from the root node to the search node.
The mode of locating the target coordinates more accurately according to the depth of the search node, which is proposed in this embodiment, is based on the structural characteristics of the nodes of the stacked structure type, that is, all the sub-nodes are stacked in sequence, and each sub-node covers the area range corresponding to the previous sub-node for consideration. Because, for a plurality of search nodes searching for the target coordinates, if the depth of the node is not the deepest, the range of the area corresponding to other search nodes truly containing the target coordinates may be covered, so that the target coordinates can be searched for. For this case, all the search nodes that search for the target coordinates may be sorted by node depth, and the search node with the largest node depth value (also referred to as the search node with the deepest node depth) may be searched. The search node with the largest depth value is considered as the search node truly containing the target coordinates, namely, the search node containing the target coordinates in the hierarchy is determined.
As can be seen from the above analysis, the processing manner proposed by the embodiment according to the characteristics of the nodes of the stacked structure type screens the plurality of search nodes searching for the target coordinates according to the depths of the nodes, and only the search node with the largest depth value among the plurality of search nodes searching for the target coordinates is determined as the search node actually containing the target coordinates, thereby improving the searching accuracy. When the operation of determining the search node of the hierarchy to continue the search is performed, it is not necessary to determine all the child nodes of the plurality of search nodes that have searched for the target coordinates as the search node of the next hierarchy, and only the child nodes of the search node that actually include the target coordinates are determined as the search node of the next hierarchy. Thus, the number of search nodes of the next level and the search times of the next level are obviously reduced, and the search efficiency is improved.
The embodiment provides another method for debugging a fast application, and the method further includes:
and when the search node with the largest depth value comprises at least two nodes, determining one of the search nodes with the largest depth value as the search node containing the target coordinates in the hierarchy for continuous searching according to a preset rule.
In this embodiment, it is considered that among the plurality of search nodes searching for the target coordinates, there may be a plurality of search nodes having the largest depth value. At this time, in order to improve the search effect, one of the search nodes may be determined as a search node including the target coordinates in the hierarchy in which the search is continued according to a preset rule. In this way, when the operation of determining the search nodes of the hierarchy which continues to search is performed, all the sub-nodes of the search nodes with the largest depth value are not required to be determined as the search nodes of the next hierarchy, and only one sub-node of the search node which contains the target coordinates and is determined according to the preset rule is required to be used as the search node of the next hierarchy. Therefore, the effects of reducing the number of search nodes of the next level and the search times of the next level are achieved, and the search efficiency is improved.
The embodiment provides another method for debugging a fast application, where the preset rule may include any one of the following:
randomly selecting;
and selecting according to the arrangement sequence of the brother nodes.
From the foregoing description, it is known that among a plurality of search nodes searching for the target coordinates, a search node having a largest depth value may have a plurality of search nodes. In this case, since the node depths are the same and the maximum value is obtained for each of the plurality of search nodes, each of the plurality of search nodes can be considered to be a search node that actually includes the target coordinates. It is not significantly different to specifically determine which search node is the search node in the hierarchy that contains the target coordinates. Based on this, the preset rule may be selected randomly, that is, any search node with the largest depth value among the plurality of search nodes searching for the target coordinates is determined as the search node containing the target coordinates in the hierarchy. The selection may be performed according to the arrangement order of the sibling nodes, that is, the search node having the highest depth value among the plurality of search nodes searching for the target coordinate, which is the first or last or the search node having the specified arrangement position (for example, the arrangement order is the 2 nd bit) among the arrangement order of the sibling nodes, is determined as the search node containing the target coordinate in the hierarchy.
The embodiment provides another method for debugging a fast application, which further includes the following operations:
acquiring coordinate information of a debugging end from a debugging operation, converting the coordinate information of the debugging end into coordinate information in a coordinate system of a terminal device, and determining the coordinate information of the converted coordinate information of the debugging end in the coordinate system of the terminal device as a target coordinate corresponding to the debugging operation.
The embodiment describes a process of determining target coordinates corresponding to a debugging operation after the terminal device receives the debugging operation of the fast application. Since the debug operation is initiated by the initiator of the debug operation (e.g. the test front end), the coordinate information of the debug end to which the debug operation corresponds, e.g. the debugger coordinate information, may be a certain coordinate position within the coordinate system used by the initiator of the debug operation. When the debugging operation is performed, the embodiment needs to convert the coordinate information corresponding to the debugging operation into the coordinate position in the coordinate system used by the terminal equipment. Namely, the debugger coordinate information is converted into coordinate information in a coordinate system of the terminal equipment, so that the coordinate information in the coordinate system of the terminal equipment is determined as target coordinates corresponding to the debugging operation.
FIG. 3 is a specific flow diagram illustrating a method of debugging a fast application, according to an example embodiment. The method can be applied to the mobile terminal, and as shown in fig. 3, the method comprises the following operation steps:
in step S301, the debugger coordinates sent by the debugging front end are received, the debugger coordinates are converted into coordinates of the mobile terminal, and the converted coordinates of the mobile terminal are determined as target coordinates.
In this step, the received debugger coordinates may be considered as a received debug operation.
In step S302, a root node in the DOM tree corresponding to the quick application is determined as a search node of the first hierarchy, and the target coordinates are searched.
In this step, the process of searching for the target coordinates may be searching for the target coordinates within the area corresponding to the search node.
In step S303, it is determined whether the search node in the present hierarchy includes the target coordinates, and 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 of the previous hierarchy, if yes, step 305 is entered, otherwise, a response that the target coordinates are not searched is returned to the debug front end, and the present flow is ended.
In step 305, the search node including the target coordinates in the previous hierarchy 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 yes, step S307 is entered, otherwise step S308 is entered;
in step S307, the area range of the child node of the list structure type currently displayed in the display screen of the terminal device is obtained, the child node of the list structure type in the area range is determined as the search node of the present hierarchy, the search node of the present hierarchy is traversed, the target coordinates are searched, and step 303 is returned;
in step S308, it is determined whether the search node containing the target coordinates is a node of the stacked structure type, if yes, step S309 is entered, otherwise step S311 is entered;
in step S309, the node of the stacked structure type including the target coordinates is recorded as the search node including the target coordinates in the present hierarchy, and the search operation of the present hierarchy is ended;
in step S310, all the child nodes of the node of the hierarchical structure type containing the target coordinates are determined as the search nodes of the present hierarchy, the search nodes of the present hierarchy are traversed, the target coordinates are searched, the depths of all the search nodes searching for the target coordinates are recorded, the search node with the largest depth value is recorded as the search node containing the target coordinates in the present hierarchy, the search operation of the present hierarchy is ended, and step 312 is returned;
In this step, when the search node with the largest depth value includes a plurality of nodes, one of the nodes may be selected randomly or may be selected according to the arrangement sequence of sibling nodes, and the selected node is recorded as the search node containing the target coordinates in the present hierarchy.
In step S311, the search node including the target coordinates determined in step 303 is recorded as a search node including the target coordinates in the present hierarchy, and the search operation of the present hierarchy is ended;
in step S312, all the child nodes of the search node containing the target coordinates in the previous hierarchy are determined as the search nodes of the present hierarchy, the search nodes of the present hierarchy are traversed to search for the target coordinates, and the step returns to step 303;
in step S313, 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 for nodes of list structure type, and steps 308 to 310 are operations for nodes of stack structure type, and the operation sequence of the nodes of the structure type can be exchanged. I.e. the operation of the nodes of the list structure type is performed after the related operation of the nodes of the stack structure type is performed.
FIG. 4 is a block diagram of a debugging apparatus for a fast application, shown in accordance with an exemplary 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 debug operation for a fast application;
a second module 42, configured to search from the search nodes of each level corresponding to the fast application;
a third module 43, configured to determine a next level of the currently searched level as a level of continuing the search and perform the search until the searched level does not contain the target coordinates when the currently searched level contains the target coordinates;
a fourth module 44, configured to determine, as the target node, a search node that includes the target coordinate in a level that is a level that does not include the target coordinate;
and a fifth module 45, configured to feed back node information of the target node to the debug side of the fast application.
The embodiment provides another debugging device for a fast application, in which searching is performed on a search node of each level corresponding to the fast application, including:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining the next level child node of the root node as a second level searching node, and searching the second level searching node;
according to the hierarchical sequence of the node tree, determining the search nodes of each hierarchy, and searching the determined search nodes of each hierarchy.
The present embodiment provides another fast-application debugging device, in which a next level of a currently searched level is determined as a level of a continued search and the search is performed, including:
when the search node in the currently searched hierarchy contains the target coordinate, determining the next hierarchy of the currently searched hierarchy as a hierarchy for continuous searching, and determining the search node in the hierarchy for continuous searching, wherein the search node in the hierarchy for continuous searching is a child node of the search node containing the target coordinate;
and in the determined search nodes of the hierarchy which continue searching, performing a search operation.
The present embodiment provides another fast-application debugging device, where determining a search node in a hierarchy for continuing searching includes:
when the structure type of the search node containing the target coordinates in the currently searched 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 as the search node of the hierarchy which continues searching from all child nodes of the search node of the list structure type.
The present embodiment provides another fast-application debugging device, where determining a search node in a hierarchy for continuing searching includes:
When the structure type of the search node containing the target coordinates in the currently searched hierarchy is determined to be the stacked structure type, all child nodes of the search node of the stacked structure type are determined to be the search nodes of the hierarchy which continues searching.
The present embodiment provides another fast-application debugging device, which further includes:
and a sixth module, configured to compare depths of the search nodes searching for the target coordinates when the target coordinates are searched for in at least two search nodes, and determine the search node with the largest depth value as the search node containing the target coordinates in the hierarchy for continuing the search.
The present embodiment provides another fast-application debugging device, which further includes:
and a seventh module, configured to determine, when the search node with the largest depth value includes at least two nodes, one of the search nodes with the largest depth value as a search node including the target coordinates in the hierarchy for continuing the search according to a preset rule.
The embodiment provides another fast-application debugging device, where the preset rule includes any one of the following:
randomly selecting;
and selecting according to the arrangement sequence of the brother nodes.
The present embodiment provides another fast-application debugging device, which further includes:
And an eighth module, configured to obtain coordinate information of the debug end from the debug operation, convert the coordinate information of the debug end into coordinate information in a coordinate system of the terminal device, and determine the coordinate information of the debug end obtained by conversion in the coordinate system of the terminal device as a target coordinate corresponding to the debug operation.
The specific manner in which the various modules perform the operations in the apparatus of the above embodiments have been described in detail in connection with the embodiments of the method, and will not be described in detail herein.
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, or the like.
Referring to fig. 5, an apparatus 500 may include one or more of the following components: a processing component 502, a memory 504, a power supply component 506, a multimedia component 508, an audio component 510, an input/output (I/O) interface 512, a sensor component 514, and a communication component 516.
The processing component 502 generally controls overall operation of the apparatus 500, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing component 502 may include one or more processors 520 to execute instructions to perform all or part of the steps of the methods described above. Further, the processing component 502 can include one or more modules that facilitate interactions 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.
Memory 504 is configured to store various types of data to support operations at device 500. Examples of such data include instructions for any application or method operating on the apparatus 500, contact data, phonebook data, messages, pictures, videos, and the like. The memory 504 may be implemented by any type or combination of volatile or nonvolatile 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 disk.
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 for the device 500.
The multimedia component 508 includes a screen between the device 500 and the user that provides an output interface. 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 input signals from a user. The touch panel includes one or more touch sensors to sense touches, swipes, and gestures on the touch panel. The touch sensor may sense not only the boundary of a touch or slide action, but also 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 operational 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 focal length and optical zoom capabilities.
The audio component 510 is configured to output and/or input audio signals. For example, the audio component 510 includes a Microphone (MIC) configured to receive external audio signals when the device 500 is in an operational mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signals may be further stored in the memory 504 or transmitted via the communication component 516. In some embodiments, the audio component 510 further comprises 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: homepage button, volume button, start button, and lock button.
The sensor assembly 514 includes one or more sensors for providing status assessment of various aspects of the apparatus 500. For example, the sensor assembly 514 may detect the on/off state of the device 500, the relative positioning of the components, such as the display and keypad of the apparatus 500, the sensor assembly 514 may also detect a change in position of the apparatus 500 or one component of the apparatus 500, the presence or absence of user contact with the apparatus 500, the orientation or acceleration/deceleration of the apparatus 500, and a change in temperature of the apparatus 500. The sensor assembly 514 may include a proximity sensor configured to detect the presence of nearby objects 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 gyroscopic 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 one exemplary embodiment, the communication component 516 receives broadcast signals 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, microcontrollers, microprocessors, or other electronic elements for executing the methods described above.
In an exemplary embodiment, a non-transitory computer readable storage medium is also provided, such as memory 504, including instructions executable by processor 520 of apparatus 500 to perform the above-described method. For example, the non-transitory computer readable storage medium may be ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.
A non-transitory computer readable storage medium, which when executed by a processor of a mobile terminal, causes the mobile terminal to perform a method of debugging a fast application, comprising:
detecting a debug operation for a fast application;
searching the search nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains target coordinates corresponding to debugging operation, determining the next hierarchy of the currently searched hierarchy as a hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in the previous hierarchy of the hierarchy not containing the target coordinates as a target node;
and feeding back node information of the target node to a debugging end of the fast application.
Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the application pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It is to be understood that the invention is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (16)
1. The method for debugging the fast application is applied to the terminal equipment and is characterized by comprising the following steps:
detecting a debug operation for a fast application;
searching the search nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
feeding back node information of the target node to the debugging end of the fast application;
the determining the next level of the current searching level as the level of continuous searching and searching comprises the following steps:
determining the next level of the current searching level as a level of continuous searching, and determining searching nodes in the level of continuous searching, wherein the searching nodes in the level of continuous searching are child nodes of the searching nodes containing the target coordinates; and in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
2. The debugging method according to claim 1, wherein searching the search nodes of each hierarchy corresponding to the fast application comprises:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining a next level child node of the root node as a second level searching node, and searching the second level searching node;
and determining search nodes of each level according to the level sequence of the node tree, and searching the determined search nodes of each level.
3. The debugging method of claim 1, wherein the determining search nodes within the hierarchy for continued searching comprises:
and when the structure type of the search node containing the target coordinate in the current search level 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 as the search node of the level for continuing the search from all child nodes of the search node of the list structure type.
4. The debugging method of claim 1, wherein the determining search nodes within the hierarchy for continued searching comprises:
And when the structure type of the search node containing the target coordinates in the current search hierarchy is determined to be a stacked structure type, determining all child nodes of the search node of the stacked structure type as search nodes of the hierarchy for continuing the search.
5. The debugging method of claim 4, wherein the method further comprises:
and comparing the depths of the search nodes searching 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 hierarchy of continuous searching.
6. The debugging method of claim 5, wherein the method further comprises:
and when the search node with the largest depth value comprises at least two nodes, determining one of the search nodes with the largest depth value as the search node containing the target coordinates in the hierarchy for continuous searching according to a preset rule.
7. The debugging method of claim 1, wherein the method further comprises:
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 terminal equipment, and determining the coordinate information of the debugging end, which is obtained by conversion, in the coordinate system of the terminal equipment as target coordinates corresponding to the debugging operation.
8. A quick-application debugging device, comprising:
a first module for detecting a debug operation for a fast application;
the second module is used for searching the search nodes of each level corresponding to the quick application;
a third module, configured to determine a next level of the currently searched level as a level to continue searching and perform searching when the currently searched level includes the target coordinate corresponding to the debug operation, until the searched level does not include the target coordinate;
a fourth module configured to determine, as a target node, a search node that includes the target coordinate within a level immediately preceding the level that does not include the target coordinate;
a fifth module, configured to feed back node information of the target node to the debug end of the fast application;
the determining the next level of the current searching level as the level of continuous searching and searching comprises the following steps:
determining the next level of the current searching level as a level of continuous searching, and determining searching nodes in the level of continuous searching, wherein the searching nodes in the level of continuous searching are child nodes of the searching nodes containing the target coordinates; and in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
9. The debugging apparatus of claim 8, wherein searching each level of search nodes corresponding to the fast application comprises:
determining a root node of a node tree corresponding to the quick application as a first-level searching node, and searching the first-level searching node;
determining a next level child node of the root node as a second level searching node, and searching the second level searching node;
and determining search nodes of each level according to the level sequence of the node tree, and searching the determined search nodes of each level.
10. The debugging apparatus of claim 8, wherein the determining a search node within the hierarchy to continue searching comprises:
and when the structure type of the search node containing the target coordinate in the current search level 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 as the search node of the level for continuing the search from all child nodes of the search node of the list structure type.
11. The debugging apparatus of claim 8, wherein the determining a search node within the hierarchy to continue searching comprises:
And when the structure type of the search node containing the target coordinates in the current search hierarchy is determined to be a stacked structure type, determining all child nodes of the search node of the stacked structure type as search nodes of the hierarchy for continuing the search.
12. The debugging apparatus of claim 11, wherein the apparatus further comprises:
and a sixth module, configured to compare depths of the search nodes searching for the target coordinates when the target coordinates are searched for in at least two search nodes, and determine the search node with the largest depth value as the search node containing the target coordinates in the hierarchy of continuous searching.
13. The debugging apparatus of claim 12, wherein the debugging apparatus further comprises:
and a seventh module, configured to determine, when the search node with the largest depth value includes at least two nodes, one of the search nodes with the largest depth value as a search node that includes the target coordinate in the hierarchy for continuing the search according to a preset rule.
14. The debugging apparatus of claim 8, wherein the debugging apparatus further comprises:
and 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 coordinate information of the debug end obtained by conversion in the coordinate system of the terminal device as a target coordinate corresponding to the debug operation.
15. A quick-application debugging device, 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 nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
feeding back node information of the target node to the debugging end of the fast application;
the determining the next level of the current searching level as the level of continuous searching and searching comprises the following steps:
determining the next level of the current searching level as a level of continuous searching, and determining searching nodes in the level of continuous searching, wherein the searching nodes in the level of continuous searching are child nodes of the searching nodes containing the target coordinates; and in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
16. A non-transitory computer readable storage medium, which when executed by a processor of a terminal device, causes 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 nodes of each level corresponding to the quick application;
when the currently searched hierarchy contains the target coordinates corresponding to the debugging operation, determining the next hierarchy of the currently searched hierarchy as the hierarchy for continuing searching and searching until the searched hierarchy does not contain the target coordinates;
determining a search node containing the target coordinates in a previous hierarchy of the hierarchy not containing the target coordinates as a target node;
feeding back node information of the target node to the debugging end of the fast application;
the determining the next level of the current searching level as the level of continuous searching and searching comprises the following steps:
determining the next level of the current searching level as a level of continuous searching, and determining searching nodes in the level of continuous searching, wherein the searching nodes in the level of continuous searching are child nodes of the searching nodes containing the target coordinates; and in the determined search nodes of the hierarchy which continue searching, carrying out searching operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911222092.7A CN111026658B (en) | 2019-12-03 | 2019-12-03 | Quick application debugging method, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911222092.7A CN111026658B (en) | 2019-12-03 | 2019-12-03 | Quick application debugging method, device and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111026658A CN111026658A (en) | 2020-04-17 |
| CN111026658B true CN111026658B (en) | 2023-10-20 |
Family
ID=70207802
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911222092.7A Active CN111026658B (en) | 2019-12-03 | 2019-12-03 | Quick application debugging method, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111026658B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009026160A (en) * | 2007-07-23 | 2009-02-05 | Mitsubishi Electric Corp | Hierarchical data display program, hierarchical data display method, hierarchical data display device |
| CN102135976A (en) * | 2010-09-27 | 2011-07-27 | 华为技术有限公司 | Hypertext markup language page structured data extraction method and device |
| CN103699648A (en) * | 2013-12-26 | 2014-04-02 | 成都市卓睿科技有限公司 | Tree-form data structure used for quick retrieval and implementation method of tree-form data structure |
| CN107390974A (en) * | 2017-07-21 | 2017-11-24 | 北京小米移动软件有限公司 | Codelookup method, apparatus and storage medium for webpage debugging |
| CN107423322A (en) * | 2017-03-31 | 2017-12-01 | 广州视源电子科技股份有限公司 | The display methods and device of the label nesting level of Webpage |
| CN107729389A (en) * | 2017-09-19 | 2018-02-23 | 小草数语（北京）科技有限公司 | Map-indication method and its device |
| CN109684438A (en) * | 2018-12-26 | 2019-04-26 | 成都科来软件有限公司 | A method of data are retrieved with father and son's hierarchical structure |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7167856B2 (en) * | 2001-05-15 | 2007-01-23 | Jonathan Keir Lawder | Method of storing and retrieving multi-dimensional data using the hilbert curve |
-
2019
- 2019-12-03 CN CN201911222092.7A patent/CN111026658B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2009026160A (en) * | 2007-07-23 | 2009-02-05 | Mitsubishi Electric Corp | Hierarchical data display program, hierarchical data display method, hierarchical data display device |
| CN102135976A (en) * | 2010-09-27 | 2011-07-27 | 华为技术有限公司 | Hypertext markup language page structured data extraction method and device |
| CN103699648A (en) * | 2013-12-26 | 2014-04-02 | 成都市卓睿科技有限公司 | Tree-form data structure used for quick retrieval and implementation method of tree-form data structure |
| CN107423322A (en) * | 2017-03-31 | 2017-12-01 | 广州视源电子科技股份有限公司 | The display methods and device of the label nesting level of Webpage |
| CN107390974A (en) * | 2017-07-21 | 2017-11-24 | 北京小米移动软件有限公司 | Codelookup method, apparatus and storage medium for webpage debugging |
| CN107729389A (en) * | 2017-09-19 | 2018-02-23 | 小草数语（北京）科技有限公司 | Map-indication method and its device |
| CN109684438A (en) * | 2018-12-26 | 2019-04-26 | 成都科来软件有限公司 | A method of data are retrieved with father and son's hierarchical structure |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111026658A (en) | 2020-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10296201B2 (en) | Method and apparatus for text selection | |
| EP3128411B1 (en) | Interface display method, terminal, computer program and recording medium | |
| EP2924591A1 (en) | Method and device for controlling page rollback | |
| US20200007944A1 (en) | Method and apparatus for displaying interactive attributes during multimedia playback | |
| EP3171554A1 (en) | Method and device for displaying a message | |
| CN105930536B (en) | Index establishing method, page jumping method and device | |
| CN105786944B (en) | Method and device for processing automatic page turning of browser | |
| EP3416054A1 (en) | Method and device for page display, and storage medium | |
| EP3147802B1 (en) | Method and apparatus for processing information | |
| CN107402767B (en) | Method and device for displaying push message | |
| CN104572875A (en) | Popularization information putting effectiveness determining method and device | |
| CN108270661B (en) | Information reply method, device and equipment | |
| EP3416070A1 (en) | Page display method and device and storage medium | |
| CN105468606B (en) | Webpage saving method and device | |
| CN108073291B (en) | Input method and device and input device | |
| CN107390974B (en) | Code searching method, device, terminal and storage medium for webpage debugging | |
| CN111596832B (en) | Page switching method and device | |
| CN105808304A (en) | Code deployment method, device and system | |
| CN113010157A (en) | Code generation method and device | |
| CN111026658B (en) | Quick application debugging method, device and medium | |
| US10613622B2 (en) | Method and device for controlling virtual reality helmets | |
| CN112333233B (en) | Event information reporting method and device, electronic equipment and storage medium | |
| CN116303101B (en) | Test case generation method, device and equipment | |
| US10423706B2 (en) | Method and device for selecting information | |
| US9679076B2 (en) | Method and device for controlling page rollback |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |