CN104572430A - Method, device and system for testing terminal application interface - Google Patents
Method, device and system for testing terminal application interface Download PDFInfo
- Publication number
- CN104572430A CN104572430A CN201310507853.XA CN201310507853A CN104572430A CN 104572430 A CN104572430 A CN 104572430A CN 201310507853 A CN201310507853 A CN 201310507853A CN 104572430 A CN104572430 A CN 104572430A
- Authority
- CN
- China
- Prior art keywords
- node
- control leaf
- list
- present
- child
- 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.)
- Granted
Links
Landscapes
- Small-Scale Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a method, a device and a system for testing a terminal application interface. The method comprises the following steps of obtaining a first list of control leaf subnodes of the current interface, determining a root node, establishing an access tree, using all nodes of the first list of the control leaf subnodes as subnodes of the root node, determining the root node as a new current node, and traversing the subnodes under the current node based on the access tree; when a second list of the control leaf subnodes different from the first list of the control leaf subnodes is obtained, using all nodes of the second list of the control leaf subnodes as the subnodes of a jumping node, and determining the jumping node as the current node; when the current node is not the root node, and all subnodes of the current node have been respectively accessed, determining a parent node of the current node as the new current node, and returning back to the step of traversing the subnodes under the current node based on the access tree; when the current node is the root node, returning back to the step of traversing the nodes of the access tree.
Description
Technical field
The present invention relates to communication technical field, be specifically related to a kind of method of testing of terminal applies interface, device and system.
Background technology
Terminal applies, refer to the application program in terminal, along with popularizing of various intelligent terminal, the kind of terminal applies is also more various, in order to the performance of verification terminal application, and can be optimized terminal applies in time and improve, make user obtain better experience, need to test terminal applies interface.
In the prior art, generally by carrying out traversal to control, terminal applies interface is tested, for Android system, because the terminal applies interface in Android system is generally made up of multiple assembly (Activity), therefore, can effectively travel through all controls in each assembly respectively, test the performance of each assembly, such as, if certain terminal applies interface comprises assembly A and assembly B, then first can determine that assembly A is current component, then all controls in assembly A are effectively traveled through, carry out the performance of test suite A, after complete to assembly A traversal, redefine current component again, such as can determine that assembly B is current component, then just the control in assembly B is effectively traveled through, with the performance of test suite B, etc., by that analogy.
To in the research and practice process of prior art, the present inventor finds, existing scheme effectively can only travel through the control of current component, realize the traversal of all component is then incompetent, and, in the control process of traversal terminal applies interface current component, if the accessed action breaks of current tree (Tree) control structure, such as, after (Click) operation is clicked to certain " button (Button) " on interface, assembly switches, then tree control structure and terminal applies interface will no longer be mated, so now, the validity of traversal will be affected, test is finally caused to make mistakes.
Summary of the invention
The embodiment of the present invention provides a kind of method of testing of terminal applies interface, device and system, full random ergodic can be carried out to all component at terminal applies interface, and, when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
The method of testing at terminal applies interface, comprising:
Obtain the first control leaf node list of current interface;
Determine root node, set up access tree according to described root node and described first control leaf node list, make all nodes in described first control leaf node list as the child node of described root node, and determine that described root node is present node;
Based on described access tree, the child node under present node is traveled through;
Obtain the second control leaf node list of current interface;
When determining that described second control leaf node list is not equal to described first control leaf node list, described second control leaf node list is added in described access tree, make the child node of all nodes as redirect node of described second control leaf node list, and determine that described redirect node is new present node, described redirect node is trigger the node obtaining described second control leaf node list;
Determine whether present node is described root node, and the whether all accessed mistake of all child nodes of present node;
If present node is not described root node, and all accessed mistake of all child nodes of present node, then determine that the father node of described present node is new present node, and return the step performing and based on described access tree, the child node under present node is traveled through;
If determine, present node is described root node, or present node has the child node of not yet accessed mistake, then return the step performing and travel through the child node under present node based on described access tree.
The proving installation at terminal applies interface, is characterized in that, comprising:
First acquiring unit, for obtaining the first control leaf node list of current interface;
Set up unit, for determining root node, set up access tree according to described root node and described first control leaf node list, make all nodes in described first control leaf node list as the child node of described root node, and determine that described root node is present node;
Traversal Unit, for traveling through the child node under present node based on described access tree;
Second acquisition unit, for obtaining the second control leaf node list of current interface;
Adding device, during for determining that described second control leaf node list is not equal to described first control leaf node list, described second control leaf node list is added in described access tree, make the child node of all nodes as redirect node of described second control leaf node list, and determine that described redirect node is present node, described redirect node is trigger the node obtaining described second control leaf node list;
Judging unit, for determining whether present node is described root node, and the whether all accessed mistake of all child nodes of present node, determining that present node is described root node, or present node is when having the child node of not yet accessed mistake, triggers Traversal Unit and return the operation performing and based on described access tree, the child node under present node is traveled through;
Processing unit, for not being described root node at judging unit determination present node, and all child nodes of present node are all accessed out-of-date, the father node determining described present node is new present node, and triggers Traversal Unit and perform the operation traveled through the child node under present node based on described access tree.
A kind of communication system, the proving installation at any one terminal applies interface that the embodiment of the present invention provides.
The embodiment of the present invention adopts the first control leaf node list obtaining current interface, determine root node, access tree is set up according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node, then based on this access tree, the child node under present node is traveled through, after this, obtain the second control leaf node list of current interface, when determining that this second control leaf node list is not equal to the first control leaf node list, second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that redirect node (redirect node is trigger the node obtaining this second control leaf node list) is new present node, when present node is not root node, and all child nodes of present node are all accessed out-of-date, determine that the father node of this present node is new present node, and return the step performing and based on this access tree, the child node under present node is traveled through, when determining that present node is described root node, or when present node has the child node of not yet accessed mistake, return the step performing and based on access tree, the child node under present node is traveled through.Due in this scenario, have employed and set up access tree according to root node and the first control leaf node list, make all nodes in the first control leaf node list as the child node of this root node, after this when getting the second control leaf node list being different from the first control leaf node list, again can using the child node of the second control leaf node list as redirect node, therefore, under can multiple different control leaf node list being added to same access tree, thus realize carrying out complete random ergodic object to all component at terminal applies interface, in terms of existing technologies, the nodes of traversal can be reduced, improve traversal efficiency, and, when the accessed action breaks of present tree control structure, whether can also change to current interface and judge, and adopt different processing modes to guarantee that control digital-to-analogue type and interface are consistent, therefore, to when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those skilled in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the process flow diagram that the embodiment of the present invention provides the method for testing at terminal applies interface;
Fig. 2 is another process flow diagram that the embodiment of the present invention provides the method for testing at terminal applies interface;
Fig. 3 is the structural representation that the embodiment of the present invention provides the test at terminal applies interface;
Fig. 4 is the structural representation of the terminal that the embodiment of the present invention provides.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those skilled in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
It should be noted that, the said test of the embodiment of the present invention, refer to test averaging time (MTTF, Mean Time To Failure) before repairing.So-called MTTF, refers to the operated averaging time that certain element is estimated.Because hardware components fault is normally permanent, the time of therefore usually repairing or replacing needed for this element is also very important, and averaging time before namely repairing, namely life-span average, is designated as MTTF.For convenience, in the invention process, all test is called.
In addition, the said traversal of the embodiment of the present invention, refers to depth-first traversal (Depth-FirstSearch).Such as, suppose that the initial state of given access tree G is that all summits were not all accessed.In G, an optional vertex v is initial starting point (source point), then depth-first traversal can be defined as follows: first access starting point v, and be labeled as and accessed; Then each abutment points w of v is searched for successively from v.If w did not access, be then that new starting point proceeds depth-first traversal with w, till the summit (being also called the summit that can reach from source point) that all and source point v has path to communicate in figure is all accessed.If now still have the summit do not accessed in access tree, then select summit not yet accessed else and repeat said process as new source point, in figure all summits all accessed till.
The embodiment of the present invention provides a kind of method of testing of terminal applies interface, device and system.Below be described in detail respectively.
Embodiment one,
In the present embodiment, be described with the angle of the proving installation at terminal applies interface, the proving installation at this terminal applies interface specifically can be in the terminal integrated, and this terminal is specifically as follows smart mobile phone and panel computer etc.
The method of testing at terminal applies interface, comprising: the first control leaf node list obtaining current interface; Determine root node, set up access tree according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node; Based on this access tree, the child node under present node is traveled through; Obtain the second control leaf node list of current interface; When determining that this second control leaf node list is not equal to described first control leaf node list, this the second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that this redirect node (namely redirect node is trigger the node obtaining described second control leaf node list) is new present node; Determine whether present node is this root node, and the whether all accessed mistake of all child nodes of present node; If present node is not root node, and all accessed mistake of all child nodes of present node, then determine that the father node of this present node is new present node, and return the step performing and based on access tree, the child node under present node is traveled through; If determine, present node is root node, or present node has the child node of not yet accessed mistake, then return the step performing and travel through the node in this access tree.
As shown in Figure 1, idiographic flow can be as follows:
101, the first control leaf node list of current interface is obtained.
Wherein, this first control leaf node list comprises at least one node.
102, root node is determined, access tree is set up in the first control leaf node list according to getting in this root node and step 101, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node.
Such as, specifically can define an empty node is root node, then using this root node as father node, child node (all nodes in this first control leaf node list are the same one-level child node of this root node) using all nodes in the first control leaf node list as this father node, sets up access tree, wherein, this access tree is non-binary trees, time initial, can determine that root node is present node, point to root node by access pointer.
103, based on this access tree, the child node under present node is traveled through.Such as, specifically can be as follows:
When determining that this root node also exists the child node of not yet accessing, from the child node of not yet accessing, obtain a child node, as test node, then this test node is tested, and access being completed this test node to be designated.
And if determine that this root node does not exist the child node of not yet accessing, then show traversal completed, can process ends.
Wherein, " test this test node, and access being completed this test node to be designated " specifically can be as follows for step:
The Hash code value of this test node is set as the first code value, and wherein, this first code value is for identifying the information such as the characteristic of current interface; Initialize operation carried out to this test node, such as, carries out clicking, slide and/or the operation such as dragging, then at end of operation this test node is designated and accesses.
Now, optionally, the number of child nodes of not yet accessing under present node can also be subtracted 1, to add up the number of child nodes of not yet accessing under present node, and can be also whether 0 determine whether root node also exists the child node of not yet accessing by the number of child nodes of not yet accessing under present node, such as, if whether the number of child nodes of not yet accessing is 0, then show there is not the child node of not yet accessing, otherwise, if the number of child nodes of not yet accessing is greater than 0, then show to there is the child node of not yet accessing, etc.
104, the second control leaf node list of current interface is obtained.
Wherein, this second control leaf node list comprises at least one node.
105, when the second control leaf node list got in determining step 104 is not equal to the first control leaf node list, this the second control leaf node list is added in access tree, make the child node of all nodes as redirect node of this second control leaf node list, and determine that this redirect node is new present node, point to this redirect node by access pointer.
Wherein, the said redirect node of the embodiment of the present invention refers to the node that can trigger the list of acquisition second control leaf node in the first control leaf node list.
Optionally, whether form closed loop to prevent from operating rear appearance " loop ", causing traversal to enter endless loop, can judge existing " loop ", namely before adding in access tree by this second control leaf node list, the method can also comprise:
Search in the father node of this redirect node and whether have the identical node of Hash code value; If exist, then delete this redirect node, determine that the node found is new present node, and perform step 106, namely perform and determine whether present node is root node, and the step of the whether all accessed mistake of all child nodes of present node; If do not exist, then return the step performing and this second control leaf node list to be added in access tree.
In addition, it should be noted that, if the second control leaf node list equals this first control leaf node list, then directly can perform step 106, namely the step of " determine whether present node is described root node, and the whether all accessed mistake of all child nodes of present node " is performed.That is, after step " obtains the second control leaf node list of current interface ", the method can also comprise:
If this second control leaf node list equals the first control leaf node list, then perform and determine whether present node is root node, and the step of the whether all accessed mistake of all child nodes of present node.
Optionally, in order to improve traversal efficiency, avoid this redirect node follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, when determining that this second control leaf node list equals the first control leaf node list, this redirect node can also be deleted.
106, determine whether present node is root node, and determine the whether all accessed mistake of all child nodes of present node, if settled front nodal point is not root node, and all accessed mistake of all child nodes of present node, then perform step 107, otherwise, if determine, present node is described root node, or present node has the child node of not yet accessed mistake, then return and perform step 103, namely perform the step of " child node under present node being traveled through based on this access tree ".
If 107 present nodes are not root nodes, and all accessed mistake of all child nodes of present node, then determine that the father node of this present node is new present node, the father node of this present node is pointed to by access pointer, and return execution step 103, namely perform the step of " child node under present node being traveled through based on this access tree ".
As from the foregoing, the present embodiment adopts the first control leaf node list obtaining current interface, determine root node, access tree is set up according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node, then based on this access tree, the child node under present node is traveled through, after this, obtain the second control leaf node list of current interface, when determining that this second control leaf node list is not equal to the first control leaf node list, second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that redirect node (redirect node is trigger the node obtaining this second control leaf node list) is new present node, when present node is not root node, and all child nodes of present node are all accessed out-of-date, determine that the father node of this present node is new present node, and return the step performing and based on this access tree, the child node under present node is traveled through, when determining that present node is described root node, or when present node has the child node of not yet accessed mistake, return the step performing and based on access tree, the child node under present node is traveled through.Due in this scenario, have employed and set up access tree according to root node and the first control leaf node list, make all nodes in the first control leaf node list as the child node of this root node, after this when getting the second control leaf node list being different from the first control leaf node list, again can using the child node of the second control leaf node list as redirect node, therefore, under can multiple different control leaf node list being added to same access tree, thus realize carrying out complete random ergodic object to all component at terminal applies interface, in terms of existing technologies, the nodes of traversal can be reduced, improve traversal efficiency, and, when the accessed action breaks of present tree control structure, whether can also change to current interface and judge, and adopt different processing modes to guarantee that control digital-to-analogue type and interface are consistent, therefore, to when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
Embodiment two,
According to the method described by embodiment one, will elaborate further in the past.
In the present embodiment, be described so that the proving installation at this terminal applies interface is specifically integrated in the terminal.
As shown in Figure 2, a kind of method of testing of terminal applies interface, idiographic flow can be as follows:
201, terminal obtains the first control leaf node list of current interface.
Wherein, this first control leaf node list comprises at least one node.
Such as, for this first control leaf node list for List allElementsA, then its code specifically can be as follows:
202, terminal definitions empty node is root node, sets up access tree, make all nodes in this first control leaf node list as the child node of this root node according to this root node with the first control leaf node list got.
Wherein, this access tree is non-binary trees, time initial, can determine that root node is present node, points to root node by access pointer.Such as, its code specifically can be as follows:
Wherein, Element root is root node, referred to as root; Element pre is present node, referred to as pre.
203, terminal determines whether this root node also exists the child node of not yet accessing, and if so, then performs step 204; If not, then show that traversal completes, can process ends; Such as, its code specifically can be as follows:
204, terminal is random from the child node of not yet accessing obtains a child node, as test node, then the Hash code value of this test node is set as the first code value, wherein, this first code value is for identifying the information such as the characteristic of current interface, such as, be specifically as follows " allElementsA.hashCode "; Initialize operation carried out to this test node, such as, carries out clicking, slide and/or the operation such as dragging, then at end of operation this test node is designated and accesses.
Now, optionally, the number of child nodes of not yet accessing under present node can also be subtracted 1, to add up the number of child nodes of not yet accessing under present node.
Such as, specific code can be as follows:
In addition, due in the process of traversal, can the node corresponding to some NOT-function control be deleted, so, the access to some NOT-function control can be avoided, improve traversal efficiency further.
205, terminal obtains the second control leaf node list of current interface.
Wherein, this second control leaf node list comprises at least one node.
Such as, for this first control leaf node list for List allElementsB, then its code specifically can be as follows:
206, terminal determines whether the second control leaf node list equals the first control leaf node list, if so, then performs step 208, and if not, then perform step 207, such as, specific code can be as follows:
207, when terminal determines that the second control leaf node list is not equal to the first control leaf node list, this the second control leaf node list is added in access tree, make the child node of all nodes as redirect node of this second control leaf node list, and determine that this redirect node is new present node, this redirect node is pointed to by access pointer, now, the information of this control tree can also be preserved.
Wherein, this redirect node refers to the node that can trigger the list of acquisition second control leaf node in the first control leaf node list.
Optionally, forming closed loop to prevent from operating rear appearance " loop ", causing traversal to enter endless loop, can judge whether existing " loop ", namely before this second control leaf node list is added in access tree, can also comprise:
Search in the father node of this redirect node and whether have the identical node of Hash code value; If exist, then delete this redirect node, determine that the node found is new present node, just access pointer points to this node found, and performs step 209; If do not exist, then return the step performing and this second control leaf node list to be added in access tree.
Such as, specifically following code can be adopted:
If 208 second control leaf node lists equal this first control leaf node list, then this redirect node of terminal deletion, then perform step 209;
Such as, specific code can be as follows:
209, whether terminal determination present node is root node, and determines the whether all accessed mistake of all child nodes of present node, if settled front nodal point is not root node, and all accessed mistake of all child nodes of present node, then perform step 210; Otherwise present node is described root node if determine, or present node has the child node of not yet accessed mistake, then perform step 203.
If 210 present nodes are not root nodes, and all accessed mistake of all child nodes of present node, then turn back to the interface at the father node place of this present node, such as click rollback button, get back to an interface, then determine that the father node of this present node is new present node, point to the father node of this present node by access pointer, and return execution step 203.Such as, its code specifically can be as follows:
As from the foregoing, the present embodiment adopts the first control leaf node list obtaining current interface, determine root node, access tree is set up according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node, then based on this access tree, the child node under present node is traveled through, after this, obtain the second control leaf node list of current interface, when determining that this second control leaf node list is not equal to the first control leaf node list, second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that redirect node (redirect node is trigger the node obtaining this second control leaf node list) is new present node, when present node is not root node, and all child nodes of present node are all accessed out-of-date, determine that the father node of this present node is new present node, and return the step performing and based on this access tree, the child node under present node is traveled through, when determining that present node is described root node, or when present node has the child node of not yet accessed mistake, return the step performing and based on access tree, the child node under present node is traveled through.Due in this scenario, have employed and set up access tree according to root node and the first control leaf node list, make all nodes in the first control leaf node list as the child node of this root node, after this when getting the second control leaf node list being different from the first control leaf node list, again can using the child node of the second control leaf node list as redirect node, therefore, under can multiple different control leaf node list being added to same access tree, thus realize carrying out complete random ergodic object to all component at terminal applies interface, in terms of existing technologies, the nodes of traversal can be reduced, improve traversal efficiency, and, when the accessed action breaks of present tree control structure, whether can also change to current interface and judge, and adopt different processing modes to guarantee that control digital-to-analogue type and interface are consistent, therefore, to when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
And, due to when determining that this second control leaf node list equals the first control leaf node list, redirect node can be deleted, therefore, this redirect node can be avoided follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, traversal efficiency can be improved.
Further, after the operation of each traverse node, can compare the interface before and after operation, and adopt different processing modes to avoid the appearance in " loop ", therefore, can the generation of anti-loops, avoid traversal to enter endless loop.And, because this programme the child node of random choose present node can reach the object of random access, therefore, can only according to for certain specific traversal order relative to prior art, seem more flexible, but also the generation of the situation that can prevent certain fixed route from causing MTTF stuck.
Embodiment three,
In order to implement above method better, the embodiment of the present invention also provides a kind of proving installation of terminal applies interface, as shown in Figure 3, the proving installation at this terminal applies interface comprise the first acquiring unit 301, set up unit 302, Traversal Unit 303, second acquisition unit 304, adding device 305, judging unit 306 and processing unit 307;
First acquiring unit 301, for obtaining the first control leaf node list of current interface;
Wherein, this first control leaf node list comprises at least one node.
Set up unit 302, for determining root node, set up access tree according to this root node and described first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node.
Such as, specifically can define an empty node is root node, then using this root node as father node, child node (all nodes in this first control leaf node list are the same one-level child node of this root node) using all nodes in the first control leaf node list as this father node, sets up access tree, wherein, this access tree is non-binary trees, time initial, can determine that root node is present node, point to root node by access pointer.
Traversal Unit 303, for traveling through the child node under present node based on this access tree.
Second acquisition unit 304, for obtaining the second control leaf node list of current interface.
Adding device 305, during for determining that this second control leaf node list is not equal to the first control leaf node list, second control leaf node list is added in this access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that this redirect node is present node.
Wherein, this redirect node refers to the node that can trigger the list of acquisition second control leaf node in the first control leaf node list.
Judging unit 306, for determining whether present node is root node, and the whether all accessed mistake of all child nodes of present node, determine that present node is described root node, or present node is when having the child node of not yet accessed mistake, triggers Traversal Unit 303 and return the operation performing and based on access tree, the child node under present node is traveled through;
Processing unit 307, for determining that at judging unit 306 present node is not root node, and all child nodes of present node are all accessed out-of-date, the father node determining present node is new present node, and triggers Traversal Unit 303 and perform the operation traveled through the child node under present node based on access tree;
Such as, wherein, Traversal Unit 303 can comprise node acquisition subelement and test subelement;
Node obtains subelement, during for determining that root node also exists the child node of not yet accessing, obtains a child node, as test node from the child node of not yet accessing;
Test subelement, for testing this test node, and accesses being completed this test node to be designated, such as, and specifically can be as follows:
Test subelement, specifically may be used for the Hash code value of this test node to be set as the first code value, wherein, this first code value is for identifying the information such as the characteristic of current interface; Initialize operation carried out to this test node, such as, carries out clicking, slide and/or the operation such as dragging, then at end of operation this test node is designated and accesses.
Now, optionally, the number of child nodes of not yet accessing under present node can also be subtracted 1, to add up the number of child nodes of not yet accessing under present node, and node whether obtain subelement can be also 0 determine whether root node also exists the child node of not yet accessing by the number of child nodes of not yet accessing under present node, such as, if whether the number of child nodes of not yet accessing is 0, then show there is not the child node of not yet accessing, otherwise, if the number of child nodes of not yet accessing is greater than 0, then show to there is the child node of not yet accessing, etc.
Optionally, closed loop is formed in order to prevent from operating rear appearance " loop ", traversal is caused to enter endless loop, can judge whether existing " loop ", namely before this second control leaf node list is added in access tree, can also judge whether to there is " loop " by whether having the identical node of Hash code value in the father node of searching this redirect node, namely the proving installation at this terminal applies interface can also comprise the 3rd processing unit;
3rd processing unit, for search this redirect node father node in whether have the identical node of Hash code value; If exist, then delete this redirect node, determine that the node found is new present node, and trigger judging unit and perform and determine whether present node is described root node, and the operation of the whether all accessed mistake of all child nodes of present node; If do not exist, then trigger adding device 305 and perform the operation this second control leaf node list added in access tree.
In addition, it should be noted that, if the second control leaf node list equals this first control leaf node list, then directly can perform and determine whether present node is described root node, and the operation of the whether all accessed mistake of all child nodes of present node, that is:
Judging unit 306, can also be used for when determining that this second control leaf node list equals the first control leaf node list, performs and determines whether present node is root node, and the operation of the whether all accessed mistake of all child nodes of present node.
Optionally, in order to improve traversal efficiency, avoid this redirect node follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, when determining that this second control leaf node list equals the first control leaf node list, this redirect node can also be deleted; Namely the proving installation at this terminal applies interface can also comprise delete cells;
Delete cells, for when determining that the second control leaf node list equals described first control leaf node list, deletes described redirect node.
During specific implementation, above unit can realize as independently entity, and can carry out combination in any yet, realize as same or several entities, the concrete enforcement of above unit see embodiment of the method above, can not repeat them here.
The proving installation at this terminal applies interface specifically can be in the terminal integrated, and this terminal is specifically as follows smart mobile phone and panel computer etc.
As from the foregoing, first acquiring unit 301 of the present embodiment can obtain the first control leaf node list of current interface, root node is determined by setting up unit 302, access tree is set up according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node, then the child node under present node is traveled through based on this access tree by Traversal Unit 303, after this, second acquisition unit 304 can also obtain the second control leaf node list of current interface, when determining that this second control leaf node list is not equal to the first control leaf node list, by adding device 305, second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that redirect node (redirect node is trigger the node obtaining this second control leaf node list) is new present node, when judging unit 306 determines that present node is not root node, and all child nodes of present node are all accessed out-of-date, processing unit 307 determines that the father node of this present node is new present node, and trigger Traversal Unit 303 and perform the operation child node under present node traveled through based on this access tree, and when determining that present node is described root node, or when present node has the child node of not yet accessed mistake, judging unit 306 triggers Traversal Unit 303 and performs the operation traveled through the child node under present node based on access tree.Due in this scenario, have employed and set up access tree according to root node and the first control leaf node list, make all nodes in the first control leaf node list as the child node of this root node, after this when getting the second control leaf node list being different from the first control leaf node list, again can using the child node of the second control leaf node list as redirect node, therefore, under can multiple different control leaf node list being added to same access tree, thus realize carrying out complete random ergodic object to all component at terminal applies interface, in terms of existing technologies, the nodes of traversal can be reduced, improve traversal efficiency, and, when the accessed action breaks of present tree control structure, whether can also change to current interface and judge, and adopt different processing modes to guarantee that control digital-to-analogue type and interface are consistent, therefore, to when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
And, due to when determining that this second control leaf node list equals the first control leaf node list, delete cells can delete redirect node, therefore, this redirect node can be avoided follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, traversal efficiency can be improved.
Further, after the operation of each traverse node, can compare the interface before and after operation, and adopt different processing modes to avoid the appearance in " loop ", therefore, can the generation of anti-loops, avoid traversal to enter endless loop.And, because this programme the child node of random choose present node can reach the object of random access, therefore, can only according to for certain specific traversal order relative to prior art, seem more flexible, but also the generation of the situation that can prevent certain fixed route from causing MTTF stuck.
Embodiment four,
Accordingly, the embodiment of the present invention also provides a kind of communication system, comprises the proving installation at any one terminal applies interface that the embodiment of the present invention provides, such as, and specifically can be as follows:
The proving installation at terminal applies interface, for obtaining the first control leaf node list of current interface; Determine root node, set up access tree according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node; Based on this access tree, the child node under present node is traveled through; Obtain the second control leaf node list of current interface; When determining that this second control leaf node list is not equal to described first control leaf node list, this the second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that this redirect node (namely redirect node is trigger the node obtaining described second control leaf node list) is new present node; Determine whether present node is this root node, and the whether all accessed mistake of all child nodes of present node; If present node is not root node, and all accessed mistake of all child nodes of present node, then determine that the father node of this present node is new present node, and return the step performing and based on access tree, the child node under present node is traveled through; If determine, present node is root node, or present node has the child node of not yet accessed mistake, then return the step performing and travel through the node in this access tree.
The specific embodiment of the proving installation at this terminal applies interface see embodiment above, can not repeat them here.
In addition, this communication system can also comprise other equipment, and such as the equipment such as base station and/or server, does not repeat them here.
Because this communication system comprises the proving installation at any one terminal applies interface that the embodiment of the present invention provides, therefore, the beneficial effect that the proving installation at the terminal applies interface provided with the embodiment of the present invention is same can be realized equally, refer to the description of preceding embodiment, do not repeat them here.
Embodiment five,
Accordingly, the embodiment of the present invention also provides a kind of terminal, as shown in Figure 4, this terminal can comprise radio frequency (RF, Radio Frequency) circuit 401, the storer 402 including one or more computer-readable recording mediums, input block 403, display unit 404, sensor 405, voicefrequency circuit 406, Wireless Fidelity (WiFi, Wireless Fidelity) module 407, include the parts such as processor 408 and power supply 409 that more than or processes core.It will be understood by those skilled in the art that the restriction of the not structure paired terminal of the terminal structure shown in Fig. 4, the parts more more or less than diagram can be comprised, or combine some parts, or different parts are arranged.Wherein:
RF circuit 401 can be used for receiving and sending messages or in communication process, the reception of signal and transmission, especially, after being received by the downlink information of base station, transfer to more than one or one processor 408 to process; In addition, base station is sent to by relating to up data.Usually, RF circuit 401 includes but not limited to antenna, at least one amplifier, tuner, one or more oscillator, subscriber identity module (SIM, Subscriber IdentityModule) card, transceiver, coupling mechanism, low noise amplifier (LNA, Low Noise Amplifier), diplexer etc.In addition, RF circuit 401 can also by radio communication and network and other devices communicatings.Described radio communication can use arbitrary communication standard or agreement, include but not limited to global system for mobile communications (GSM, Global System of Mobile communication), general packet radio service (GPRS, General Packet Radio Service), CDMA (CDMA, Code Division MultipleAccess), Wideband Code Division Multiple Access (WCDMA) (WCDMA, Wideband Code Division Multiple Access), Long Term Evolution (LTE, Long Term Evolution), Email, Short Message Service (SMS, ShortMessaging Service) etc.
Storer 402 can be used for storing software program and module, and processor 408 is stored in software program and the module of storer 402 by running, thus performs the application of various function and data processing.Storer 402 mainly can comprise storage program district and store data field, and wherein, storage program district can store operating system, application program (such as sound-playing function, image player function etc.) etc. needed at least one function; Store data field and can store the data (such as voice data, phone directory etc.) etc. created according to the use of terminal.In addition, storer 402 can comprise high-speed random access memory, can also comprise nonvolatile memory, such as at least one disk memory, flush memory device or other volatile solid-state parts.Correspondingly, storer 402 can also comprise Memory Controller, to provide the access of processor 408 and input block 403 pairs of storeies 402.
Input block 403 can be used for the numeral or the character information that receive input, and produces and to arrange with user and function controls relevant keyboard, mouse, control lever, optics or trace ball signal and inputs.Particularly, in a specific embodiment, input block 403 can comprise Touch sensitive surface and other input equipments.Touch sensitive surface, also referred to as touch display screen or Trackpad, user can be collected or neighbouring touch operation (such as user uses any applicable object or the operations of annex on Touch sensitive surface or near Touch sensitive surface such as finger, stylus) thereon, and drive corresponding coupling arrangement according to the formula preset.Optionally, Touch sensitive surface can comprise touch detecting apparatus and touch controller two parts.Wherein, touch detecting apparatus detects the touch orientation of user, and detects the signal that touch operation brings, and sends signal to touch controller; Touch controller receives touch information from touch detecting apparatus, and converts it to contact coordinate, then gives processor 408, and the order that energy receiving processor 408 is sent also is performed.In addition, the polytypes such as resistance-type, condenser type, infrared ray and surface acoustic wave can be adopted to realize Touch sensitive surface.Except Touch sensitive surface, input block 403 can also comprise other input equipments.Particularly, other input equipments can include but not limited to one or more in physical keyboard, function key (such as volume control button, switch key etc.), trace ball, mouse, control lever etc.
Display unit 404 can be used for the various graphical user interface showing information or the information being supplied to user and the terminal inputted by user, and these graphical user interface can be made up of figure, text, icon, video and its combination in any.Display unit 404 can comprise display panel, optionally, the forms such as liquid crystal display (LCD, Liquid Crystal Display), Organic Light Emitting Diode (OLED, OrganicLight-Emitting Diode) can be adopted to configure display panel.Further, Touch sensitive surface can cover display panel, when Touch sensitive surface detects thereon or after neighbouring touch operation, sends processor 408 to determine the type of touch event, provide corresponding vision to export with preprocessor 408 on a display panel according to the type of touch event.Although in the diagram, Touch sensitive surface and display panel be as two independently parts realize inputting and input function, in certain embodiments, can by Touch sensitive surface and display panel integrated and realize input and output function.
Terminal also can comprise at least one sensor 405, such as optical sensor, motion sensor and other sensors.Particularly, optical sensor can comprise ambient light sensor and proximity transducer, and wherein, ambient light sensor the light and shade of environmentally light can regulate the brightness of display panel, and proximity transducer at fast mobile terminal to time in one's ear, can cut out display panel and/or backlight.As the one of motion sensor; Gravity accelerometer can detect the size of all directions (are generally three axles) acceleration; size and the direction of gravity can be detected time static, can be used for identifying the application (such as horizontal/vertical screen switching, dependent game, magnetometer pose calibrating) of mobile phone attitude, Vibration identification correlation function (such as passometer, knock) etc.; As for terminal also other sensors such as configurable gyroscope, barometer, hygrometer, thermometer, infrared ray sensor, do not repeat them here.
Voicefrequency circuit 406, loudspeaker, microphone can provide the audio interface between user and terminal.Voicefrequency circuit 406 can by receive voice data conversion after electric signal, be transferred to loudspeaker, by loudspeaker be converted to voice signal export; On the other hand, the voice signal of collection is converted to electric signal by microphone, voice data is converted to after being received by voicefrequency circuit 406, after again voice data output processor 408 being processed, through RF circuit 401 to send to such as another terminal, or export voice data to storer 402 to process further.Voicefrequency circuit 406 also may comprise earphone jack, to provide the communication of peripheral hardware earphone and terminal.
WiFi belongs to short range wireless transmission technology, and terminal can help user to send and receive e-mail by WiFi module 407, browse webpage and access streaming video etc., and its broadband internet wireless for user provides is accessed.Although Fig. 4 shows WiFi module 407, be understandable that, it does not belong to must forming of terminal, can omit in the scope of essence not changing invention as required completely.
Processor 408 is control centers of terminal, utilize the various piece of various interface and the whole mobile phone of connection, software program in storer 402 and/or module is stored in by running or performing, and call the data be stored in storer 402, perform various function and the process data of terminal, thus integral monitoring is carried out to mobile phone.Optionally, processor 408 can comprise one or more process core; Preferably, processor 408 accessible site application processor and modem processor, wherein, application processor mainly processes operating system, user interface and application program etc., and modem processor mainly processes radio communication.Be understandable that, above-mentioned modem processor also can not be integrated in processor 408.
Terminal also comprises the power supply 409(such as battery of powering to all parts), preferably, power supply can be connected with processor 408 logic by power-supply management system, thus realizes the functions such as management charging, electric discharge and power managed by power-supply management system.Power supply 409 can also comprise one or more direct current or AC power, recharging system, power failure detection circuit, power supply changeover device or the random component such as inverter, power supply status indicator.
Although not shown, terminal can also comprise camera, bluetooth module etc., does not repeat them here.Specifically in the present embodiment, processor 408 in terminal can according to following instruction, executable file corresponding for the process of one or more application program is loaded in storer 402, and the application program be stored in storer 402 is run by processor 408, thus realize various function:
Although not shown, terminal can also comprise camera, bluetooth module etc., does not repeat them here.Specifically in the present embodiment, the display unit of terminal is touch-screen display, terminal also includes storer, and one or more than one program, one of them or more than one program are stored in storer, and are configured to be performed by more than one or one processor state more than one or one routine package containing the instruction for carrying out following operation:
Obtain the first control leaf node list of current interface; Determine root node, set up access tree according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node; Based on this access tree, the child node under present node is traveled through; Obtain the second control leaf node list of current interface; When determining that this second control leaf node list is not equal to described first control leaf node list, this the second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that this redirect node (namely redirect node is trigger the node obtaining described second control leaf node list) is new present node; Determine whether present node is this root node, and the whether all accessed mistake of all child nodes of present node; If present node is not root node, and all accessed mistake of all child nodes of present node, then determine that the father node of this present node is new present node, and return the step performing and based on access tree, the child node under present node is traveled through; If determine, present node is root node, or present node has the child node of not yet accessed mistake, then return the step performing and travel through the node in this access tree.
Wherein, " travel through the child node under present node based on described access tree " specifically can be as follows for step:
When determining that this root node also exists the child node of not yet accessing, from the child node of not yet accessing, obtain a child node, as test node, this test node is tested, and access being completed this test node to be designated, such as, specifically can be as follows:
The Hash code value of this test node is set as the first code value, and wherein, the first code value is for identifying the characteristic of current interface; Initialize operation is carried out to this test node, and at end of operation this test node is designated and accesses.
Now, optionally, the number of child nodes of not yet accessing under present node can also be subtracted 1, to add up the number of child nodes of not yet accessing under present node, and can be also whether 0 determine whether root node also exists the child node of not yet accessing by the number of child nodes of not yet accessing under present node, such as, if whether the number of child nodes of not yet accessing is 0, then show there is not the child node of not yet accessing, otherwise, if the number of child nodes of not yet accessing is greater than 0, then show to there is the child node of not yet accessing, etc.
Optionally, forming closed loop to prevent from operating rear appearance " loop ", causing traversal to enter endless loop, can judge whether existing " loop ", namely, before adding in access tree by this second control leaf node list, following operation can also be performed:
Search in the father node of this redirect node and whether have the identical node of Hash code value; If exist, then delete described redirect node, determine that the node found is new present node, and return execution and determine whether present node is described root node, and the operation of the whether all accessed mistake of all child nodes of present node; If do not exist, then return the operation performing and described second control leaf node list to be added in described access tree.
In addition, it should be noted that, if the second control leaf node list equals this first control leaf node list, then directly can perform the operation of " determine whether present node is described root node, and the whether all accessed mistake of all child nodes of present node ".
Optionally, in order to improve traversal efficiency, avoid this redirect node follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, when determining that this second control leaf node list equals the first control leaf node list, this redirect node can also be deleted.
The execution of each operation specifically see embodiment above, can not repeat them here above.
As from the foregoing, the terminal of the present embodiment can obtain the first control leaf node list of current interface, determine root node, access tree is set up according to this root node and the first control leaf node list, make all nodes in this first control leaf node list as the child node of this root node, and determine that this root node is present node, then based on this access tree, the child node under present node is traveled through, after this, obtain the second control leaf node list of current interface, when determining that this second control leaf node list is not equal to the first control leaf node list, second control leaf node list is added in access tree, make the child node of all nodes as redirect node of the second control leaf node list, and determine that redirect node (redirect node is trigger the node obtaining this second control leaf node list) is new present node, when present node is not root node, and all child nodes of present node are all accessed out-of-date, determine that the father node of this present node is new present node, and return the step performing and based on this access tree, the child node under present node is traveled through, when determining that present node is described root node, or when present node has the child node of not yet accessed mistake, return the step performing and based on access tree, the child node under present node is traveled through.Due in this scenario, have employed and set up access tree according to root node and the first control leaf node list, make all nodes in the first control leaf node list as the child node of this root node, after this when getting the second control leaf node list being different from the first control leaf node list, again can using the child node of the second control leaf node list as redirect node, therefore, under can multiple different control leaf node list being added to same access tree, thus realize carrying out complete random ergodic object to all component at terminal applies interface, in terms of existing technologies, the nodes of traversal can be reduced, improve traversal efficiency, and, when the accessed action breaks of present tree control structure, whether can also change to current interface and judge, and adopt different processing modes to guarantee that control digital-to-analogue type and interface are consistent, therefore, to when the accessed action breaks of present tree control structure, also can not have an impact to the validity of traversal, be conducive to the efficiency and the effect that improve test.
And, due to when determining that this second control leaf node list equals the first control leaf node list, redirect node can be deleted, therefore, this redirect node can be avoided follow-up accessed again, and avoid traveling through (be nonsensical to the traversal of these NOT-function controls) to certain some NOT-function control, traversal efficiency can be improved.
Further, after the operation of each traverse node, can compare the interface before and after operation, and adopt different processing modes to avoid the appearance in " loop ", therefore, can the generation of anti-loops, avoid traversal to enter endless loop.And, because this programme the child node of random choose present node can reach the object of random access, therefore, can only according to for certain specific traversal order relative to prior art, seem more flexible, but also the generation of the situation that can prevent certain fixed route from causing MTTF stuck.
One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is that the hardware that can carry out instruction relevant by program has come, this program can be stored in a computer-readable recording medium, storage medium can comprise: ROM (read-only memory) (ROM, Read Only Memory), random access memory (RAM, Random Access Memory), disk or CD etc.
Above the method for testing at a kind of terminal applies interface that the embodiment of the present invention provides, device and system are described in detail, apply specific case herein to set forth principle of the present invention and embodiment, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for those skilled in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (13)
1. the method for testing at terminal applies interface, is characterized in that, comprising:
Obtain the first control leaf node list of current interface;
Determine root node, set up access tree according to described root node and described first control leaf node list, make all nodes in described first control leaf node list as the child node of described root node, and determine that described root node is present node;
Based on described access tree, the child node under present node is traveled through;
Obtain the second control leaf node list of current interface;
When determining that described second control leaf node list is not equal to described first control leaf node list, described second control leaf node list is added in described access tree, make the child node of all nodes as redirect node of described second control leaf node list, and determine that described redirect node is new present node, described redirect node is trigger the node obtaining described second control leaf node list;
Determine whether present node is described root node, and the whether all accessed mistake of all child nodes of present node;
If present node is not described root node, and all accessed mistake of all child nodes of present node, then determine that the father node of described present node is new present node, and return the step performing and based on described access tree, the child node under present node is traveled through;
If determine, present node is described root node, or present node has the child node of not yet accessed mistake, then return the step performing and travel through the child node under present node based on described access tree.
2. method according to claim 1, is characterized in that, describedly travels through the child node under present node based on described access tree, comprising:
When determining that described root node also exists the child node of not yet accessing, from the child node of not yet accessing, obtain a child node, as test node;
Described test node is tested, and accesses being completed described test node to be designated.
3. method according to claim 2, is characterized in that, describedly tests described test node, and accesses being completed described test node to be designated, and comprising:
The Hash code value of described test node is set as the first code value, and described first code value is for identifying the characteristic of current interface;
Initialize operation is carried out to described test node, and at end of operation described test node is designated and accesses.
4. method according to claim 3, is characterized in that, described described second control leaf node list is added in described access tree before, also comprise:
Search in the father node of described redirect node and whether have the identical node of Hash code value;
If exist, then delete described redirect node, determine that the node found is new present node, and return execution and determine whether present node is described root node, and the step of the whether all accessed mistake of all child nodes of present node;
If do not exist, then return the step performing and described second control leaf node list to be added in described access tree.
5. the method according to any one of Claims 1-4, is characterized in that, after the second control leaf node list of described acquisition current interface, also comprises:
If described second control leaf node list equals described first control leaf node list, then perform and determine whether present node is described root node, and the step of the whether all accessed mistake of all child nodes of present node.
6. method according to claim 5, is characterized in that, described in return execution and determine whether present node is described root node, and before the step of the whether all accessed mistake of all child nodes of present node, also to comprise:
Delete described redirect node.
7. the proving installation at terminal applies interface, is characterized in that, comprising:
First acquiring unit, for obtaining the first control leaf node list of current interface;
Set up unit, for determining root node, set up access tree according to described root node and described first control leaf node list, make all nodes in described first control leaf node list as the child node of described root node, and determine that described root node is present node;
Traversal Unit, for traveling through the child node under present node based on described access tree;
Second acquisition unit, for obtaining the second control leaf node list of current interface;
Adding device, during for determining that described second control leaf node list is not equal to described first control leaf node list, described second control leaf node list is added in described access tree, make the child node of all nodes as redirect node of described second control leaf node list, and determine that described redirect node is present node, described redirect node is trigger the node obtaining described second control leaf node list;
Judging unit, for determining whether present node is described root node, and the whether all accessed mistake of all child nodes of present node, determine that present node is described root node, or present node is when having the child node of not yet accessed mistake, triggers Traversal Unit and return the operation performing and based on described access tree, the child node under present node is traveled through;
Processing unit, for not being described root node at judging unit determination present node, and all child nodes of present node are all accessed out-of-date, the father node determining described present node is new present node, and triggers Traversal Unit and perform the operation traveled through the child node under present node based on described access tree.
8. the proving installation at terminal applies interface according to claim 7, is characterized in that, described Traversal Unit comprises node and obtains subelement and test subelement;
Node obtains subelement, during for determining that described root node also exists the child node of not yet accessing, obtains a child node, as test node from the child node of not yet accessing;
Test subelement, for testing described test node, and accesses being completed described test node to be designated.
9. the proving installation at terminal applies interface according to claim 8, is characterized in that,
Described test subelement, specifically for the Hash code value of described test node is set as the first code value, described first code value is for identifying the characteristic of current interface; Initialize operation is carried out to described test node, and at end of operation described test node is designated and accesses.
10. the proving installation at terminal applies interface according to claim 9, is characterized in that, also comprises the 3rd processing unit;
3rd processing unit, for search described redirect node father node in whether have the identical node of Hash code value; If exist, then delete described redirect node, determine that the node found is new present node, and trigger judging unit and perform and determine whether present node is described root node, and the operation of the whether all accessed mistake of all child nodes of present node; If do not exist, then described second control leaf node list is added to the operation in described access tree by the execution of triggering adding device.
The proving installation at 11. terminal applies interfaces according to any one of claim 7 to 10, is characterized in that,
Described judging unit, also for when determining that described second control leaf node list equals described first control leaf node list, performing and determining whether present node is described root node, and the operation of the whether all accessed mistake of all child nodes of present node.
The proving installation at 12. terminal applies interfaces according to claim 11, is characterized in that, also comprise delete cells;
Delete cells, for when determining that described second control leaf node list equals described first control leaf node list, deletes described redirect node.
13. 1 kinds of communication systems, is characterized in that, comprise the proving installation at the terminal applies interface described in any one of claim 7 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310507853.XA CN104572430B (en) | 2013-10-24 | 2013-10-24 | A kind of test method, the device and system at terminal applies interface |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310507853.XA CN104572430B (en) | 2013-10-24 | 2013-10-24 | A kind of test method, the device and system at terminal applies interface |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104572430A true CN104572430A (en) | 2015-04-29 |
| CN104572430B CN104572430B (en) | 2018-04-27 |
Family
ID=53088564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310507853.XA Active CN104572430B (en) | 2013-10-24 | 2013-10-24 | A kind of test method, the device and system at terminal applies interface |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104572430B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105281977A (en) * | 2015-10-21 | 2016-01-27 | 北京软件产品质量检测检验中心 | Method and system for testing intelligent performance based on binary-tree algorithm |
| CN105630686A (en) * | 2016-03-24 | 2016-06-01 | 厦门美图移动科技有限公司 | Traversal testing method and device for applications and mobile terminal |
| CN105790929A (en) * | 2016-04-19 | 2016-07-20 | 清华大学 | High-efficient access control method based on rule redundancy elimination in encryption environment |
| CN105868105A (en) * | 2016-03-24 | 2016-08-17 | 厦门美图移动科技有限公司 | Application traversal testing method and device, and mobile terminal |
| CN106294123A (en) * | 2016-07-22 | 2017-01-04 | 厦门美图移动科技有限公司 | A kind of travel through the method for route matching, device and mobile terminal in test |
| CN106294152A (en) * | 2016-08-09 | 2017-01-04 | 努比亚技术有限公司 | The traversal test device and method of application user interface |
| CN107515821A (en) * | 2016-06-17 | 2017-12-26 | 百度在线网络技术（北京）有限公司 | Components testing method and apparatus |
| CN108009078A (en) * | 2016-11-01 | 2018-05-08 | 腾讯科技（深圳）有限公司 | A kind of application interface traversal method, system and test equipment |
| CN109558321A (en) * | 2018-11-29 | 2019-04-02 | 北京远特科技股份有限公司 | Android device test method and device |
| CN109783343A (en) * | 2017-11-13 | 2019-05-21 | 北京嘀嘀无限科技发展有限公司 | Components testing method, apparatus, client device and computer readable storage medium |
| CN110737578A (en) * | 2018-07-20 | 2020-01-31 | 北京奇虎科技有限公司 | test application method and device |
| CN111123888A (en) * | 2019-12-19 | 2020-05-08 | 江苏中天科技软件技术有限公司 | Industrial control protocol testing method and system, electronic equipment and storage medium |
| CN111522548A (en) * | 2020-03-24 | 2020-08-11 | 北京三快在线科技有限公司 | Project function expansion method and device, electronic equipment and computer readable medium |
| CN111694754A (en) * | 2020-07-30 | 2020-09-22 | 北京字节跳动网络技术有限公司 | Application program testing method and device, electronic equipment and computer medium |
| CN112511434A (en) * | 2020-11-25 | 2021-03-16 | 广州技象科技有限公司 | Internet of things node access path planning method, device, equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1719786A (en) * | 2004-07-08 | 2006-01-11 | 中兴通讯股份有限公司 | Automatic testing system and method for command of command line interface of data communication apparatus |
| US20060085764A1 (en) * | 2004-10-15 | 2006-04-20 | Microsoft Corporation | System and method for making a user interface element visible |
| CN101286132A (en) * | 2008-06-02 | 2008-10-15 | 北京邮电大学 | Test method and system based on software defect mode |
| CN101334728A (en) * | 2008-07-28 | 2008-12-31 | 北京航空航天大学 | Interface creating method and platform based on XML document description |
| CN101350020A (en) * | 2008-07-29 | 2009-01-21 | 北京中星微电子有限公司 | Method, apparatus and system for verifying embedded type file system |
| CN101403967A (en) * | 2008-11-12 | 2009-04-08 | 恒生电子股份有限公司 | Interface preservation and indication method, client terminal and server |
| CN102299966A (en) * | 2011-09-06 | 2011-12-28 | 深圳中兴力维技术有限公司 | Method and device for loading data in large volume at WEB client |
-
2013
- 2013-10-24 CN CN201310507853.XA patent/CN104572430B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1719786A (en) * | 2004-07-08 | 2006-01-11 | 中兴通讯股份有限公司 | Automatic testing system and method for command of command line interface of data communication apparatus |
| US20060085764A1 (en) * | 2004-10-15 | 2006-04-20 | Microsoft Corporation | System and method for making a user interface element visible |
| CN101286132A (en) * | 2008-06-02 | 2008-10-15 | 北京邮电大学 | Test method and system based on software defect mode |
| CN101334728A (en) * | 2008-07-28 | 2008-12-31 | 北京航空航天大学 | Interface creating method and platform based on XML document description |
| CN101350020A (en) * | 2008-07-29 | 2009-01-21 | 北京中星微电子有限公司 | Method, apparatus and system for verifying embedded type file system |
| CN101403967A (en) * | 2008-11-12 | 2009-04-08 | 恒生电子股份有限公司 | Interface preservation and indication method, client terminal and server |
| CN102299966A (en) * | 2011-09-06 | 2011-12-28 | 深圳中兴力维技术有限公司 | Method and device for loading data in large volume at WEB client |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105281977B (en) * | 2015-10-21 | 2018-04-03 | 北京软件产品质量检测检验中心 | A kind of intelligent behaviour method of testing and system based on binary tree algorithm |
| CN105281977A (en) * | 2015-10-21 | 2016-01-27 | 北京软件产品质量检测检验中心 | Method and system for testing intelligent performance based on binary-tree algorithm |
| CN105630686A (en) * | 2016-03-24 | 2016-06-01 | 厦门美图移动科技有限公司 | Traversal testing method and device for applications and mobile terminal |
| CN105868105A (en) * | 2016-03-24 | 2016-08-17 | 厦门美图移动科技有限公司 | Application traversal testing method and device, and mobile terminal |
| CN105630686B (en) * | 2016-03-24 | 2018-12-18 | 厦门美图移动科技有限公司 | A kind of application traversal test method, equipment and mobile terminal |
| CN105790929B (en) * | 2016-04-19 | 2018-12-28 | 清华大学 | Access control method in a kind of encryption environment that rule-based redundancy is eliminated |
| CN105790929A (en) * | 2016-04-19 | 2016-07-20 | 清华大学 | High-efficient access control method based on rule redundancy elimination in encryption environment |
| CN107515821B (en) * | 2016-06-17 | 2021-08-31 | 百度在线网络技术（北京）有限公司 | Control testing method and device |
| CN107515821A (en) * | 2016-06-17 | 2017-12-26 | 百度在线网络技术（北京）有限公司 | Components testing method and apparatus |
| CN106294123A (en) * | 2016-07-22 | 2017-01-04 | 厦门美图移动科技有限公司 | A kind of travel through the method for route matching, device and mobile terminal in test |
| CN106294123B (en) * | 2016-07-22 | 2018-12-18 | 厦门美图移动科技有限公司 | The matched method, device and mobile terminal in path in a kind of test of traversal |
| CN106294152B (en) * | 2016-08-09 | 2019-03-12 | 努比亚技术有限公司 | Using the traversal test device and method of user interface |
| CN106294152A (en) * | 2016-08-09 | 2017-01-04 | 努比亚技术有限公司 | The traversal test device and method of application user interface |
| US10990511B2 (en) | 2016-11-01 | 2021-04-27 | Tencent Technology (Shenzhen) Company Limited | Apparatus and application interface traversing method |
| CN108009078A (en) * | 2016-11-01 | 2018-05-08 | 腾讯科技（深圳）有限公司 | A kind of application interface traversal method, system and test equipment |
| CN108009078B (en) * | 2016-11-01 | 2021-04-27 | 腾讯科技（深圳）有限公司 | Application interface traversal method, system and test equipment |
| CN109783343A (en) * | 2017-11-13 | 2019-05-21 | 北京嘀嘀无限科技发展有限公司 | Components testing method, apparatus, client device and computer readable storage medium |
| CN110737578A (en) * | 2018-07-20 | 2020-01-31 | 北京奇虎科技有限公司 | test application method and device |
| CN109558321A (en) * | 2018-11-29 | 2019-04-02 | 北京远特科技股份有限公司 | Android device test method and device |
| CN109558321B (en) * | 2018-11-29 | 2022-03-18 | 北京远特科技股份有限公司 | Android equipment testing method and device |
| CN111123888A (en) * | 2019-12-19 | 2020-05-08 | 江苏中天科技软件技术有限公司 | Industrial control protocol testing method and system, electronic equipment and storage medium |
| CN111522548A (en) * | 2020-03-24 | 2020-08-11 | 北京三快在线科技有限公司 | Project function expansion method and device, electronic equipment and computer readable medium |
| CN111694754A (en) * | 2020-07-30 | 2020-09-22 | 北京字节跳动网络技术有限公司 | Application program testing method and device, electronic equipment and computer medium |
| CN111694754B (en) * | 2020-07-30 | 2023-04-07 | 抖音视界有限公司 | Application program testing method and device, electronic equipment and computer medium |
| CN112511434A (en) * | 2020-11-25 | 2021-03-16 | 广州技象科技有限公司 | Internet of things node access path planning method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104572430B (en) | 2018-04-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104572430A (en) | Method, device and system for testing terminal application interface | |
| CN104123218B (en) | Method, device and system for code coverage test | |
| CN104965721A (en) | Method and apparatus for updating an application | |
| CN104951212A (en) | Method, device and system for processing desktop data of mobile terminal | |
| CN104636047A (en) | Method and device for operating objects in list and touch screen terminal | |
| CN103164322A (en) | Signature method and signature device for program crashing | |
| CN104954402A (en) | Application recommending method, system and apparatus | |
| CN104281394A (en) | Method and device for intelligently selecting words | |
| CN104965716A (en) | Icon updating method, client apparatus, and terminal apparatus | |
| CN104281600A (en) | Method and device for intelligent selecting words | |
| CN105302452A (en) | Gesture interaction-based operation method and device | |
| CN104134043B (en) | Content is hidden, separates method, device and the terminal hidden | |
| CN103177217B (en) | A kind of file scanning method, system and client and server | |
| CN103310009A (en) | Method, device and terminal for updating webpage data | |
| CN104965722A (en) | Method and apparatus for displaying information | |
| CN105530239A (en) | Multimedia data obtaining method and device | |
| CN104699501A (en) | Method and device for running application program | |
| CN105512150A (en) | Method and device for information search | |
| CN103399706A (en) | Page interaction method, device and terminal | |
| CN104951637A (en) | Method and device for obtaining training parameters | |
| CN105278925A (en) | Method and device for refuse cleaning of uninstalled software | |
| CN104123210A (en) | Method, device and system for testing performance of browser | |
| CN104978237A (en) | Method and device for repairing dynamic link library file | |
| CN104346128A (en) | Executing method and executing device of sound events | |
| CN104965825A (en) | Method and terminal for processing data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |