Community
Participate
Working Groups
int mid = 0;
char[] midName;
while (left <= right) {
mid = (left + right) /2;
mid = (left + right) / 2;
if (sortedFields[mid] == null) {
// abort and do a linear search
for (int i = 0, max2 = sortedFields.length; i < max2; i++) {
FieldBinding fieldBinding = sortedFields[i];
if (fieldBinding != null) {
char[] fieldName = fieldBinding.name;
if (compare(name, fieldBinding.name, nameLength, fieldName.length) == 0) {
return fieldBinding;
}
return null;
int compare = compare(name, midName = sortedFields[mid].name, nameLength, midName.length);
if (compare < 0) {
right = mid-1;