void function ( final MathOperatorNode arg0 , final Deque < IMathTreeElement > arg1 ) { final List < IMathTreeElement > loc0 = arg0 . getChildren ( ) ; for ( int loc1 = loc0 . size ( ) ; loc1 > 0 ; loc1 -- ) { final IMathTreeElement loc2 = loc0 . get ( loc1 - 1 ) ; arg1 . push ( loc2 ) ; if ( loc2 instanceof MathOperatorNode ) { fillStack ( ( MathOperatorNode ) loc2 , arg1 ) ; } } }
helper method to create the evaluation ordered list . concode_field_sep RootNode root concode_elem_sep MathOperatorNode currentNode concode_elem_sep String id concode_field_sep IMathTreeElement getFirst concode_elem_sep boolean isSimple concode_elem_sep String toString concode_elem_sep String getId concode_elem_sep boolean usesFunction concode_elem_sep boolean usesFunction concode_elem_sep void attach concode_elem_sep void attach concode_elem_sep void attach concode_elem_sep void attach concode_elem_sep MathOperatorNode getRoot concode_elem_sep void moveUp concode_elem_sep List<IMathTreeElement> getEvaluationOrder