Examples of AJCComparableExpressionTree

joust.tree.annotatedtree.AJCComparableExpressionTree
Wrapper classes for the AJCTree nodes that implement a different scheme for equality testing than the regular ones. The semantics of equals on an AJCExpressionTree are that it returns true if the other expression is equivalent to this one (ie. One node could be replaced with the other in the tree without any affect on the output).

Examples of joust.tree.annotatedtree.AJCComparableExpressionTree


        log.debug("Invariant expressions: {}", Arrays.toString(invariantFinder.invariantExpressions.keySet().toArray()));


        Iterator<AJCComparableExpressionTree> iterator = invariantFinder.invariantExpressions.keySet().iterator();
        while (iterator.hasNext()) {
            AJCComparableExpressionTree expr = iterator.next();
            // Discard all expressions that aren't complicated enough to be worth moving..
            ExpressionComplexityClassifier classifier = new ExpressionComplexityClassifier();
            classifier.visitTree(expr.wrappedNode);


            if (classifier.getScore() < INVAR_COMPLEXITY_THRESHOLD) {

View Full Code Here

Examples of joust.tree.annotatedtree.AJCComparableExpressionTree

        Arrays.sort(keys, new InvariantExpressionComparator(invariants));


        log.info("Keys: {}", Arrays.toString(keys));
        log.info("Best one: {}", keys[0]);


        AJCComparableExpressionTree key = keys[0];
        Set<AJCTree> usages = invariants.get(key);


        // Unused ones will have a score of zero - so no further ones can be of use.
        if (usages.isEmpty()) {
            return;

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.