extractFinalCandidates(pred, exprContext, conf);
expr.getChildren().get(i), ctx.getNewToOldExprMap().get(expr).getChildren().get(i)); extractFinalCandidates(expr.getChildren().get(i), ctx, conf);
extractFinalCandidates(pred, exprContext, conf);
expr.getChildren().get(i), ctx.getNewToOldExprMap().get(expr).getChildren().get(i)); extractFinalCandidates(expr.getChildren().get(i), ctx, conf);
/** * Walks through the top AND nodes and determine which of them are final * candidates. */ private static void extractFinalCandidates(ExprNodeDesc expr, ExprWalkerInfo ctx) { if (ctx.isCandidate(expr)) { ctx.addFinalCandidate(expr); return; } if (FunctionRegistry.isOpAnd(expr)) { // If the operator is AND, we need to determine if any of the children are // final candidates. for (Node ch : expr.getChildren()) { extractFinalCandidates((ExprNodeDesc) ch, ctx); } } }
extractFinalCandidates(pred, exprContext, conf);
extractFinalCandidates(pred, exprContext);
(ExprNodeDesc) expr.getChildren().get(i), ctx.getNewToOldExprMap().get(expr).getChildren().get(i)); extractFinalCandidates((ExprNodeDesc) expr.getChildren().get(i), ctx, conf);