question: an nm intersection that terminates if any intersection is found . the sizes of both arguments are assumed to be so small , and the likelihood of an intersection so great , that it is not worth the cpu cost of sorting or the memory cost of hashing . concode_field_sep ConnectionSpec COMPATIBLE_TLS concode_elem_sep boolean supportsTlsExtensions concode_elem_sep ConnectionSpec CLEARTEXT concode_elem_sep String[] tlsVersions concode_elem_sep String[] cipherSuites concode_elem_sep CipherSuite[] APPROVED_CIPHER_SUITES concode_elem_sep boolean tls concode_elem_sep ConnectionSpec MODERN_TLS concode_field_sep Builder allEnabledCipherSuites concode_elem_sep void apply concode_elem_sep ConnectionSpec supportedSpec concode_elem_sep boolean isTls concode_elem_sep boolean isCompatible concode_elem_sep boolean supportsTlsExtensions concode_elem_sep Builder supportsTlsExtensions concode_elem_sep Builder allEnabledTlsVersions concode_elem_sep List<TlsVersion> tlsVersions concode_elem_sep Builder tlsVersions concode_elem_sep Builder tlsVersions concode_elem_sep ConnectionSpec build concode_elem_sep List<CipherSuite> cipherSuites concode_elem_sep Builder cipherSuites concode_elem_sep Builder cipherSuites concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep String toString
target: boolean function ( String [ ] arg0 , String [ ] arg1 ) { if ( arg0 == null || arg1 == null || arg0 . length == 0 || arg1 . length == 0 ) { return false ; } for ( String loc0 : arg0 ) { if ( contains ( arg1 , loc0 ) ) { return true ; } } return false ; }