RangedCollection < T > function ( int arg0 ) { levelCount = 0 ; levels . clear ( ) ; for ( Map . Entry < Entry , Integer > loc0 : running . entrySet ( ) ) { put ( loc0 . getValue ( ) . intValue ( ) , arg0 , loc0 . getKey ( ) . value ) ; } running . clear ( ) ; collection . optimize ( ) ; return collection ; }
stops everything at outputlocation and creates the optimized collection . concode_field_sep AnalyzeStack analyzeStack concode_elem_sep Map<Entry,Integer> running concode_elem_sep Set<K> nonactives concode_elem_sep List<Level> levels concode_elem_sep Set<Entry> actives concode_elem_sep int levelCount concode_elem_sep RangedCollection<T> collection concode_elem_sep T value concode_elem_sep K key concode_elem_sep int height concode_field_sep boolean isNotActive concode_elem_sep boolean alive concode_elem_sep void active concode_elem_sep void active concode_elem_sep void active concode_elem_sep void clean concode_elem_sep boolean isActive concode_elem_sep Entry getActiveEntry concode_elem_sep void push concode_elem_sep void put concode_elem_sep void pop concode_elem_sep void notactive concode_elem_sep void notactive concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep void override concode_elem_sep RangedCollection<T> createCollection