List < Node > function ( ) { List < Node > loc0 = new ArrayList < > ( ancestors ) ; Collections . reverse ( loc0 ) ; return loc0 ; }
gets the ancestors of the current node , with the deepest node first . only exposed for testing purposes . concode_field_sep FunctionlessLocalScope iterator concode_elem_sep String varName concode_elem_sep Node lookAhead concode_elem_sep boolean valueHasSideEffects concode_elem_sep Stack<Node> ancestors concode_field_sep Node next concode_elem_sep Node next concode_elem_sep LocalVarMotion forVar concode_elem_sep Node current concode_elem_sep Node currentParent concode_elem_sep boolean hasNext concode_elem_sep boolean hasNext concode_elem_sep LocalVarMotion forAssign concode_elem_sep void advanceLookAhead concode_elem_sep void remove concode_elem_sep void remove