int function ( final BSBundle arg0 ) { int loc0 = ( bopId < arg0 . bopId ) ? 1 : ( ( bopId == arg0 . bopId ) ? 0 : - 1 ) ; if ( loc0 == 0 ) { loc0 = ( shardId < arg0 . shardId ) ? 1 : ( ( shardId == arg0 . shardId ) ? 0 : - 1 ) ; } return loc0 ; }
this orders the bsbundle s by reverse #bopid and by #shardid if the #bopid is the same . this order imposes abias to draw entries with higher #bopid s from an ordered collection . note : query plans are assigned bopids from 0 through n where higher bopids are assigned to operators that occur later in the query plan . this is not a strict rule , but it is a strong bias . given that bias and an ordered map , this comparator will tend to draw from operatorsthat are further along in the query plan . this emphasizes getting results through the pipeline quickly . whether or not this comparator hasany effect depends on the chunkedrunningquery #consumechunk method and the backing map over the operator queues . if a hash map is used , then the comparator is ignored . if a skip list map is used , then the comparator will influence the manner in which theoperator queues are drained . concode_field_sep int bopId concode_elem_sep int shardId concode_field_sep int hashCode concode_elem_sep boolean equals concode_elem_sep String toString