mirror of
https://github.com/commons-app/apps-android-commons.git
synced 2025-10-27 12:53:55 +01:00
Fixing Codacy issues
This commit is contained in:
parent
c9ed77f696
commit
8edd90ef50
2 changed files with 13 additions and 3 deletions
|
|
@ -227,7 +227,8 @@ public class CategorizationFragment extends Fragment {
|
||||||
|
|
||||||
private Comparator<CategoryItem> sortBySimilarity(final String filter) {
|
private Comparator<CategoryItem> sortBySimilarity(final String filter) {
|
||||||
Comparator<String> stringSimilarityComparator = StringSortingUtils.sortBySimilarity(filter);
|
Comparator<String> stringSimilarityComparator = StringSortingUtils.sortBySimilarity(filter);
|
||||||
return (firstItem, secondItem) -> stringSimilarityComparator.compare(firstItem.getName(), secondItem.getName());
|
return (firstItem, secondItem) -> stringSimilarityComparator
|
||||||
|
.compare(firstItem.getName(), secondItem.getName());
|
||||||
}
|
}
|
||||||
|
|
||||||
private List<String> getStringList(List<CategoryItem> input) {
|
private List<String> getStringList(List<CategoryItem> input) {
|
||||||
|
|
|
||||||
|
|
@ -9,10 +9,19 @@ public class StringSortingUtils {
|
||||||
//no-op
|
//no-op
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Returns Comparator for sorting strings by its similarity with Levenshtein
|
||||||
|
* algorithm. By using this Comparator we get results from the highest to
|
||||||
|
* the lowest match.
|
||||||
|
*
|
||||||
|
* @param filter pattern to compare similarity
|
||||||
|
* @return Comparator with string similarity
|
||||||
|
*/
|
||||||
|
|
||||||
public static Comparator<String> sortBySimilarity(final String filter) {
|
public static Comparator<String> sortBySimilarity(final String filter) {
|
||||||
return (firstItem, secondItem) -> {
|
return (firstItem, secondItem) -> {
|
||||||
double firstItemSimilarity = StringSortingUtils.calculateSimilarity(firstItem, filter);
|
double firstItemSimilarity = calculateSimilarity(firstItem, filter);
|
||||||
double secondItemSimilarity = StringSortingUtils.calculateSimilarity(secondItem, filter);
|
double secondItemSimilarity = calculateSimilarity(secondItem, filter);
|
||||||
return (int) Math.signum(secondItemSimilarity - firstItemSimilarity);
|
return (int) Math.signum(secondItemSimilarity - firstItemSimilarity);
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue