lookup the counternode identified by the hieraryelements if it exists . returns null if no such counternode is found . must only be called on the root of the tree . concode_field_sep CounterNode curNode concode_elem_sep String hierarchy concode_elem_sep ArrayDeque<CounterNode> stack concode_elem_sep String QUOTED_SEP concode_elem_sep List<String> hierarchyElements concode_elem_sep DebugCounterImpl counter concode_elem_sep TreeMap<String,CounterNode> children concode_field_sep DebugCounterImpl next concode_elem_sep DebugCounterImpl getCounter concode_elem_sep Iterable<DebugCounterImpl> getCountersInHierarchy concode_elem_sep CounterNode newTree concode_elem_sep boolean hasNext concode_elem_sep void gotoNextNode concode_elem_sep List<String> getHierarchyElements concode_elem_sep List<String> getHierarchyElements concode_elem_sep CounterNode remove concode_elem_sep void remove concode_elem_sep boolean addModule concode_elem_sep void resetHierarchy concode_elem_sep DebugCounterImpl addCounter concode_elem_sep Iterator<DebugCounterImpl> iterator concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep void verifyIsRoot concode_elem_sep String getHierarchy
CounterNode function ( List < String > arg0 ) { CounterNode loc0 = this ; for ( String loc1 : arg0 ) { loc0 = loc0 . children . get ( loc1 ) ; if ( loc0 == null ) { break ; } } return loc0 ; }