Here you can find the source of splitOrderByFirst(byte[] pattern, byte[] src, int offset)
public static byte[] splitOrderByFirst(byte[] pattern, byte[] src, int offset)
//package com.java2s; /*// w w w . j av a 2 s. com * Copyright [2017] [$author] * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ import java.util.Arrays; public class Main { public static byte[] splitOrderByFirst(byte[] pattern, byte[] src, int offset) { byte[] result; int match = firstMatch(pattern, src, offset); if (match < 0) { result = null; } else { if (match > 0) { result = Arrays.copyOfRange(src, offset, match); } else { result = new byte[0]; } } return result; } /** * @param pattern * @param src * @param offset * @return */ public static int firstMatch(byte[] pattern, byte[] src, int offset) { for (int i = 0; i < src.length; i++) { int pos = i + offset; if (isMatch(pattern, src, pos)) { return pos; } } return -1; } /** * @param pattern * @param src * @param offset * @return */ public static boolean isMatch(byte[] pattern, byte[] src, int offset) { int distance = src.length - pattern.length - offset; if (distance < 0) return false; for (int i = 0; i < pattern.length; i++) { if (pattern[i] != src[i + offset]) return false; } return true; } }