Map < String , Queue > function ( ) { Map < String , Queue > loc0 = new HashMap < String , Queue > ( ) ; if ( children == null ) { loc0 . put ( name , this ) ; return loc0 ; } for ( Queue loc1 : children ) { loc0 . putAll ( loc1 . getLeafQueues ( ) ) ; } return loc0 ; }
this method helps in maintaining the single data structure across queuemanager . now if we just maintain list of root queues we should be done . does n't return null . adds itself if this is leaf node . concode_field_sep String name concode_elem_sep Log LOG concode_elem_sep Map<String,AccessControlList> acls concode_elem_sep Set<Queue> children concode_elem_sep Object schedulingInfo concode_elem_sep QueueState state concode_elem_sep Properties props concode_field_sep void setName concode_elem_sep Map<String,AccessControlList> getAcls concode_elem_sep String getName concode_elem_sep void setProperties concode_elem_sep Properties getProperties concode_elem_sep Object getSchedulingInfo concode_elem_sep int compareTo concode_elem_sep void setAcls concode_elem_sep void setSchedulingInfo concode_elem_sep Map<String,Queue> getInnerQueues concode_elem_sep void copySchedulingInfo concode_elem_sep Set<Queue> getChildren concode_elem_sep QueueState getState concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep void setState concode_elem_sep String toString concode_elem_sep boolean isHierarchySameAs concode_elem_sep void addChild concode_elem_sep JobQueueInfo getJobQueueInfo