int function ( byte [ ] arg0 , byte [ ] arg1 ) { int [ ] loc0 = loc0 ( arg1 ) ; int loc1 = 0 ; for ( int loc2 = 0 ; loc2 < arg0 . length ; loc2 ++ ) { while ( loc1 > 0 && arg1 [ loc1 ] != arg0 [ loc2 ] ) loc1 = loc0 [ loc1 - 1 ] ; if ( arg1 [ loc1 ] == arg0 [ loc2 ] ) loc1 ++ ; if ( loc1 == arg1 . length ) return loc2 - arg1 . length + 1 ; } return - 1 ; }
knuth-morris-pratt algorithm to find a byte within a byte . concode_field_sep PlaceHolder placeHolder concode_field_sep ID3v2APICFrameBody parseID3v2APICFrameBody concode_elem_sep int[] failure concode_elem_sep ID3v2PRIVFrameBody parseID3v2PRIVFrameBody concode_elem_sep ID3v2TextFrameBody parseID3v2TextFrameBody concode_elem_sep ID3v2COMMFrameBody parseID3v2COMMFrameBody concode_elem_sep ID3v2TXXXFrameBody parseID3v2TXXXFrameBody concode_elem_sep ID3v2WXXXFrameBody parseID3v2WXXXFrameBody