BitSet function ( AcceptanceRabin arg0 ) { BitSet loc0 = new BitSet ( ) ; int loc1 = arg0 . size ( ) ; for ( int loc2 = 0 ; loc2 < loc1 ; loc2 ++ ) { loc0 . or ( arg0 . get ( loc2 ) . getK ( ) ) ; } return loc0 ; }
get the union of the k_i states of a rabin acceptance condition . concode_field_sep PlaceHolder placeHolder concode_field_sep DA<BitSet,? extends AcceptanceOmega> simplifyAcceptance concode_elem_sep boolean isDFA