return a measurednode of the given condition node , without minimizing the result . since a minimizedcondition necessarily must contain two trees , this method sets the negative side to a token #script node never validinside an expression with an unreasonably high length so that it will never be chosen by #getminimized . concode_field_sep Node node concode_elem_sep MeasuredNode negative concode_elem_sep int length concode_elem_sep MeasuredNode positive concode_elem_sep Node placeholder concode_elem_sep Comparator<MeasuredNode> AST_LENGTH_COMPARATOR concode_elem_sep boolean changed concode_field_sep int compare concode_elem_sep Node getPlaceholder concode_elem_sep MeasuredNode addNode concode_elem_sep MeasuredNode getMinimized concode_elem_sep MeasuredNode change concode_elem_sep MeasuredNode addNot concode_elem_sep MinimizedCondition computeMinimizedCondition concode_elem_sep Node swapWithPlaceholderNode concode_elem_sep MeasuredNode cloneTree concode_elem_sep MinimizedCondition fromConditionNode concode_elem_sep MinimizedCondition setPlaceholder concode_elem_sep boolean isChanged concode_elem_sep MeasuredNode negate concode_elem_sep int estimateCostOneLevel concode_elem_sep Node getNode
MinimizedCondition function ( Node arg0 ) { Preconditions . checkNotNull ( arg0 . getParent ( ) ) ; Node loc0 = swapWithPlaceholderNode ( arg0 ) ; MeasuredNode loc1 = new MeasuredNode ( arg0 , 0 , false ) ; MeasuredNode loc2 = new MeasuredNode ( IR . script ( ) , Integer . MAX_VALUE , true ) ; return new MinimizedCondition ( loc1 , loc2 ) . setPlaceholder ( loc0 ) ; }