final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
final void sortModules(List<Module> modules, Sort... sortOptions) { if (modules.size() < 2) return; if (sortOptions == null || Sort.BY_ID.isContained(sortOptions) || sortOptions.length == 0) { Collections.sort(modules, new Comparator<Module>() { @Override if (Sort.BY_START_LEVEL.isContained(sortOptions)) { Collections.sort(modules); if (Sort.BY_DEPENDENCY.isContained(sortOptions)) { if (Sort.BY_START_LEVEL.isContained(sortOptions)) {
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }
/** * Tests if this option is contained in the specified options */ public boolean isContained(Sort... options) { for (Sort option : options) { if (equals(option)) { return true; } } return false; } }