Skip to content

Commit

Permalink
wip
Browse files Browse the repository at this point in the history
  • Loading branch information
hmottestad committed Feb 12, 2025
1 parent f8e6813 commit 014985c
Show file tree
Hide file tree
Showing 2 changed files with 42 additions and 42 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -49,42 +49,10 @@ static ByteString copy(CharSequence csq) {
*/
byte[] getBuffer();

@Override
default int compareTo(ByteString other) {
int n = Math.min(length(), other.length());
int k = 0;
while (k < n) {
char c1 = charAt(k);
char c2 = other.charAt(k);
if (c1 != c2) {
return c1 - c2;
}
k++;
}
return length() - other.length();
}

// /*
// * (non-Javadoc)
// * @see java.lang.Comparable#compareTo(java.lang.Object)
// */
// @Override
// default int compareTo(ByteString other) {
// int n = Math.min(length(), other.length());
//
// if (n == 0) {
// return length() - other.length();
// }
//
// byte[] buffer = getBuffer();
// byte[] buffer1 = other.getBuffer();
//
// int mismatch = Arrays.mismatch(buffer, buffer1);
// if (mismatch == -1) {
// return length() - other.length();
// }
//
// int k = mismatch;
// int k = 0;
// while (k < n) {
// char c1 = charAt(k);
// char c2 = other.charAt(k);
Expand All @@ -96,6 +64,38 @@ default int compareTo(ByteString other) {
// return length() - other.length();
// }

/*
* (non-Javadoc)
* @see java.lang.Comparable#compareTo(java.lang.Object)
*/
@Override
default int compareTo(ByteString other) {
int n = Math.min(length(), other.length());

if (n == 0) {
return length() - other.length();
}

byte[] buffer = getBuffer();
byte[] buffer1 = other.getBuffer();

int mismatch = Arrays.mismatch(buffer, buffer1);
if (mismatch == -1) {
return length() - other.length();
}

int k = mismatch;
while (k < n) {
char c1 = charAt(k);
char c2 = other.charAt(k);
if (c1 != c2) {
return c1 - c2;
}
k++;
}
return length() - other.length();
}

@Override
ByteString subSequence(int start, int end);

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -120,16 +120,16 @@ public static int longestCommonPrefix(CharSequence str1, CharSequence str2) {
return longestCommonPrefix(str1, str2, 0);
}

public static int longestCommonPrefix(CharSequence str1, CharSequence str2, int from) {
int len = Math.min(str1.length(), str2.length());
int delta = from;
while (delta < len && str1.charAt(delta) == str2.charAt(delta)) {
delta++;
}
return delta - from;
}
// public static int longestCommonPrefix(CharSequence str1, CharSequence str2, int from) {
// int len = Math.min(str1.length(), str2.length());
// int delta = from;
// while (delta < len && str1.charAt(delta) == str2.charAt(delta)) {
// delta++;
// }
// return delta - from;
// }

public static int longestCommonPrefixNew(CharSequence str1, CharSequence str2, int from) {
public static int longestCommonPrefix(CharSequence str1, CharSequence str2, int from) {

int len = Math.min(str1.length(), str2.length());
if (from >= len) {
Expand Down

0 comments on commit 014985c

Please sign in to comment.