FindBugs appeased

This commit is contained in:
Iskra Delta 2016-10-13 10:57:15 +00:00 committed by AndyScherzinger
parent 971fba2f3d
commit 350947bde5
No known key found for this signature in database
GPG key ID: 6CADC7E3523C308B
2 changed files with 6 additions and 4 deletions

View file

@ -39,6 +39,8 @@ import com.owncloud.android.ui.activity.Preferences;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
import edu.umd.cs.findbugs.annotations.SuppressFBWarnings;
/**
* Main Application of the project

View file

@ -291,7 +291,7 @@ public class FileStorageUtils {
List<File> files = new ArrayList<File>(Arrays.asList(filesArray));
Collections.sort(files, new Comparator<File>() {
@SuppressFBWarnings(value = "Bx")
@SuppressFBWarnings(value = "Bx", justification = "Would require stepping up API level")
public int compare(File o1, File o2) {
Long obj1 = o1.lastModified();
return multiplier * obj1.compareTo(o2.lastModified());
@ -309,7 +309,7 @@ public class FileStorageUtils {
final int multiplier = mSortAscending ? 1 : -1;
Collections.sort(files, new Comparator<OCFile>() {
@SuppressFBWarnings(value = "Bx")
@SuppressFBWarnings(value = "Bx", justification = "Would require stepping up API level")
public int compare(OCFile o1, OCFile o2) {
if (o1.isFolder() && o2.isFolder()) {
Long obj1 = o1.getFileLength();
@ -338,7 +338,7 @@ public class FileStorageUtils {
List<File> files = new ArrayList<File>(Arrays.asList(filesArray));
Collections.sort(files, new Comparator<File>() {
@SuppressFBWarnings(value = "Bx")
@SuppressFBWarnings(value = "Bx", justification = "Would require stepping up API level")
public int compare(File o1, File o2) {
if (o1.isDirectory() && o2.isDirectory()) {
Long obj1 = getFolderSize(o1);
@ -362,7 +362,7 @@ public class FileStorageUtils {
* Sorts list by Name
* @param files files to sort
*/
@SuppressFBWarnings(value = "Bx")
@SuppressFBWarnings(value = "Bx", justification = "Would require stepping up API level")
public static Vector<OCFile> sortOCFilesByName(Vector<OCFile> files){
final int multiplier = mSortAscending ? 1 : -1;