org.netbeans.modules.derby.SearchUtil Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you 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.
*/
package org.netbeans.modules.derby;
/**
*
* @author pj97932
*/
public class SearchUtil {
static final int FOUND = -1;
/** Returns the number of characters from the searchedFor string that are at the end of the buffer,
* or FOUND if found the whole string
**/
static int checkForString(String searchedFor, int searchStart, char[] buf, int bufLen) {
if (searchedFor.length() == 0)
throw new IllegalArgumentException();
if (searchStart > 0) {
// already have a substring
int res = checkPosition(searchedFor, searchStart, buf, bufLen, 0);
if (res == FOUND)
return FOUND;
}
for (int i = 0; i < bufLen; i++) {
if (buf[i] == searchedFor.charAt(searchStart)) {
// found the first character
int res = checkPosition(searchedFor, 0, buf, bufLen, i);
if (res != 0)
return res;
}
}
return 0;
}
/** Checks whether the buffer contains a portion of searchedFor from searchStart, starting from buffer
* position bufFrom.
* Returns the number of characters from the searchedFor string that are at the end of the buffer,
* or FOUND if found the whole string
*/
static int checkPosition(String searchedFor, int searchStart, char[] buf, int bufLen, int bufFrom) {
String realSearch = searchedFor.substring(searchStart);
for (int i = 0; i < realSearch.length(); i++) {
int bufPos = bufFrom + i;
if (bufPos >= bufLen) {
return searchStart + i;
}
if (buf[bufPos] != realSearch.charAt(i))
return 0;
}
return FOUND;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy