this method is called after all of the children of n have been visited . in this case , these children were visited by the visitor v . this is the last chance for the visitor to modify the tree rooted at n . this method will be called exactly the same number of times as entry is called . that is , for each node that is not overriden , enter and leave are each called exactly once . note that if old == n then the vistior should make a copy of n before modifying it . it should then return the modified copy . the default implementation of this method is to call #leave node , node , nodevisitor leave old , n , v , as most subclasses do not need to know the parent of the node n. concode_field_sep PlaceHolder placeHolder concode_field_sep Node visitEdgeNoOverride concode_elem_sep void finish concode_elem_sep void finish concode_elem_sep String toString concode_elem_sep Node override concode_elem_sep Node override concode_elem_sep NodeVisitor enter concode_elem_sep NodeVisitor enter concode_elem_sep Node visitEdge concode_elem_sep NodeVisitor begin concode_elem_sep Object shallowCopy
Node function ( Node arg0 , Node arg1 , Node arg2 , NodeVisitor arg3 ) { return leave ( arg1 , arg2 , arg3 ) ; }