-
Notifications
You must be signed in to change notification settings - Fork 20
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Use alphanumeric and nest-aware sorting for
VisitOrder#createByName (…
…#36)
- Loading branch information
1 parent
983c427
commit d6b7a22
Showing
4 changed files
with
215 additions
and
20 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
148 changes: 148 additions & 0 deletions
148
src/main/java/net/fabricmc/mappingio/tree/AlphanumericComparator.java
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,148 @@ | ||
| // Copied from https://github.com/sawano/alphanumeric-comparator/blob/5756d78617d411fbda4c51fe13d410c85392e737/src/main/java/se/sawano/java/text/AlphanumericComparator.java | ||
|
|
||
| /* | ||
| * Copyright 2014 Daniel Sawano | ||
| * | ||
| * 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. | ||
| */ | ||
|
|
||
| package net.fabricmc.mappingio.tree; | ||
|
|
||
| import static java.nio.CharBuffer.wrap; | ||
| import static java.util.Objects.requireNonNull; | ||
|
|
||
| import java.nio.CharBuffer; | ||
| import java.text.Collator; | ||
| import java.util.Comparator; | ||
| import java.util.Locale; | ||
|
|
||
| class AlphanumericComparator implements Comparator<CharSequence> { | ||
| private final Collator collator; | ||
|
|
||
| /** | ||
| * Creates a comparator that will use lexicographical sorting of the non-numerical parts of the compared strings. | ||
| */ | ||
| AlphanumericComparator() { | ||
| collator = null; | ||
| } | ||
|
|
||
| /** | ||
| * Creates a comparator that will use locale-sensitive sorting of the non-numerical parts of the compared strings. | ||
| * | ||
| * @param locale The locale to use. | ||
| */ | ||
| AlphanumericComparator(Locale locale) { | ||
| this(Collator.getInstance(requireNonNull(locale))); | ||
| } | ||
|
|
||
| /** | ||
| * Creates a comparator that will use the given collator to sort the non-numerical parts of the compared strings. | ||
| * | ||
| * @param collator The collator to use. | ||
| */ | ||
| AlphanumericComparator(Collator collator) { | ||
| this.collator = requireNonNull(collator); | ||
| } | ||
|
|
||
| @Override | ||
| public int compare(CharSequence s1, CharSequence s2) { | ||
| CharBuffer b1 = wrap(s1); | ||
| CharBuffer b2 = wrap(s2); | ||
|
|
||
| while (b1.hasRemaining() && b2.hasRemaining()) { | ||
| moveWindow(b1); | ||
| moveWindow(b2); | ||
| int result = compare(b1, b2); | ||
|
|
||
| if (result != 0) { | ||
| return result; | ||
| } | ||
|
|
||
| prepareForNextIteration(b1); | ||
| prepareForNextIteration(b2); | ||
| } | ||
|
|
||
| return s1.length() - s2.length(); | ||
| } | ||
|
|
||
| private void moveWindow(CharBuffer buffer) { | ||
| int start = buffer.position(); | ||
| int end = buffer.position(); | ||
| boolean isNumerical = isDigit(buffer.get(start)); | ||
|
|
||
| while (end < buffer.limit() && isNumerical == isDigit(buffer.get(end))) { | ||
| ++end; | ||
|
|
||
| if (isNumerical && (start + 1 < buffer.limit()) && isZero(buffer.get(start)) && isDigit(buffer.get(end))) { | ||
| ++start; // trim leading zeros | ||
| } | ||
| } | ||
|
|
||
| buffer.position(start).limit(end); | ||
| } | ||
|
|
||
| private int compare(CharBuffer b1, CharBuffer b2) { | ||
| if (isNumerical(b1) && isNumerical(b2)) { | ||
| return compareNumerically(b1, b2); | ||
| } | ||
|
|
||
| return compareAsStrings(b1, b2); | ||
| } | ||
|
|
||
| private boolean isNumerical(CharBuffer buffer) { | ||
| return isDigit(buffer.charAt(0)); | ||
| } | ||
|
|
||
| private boolean isDigit(char c) { | ||
| if (collator == null) { | ||
| int intValue = (int) c; | ||
| return intValue >= 48 && intValue <= 57; | ||
| } | ||
|
|
||
| return Character.isDigit(c); | ||
| } | ||
|
|
||
| private int compareNumerically(CharBuffer b1, CharBuffer b2) { | ||
| int diff = b1.length() - b2.length(); | ||
|
|
||
| if (diff != 0) { | ||
| return diff; | ||
| } | ||
|
|
||
| for (int i = 0; i < b1.remaining() && i < b2.remaining(); ++i) { | ||
| int result = Character.compare(b1.charAt(i), b2.charAt(i)); | ||
|
|
||
| if (result != 0) { | ||
| return result; | ||
| } | ||
| } | ||
|
|
||
| return 0; | ||
| } | ||
|
|
||
| private void prepareForNextIteration(CharBuffer buffer) { | ||
| buffer.position(buffer.limit()).limit(buffer.capacity()); | ||
| } | ||
|
|
||
| private int compareAsStrings(CharBuffer b1, CharBuffer b2) { | ||
| if (collator != null) { | ||
| return collator.compare(b1.toString(), b2.toString()); | ||
| } | ||
|
|
||
| return b1.toString().compareTo(b2.toString()); | ||
| } | ||
|
|
||
| private boolean isZero(char c) { | ||
| return c == '0'; | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters