void function ( float arg0 ) { SortedMap < Float , QueueTask > loc0 = queue . headMap ( arg0 , true ) ; for ( QueueTask loc1 : loc0 . values ( ) ) { enqueueIn ( loc1 . req , loc1 . channel ) ; } loc0 . clear ( ) ; queueTime = arg0 ; }
when a queuetime advance is received , the inbound queue can be searched for tasks that are greater than the new queuetime . concode_field_sep ThreadGroup tgroup concode_elem_sep Logger logger concode_elem_sep float queueTime concode_elem_sep NavigableMap<Float,QueueTask> queue concode_elem_sep LinkedBlockingDeque<OneQueueEntry> inbound concode_elem_sep LinkedBlockingDeque<OneQueueEntry> outbound concode_elem_sep InboundWorker iworker concode_elem_sep Channel channel concode_elem_sep OutboundWorker oworker concode_elem_sep Request req concode_elem_sep float queueTime concode_field_sep void init concode_elem_sep void enqueueIn concode_elem_sep void enqueueResponse concode_elem_sep int compareTo concode_elem_sep void enqueueRequest concode_elem_sep void shutdown