Output from changed object on application
AssigneeHewlett-Packard Development Company, L.P.
InventorsErez Bixon, Ofer Mekmal, Yoav Eilat
Life of this patent
Estimating the term…
Abstract
Human rules and heuristics may be applied in a logic determination to promote relevance of an output for testing due to a changed object on an application. The output comprises an indication of one or more objects from a plurality of available objects that are to be tested due to the changed object on the application.
Claims15
A method, using a computer processor to execute instructions, stored in a memory, to perform the steps of:
- using a first and a second algorithm to apply human rules and heuristics in a logic determination to select an output for testing due to a changed object on an application, wherein the output comprises an indication of one or more objects from a plurality of available objects that are to be tested due to the changed object on the application:
- executing instructions to collect the one or more objects of the plurality of available objects as more useful than other objects of the plurality of available objects for notification to a user of the application in view of the changed object;
- and
- executing instructions to withhold the other objects from notification to the user of the application as unlikely to be tested, under the human rules from expert advice.
A method, using a computer processor to execute instructions, stored in a memory, to perform the steps of:
- receiving an identification of a change on an application, wherein the change comprises one or more changed objects on the application;
- employing the one or more changed objects in a first algorithm of a first iteration to search for other objects that directly use the one or more changed objects;
- and
- applying rules in a second algorithm at an end of the first iteration to determine an input for the first algorithm in a second iteration, wherein applying rules in the second algorithm at the end of the first iteration to determine the input for the first algorithm in the second iteration comprises:
- employing the second algorithm to apply the rules, at the end of the first iteration to determine the input for the second iteration to comprise one of:
- an output of the first algorithm;
- a modified output of the first algorithm;
- or
- information that excludes an output, of the first, algorithm.
A method, using a computer processor to execute instructions, stored in a memory, to perform the steps of:
- receiving an identification of a change on an application, wherein the change comprises one or more changed objects on the application;
- employing the one or more changed objects in a first algorithm of a first iteration to search for other objects that directly use the one or more changed objects;
- and
- applying rules in a second algorithm at an end of the first iteration to determine an input for the first algorithm in a second iteration, wherein the step applying rules in the second algorithm at the end of the first iteration to determine the input for the first algorithm in the second iteration comprises:
- employing the second algorithm to apply the rules at the end of each iteration to determine an input for the first algorithm in a next iteration to comprise one of:
- an output of the first algorithm;
- a modified output of the first algorithm;
- or
- information that excludes an output of the first algorithm.
A method, using a computer processor to execute instructions, stored in a memory, to perform the steps of:
- receiving an identification of a change on an application, wherein the change comprises one or more changed objects on the application;
- employing the one or more changed objects in a first algorithm of a first iteration to search for other objects that directly use the one or more changed objects;
- and
- applying rules in a second algorithm at an end of the first iteration to determine an input for the first algorithm in a second iteration, wherein applying rules in the second algorithm includes:
- employing the second algorithm to apply the rules at the end of each iteration to determine the input for the subsequent iteration to comprise one of:
- an output of the first algorithm;
- a modified output of the first algorithm;
- or
- information that excludes an output of the first algorithm;
- providing output from iterations wherein each iteration comprises a strategy employed by a logic determination that checks the output from the second algorithm and determines whether a type of each object is one of a set of types determined for presentation to a user of the application;
- stopping the iterations and returning a subject object as the output from the iterations from the one or more changed objects upon:
- the first algorithm making a determination that further iteration on the subject object is unneeded;
- and
- the second algorithm making a determination to decline drop of the subject object through exclusion of the output of the first algorithm from a subsequent iteration;
- stopping the iterations and withholding the subject object as the output from the iterations from the one or more changed objects upon:
- the second algorithm making a determination to drop the subject object through exclusion of the output of the first algorithm from the subsequent iteration.
A method, using a computer processor to execute instructions, stored in a memory, to perform the steps of:
- running a first algorithm in parallel with a second algorithm;
- wherein the second algorithm completes the first algorithm through determination of a nature of an output of the first algorithm and how to proceed with the output;
- and
- wherein the step of running the first algorithm in parallel with the second algorithm comprises:
- executing instructions to operate the second algorithm on an output of the first algorithm in iteration through application of a set of rules and heuristics on each object that is determined by the first algorithm to directly use a changed object on an application;
- and
- executing instructions to employ a different set of rules and heuristics for each type of change created on an application.
Dependencies are inferred from the claim text.