List < T > function ( ) { List < T > loc0 = Generics . newArrayList ( size ) ; TreeShapedStack < T > loc1 = this ; for ( int loc2 = 0 ; loc2 < size ; ++ loc2 ) { loc0 . add ( loc1 . data ) ; loc1 = loc1 . pop ( ) ; } Collections . reverse ( loc0 ) ; return loc0 ; }
returns the current stack as a list concode_field_sep T data concode_elem_sep int size concode_elem_sep TreeShapedStack<T> previous concode_field_sep TreeShapedStack<T> pop concode_elem_sep int size concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep String internalToString concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep TreeShapedStack<T> push concode_elem_sep T peek