From a42d2dccf085bbd7539a8e5939487a40bdaef78b Mon Sep 17 00:00:00 2001
From: Stefan Bodewig
Date: Wed, 31 Dec 2014 18:09:17 +0100
Subject: [PATCH 01/65] upgrade to latest XMLUnit
---
ivy.xml | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/ivy.xml b/ivy.xml
index 93515178..552f3e76 100644
--- a/ivy.xml
+++ b/ivy.xml
@@ -62,7 +62,7 @@
-
+
From e1276e0ac2407111d7bebd16e32a944660166ff6 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Nicolas=20Laleve=CC=81e?=
Date: Tue, 30 Dec 2014 17:55:53 +0100
Subject: [PATCH 02/65] use java 5 constructs
---
src/java/org/apache/ivy/Ivy.java | 17 +-
src/java/org/apache/ivy/ant/FixDepsTask.java | 10 +-
src/java/org/apache/ivy/ant/IvyBuildList.java | 123 +++++------
.../org/apache/ivy/ant/IvyDependency.java | 25 +--
src/java/org/apache/ivy/ant/IvyResolve.java | 27 +--
.../cache/DefaultRepositoryCacheManager.java | 19 +-
.../core/module/descriptor/Configuration.java | 20 +-
.../descriptor/DefaultModuleDescriptor.java | 119 +++++-----
.../ivy/core/module/id/MatcherLookup.java | 38 ++--
.../apache/ivy/core/module/id/ModuleId.java | 25 +--
.../ivy/core/module/id/ModuleRevisionId.java | 46 ++--
.../ivy/core/module/id/ModuleRules.java | 72 +++---
.../apache/ivy/core/report/ResolveReport.java | 92 ++++----
.../apache/ivy/core/resolve/ResolveData.java | 48 ++--
.../ivy/core/resolve/ResolveEngine.java | 107 +++++----
.../ivy/core/resolve/ResolveOptions.java | 7 +-
.../apache/ivy/core/resolve/VisitData.java | 10 +-
.../apache/ivy/core/resolve/VisitNode.java | 43 ++--
.../apache/ivy/core/search/SearchEngine.java | 192 ++++++++--------
.../apache/ivy/core/settings/IvySettings.java | 177 +++++++--------
.../org/apache/ivy/osgi/filter/AndFilter.java | 1 +
.../apache/ivy/osgi/filter/CompareFilter.java | 20 +-
.../ivy/osgi/filter/MultiOperatorFilter.java | 3 +
.../org/apache/ivy/osgi/filter/NotFilter.java | 1 +
.../apache/ivy/osgi/filter/OSGiFilter.java | 1 +
.../ivy/osgi/filter/OSGiFilterParser.java | 36 ++-
.../org/apache/ivy/osgi/filter/OrFilter.java | 1 +
.../ivy/osgi/filter/UniOperatorFilter.java | 3 +
.../org/apache/ivy/osgi/obr/OBRResolver.java | 6 +-
.../apache/ivy/osgi/obr/xml/OBRXMLParser.java | 20 +-
.../apache/ivy/osgi/p2/P2ArtifactParser.java | 8 +
.../apache/ivy/osgi/p2/P2CompositeParser.java | 4 +
.../apache/ivy/osgi/p2/P2MetadataParser.java | 30 +++
.../apache/ivy/osgi/p2/PropertiesParser.java | 3 +
.../ivy/osgi/repo/AbstractOSGiResolver.java | 75 ++++---
.../xml/EclipseUpdateSiteParser.java | 7 +-
.../osgi/updatesite/xml/FeatureParser.java | 15 +-
.../xml/UpdateSiteDigestParser.java | 6 +-
.../ivy/osgi/util/DelegatingHandler.java | 19 +-
.../conflict/AbstractConflictManager.java | 5 +-
.../ivy/plugins/conflict/ConflictManager.java | 5 +-
.../conflict/FixedConflictManager.java | 13 +-
.../LatestCompatibleConflictManager.java | 67 +++---
.../conflict/LatestConflictManager.java | 24 +-
.../plugins/conflict/NoConflictManager.java | 2 +-
.../conflict/RegexpConflictManager.java | 6 +-
.../conflict/StrictConflictManager.java | 7 +-
.../latest/AbstractLatestStrategy.java | 7 +-
.../latest/ComparatorLatestStrategy.java | 12 +-
.../latest/LatestLexicographicStrategy.java | 8 +-
.../latest/LatestRevisionStrategy.java | 36 +--
.../ivy/plugins/latest/LatestStrategy.java | 2 +-
.../plugins/latest/LatestTimeStrategy.java | 8 +-
.../matcher/AbstractPatternMatcher.java | 1 +
.../matcher/ExactOrRegexpPatternMatcher.java | 1 +
.../plugins/matcher/ExactPatternMatcher.java | 1 +
.../plugins/matcher/GlobPatternMatcher.java | 1 +
.../ivy/plugins/matcher/MapMatcher.java | 25 +--
.../plugins/matcher/RegexpPatternMatcher.java | 1 +
.../AbstractModuleDescriptorParser.java | 9 +-
.../ModuleDescriptorParserRegistry.java | 9 +-
.../ivy/plugins/parser/ParserSettings.java | 2 +-
.../plugins/parser/m2/PomDependencyMgt.java | 4 +-
.../parser/m2/PomModuleDescriptorBuilder.java | 95 ++++----
.../ivy/plugins/parser/m2/PomReader.java | 46 ++--
.../parser/xml/XmlModuleDescriptorParser.java | 44 ++--
.../repository/AbstractRepository.java | 1 +
.../ivy/plugins/repository/Repository.java | 4 +-
.../AbstractPatternsBasedResolver.java | 137 ++++++------
.../plugins/resolver/AbstractResolver.java | 5 +-
.../resolver/AbstractSshBasedResolver.java | 1 +
.../ivy/plugins/resolver/BasicResolver.java | 100 +++++----
.../ivy/plugins/resolver/BintrayResolver.java | 2 -
.../ivy/plugins/resolver/CacheResolver.java | 14 +-
.../ivy/plugins/resolver/ChainResolver.java | 74 +++----
.../plugins/resolver/DependencyResolver.java | 6 +-
.../ivy/plugins/resolver/DualResolver.java | 7 +
.../plugins/resolver/FileSystemResolver.java | 28 ++-
.../ivy/plugins/resolver/IBiblioResolver.java | 55 +++--
.../ivy/plugins/resolver/IvyRepResolver.java | 29 ++-
.../ivy/plugins/resolver/JarResolver.java | 2 +
.../plugins/resolver/MirroredURLResolver.java | 16 +-
.../plugins/resolver/RepositoryResolver.java | 24 +-
.../plugins/resolver/ResolverSettings.java | 2 +-
.../ivy/plugins/resolver/SFTPResolver.java | 1 +
.../ivy/plugins/resolver/SshResolver.java | 1 +
.../ivy/plugins/resolver/URLResolver.java | 1 +
.../ivy/plugins/resolver/VfsResolver.java | 2 +
.../ivy/plugins/resolver/VsftpResolver.java | 1 +
.../resolver/util/ApacheHttpURLLister.java | 3 +-
.../plugins/resolver/util/FileURLLister.java | 7 +-
.../resolver/util/ResolvedResource.java | 1 +
.../plugins/resolver/util/ResolverHelper.java | 34 ++-
.../ivy/plugins/resolver/util/URLLister.java | 2 +-
.../ivy/util/AbstractMessageLogger.java | 82 +------
.../apache/ivy/util/ContextualSAXHandler.java | 9 +-
.../apache/ivy/util/MessageLoggerEngine.java | 29 ++-
.../ivy/util/cli/CommandLineParser.java | 29 ++-
.../ivy/util/extendable/ExtendableItem.java | 6 +-
.../util/extendable/ExtendableItemHelper.java | 22 +-
.../UnmodifiableExtendableItem.java | 34 +--
.../apache/ivy/util/url/ApacheURLLister.java | 10 +-
.../ivy/core/module/id/ModuleIdTest.java | 13 --
.../apache/ivy/core/resolve/ResolveTest.java | 205 +++++++++---------
104 files changed, 1481 insertions(+), 1435 deletions(-)
diff --git a/src/java/org/apache/ivy/Ivy.java b/src/java/org/apache/ivy/Ivy.java
index c3799e92..6cbd02cc 100644
--- a/src/java/org/apache/ivy/Ivy.java
+++ b/src/java/org/apache/ivy/Ivy.java
@@ -24,7 +24,6 @@ import java.net.URL;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Collection;
-import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Properties;
@@ -45,6 +44,7 @@ import org.apache.ivy.core.publish.PublishEngine;
import org.apache.ivy.core.publish.PublishOptions;
import org.apache.ivy.core.report.ResolveReport;
import org.apache.ivy.core.repository.RepositoryManagementEngine;
+import org.apache.ivy.core.resolve.IvyNode;
import org.apache.ivy.core.resolve.ResolveData;
import org.apache.ivy.core.resolve.ResolveEngine;
import org.apache.ivy.core.resolve.ResolveOptions;
@@ -631,7 +631,7 @@ public class Ivy {
/**
* Sorts the collection of IvyNode from the less dependent to the more dependent
*/
- public List sortNodes(Collection nodes, SortOptions options) {
+ public List sortNodes(Collection nodes, SortOptions options) {
pushContext();
try {
return getSortEngine().sortNodes(nodes, options);
@@ -654,7 +654,8 @@ public class Ivy {
* if a circular dependency exists and circular dependency strategy decide to throw
* an exception
*/
- public List sortModuleDescriptors(Collection moduleDescriptors, SortOptions options) {
+ public List sortModuleDescriptors(
+ Collection moduleDescriptors, SortOptions options) {
pushContext();
try {
return getSortEngine().sortModuleDescriptors(moduleDescriptors, options);
@@ -750,7 +751,7 @@ public class Ivy {
}
}
- public String[] listTokenValues(String token, Map otherTokenValues) {
+ public String[] listTokenValues(String token, Map otherTokenValues) {
pushContext();
try {
return searchEngine.listTokenValues(token, otherTokenValues);
@@ -833,14 +834,12 @@ public class Ivy {
}
private void postConfigure() {
- Collection triggers = settings.getTriggers();
- for (Iterator iter = triggers.iterator(); iter.hasNext();) {
- Trigger trigger = (Trigger) iter.next();
+ List triggers = settings.getTriggers();
+ for (Trigger trigger : triggers) {
eventManager.addIvyListener(trigger, trigger.getEventFilter());
}
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
+ for (DependencyResolver resolver : settings.getResolvers()) {
if (resolver instanceof BasicResolver) {
((BasicResolver) resolver).setEventManager(eventManager);
}
diff --git a/src/java/org/apache/ivy/ant/FixDepsTask.java b/src/java/org/apache/ivy/ant/FixDepsTask.java
index 1be9222d..8695cb87 100644
--- a/src/java/org/apache/ivy/ant/FixDepsTask.java
+++ b/src/java/org/apache/ivy/ant/FixDepsTask.java
@@ -32,7 +32,7 @@ public class FixDepsTask extends IvyPostResolveTask {
private File dest;
- private List/* */keeps = new ArrayList();
+ private List keeps = new ArrayList();
public void setToFile(File dest) {
this.dest = dest;
@@ -59,6 +59,7 @@ public class FixDepsTask extends IvyPostResolveTask {
return k;
}
+ @Override
public void doExecute() throws BuildException {
prepareAndCheck();
@@ -72,10 +73,9 @@ public class FixDepsTask extends IvyPostResolveTask {
ResolveReport report = getResolvedReport();
- List/* */midToKeep = new ArrayList();
- for (int i = 0; i < keeps.size(); i++) {
- midToKeep.add(ModuleId.newInstance(((Keep) keeps.get(i)).org,
- ((Keep) keeps.get(i)).module));
+ List midToKeep = new ArrayList();
+ for (Keep keep : keeps) {
+ midToKeep.add(ModuleId.newInstance(keep.org, keep.module));
}
ModuleDescriptor md = report.toFixedModuleDescriptor(getSettings(), midToKeep);
diff --git a/src/java/org/apache/ivy/ant/IvyBuildList.java b/src/java/org/apache/ivy/ant/IvyBuildList.java
index 0620b49e..ba4b1a37 100644
--- a/src/java/org/apache/ivy/ant/IvyBuildList.java
+++ b/src/java/org/apache/ivy/ant/IvyBuildList.java
@@ -23,7 +23,6 @@ import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.ListIterator;
@@ -66,7 +65,7 @@ public class IvyBuildList extends IvyTask {
public static final String DESCRIPTOR_REQUIRED = "required";
- private List buildFileSets = new ArrayList(); // List (FileSet)
+ private List buildFileSets = new ArrayList();
private String reference;
@@ -152,6 +151,7 @@ public class IvyBuildList extends IvyTask {
this.onlydirectdep = onlydirectdep;
}
+ @Override
public void doExecute() throws BuildException {
if (reference == null) {
throw new BuildException("reference should be provided in ivy build list");
@@ -168,12 +168,12 @@ public class IvyBuildList extends IvyTask {
Path path = new Path(getProject());
- Map buildFiles = new HashMap(); // Map (ModuleDescriptor -> File buildFile)
- List independent = new ArrayList();
- List noDescriptor = new ArrayList();
- Collection mds = new ArrayList();
+ Map buildFiles = new HashMap();
+ List independent = new ArrayList();
+ List noDescriptor = new ArrayList();
+ Collection mds = new ArrayList();
- Set rootModuleNames = new LinkedHashSet();
+ Set rootModuleNames = new LinkedHashSet();
if (!"*".equals(root)) {
StringTokenizer st = new StringTokenizer(root, delimiter);
while (st.hasMoreTokens()) {
@@ -181,7 +181,7 @@ public class IvyBuildList extends IvyTask {
}
}
- Set leafModuleNames = new LinkedHashSet();
+ Set leafModuleNames = new LinkedHashSet();
if (!"*".equals(leaf)) {
StringTokenizer st = new StringTokenizer(leaf, delimiter);
while (st.hasMoreTokens()) {
@@ -189,15 +189,14 @@ public class IvyBuildList extends IvyTask {
}
}
- Set restartFromModuleNames = new LinkedHashSet();
+ Set restartFromModuleNames = new LinkedHashSet();
if (!"*".equals(restartFrom)) {
StringTokenizer st = new StringTokenizer(restartFrom, delimiter);
// Only accept one (first) module
restartFromModuleNames.add(st.nextToken());
}
- for (ListIterator iter = buildFileSets.listIterator(); iter.hasNext();) {
- FileSet fs = (FileSet) iter.next();
+ for (FileSet fs : buildFileSets) {
DirectoryScanner ds = fs.getDirectoryScanner(getProject());
String[] builds = ds.getIncludedFiles();
for (int i = 0; i < builds.length; i++) {
@@ -228,12 +227,12 @@ public class IvyBuildList extends IvyTask {
}
}
- List leafModuleDescriptors = convertModuleNamesToModuleDescriptors(mds, leafModuleNames,
- "leaf");
- List rootModuleDescriptors = convertModuleNamesToModuleDescriptors(mds, rootModuleNames,
- "root");
- List restartFromModuleDescriptors = convertModuleNamesToModuleDescriptors(mds,
- restartFromModuleNames, "restartFrom");
+ List leafModuleDescriptors = convertModuleNamesToModuleDescriptors(mds,
+ leafModuleNames, "leaf");
+ List rootModuleDescriptors = convertModuleNamesToModuleDescriptors(mds,
+ rootModuleNames, "root");
+ List restartFromModuleDescriptors = convertModuleNamesToModuleDescriptors(
+ mds, restartFromModuleNames, "restartFrom");
if (!rootModuleDescriptors.isEmpty()) {
Message.info("Filtering modules based on roots " + rootModuleNames);
@@ -244,16 +243,14 @@ public class IvyBuildList extends IvyTask {
mds = filterModulesFromLeaf(mds, leafModuleDescriptors);
}
- List sortedModules = ivy.sortModuleDescriptors(mds, SortOptions.DEFAULT);
+ List sortedModules = ivy.sortModuleDescriptors(mds, SortOptions.DEFAULT);
if (!OnMissingDescriptor.TAIL.equals(onMissingDescriptor)) {
- for (ListIterator iter = noDescriptor.listIterator(); iter.hasNext();) {
- File buildFile = (File) iter.next();
+ for (File buildFile : noDescriptor) {
addBuildFile(path, buildFile);
}
}
- for (ListIterator iter = independent.listIterator(); iter.hasNext();) {
- File buildFile = (File) iter.next();
+ for (File buildFile : independent) {
addBuildFile(path, buildFile);
}
if (isReverse()) {
@@ -264,11 +261,9 @@ public class IvyBuildList extends IvyTask {
// so they are not removed from build path.
if (!restartFromModuleDescriptors.isEmpty()) {
boolean foundRestartFrom = false;
- List keptModules = new ArrayList();
- ModuleDescriptor restartFromModuleDescriptor = (ModuleDescriptor) restartFromModuleDescriptors
- .get(0);
- for (ListIterator iter = sortedModules.listIterator(); iter.hasNext();) {
- ModuleDescriptor md = (ModuleDescriptor) iter.next();
+ List keptModules = new ArrayList();
+ ModuleDescriptor restartFromModuleDescriptor = restartFromModuleDescriptors.get(0);
+ for (ModuleDescriptor md : sortedModules) {
if (md.equals(restartFromModuleDescriptor)) {
foundRestartFrom = true;
}
@@ -279,18 +274,17 @@ public class IvyBuildList extends IvyTask {
sortedModules = keptModules;
}
StringBuffer order = new StringBuffer();
- for (ListIterator iter = sortedModules.listIterator(); iter.hasNext();) {
- ModuleDescriptor md = (ModuleDescriptor) iter.next();
+ for (ListIterator iter = sortedModules.listIterator(); iter.hasNext();) {
+ ModuleDescriptor md = iter.next();
order.append(md.getModuleRevisionId().getModuleId());
if (iter.hasNext()) {
order.append(", ");
}
- File buildFile = (File) buildFiles.get(md);
+ File buildFile = buildFiles.get(md);
addBuildFile(path, buildFile);
}
if (OnMissingDescriptor.TAIL.equals(onMissingDescriptor)) {
- for (ListIterator iter = noDescriptor.listIterator(); iter.hasNext();) {
- File buildFile = (File) iter.next();
+ for (File buildFile : noDescriptor) {
addBuildFile(path, buildFile);
}
}
@@ -299,7 +293,7 @@ public class IvyBuildList extends IvyTask {
getProject().setProperty("ivy.sorted.modules", order.toString());
}
- private void onMissingDescriptor(File buildFile, File ivyFile, List noDescriptor) {
+ private void onMissingDescriptor(File buildFile, File ivyFile, List noDescriptor) {
if (OnMissingDescriptor.SKIP.equals(onMissingDescriptor)) {
Message.debug("skipping " + buildFile + ": descriptor " + ivyFile + " doesn't exist");
} else if (OnMissingDescriptor.FAIL.equals(onMissingDescriptor)) {
@@ -323,12 +317,12 @@ public class IvyBuildList extends IvyTask {
}
}
- private List convertModuleNamesToModuleDescriptors(Collection mds, Set moduleNames, String kind) {
- List result = new ArrayList();
- Set foundModuleNames = new HashSet();
+ private List convertModuleNamesToModuleDescriptors(
+ Collection mds, Set moduleNames, String kind) {
+ List result = new ArrayList();
+ Set foundModuleNames = new HashSet();
- for (Iterator it = mds.iterator(); it.hasNext();) {
- ModuleDescriptor md = (ModuleDescriptor) it.next();
+ for (ModuleDescriptor md : mds) {
String name = md.getModuleRevisionId().getModuleId().getName();
if (moduleNames.contains(name)) {
foundModuleNames.add(name);
@@ -337,14 +331,14 @@ public class IvyBuildList extends IvyTask {
}
if (foundModuleNames.size() < moduleNames.size()) {
- Set missingModules = new HashSet(moduleNames);
+ Set missingModules = new HashSet(moduleNames);
missingModules.removeAll(foundModuleNames);
StringBuffer missingNames = new StringBuffer();
String sep = "";
- for (Iterator it = missingModules.iterator(); it.hasNext();) {
+ for (String name : missingModules) {
missingNames.append(sep);
- missingNames.append(it.next());
+ missingNames.append(name);
sep = ", ";
}
@@ -365,20 +359,17 @@ public class IvyBuildList extends IvyTask {
* root module
* @return filtered list of modules
*/
- private Collection filterModulesFromRoot(Collection mds, List rootmds) {
- // Make a map of ModuleId objects -> ModuleDescriptors
- Map moduleIdMap = new HashMap();
- for (Iterator iter = mds.iterator(); iter.hasNext();) {
- ModuleDescriptor md = ((ModuleDescriptor) iter.next());
+ private Collection filterModulesFromRoot(Collection mds,
+ List rootmds) {
+ Map moduleIdMap = new HashMap();
+ for (ModuleDescriptor md : mds) {
moduleIdMap.put(md.getModuleRevisionId().getModuleId(), md);
}
// recursively process the nodes
- Set toKeep = new LinkedHashSet();
+ Set toKeep = new LinkedHashSet();
- Iterator it = rootmds.iterator();
- while (it.hasNext()) {
- ModuleDescriptor rootmd = (ModuleDescriptor) it.next();
+ for (ModuleDescriptor rootmd : rootmds) {
processFilterNodeFromRoot(rootmd, toKeep, moduleIdMap);
// With the excluderoot attribute set to true, take the rootmd out of the toKeep set.
if (excludeRoot) {
@@ -391,8 +382,7 @@ public class IvyBuildList extends IvyTask {
}
// just for logging
- for (Iterator iter = toKeep.iterator(); iter.hasNext();) {
- ModuleDescriptor md = ((ModuleDescriptor) iter.next());
+ for (ModuleDescriptor md : toKeep) {
Message.verbose("Kept module " + md.getModuleRevisionId().getModuleId().getName());
}
@@ -411,13 +401,14 @@ public class IvyBuildList extends IvyTask {
* @param moduleIdMap
* reference mapping of moduleId to ModuleDescriptor that are part of the BuildList
*/
- private void processFilterNodeFromRoot(ModuleDescriptor node, Set toKeep, Map moduleIdMap) {
+ private void processFilterNodeFromRoot(ModuleDescriptor node, Set toKeep,
+ Map moduleIdMap) {
// toKeep.add(node);
DependencyDescriptor[] deps = node.getDependencies();
for (int i = 0; i < deps.length; i++) {
ModuleId id = deps[i].getDependencyId();
- ModuleDescriptor md = (ModuleDescriptor) moduleIdMap.get(id);
+ ModuleDescriptor md = moduleIdMap.get(id);
// we test if this module id has a module descriptor, and if it isn't already in the
// toKeep Set, in which there's probably a circular dependency
if (md != null && !toKeep.contains(md)) {
@@ -439,19 +430,16 @@ public class IvyBuildList extends IvyTask {
* leaf module
* @return filtered list of modules
*/
- private Collection filterModulesFromLeaf(Collection mds, List leafmds) {
- // Make a map of ModuleId objects -> ModuleDescriptors
- Map moduleIdMap = new HashMap();
- for (Iterator iter = mds.iterator(); iter.hasNext();) {
- ModuleDescriptor md = ((ModuleDescriptor) iter.next());
+ private Collection filterModulesFromLeaf(Collection mds,
+ List leafmds) {
+ Map moduleIdMap = new HashMap();
+ for (ModuleDescriptor md : mds) {
moduleIdMap.put(md.getModuleRevisionId().getModuleId(), md);
}
// recursively process the nodes
- Set toKeep = new LinkedHashSet();
- Iterator it = leafmds.iterator();
- while (it.hasNext()) {
- ModuleDescriptor leafmd = (ModuleDescriptor) it.next();
+ Set toKeep = new LinkedHashSet();
+ for (ModuleDescriptor leafmd : leafmds) {
// With the excludeleaf attribute set to true, take the rootmd out of the toKeep set.
if (excludeLeaf) {
Message.verbose("Excluded module "
@@ -463,8 +451,7 @@ public class IvyBuildList extends IvyTask {
}
// just for logging
- for (Iterator iter = toKeep.iterator(); iter.hasNext();) {
- ModuleDescriptor md = ((ModuleDescriptor) iter.next());
+ for (ModuleDescriptor md : toKeep) {
Message.verbose("Kept module " + md.getModuleRevisionId().getModuleId().getName());
}
@@ -482,9 +469,9 @@ public class IvyBuildList extends IvyTask {
* @param moduleIdMap
* reference mapping of moduleId to ModuleDescriptor that are part of the BuildList
*/
- private void processFilterNodeFromLeaf(ModuleDescriptor node, Set toKeep, Map moduleIdMap) {
- for (Iterator iter = moduleIdMap.values().iterator(); iter.hasNext();) {
- ModuleDescriptor md = (ModuleDescriptor) iter.next();
+ private void processFilterNodeFromLeaf(ModuleDescriptor node, Set toKeep,
+ Map moduleIdMap) {
+ for (ModuleDescriptor md : moduleIdMap.values()) {
DependencyDescriptor[] deps = md.getDependencies();
for (int i = 0; i < deps.length; i++) {
ModuleId id = deps[i].getDependencyId();
diff --git a/src/java/org/apache/ivy/ant/IvyDependency.java b/src/java/org/apache/ivy/ant/IvyDependency.java
index dbc8f215..051a55ad 100644
--- a/src/java/org/apache/ivy/ant/IvyDependency.java
+++ b/src/java/org/apache/ivy/ant/IvyDependency.java
@@ -18,7 +18,6 @@
package org.apache.ivy.ant;
import java.util.ArrayList;
-import java.util.Iterator;
import java.util.List;
import org.apache.ivy.core.module.descriptor.DefaultDependencyDescriptor;
@@ -32,13 +31,13 @@ import org.apache.tools.ant.BuildException;
public class IvyDependency {
- private List/* */confs = new ArrayList();
+ private List confs = new ArrayList();
- private List/* */artifacts = new ArrayList();
+ private List artifacts = new ArrayList();
- private List/* */excludes = new ArrayList();
+ private List excludes = new ArrayList();
- private List/* */includes = new ArrayList();
+ private List includes = new ArrayList();
private String org;
@@ -161,28 +160,20 @@ public class IvyDependency {
dd.addDependencyConfiguration(masterConf, "*");
}
- Iterator itConfs = confs.iterator();
- while (itConfs.hasNext()) {
- IvyDependencyConf c = (IvyDependencyConf) itConfs.next();
+ for (IvyDependencyConf c : confs) {
c.addConf(dd, masterConf);
}
- Iterator itArtifacts = artifacts.iterator();
- while (itArtifacts.hasNext()) {
- IvyDependencyArtifact artifact = (IvyDependencyArtifact) itArtifacts.next();
+ for (IvyDependencyArtifact artifact : artifacts) {
artifact.addArtifact(dd, masterConf);
}
- Iterator itExcludes = excludes.iterator();
- while (itExcludes.hasNext()) {
- IvyDependencyExclude exclude = (IvyDependencyExclude) itExcludes.next();
+ for (IvyDependencyExclude exclude : excludes) {
DefaultExcludeRule rule = exclude.asRule(settings);
dd.addExcludeRule(masterConf, rule);
}
- Iterator itIncludes = includes.iterator();
- while (itIncludes.hasNext()) {
- IvyDependencyInclude include = (IvyDependencyInclude) itIncludes.next();
+ for (IvyDependencyInclude include : includes) {
DefaultIncludeRule rule = include.asRule(settings);
dd.addIncludeRule(masterConf, rule);
}
diff --git a/src/java/org/apache/ivy/ant/IvyResolve.java b/src/java/org/apache/ivy/ant/IvyResolve.java
index 5dd77577..c700421b 100644
--- a/src/java/org/apache/ivy/ant/IvyResolve.java
+++ b/src/java/org/apache/ivy/ant/IvyResolve.java
@@ -23,7 +23,6 @@ import java.text.ParseException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
-import java.util.Iterator;
import java.util.List;
import org.apache.ivy.Ivy;
@@ -91,11 +90,11 @@ public class IvyResolve extends IvyTask {
private boolean checkIfChanged = true; // for backward compatibility
- private List/* */dependencies = new ArrayList();
+ private List dependencies = new ArrayList();
- private List/* */excludes = new ArrayList();
+ private List excludes = new ArrayList();
- private List/* */conflicts = new ArrayList();
+ private List conflicts = new ArrayList();
public boolean isUseOrigin() {
return useOrigin;
@@ -229,11 +228,13 @@ public class IvyResolve extends IvyTask {
return c;
}
+ @Override
protected void prepareTask() {
super.prepareTask();
Message.setShowProgress(showProgress);
}
+ @Override
public void doExecute() throws BuildException {
Ivy ivy = getIvyInstance();
IvySettings settings = ivy.getSettings();
@@ -267,24 +268,18 @@ public class IvyResolve extends IvyTask {
Ivy.getWorkingRevision());
DefaultModuleDescriptor md = DefaultModuleDescriptor.newBasicInstance(mrid, null);
- Iterator itDeps = dependencies.iterator();
- while (itDeps.hasNext()) {
- IvyDependency dep = (IvyDependency) itDeps.next();
+ for (IvyDependency dep : dependencies) {
DependencyDescriptor dd = dep.asDependencyDescriptor(md, "default", settings);
md.addDependency(dd);
}
- Iterator itExcludes = excludes.iterator();
- while (itExcludes.hasNext()) {
- IvyExclude exclude = (IvyExclude) itExcludes.next();
+ for (IvyExclude exclude : excludes) {
DefaultExcludeRule rule = exclude.asRule(settings);
rule.addConfiguration("default");
md.addExcludeRule(rule);
}
- Iterator itConflicts = conflicts.iterator();
- while (itConflicts.hasNext()) {
- IvyConflict conflict = (IvyConflict) itConflicts.next();
+ for (IvyConflict conflict : conflicts) {
conflict.addConflict(md, settings);
}
@@ -426,9 +421,9 @@ public class IvyResolve extends IvyTask {
}
}
- protected Collection/* */getAllowedLogOptions() {
- return Arrays.asList(new String[] {LogOptions.LOG_DEFAULT, LogOptions.LOG_DOWNLOAD_ONLY,
- LogOptions.LOG_QUIET});
+ protected Collection getAllowedLogOptions() {
+ return Arrays.asList(LogOptions.LOG_DEFAULT, LogOptions.LOG_DOWNLOAD_ONLY,
+ LogOptions.LOG_QUIET);
}
private ResolveOptions getResolveOptions(Ivy ivy, String[] confs, IvySettings settings) {
diff --git a/src/java/org/apache/ivy/core/cache/DefaultRepositoryCacheManager.java b/src/java/org/apache/ivy/core/cache/DefaultRepositoryCacheManager.java
index 55f498d2..a950c0bd 100644
--- a/src/java/org/apache/ivy/core/cache/DefaultRepositoryCacheManager.java
+++ b/src/java/org/apache/ivy/core/cache/DefaultRepositoryCacheManager.java
@@ -26,8 +26,8 @@ import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.text.ParseException;
import java.util.Date;
-import java.util.Iterator;
import java.util.Map;
+import java.util.Map.Entry;
import java.util.regex.Pattern;
import org.apache.ivy.Ivy;
@@ -114,7 +114,7 @@ public class DefaultRepositoryCacheManager implements RepositoryCacheManager, Iv
private Boolean useOrigin;
- private ModuleRules/* */ttlRules = new ModuleRules();
+ private ModuleRules ttlRules = new ModuleRules();
private Long defaultTTL = null;
@@ -239,16 +239,16 @@ public class DefaultRepositoryCacheManager implements RepositoryCacheManager, Iv
this.changingPattern = changingPattern;
}
- public void addTTL(Map attributes, PatternMatcher matcher, long duration) {
+ public void addTTL(Map attributes, PatternMatcher matcher, long duration) {
ttlRules.defineRule(new MapMatcher(attributes, matcher), new Long(duration));
}
- public void addConfiguredTtl(Map/* */attributes) {
- String duration = (String) attributes.remove("duration");
+ public void addConfiguredTtl(Map attributes) {
+ String duration = attributes.remove("duration");
if (duration == null) {
throw new IllegalArgumentException("'duration' attribute is mandatory for ttl");
}
- String matcher = (String) attributes.remove("matcher");
+ String matcher = attributes.remove("matcher");
addTTL(attributes,
matcher == null ? ExactPatternMatcher.INSTANCE : settings.getMatcher(matcher),
parseDuration(duration));
@@ -531,10 +531,8 @@ public class DefaultRepositoryCacheManager implements RepositoryCacheManager, Iv
// try to find other cached artifact info with same location. This must be the
// origin. We must parse the key as we do not know for sure what the original
// artifact is named.
- Iterator it = cdf.entrySet().iterator();
String ownLocationKey = getLocationKey(artifact);
- while (it.hasNext()) {
- Map.Entry entry = (Map.Entry) it.next();
+ for (Entry
*/
-public class ModuleRules {
- private Map/* */rules = new LinkedHashMap();
+public class ModuleRules {
+
+ private Map rules = new LinkedHashMap();
private MatcherLookup matcher_lookup = new MatcherLookup();
@@ -60,10 +61,10 @@ public class ModuleRules {
public ModuleRules() {
}
- private ModuleRules(Map/* */rules) {
- this.rules = new LinkedHashMap(rules);
- for (Iterator iter = rules.keySet().iterator(); iter.hasNext();) {
- matcher_lookup.add((MapMatcher) iter.next());
+ private ModuleRules(Map rules) {
+ this.rules = new LinkedHashMap(rules);
+ for (MapMatcher matcher : rules.keySet()) {
+ matcher_lookup.add(matcher);
}
}
@@ -75,7 +76,7 @@ public class ModuleRules {
* @param rule
* the rule to apply. Must not be null.
*/
- public void defineRule(MapMatcher condition, Object rule) {
+ public void defineRule(MapMatcher condition, T rule) {
Checks.checkNotNull(condition, "condition");
Checks.checkNotNull(rule, "rule");
@@ -93,8 +94,8 @@ public class ModuleRules {
* applies.
* @see #getRule(ModuleId, Filter)
*/
- public Object getRule(ModuleId mid) {
- return getRule(mid, NoFilter.INSTANCE);
+ public T getRule(ModuleId mid) {
+ return getRule(mid, NoFilter. instance());
}
/**
@@ -105,8 +106,8 @@ public class ModuleRules {
* the {@link ModuleId} to search the rule for. Must not be null.
* @return an array of rule objects matching the given {@link ModuleId}.
*/
- public Object[] getRules(ModuleId mid) {
- return getRules(mid.getAttributes(), NoFilter.INSTANCE);
+ public T[] getRules(ModuleId mid) {
+ return getRules(mid.getAttributes(), NoFilter. instance());
}
/**
@@ -120,8 +121,8 @@ public class ModuleRules {
* no rule applies.
* @see #getRule(ModuleRevisionId, Filter)
*/
- public Object getRule(ModuleRevisionId mrid) {
- return getRule(mrid, NoFilter.INSTANCE);
+ public T getRule(ModuleRevisionId mrid) {
+ return getRule(mrid, NoFilter. instance());
}
/**
@@ -140,7 +141,7 @@ public class ModuleRules {
* applies.
* @see #getRule(ModuleRevisionId, Filter)
*/
- public Object getRule(ModuleId mid, Filter filter) {
+ public T getRule(ModuleId mid, Filter filter) {
Checks.checkNotNull(mid, "mid");
return getRule(mid.getAttributes(), filter);
}
@@ -161,18 +162,17 @@ public class ModuleRules {
* no rule applies.
* @see #getRule(ModuleRevisionId)
*/
- public Object getRule(ModuleRevisionId mrid, Filter filter) {
+ public T getRule(ModuleRevisionId mrid, Filter filter) {
Checks.checkNotNull(mrid, "mrid");
Checks.checkNotNull(filter, "filter");
- Map moduleAttributes = mrid.getAttributes();
+ Map moduleAttributes = mrid.getAttributes();
return getRule(moduleAttributes, filter);
}
- private Object getRule(Map moduleAttributes, Filter filter) {
- List matchers = matcher_lookup.get(moduleAttributes);
- for (Iterator iter = matchers.iterator(); iter.hasNext();) {
- MapMatcher midm = (MapMatcher) iter.next();
- Object rule = rules.get(midm);
+ private T getRule(Map moduleAttributes, Filter filter) {
+ List matchers = matcher_lookup.get(moduleAttributes);
+ for (MapMatcher midm : matchers) {
+ T rule = rules.get(midm);
if (filter.accept(rule)) {
return rule;
}
@@ -193,24 +193,23 @@ public class ModuleRules {
* {@link ModuleRevisionId}. Must not be null.
* @return an array of rule objects matching the given {@link ModuleRevisionId}.
*/
- public Object[] getRules(ModuleRevisionId mrid, Filter filter) {
+ public T[] getRules(ModuleRevisionId mrid, Filter filter) {
Checks.checkNotNull(mrid, "mrid");
Checks.checkNotNull(filter, "filter");
- Map moduleAttributes = mrid.getAttributes();
+ Map moduleAttributes = mrid.getAttributes();
return getRules(moduleAttributes, filter);
}
- private Object[] getRules(Map moduleAttributes, Filter filter) {
- List matchers = matcher_lookup.get(moduleAttributes);
- List matchingRules = new ArrayList();
- for (Iterator iter = matchers.iterator(); iter.hasNext();) {
- MapMatcher midm = (MapMatcher) iter.next();
- Object rule = rules.get(midm);
+ private T[] getRules(Map moduleAttributes, Filter filter) {
+ List matchers = matcher_lookup.get(moduleAttributes);
+ List matchingRules = new ArrayList();
+ for (MapMatcher midm : matchers) {
+ T rule = rules.get(midm);
if (filter.accept(rule)) {
matchingRules.add(rule);
}
}
- return matchingRules.toArray();
+ return matchingRules.toArray((T[]) new Object[0]);
}
/**
@@ -223,9 +222,9 @@ public class ModuleRules {
if (rules.isEmpty()) {
Message.debug(prefix + "NONE");
} else {
- for (Iterator iter = rules.keySet().iterator(); iter.hasNext();) {
- MapMatcher midm = (MapMatcher) iter.next();
- Object rule = rules.get(midm);
+ for (Entry entry : rules.entrySet()) {
+ MapMatcher midm = entry.getKey();
+ T rule = entry.getValue();
Message.debug(prefix + midm + " -> " + rule);
}
}
@@ -240,11 +239,12 @@ public class ModuleRules {
*
* @return an unmodifiable view of all the rules defined on this ModuleRules.
*/
- public Map/* */getAllRules() {
+ public Map getAllRules() {
return Collections.unmodifiableMap(rules);
}
+ @Override
public Object clone() {
- return new ModuleRules(rules);
+ return new ModuleRules(rules);
}
}
diff --git a/src/java/org/apache/ivy/core/report/ResolveReport.java b/src/java/org/apache/ivy/core/report/ResolveReport.java
index 0f12488d..7fc1df81 100644
--- a/src/java/org/apache/ivy/core/report/ResolveReport.java
+++ b/src/java/org/apache/ivy/core/report/ResolveReport.java
@@ -23,7 +23,6 @@ import java.util.Arrays;
import java.util.Collection;
import java.util.Date;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.List;
@@ -31,6 +30,7 @@ import java.util.Map;
import java.util.Set;
import org.apache.ivy.core.cache.ResolutionCacheManager;
+import org.apache.ivy.core.module.descriptor.Artifact;
import org.apache.ivy.core.module.descriptor.Configuration;
import org.apache.ivy.core.module.descriptor.DefaultDependencyDescriptor;
import org.apache.ivy.core.module.descriptor.DefaultModuleDescriptor;
@@ -50,17 +50,16 @@ import org.apache.ivy.util.filter.Filter;
public class ResolveReport {
private ModuleDescriptor md;
- /** String conf -> ConfigurationResolveReport report */
- private Map confReports = new LinkedHashMap();
+ private Map confReports = new LinkedHashMap();
- private List problemMessages = new ArrayList();
+ private List problemMessages = new ArrayList();
/**
* the list of all dependencies resolved, ordered from the more dependent to the less dependent
*/
- private List/* */dependencies = new ArrayList();
+ private List dependencies = new ArrayList();
- private List/* */artifacts = new ArrayList();
+ private List artifacts = new ArrayList();
private long resolveTime;
@@ -84,20 +83,20 @@ public class ResolveReport {
}
public ConfigurationResolveReport getConfigurationReport(String conf) {
- return (ConfigurationResolveReport) confReports.get(conf);
+ return confReports.get(conf);
}
public String[] getConfigurations() {
- return (String[]) confReports.keySet().toArray(new String[confReports.size()]);
+ return confReports.keySet().toArray(new String[confReports.size()]);
}
public boolean hasError() {
- boolean hasError = false;
- for (Iterator it = confReports.values().iterator(); it.hasNext() && !hasError;) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) it.next();
- hasError |= report.hasError();
+ for (ConfigurationResolveReport report : confReports.values()) {
+ if (report.hasError()) {
+ return true;
+ }
}
- return hasError;
+ return false;
}
public void output(ReportOutputter[] outputters, ResolutionCacheManager cacheMgr,
@@ -112,21 +111,19 @@ public class ResolveReport {
}
public IvyNode[] getEvictedNodes() {
- Collection all = new LinkedHashSet();
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ Collection all = new LinkedHashSet();
+ for (ConfigurationResolveReport report : confReports.values()) {
all.addAll(Arrays.asList(report.getEvictedNodes()));
}
- return (IvyNode[]) all.toArray(new IvyNode[all.size()]);
+ return all.toArray(new IvyNode[all.size()]);
}
public IvyNode[] getUnresolvedDependencies() {
- Collection all = new LinkedHashSet();
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ Collection all = new LinkedHashSet();
+ for (ConfigurationResolveReport report : confReports.values()) {
all.addAll(Arrays.asList(report.getUnresolvedDependencies()));
}
- return (IvyNode[]) all.toArray(new IvyNode[all.size()]);
+ return all.toArray(new IvyNode[all.size()]);
}
/**
@@ -164,36 +161,32 @@ public class ResolveReport {
*/
public ArtifactDownloadReport[] getArtifactsReports(DownloadStatus downloadStatus,
boolean withEvicted) {
- Collection all = new LinkedHashSet();
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ Collection all = new LinkedHashSet();
+ for (ConfigurationResolveReport report : confReports.values()) {
ArtifactDownloadReport[] reports = report.getArtifactsReports(downloadStatus,
withEvicted);
all.addAll(Arrays.asList(reports));
}
- return (ArtifactDownloadReport[]) all.toArray(new ArtifactDownloadReport[all.size()]);
+ return all.toArray(new ArtifactDownloadReport[all.size()]);
}
public ArtifactDownloadReport[] getArtifactsReports(ModuleRevisionId mrid) {
- Collection all = new LinkedHashSet();
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ Collection all = new LinkedHashSet();
+ for (ConfigurationResolveReport report : confReports.values()) {
all.addAll(Arrays.asList(report.getDownloadReports(mrid)));
}
- return (ArtifactDownloadReport[]) all.toArray(new ArtifactDownloadReport[all.size()]);
+ return all.toArray(new ArtifactDownloadReport[all.size()]);
}
public void checkIfChanged() {
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ for (ConfigurationResolveReport report : confReports.values()) {
report.checkIfChanged();
}
}
/** Can only be called if checkIfChanged has been called */
public boolean hasChanged() {
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport report = (ConfigurationResolveReport) iter.next();
+ for (ConfigurationResolveReport report : confReports.values()) {
if (report.hasChanged()) {
return true;
}
@@ -201,18 +194,17 @@ public class ResolveReport {
return false;
}
- public void setProblemMessages(List problems) {
+ public void setProblemMessages(List problems) {
problemMessages = problems;
}
- public List getProblemMessages() {
+ public List getProblemMessages() {
return problemMessages;
}
- public List getAllProblemMessages() {
- List ret = new ArrayList(problemMessages);
- for (Iterator iter = confReports.values().iterator(); iter.hasNext();) {
- ConfigurationResolveReport r = (ConfigurationResolveReport) iter.next();
+ public List getAllProblemMessages() {
+ List ret = new ArrayList(problemMessages);
+ for (ConfigurationResolveReport r : confReports.values()) {
IvyNode[] unresolved = r.getUnresolvedDependencies();
for (int i = 0; i < unresolved.length; i++) {
String errMsg = unresolved[i].getProblemMessage();
@@ -230,12 +222,11 @@ public class ResolveReport {
return ret;
}
- public void setDependencies(List dependencies, Filter artifactFilter) {
+ public void setDependencies(List dependencies, Filter artifactFilter) {
this.dependencies = dependencies;
// collect list of artifacts
- artifacts = new ArrayList();
- for (Iterator iter = dependencies.iterator(); iter.hasNext();) {
- IvyNode dependency = (IvyNode) iter.next();
+ artifacts = new ArrayList();
+ for (IvyNode dependency : dependencies) {
if (!dependency.isCompletelyEvicted() && !dependency.hasProblem()) {
artifacts.addAll(Arrays.asList(dependency.getSelectedArtifacts(artifactFilter)));
}
@@ -257,7 +248,7 @@ public class ResolveReport {
*
* @return The list of all dependencies.
*/
- public List/* */getDependencies() {
+ public List getDependencies() {
return dependencies;
}
@@ -267,7 +258,7 @@ public class ResolveReport {
*
* @return The list of all artifacts.
*/
- public List/* */getArtifacts() {
+ public List getArtifacts() {
return artifacts;
}
@@ -276,11 +267,10 @@ public class ResolveReport {
*
* @return a list of ModuleId
*/
- public List getModuleIds() {
- List ret = new ArrayList();
- List sortedDependencies = new ArrayList(dependencies);
- for (Iterator iter = sortedDependencies.iterator(); iter.hasNext();) {
- IvyNode dependency = (IvyNode) iter.next();
+ public List getModuleIds() {
+ List ret = new ArrayList();
+ List sortedDependencies = new ArrayList(dependencies);
+ for (IvyNode dependency : sortedDependencies) {
ModuleId mid = dependency.getResolvedId().getModuleId();
if (!ret.contains(mid)) {
ret.add(mid);
@@ -408,7 +398,7 @@ public class ResolveReport {
// add resolved dependencies
for (int i = 0; i < dependencies.size(); i++) {
- IvyNode node = (IvyNode) dependencies.get(i);
+ IvyNode node = dependencies.get(i);
if (midToKeep != null && midToKeep.contains(node.getModuleId())) {
continue;
}
diff --git a/src/java/org/apache/ivy/core/resolve/ResolveData.java b/src/java/org/apache/ivy/core/resolve/ResolveData.java
index 54cb661b..f6cb9a75 100644
--- a/src/java/org/apache/ivy/core/resolve/ResolveData.java
+++ b/src/java/org/apache/ivy/core/resolve/ResolveData.java
@@ -37,7 +37,8 @@ import org.apache.ivy.util.Message;
public class ResolveData {
private ResolveEngine engine;
- private Map visitData; // shared map of all visit data: Map (ModuleRevisionId -> VisitData)
+ // shared map of all visit data
+ private Map visitData;
private ConfigurationResolveReport report;
@@ -55,16 +56,16 @@ public class ResolveData {
}
public ResolveData(ResolveEngine engine, ResolveOptions options) {
- this(engine, options, null, new LinkedHashMap());
+ this(engine, options, null, new LinkedHashMap());
}
public ResolveData(ResolveEngine engine, ResolveOptions options,
ConfigurationResolveReport report) {
- this(engine, options, report, new LinkedHashMap());
+ this(engine, options, report, new LinkedHashMap());
}
public ResolveData(ResolveEngine engine, ResolveOptions options,
- ConfigurationResolveReport report, Map visitData) {
+ ConfigurationResolveReport report, Map visitData) {
this.engine = engine;
this.report = report;
this.visitData = visitData;
@@ -80,30 +81,28 @@ public class ResolveData {
return visitData == null ? null : visitData.getNode();
}
- public Collection getNodes() {
- Collection nodes = new ArrayList();
- for (Iterator iter = visitData.values().iterator(); iter.hasNext();) {
- VisitData vdata = (VisitData) iter.next();
+ public Collection getNodes() {
+ Collection nodes = new ArrayList();
+ for (VisitData vdata : visitData.values()) {
nodes.add(vdata.getNode());
}
return nodes;
}
- public Collection getNodeIds() {
+ public Collection getNodeIds() {
return visitData.keySet();
}
public VisitData getVisitData(ModuleRevisionId mrid) {
- VisitData result = (VisitData) visitData.get(mrid);
+ VisitData result = visitData.get(mrid);
if (result == null) {
// search again, now ignore the missing extra attributes
- for (Iterator it = visitData.entrySet().iterator(); it.hasNext();) {
- Map.Entry entry = (Entry) it.next();
- ModuleRevisionId current = (ModuleRevisionId) entry.getKey();
+ for (Entry entry : visitData.entrySet()) {
+ ModuleRevisionId current = entry.getKey();
if (isSubMap(mrid.getAttributes(), current.getAttributes())) {
- result = (VisitData) entry.getValue();
+ result = entry.getValue();
break;
}
}
@@ -115,7 +114,7 @@ public class ResolveData {
/**
* Checks whether one map is a sub-map of the other.
*/
- private static boolean isSubMap(Map map1, Map map2) {
+ private static boolean isSubMap(Map map1, Map map2) {
int map1Size = map1.size();
int map2Size = map2.size();
@@ -123,11 +122,10 @@ public class ResolveData {
return map1.equals(map2);
}
- Map smallest = map1Size < map2Size ? map1 : map2;
- Map largest = map1Size < map2Size ? map2 : map1;
+ Map smallest = map1Size < map2Size ? map1 : map2;
+ Map largest = map1Size < map2Size ? map2 : map1;
- for (Iterator it = smallest.entrySet().iterator(); it.hasNext();) {
- Map.Entry entry = (Entry) it.next();
+ for (Entry entry : smallest.entrySet()) {
if (!largest.containsKey(entry.getKey())) {
return false;
@@ -258,9 +256,10 @@ public class ResolveData {
}
void blacklist(IvyNode node) {
- for (Iterator iter = visitData.entrySet().iterator(); iter.hasNext();) {
- Entry entry = (Entry) iter.next();
- VisitData vdata = (VisitData) entry.getValue();
+ for (Iterator> iter = visitData.entrySet().iterator(); iter
+ .hasNext();) {
+ Entry entry = iter.next();
+ VisitData vdata = entry.getValue();
if (vdata.getNode() == node && !node.getResolvedId().equals(entry.getKey())) {
// this visit data was associated with the blacklisted node,
// we discard this association
@@ -298,14 +297,13 @@ public class ResolveData {
VisitNode current = getCurrentVisitNode();
if (current != null) {
// mediating dd through dependers stack
- List dependers = new ArrayList(current.getPath());
+ List dependers = new ArrayList(current.getPath());
// the returned path contains the currently visited node, we are only interested in
// the dependers, so we remove the currently visted node from the end
dependers.remove(dependers.size() - 1);
// we want to apply mediation going up in the dependers stack, not the opposite
Collections.reverse(dependers);
- for (Iterator iterator = dependers.iterator(); iterator.hasNext();) {
- VisitNode n = (VisitNode) iterator.next();
+ for (VisitNode n : dependers) {
ModuleDescriptor md = n.getDescriptor();
if (md != null) {
dd = md.mediate(dd);
diff --git a/src/java/org/apache/ivy/core/resolve/ResolveEngine.java b/src/java/org/apache/ivy/core/resolve/ResolveEngine.java
index bb3bc95e..33e908dd 100644
--- a/src/java/org/apache/ivy/core/resolve/ResolveEngine.java
+++ b/src/java/org/apache/ivy/core/resolve/ResolveEngine.java
@@ -29,10 +29,8 @@ import java.util.Collections;
import java.util.Date;
import java.util.HashMap;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
-import java.util.ListIterator;
import java.util.Map;
import java.util.Properties;
import java.util.Set;
@@ -88,7 +86,7 @@ public class ResolveEngine {
private SortEngine sortEngine;
- private Set fetchedSet = new HashSet();
+ private Set fetchedSet = new HashSet();
private DependencyResolver dictatorResolver;
@@ -251,7 +249,7 @@ public class ResolveEngine {
.getResolvedModuleRevisionId());
Properties props = new Properties();
if (dependencies.length > 0) {
- Map forcedRevisions = new HashMap();
+ Map forcedRevisions = new HashMap();
for (int i = 0; i < dependencies.length; i++) {
if (dependencies[i].getModuleRevision() != null
&& dependencies[i].getModuleRevision().isForce()) {
@@ -262,8 +260,7 @@ public class ResolveEngine {
IvyNode root = dependencies[0].getRoot();
- // ();
- Map topLevelDeps = new HashMap(); //
+ Map topLevelDeps = new HashMap();
for (int i = 0; i < dependencies.length; i++) {
if (!dependencies[i].hasProblem()) {
DependencyDescriptor dd = dependencies[i].getDependencyDescriptor(root);
@@ -279,7 +276,7 @@ public class ResolveEngine {
DependencyDescriptor dd = dependencies[i].getDependencyDescriptor(root);
if (dd == null) {
ModuleId mid = dependencies[i].getModuleId();
- IvyNode tlDep = (IvyNode) topLevelDeps.get(mid);
+ IvyNode tlDep = topLevelDeps.get(mid);
if (tlDep != null) {
dd = tlDep.getDependencyDescriptor(root);
}
@@ -288,8 +285,8 @@ public class ResolveEngine {
ModuleRevisionId depResolvedId = dependencies[i].getResolvedId();
ModuleDescriptor depDescriptor = dependencies[i].getDescriptor();
ModuleRevisionId depRevisionId = dd.getDependencyRevisionId();
- ModuleRevisionId forcedRevisionId = (ModuleRevisionId) forcedRevisions
- .get(dependencies[i].getModuleId());
+ ModuleRevisionId forcedRevisionId = forcedRevisions.get(dependencies[i]
+ .getModuleId());
if (dependencies[i].getModuleRevision() != null
&& dependencies[i].getModuleRevision().isForce()
@@ -373,14 +370,14 @@ public class ResolveEngine {
report.output(settings.getReportOutputters(), cacheMgr, options);
}
- public void downloadArtifacts(ResolveReport report, Filter artifactFilter,
+ public void downloadArtifacts(ResolveReport report, Filter artifactFilter,
DownloadOptions options) {
long start = System.currentTimeMillis();
- IvyNode[] dependencies = (IvyNode[]) report.getDependencies().toArray(
+ IvyNode[] dependencies = report.getDependencies().toArray(
new IvyNode[report.getDependencies().size()]);
- eventManager.fireIvyEvent(new PrepareDownloadEvent((Artifact[]) report.getArtifacts()
- .toArray(new Artifact[report.getArtifacts().size()])));
+ eventManager.fireIvyEvent(new PrepareDownloadEvent(report.getArtifacts().toArray(
+ new Artifact[report.getArtifacts().size()])));
long totalSize = 0;
for (int i = 0; i < dependencies.length; i++) {
@@ -541,7 +538,7 @@ public class ResolveEngine {
throw new NullPointerException("module descriptor must not be null");
}
String[] confs = options.getConfs(md);
- Collection missingConfs = new ArrayList();
+ Collection missingConfs = new ArrayList();
for (int i = 0; i < confs.length; i++) {
if (confs[i] == null) {
throw new NullPointerException("null conf not allowed: confs where: "
@@ -608,41 +605,39 @@ public class ResolveEngine {
}
// clean data
- for (Iterator iter = data.getNodes().iterator(); iter.hasNext();) {
- IvyNode dep = (IvyNode) iter.next();
+ for (IvyNode dep : data.getNodes()) {
dep.clean();
}
}
// prune and reverse sort fectched dependencies
- Collection nodes = data.getNodes();
+ Collection nodes = data.getNodes();
// use a Set to avoid duplicates, linked to preserve order
- Collection dependencies = new LinkedHashSet(nodes.size());
- for (Iterator iter = nodes.iterator(); iter.hasNext();) {
- IvyNode node = (IvyNode) iter.next();
+ Collection dependencies = new LinkedHashSet(nodes.size());
+ for (IvyNode node : nodes) {
if (node != null && !node.isRoot() && !node.isCompletelyBlacklisted()) {
dependencies.add(node);
}
}
- List sortedDependencies = sortEngine.sortNodes(dependencies, SortOptions.SILENT);
+ List sortedDependencies = sortEngine.sortNodes(dependencies,
+ SortOptions.SILENT);
Collections.reverse(sortedDependencies);
handleTransiviteEviction(md, confs, data, sortedDependencies);
- return (IvyNode[]) dependencies.toArray(new IvyNode[dependencies.size()]);
+ return dependencies.toArray(new IvyNode[dependencies.size()]);
} finally {
IvyContext.popContext();
}
}
private void handleTransiviteEviction(ModuleDescriptor md, String[] confs, ResolveData data,
- List sortedDependencies) {
+ List sortedDependencies) {
// handle transitive eviction now:
// if a module has been evicted then all its dependencies required only by it should be
// evicted too. Since nodes are now sorted from the more dependent to the less one, we
// can traverse the list and check only the direct parent and not all the ancestors
- for (ListIterator iter = sortedDependencies.listIterator(); iter.hasNext();) {
- IvyNode node = (IvyNode) iter.next();
+ for (IvyNode node : sortedDependencies) {
if (!node.isCompletelyEvicted()) {
for (int i = 0; i < confs.length; i++) {
IvyNodeCallers.Caller[] callers = node.getCallers(confs[i]);
@@ -740,8 +735,7 @@ public class ResolveEngine {
// update selected nodes with confs asked in evicted one
EvictionData ed = node.getEvictedData();
if (ed.getSelected() != null) {
- for (Iterator iter = ed.getSelected().iterator(); iter.hasNext();) {
- IvyNode selected = (IvyNode) iter.next();
+ for (IvyNode selected : ed.getSelected()) {
if (!selected.isLoaded()) {
// the node is not yet loaded, we can simply update its set of
// configurations to fetch
@@ -793,9 +787,8 @@ public class ResolveEngine {
// now we can actually resolve this configuration dependencies
if (!isDependenciesFetched(node.getNode(), conf) && node.isTransitive()) {
- Collection/* */dependencies = node.getDependencies(conf);
- for (Iterator iter = dependencies.iterator(); iter.hasNext();) {
- VisitNode dep = (VisitNode) iter.next();
+ Collection dependencies = node.getDependencies(conf);
+ for (VisitNode dep : dependencies) {
dep.useRealNode(); // the node may have been resolved to another real one while
// resolving other deps
String[] confs = dep.getRequiredConfigurations(node, conf);
@@ -853,7 +846,7 @@ public class ResolveEngine {
}
private void resolveConflict(VisitNode node, String conf) {
- resolveConflict(node, node.getParent(), conf, Collections.EMPTY_SET);
+ resolveConflict(node, node.getParent(), conf, Collections. emptySet());
}
/**
@@ -870,7 +863,7 @@ public class ResolveEngine {
* @return true if conflict resolution has been done, false it can't be done yet
*/
private boolean resolveConflict(VisitNode node, VisitNode ancestor, String conf,
- Collection toevict) {
+ Collection toevict) {
if (ancestor == null || node == ancestor) {
return true;
}
@@ -907,15 +900,16 @@ public class ResolveEngine {
}
// compute conflicts
- Set resolvedNodes = ancestor.getNode().getResolvedNodes(node.getModuleId(),
+ Set resolvedNodes = ancestor.getNode().getResolvedNodes(node.getModuleId(),
node.getRootModuleConf());
resolvedNodes.addAll(ancestor.getNode().getPendingConflicts(node.getRootModuleConf(),
node.getModuleId()));
- Collection conflicts = computeConflicts(node, ancestor, conf, toevict, resolvedNodes);
+ Collection conflicts = computeConflicts(node, ancestor, conf, toevict,
+ resolvedNodes);
ConflictManager conflictManager = ancestor.getNode().getConflictManager(node.getModuleId());
- Collection resolved = resolveConflicts(node, ancestor, conflicts, conflictManager);
+ Collection resolved = resolveConflicts(node, ancestor, conflicts, conflictManager);
if (resolved == null) {
if (debugConflictResolution) {
@@ -939,8 +933,7 @@ public class ResolveEngine {
toevict = resolvedNodes;
toevict.removeAll(resolved);
- for (Iterator iter = toevict.iterator(); iter.hasNext();) {
- IvyNode te = (IvyNode) iter.next();
+ for (IvyNode te : toevict) {
te.markEvicted(node.getRootModuleConf(), ancestor.getNode(), conflictManager,
resolved);
@@ -956,14 +949,14 @@ public class ResolveEngine {
ancestor.getNode().setResolvedNodes(node.getModuleId(), node.getRootModuleConf(),
resolved);
- Collection evicted = new HashSet(ancestor.getNode().getEvictedNodes(node.getModuleId(),
- node.getRootModuleConf()));
+ Collection evicted = new HashSet(ancestor.getNode().getEvictedNodes(
+ node.getModuleId(), node.getRootModuleConf()));
evicted.removeAll(resolved);
evicted.addAll(toevict);
ancestor.getNode().setEvictedNodes(node.getModuleId(), node.getRootModuleConf(),
evicted);
ancestor.getNode().setPendingConflicts(node.getModuleId(), node.getRootModuleConf(),
- Collections.EMPTY_SET);
+ Collections. emptySet());
return resolveConflict(node, ancestor.getParent(), conf, toevict);
} else {
@@ -977,8 +970,8 @@ public class ResolveEngine {
// it's time to update parent resolved and evicted with what was found
- Collection evicted = new HashSet(ancestor.getNode().getEvictedNodes(node.getModuleId(),
- node.getRootModuleConf()));
+ Collection evicted = new HashSet(ancestor.getNode().getEvictedNodes(
+ node.getModuleId(), node.getRootModuleConf()));
toevict.removeAll(resolved);
evicted.removeAll(resolved);
evicted.addAll(toevict);
@@ -986,7 +979,7 @@ public class ResolveEngine {
ancestor.getNode().setEvictedNodes(node.getModuleId(), node.getRootModuleConf(),
evicted);
ancestor.getNode().setPendingConflicts(node.getModuleId(), node.getRootModuleConf(),
- Collections.EMPTY_SET);
+ Collections. emptySet());
node.markEvicted(ancestor, conflictManager, resolved);
if (debugConflictResolution) {
@@ -994,14 +987,13 @@ public class ResolveEngine {
}
// if resolved changed we have to go up in the graph
- Collection prevResolved = ancestor.getNode().getResolvedNodes(node.getModuleId(),
- node.getRootModuleConf());
+ Collection prevResolved = ancestor.getNode().getResolvedNodes(
+ node.getModuleId(), node.getRootModuleConf());
boolean solved = true;
if (!prevResolved.equals(resolved)) {
ancestor.getNode().setResolvedNodes(node.getModuleId(), node.getRootModuleConf(),
resolved);
- for (Iterator iter = resolved.iterator(); iter.hasNext();) {
- IvyNode sel = (IvyNode) iter.next();
+ for (IvyNode sel : resolved) {
if (!prevResolved.contains(sel)) {
solved &= resolveConflict(node.gotoNode(sel), ancestor.getParent(), conf,
toevict);
@@ -1012,8 +1004,8 @@ public class ResolveEngine {
}
}
- private Collection resolveConflicts(VisitNode node, VisitNode ancestor, Collection conflicts,
- ConflictManager conflictManager) {
+ private Collection resolveConflicts(VisitNode node, VisitNode ancestor,
+ Collection conflicts, ConflictManager conflictManager) {
if (node.getParent() != ancestor
// we are not handling the direct parent
@@ -1064,9 +1056,9 @@ public class ResolveEngine {
* @return a collection of IvyNode which may be in conflict with the given node in the given
* ancestor. This collection always contain at least the given node.
*/
- private Collection computeConflicts(VisitNode node, VisitNode ancestor, String conf,
- Collection toevict, Collection selectedNodes) {
- Collection conflicts = new LinkedHashSet();
+ private Collection computeConflicts(VisitNode node, VisitNode ancestor, String conf,
+ Collection toevict, Collection selectedNodes) {
+ Collection conflicts = new LinkedHashSet();
conflicts.add(node.getNode());
/*
* We first try to remove all evicted nodes from the collection of selected nodes to update
@@ -1087,11 +1079,11 @@ public class ResolveEngine {
data.setCurrentVisitNode(ancestor);
try {
// In this case we need to compute selected nodes again.
- Collection deps = ancestor.getNode().getDependencies(node.getRootModuleConf(),
+ Collection deps = ancestor.getNode().getDependencies(
+ node.getRootModuleConf(),
ancestor.getNode().getConfigurations(node.getRootModuleConf()),
ancestor.getRequestedConf());
- for (Iterator iter = deps.iterator(); iter.hasNext();) {
- IvyNode dep = (IvyNode) iter.next();
+ for (IvyNode dep : deps) {
if (dep.getModuleId().equals(node.getModuleId())) {
conflicts.add(dep);
}
@@ -1108,12 +1100,11 @@ public class ResolveEngine {
* the parent direct dependencies in current root module conf.
*/
VisitNode parent = node.getParent();
- Collection parentDepIvyNodes = parent.getNode().getDependencies(
+ Collection parentDepIvyNodes = parent.getNode().getDependencies(
node.getRootModuleConf(),
parent.getNode().getConfigurations(node.getRootModuleConf()),
parent.getRequestedConf());
- for (Iterator it = parentDepIvyNodes.iterator(); it.hasNext();) {
- IvyNode parentDep = (IvyNode) it.next();
+ for (IvyNode parentDep : parentDepIvyNodes) {
if (parentDep.getModuleId().equals(node.getModuleId())) {
conflicts.add(parentDep);
}
diff --git a/src/java/org/apache/ivy/core/resolve/ResolveOptions.java b/src/java/org/apache/ivy/core/resolve/ResolveOptions.java
index 9ffe43f4..b872b4cc 100644
--- a/src/java/org/apache/ivy/core/resolve/ResolveOptions.java
+++ b/src/java/org/apache/ivy/core/resolve/ResolveOptions.java
@@ -20,6 +20,7 @@ package org.apache.ivy.core.resolve;
import java.util.Date;
import org.apache.ivy.core.LogOptions;
+import org.apache.ivy.core.module.descriptor.Artifact;
import org.apache.ivy.core.module.descriptor.ModuleDescriptor;
import org.apache.ivy.core.module.id.ModuleId;
import org.apache.ivy.util.ConfigurationUtils;
@@ -100,7 +101,7 @@ public class ResolveOptions extends LogOptions {
/**
* A filter to use to avoid downloading all artifacts.
*/
- private Filter artifactFilter = FilterHelper.NO_FILTER;
+ private Filter artifactFilter = FilterHelper.NO_FILTER;
/**
* The resolve mode to use. Should be one of {@link #RESOLVEMODES}, or null to use
@@ -140,11 +141,11 @@ public class ResolveOptions extends LogOptions {
checkIfChanged = options.checkIfChanged;
}
- public Filter getArtifactFilter() {
+ public Filter getArtifactFilter() {
return artifactFilter;
}
- public ResolveOptions setArtifactFilter(Filter artifactFilter) {
+ public ResolveOptions setArtifactFilter(Filter artifactFilter) {
this.artifactFilter = artifactFilter;
return this;
}
diff --git a/src/java/org/apache/ivy/core/resolve/VisitData.java b/src/java/org/apache/ivy/core/resolve/VisitData.java
index 16a10ab5..3beb8770 100644
--- a/src/java/org/apache/ivy/core/resolve/VisitData.java
+++ b/src/java/org/apache/ivy/core/resolve/VisitData.java
@@ -38,7 +38,7 @@ public class VisitData {
* The associated visit nodes, per rootModuleConf Note that the value is a List, because a node
* can be visited from several parents during the resolution process
*/
- private Map visitNodes = new HashMap(); // Map (String rootModuleConf -> List(VisitNode))
+ private Map> visitNodes = new HashMap>();
public VisitData(IvyNode node) {
this.node = node;
@@ -49,10 +49,10 @@ public class VisitData {
getVisitNodes(rootModuleConf).add(node);
}
- public List getVisitNodes(String rootModuleConf) {
- List visits = (List) visitNodes.get(rootModuleConf);
+ public List getVisitNodes(String rootModuleConf) {
+ List visits = visitNodes.get(rootModuleConf);
if (visits == null) {
- visits = new ArrayList();
+ visits = new ArrayList();
visitNodes.put(rootModuleConf, visits);
}
return visits;
@@ -66,7 +66,7 @@ public class VisitData {
this.node = node;
}
- public void addVisitNodes(String rootModuleConf, List visitNodes) {
+ public void addVisitNodes(String rootModuleConf, List visitNodes) {
getVisitNodes(rootModuleConf).addAll(visitNodes);
}
}
diff --git a/src/java/org/apache/ivy/core/resolve/VisitNode.java b/src/java/org/apache/ivy/core/resolve/VisitNode.java
index 1547a403..ff2d5a1e 100644
--- a/src/java/org/apache/ivy/core/resolve/VisitNode.java
+++ b/src/java/org/apache/ivy/core/resolve/VisitNode.java
@@ -21,7 +21,6 @@ import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
@@ -70,7 +69,7 @@ public class VisitNode {
* Direct path from root to this node. Note that the colleciton is ordered but is not a list
* implementation This collection is null until it is required, see getPath
*/
- private Collection path = null; // Collection(VisitNode)
+ private Collection path = null;
/**
* The configuration of the parent module in the current visit
@@ -159,16 +158,16 @@ public class VisitNode {
*
* @return
*/
- public Collection/* */getPath() {
+ public Collection getPath() {
if (path == null) {
path = computePath();
}
return path;
}
- private Collection/* */computePath() {
+ private Collection computePath() {
if (parent != null) {
- Collection p = new LinkedHashSet(parent.getPath());
+ Collection p = new LinkedHashSet(parent.getPath());
p.add(this);
return p;
} else {
@@ -200,7 +199,7 @@ public class VisitNode {
public static VisitNode getRoot(VisitNode parent) {
VisitNode root = parent;
- Collection path = new HashSet();
+ Collection path = new HashSet();
path.add(root);
while (root.getParent() != null && !root.getNode().isRoot()) {
if (path.contains(root.getParent())) {
@@ -309,11 +308,10 @@ public class VisitNode {
return loaded;
}
- public Collection/* */getDependencies(String conf) {
- Collection/* */deps = node.getDependencies(rootModuleConf, conf, requestedConf);
- Collection/* */ret = new ArrayList(deps.size());
- for (Iterator iter = deps.iterator(); iter.hasNext();) {
- IvyNode depNode = (IvyNode) iter.next();
+ public Collection getDependencies(String conf) {
+ Collection deps = node.getDependencies(rootModuleConf, conf, requestedConf);
+ Collection ret = new ArrayList(deps.size());
+ for (IvyNode depNode : deps) {
ret.add(traverseChild(conf, depNode));
}
return ret;
@@ -336,9 +334,8 @@ public class VisitNode {
}
VisitData visitData = data.getVisitData(node.getId());
if (visitData != null) {
- List visitNodes = visitData.getVisitNodes(rootModuleConf);
- for (Iterator iter = visitNodes.iterator(); iter.hasNext();) {
- VisitNode vnode = (VisitNode) iter.next();
+ List visitNodes = visitData.getVisitNodes(rootModuleConf);
+ for (VisitNode vnode : visitNodes) {
if ((parent == null && vnode.getParent() == null)
|| (parent != null && parent.getId().equals(vnode.getParent().getId()))) {
vnode.parentConf = parentConf;
@@ -371,11 +368,10 @@ public class VisitNode {
return new VisitNode(data, node, parent, rootModuleConf, parentConf, usage);
}
- private ModuleRevisionId[] toMrids(Collection path, ModuleRevisionId last) {
+ private ModuleRevisionId[] toMrids(Collection path, ModuleRevisionId last) {
ModuleRevisionId[] ret = new ModuleRevisionId[path.size() + 1];
int i = 0;
- for (Iterator iter = path.iterator(); iter.hasNext(); i++) {
- VisitNode node = (VisitNode) iter.next();
+ for (VisitNode node : path) {
ret[i] = node.getNode().getId();
}
ret[ret.length - 1] = last;
@@ -386,7 +382,7 @@ public class VisitNode {
return node.getResolvedId();
}
- public void updateConfsToFetch(Collection confs) {
+ public void updateConfsToFetch(Collection confs) {
node.updateConfsToFetch(confs);
}
@@ -432,8 +428,7 @@ public class VisitNode {
if (parent != null) {
isCircular = Boolean.FALSE; // asumme it's false, and see if it isn't by checking
// the parent path
- for (Iterator iter = parent.getPath().iterator(); iter.hasNext();) {
- VisitNode ancestor = (VisitNode) iter.next();
+ for (VisitNode ancestor : parent.getPath()) {
if (getId().getModuleId().equals(ancestor.getId().getModuleId())) {
isCircular = Boolean.TRUE;
break;
@@ -458,7 +453,7 @@ public class VisitNode {
return node.getModuleId();
}
- public Collection getResolvedRevisions(ModuleId mid) {
+ public Collection getResolvedRevisions(ModuleId mid) {
return node.getResolvedRevisions(mid, rootModuleConf);
}
@@ -481,7 +476,8 @@ public class VisitNode {
* @param selected
* a Collection of {@link IvyNode} which have been selected
*/
- public void markEvicted(VisitNode parent, ConflictManager conflictMgr, Collection selected) {
+ public void markEvicted(VisitNode parent, ConflictManager conflictMgr,
+ Collection selected) {
node.markEvicted(rootModuleConf, parent.getNode(), conflictMgr, selected);
}
@@ -493,7 +489,7 @@ public class VisitNode {
return node.getEvictionDataInRoot(rootModuleConf, ancestor.getNode());
}
- public Collection getEvictedRevisions(ModuleId moduleId) {
+ public Collection getEvictedRevisions(ModuleId moduleId) {
return node.getEvictedRevisions(moduleId, rootModuleConf);
}
@@ -508,6 +504,7 @@ public class VisitNode {
// rootModuleConf = rootModuleConf;
// }
+ @Override
public String toString() {
return node.toString();
}
diff --git a/src/java/org/apache/ivy/core/search/SearchEngine.java b/src/java/org/apache/ivy/core/search/SearchEngine.java
index 84c24435..b35ee926 100644
--- a/src/java/org/apache/ivy/core/search/SearchEngine.java
+++ b/src/java/org/apache/ivy/core/search/SearchEngine.java
@@ -22,7 +22,6 @@ import java.util.Arrays;
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
-import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
@@ -56,125 +55,119 @@ public class SearchEngine {
* @param otherTokenValues
* @return
*/
- public String[] listTokenValues(String token, Map otherTokenValues) {
- Set entries = new LinkedHashSet();
+ public String[] listTokenValues(String token, Map otherTokenValues) {
+ Set entries = new LinkedHashSet();
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] values = resolver.listTokenValues(new String[] {token}, otherTokenValues);
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] values = resolver.listTokenValues(new String[] {token},
+ otherTokenValues);
for (int i = 0; i < values.length; i++) {
entries.add(values[i].get(token));
}
}
- return (String[]) entries.toArray(new String[entries.size()]);
+ return entries.toArray(new String[entries.size()]);
}
public OrganisationEntry[] listOrganisationEntries() {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] orgs = resolver.listTokenValues(new String[] {IvyPatternHelper.ORGANISATION_KEY},
- new HashMap());
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] orgs = resolver.listTokenValues(
+ new String[] {IvyPatternHelper.ORGANISATION_KEY}, new HashMap());
for (int i = 0; i < orgs.length; i++) {
- String org = (String) orgs[i].get(IvyPatternHelper.ORGANISATION_KEY);
+ String org = orgs[i].get(IvyPatternHelper.ORGANISATION_KEY);
entries.add(new OrganisationEntry(resolver, org));
}
}
- return (OrganisationEntry[]) entries.toArray(new OrganisationEntry[entries.size()]);
+ return entries.toArray(new OrganisationEntry[entries.size()]);
}
public String[] listOrganisations() {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] orgs = resolver.listTokenValues(new String[] {IvyPatternHelper.ORGANISATION_KEY},
- new HashMap());
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] orgs = resolver.listTokenValues(
+ new String[] {IvyPatternHelper.ORGANISATION_KEY}, new HashMap());
for (int i = 0; i < orgs.length; i++) {
entries.add(orgs[i].get(IvyPatternHelper.ORGANISATION_KEY));
}
}
- return (String[]) entries.toArray(new String[entries.size()]);
+ return entries.toArray(new String[entries.size()]);
}
public ModuleEntry[] listModuleEntries(OrganisationEntry org) {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- Map tokenValues = new HashMap();
+ Map tokenValues = new HashMap();
tokenValues.put(IvyPatternHelper.ORGANISATION_KEY, org.getOrganisation());
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] modules = resolver.listTokenValues(new String[] {IvyPatternHelper.MODULE_KEY},
- tokenValues);
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] modules = resolver.listTokenValues(
+ new String[] {IvyPatternHelper.MODULE_KEY}, tokenValues);
for (int i = 0; i < modules.length; i++) {
- String module = (String) modules[i].get(IvyPatternHelper.MODULE_KEY);
+ String module = modules[i].get(IvyPatternHelper.MODULE_KEY);
entries.add(new ModuleEntry(org, module));
}
}
- return (ModuleEntry[]) entries.toArray(new ModuleEntry[entries.size()]);
+ return entries.toArray(new ModuleEntry[entries.size()]);
}
public String[] listModules(String org) {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- Map tokenValues = new HashMap();
+ Map tokenValues = new HashMap();
tokenValues.put(IvyPatternHelper.ORGANISATION_KEY, org);
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] modules = resolver.listTokenValues(new String[] {IvyPatternHelper.MODULE_KEY},
- tokenValues);
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] modules = resolver.listTokenValues(
+ new String[] {IvyPatternHelper.MODULE_KEY}, tokenValues);
for (int i = 0; i < modules.length; i++) {
entries.add(modules[i].get(IvyPatternHelper.MODULE_KEY));
}
}
- return (String[]) entries.toArray(new String[entries.size()]);
+ return entries.toArray(new String[entries.size()]);
}
public RevisionEntry[] listRevisionEntries(ModuleEntry module) {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- Map tokenValues = new HashMap();
+ Map tokenValues = new HashMap();
tokenValues.put(IvyPatternHelper.ORGANISATION_KEY, module.getOrganisation());
tokenValues.put(IvyPatternHelper.MODULE_KEY, module.getModule());
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] revisions = resolver.listTokenValues(
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] revisions = resolver.listTokenValues(
new String[] {IvyPatternHelper.REVISION_KEY}, tokenValues);
for (int i = 0; i < revisions.length; i++) {
- String revision = (String) revisions[i].get(IvyPatternHelper.REVISION_KEY);
+ String revision = revisions[i].get(IvyPatternHelper.REVISION_KEY);
entries.add(new RevisionEntry(module, revision));
}
}
- return (RevisionEntry[]) entries.toArray(new RevisionEntry[entries.size()]);
+ return entries.toArray(new RevisionEntry[entries.size()]);
}
public String[] listRevisions(String org, String module) {
- Set entries = new HashSet();
+ Set entries = new HashSet();
- Map tokenValues = new HashMap();
+ Map tokenValues = new HashMap();
tokenValues.put(IvyPatternHelper.ORGANISATION_KEY, org);
tokenValues.put(IvyPatternHelper.MODULE_KEY, module);
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] revisions = resolver.listTokenValues(
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] revisions = resolver.listTokenValues(
new String[] {IvyPatternHelper.REVISION_KEY}, tokenValues);
for (int i = 0; i < revisions.length; i++) {
entries.add(revisions[i].get(IvyPatternHelper.REVISION_KEY));
}
}
- return (String[]) entries.toArray(new String[entries.size()]);
+ return entries.toArray(new String[entries.size()]);
}
/**
@@ -189,9 +182,9 @@ public class SearchEngine {
* @return
*/
public ModuleId[] listModules(ModuleId moduleCrit, PatternMatcher matcher) {
- List ret = new ArrayList();
+ List ret = new ArrayList();
- Map criteria = new HashMap();
+ Map criteria = new HashMap();
addMatcher(matcher, moduleCrit.getOrganisation(), criteria,
IvyPatternHelper.ORGANISATION_KEY);
addMatcher(matcher, moduleCrit.getName(), criteria, IvyPatternHelper.MODULE_KEY);
@@ -199,19 +192,18 @@ public class SearchEngine {
String[] tokensToList = new String[] {IvyPatternHelper.ORGANISATION_KEY,
IvyPatternHelper.MODULE_KEY};
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
for (int i = 0; i < moduleIdAsMap.length; i++) {
- String org = (String) moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
- String name = (String) moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
+ String org = moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
+ String name = moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
ModuleId modId = ModuleId.newInstance(org, name);
ret.add(NameSpaceHelper.transform(modId, resolver.getNamespace()
.getToSystemTransformer()));
}
}
- return (ModuleId[]) ret.toArray(new ModuleId[ret.size()]);
+ return ret.toArray(new ModuleId[ret.size()]);
}
/**
@@ -226,37 +218,33 @@ public class SearchEngine {
* @return
*/
public ModuleRevisionId[] listModules(ModuleRevisionId moduleCrit, PatternMatcher matcher) {
- List ret = new ArrayList();
+ List ret = new ArrayList();
- Map criteria = new HashMap();
- for (Iterator it = moduleCrit.getAttributes().entrySet().iterator(); it.hasNext();) {
- Map.Entry entry = (Entry) it.next();
- addMatcher(matcher, (String) entry.getValue(), criteria, (String) entry.getKey());
+ Map criteria = new HashMap();
+ for (Entry entry : moduleCrit.getAttributes().entrySet()) {
+ addMatcher(matcher, entry.getValue(), criteria, entry.getKey());
}
- String[] tokensToList = (String[]) moduleCrit.getAttributes().keySet()
+ String[] tokensToList = moduleCrit.getAttributes().keySet()
.toArray(new String[moduleCrit.getAttributes().size()]);
- for (Iterator iter = settings.getResolvers().iterator(); iter.hasNext();) {
- DependencyResolver resolver = (DependencyResolver) iter.next();
- Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
+ for (DependencyResolver resolver : settings.getResolvers()) {
+ Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
for (int i = 0; i < moduleIdAsMap.length; i++) {
- String org = (String) moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
- String name = (String) moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
- String branch = (String) moduleIdAsMap[i].get(IvyPatternHelper.BRANCH_KEY);
- String rev = (String) moduleIdAsMap[i].get(IvyPatternHelper.REVISION_KEY);
+ String org = moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
+ String name = moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
+ String branch = moduleIdAsMap[i].get(IvyPatternHelper.BRANCH_KEY);
+ String rev = moduleIdAsMap[i].get(IvyPatternHelper.REVISION_KEY);
- Map foundExtraAtts = new HashMap();
- Set qualAttributes = moduleCrit.getQualifiedExtraAttributes().keySet();
- for (Iterator iter2 = qualAttributes.iterator(); iter2.hasNext();) {
- String qualifiedKey = (String) iter2.next();
+ Map foundExtraAtts = new HashMap();
+ Set qualAttributes = moduleCrit.getQualifiedExtraAttributes().keySet();
+ for (String qualifiedKey : qualAttributes) {
String value = null;
int colonIndex = qualifiedKey.indexOf(':');
if (colonIndex == -1) {
- value = (String) moduleIdAsMap[i].get(qualifiedKey);
+ value = moduleIdAsMap[i].get(qualifiedKey);
} else {
- value = (String) moduleIdAsMap[i].get(qualifiedKey
- .substring(colonIndex + 1));
+ value = moduleIdAsMap[i].get(qualifiedKey.substring(colonIndex + 1));
}
if (value != null) {
@@ -270,7 +258,7 @@ public class SearchEngine {
}
}
- return (ModuleRevisionId[]) ret.toArray(new ModuleRevisionId[ret.size()]);
+ return ret.toArray(new ModuleRevisionId[ret.size()]);
}
/**
@@ -289,33 +277,32 @@ public class SearchEngine {
*/
public ModuleRevisionId[] listModules(DependencyResolver resolver, ModuleRevisionId moduleCrit,
PatternMatcher matcher) {
- Map criteria = new HashMap();
- for (Iterator it = moduleCrit.getAttributes().entrySet().iterator(); it.hasNext();) {
- Map.Entry entry = (Entry) it.next();
- addMatcher(matcher, (String) entry.getValue(), criteria, (String) entry.getKey());
+ Map criteria = new HashMap();
+ for (Entry entry : moduleCrit.getAttributes().entrySet()) {
+ addMatcher(matcher, entry.getValue(), criteria, entry.getKey());
}
- String[] tokensToList = (String[]) moduleCrit.getAttributes().keySet()
+ String[] tokensToList = moduleCrit.getAttributes().keySet()
.toArray(new String[moduleCrit.getAttributes().size()]);
- Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
- Set result = new LinkedHashSet(); // we use a Set to remove duplicates
+ Map[] moduleIdAsMap = resolver.listTokenValues(tokensToList, criteria);
+ Set result = new LinkedHashSet(); // we use a Set to
+ // remove duplicates
for (int i = 0; i < moduleIdAsMap.length; i++) {
- String org = (String) moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
- String name = (String) moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
- String branch = (String) moduleIdAsMap[i].get(IvyPatternHelper.BRANCH_KEY);
- String rev = (String) moduleIdAsMap[i].get(IvyPatternHelper.REVISION_KEY);
+ String org = moduleIdAsMap[i].get(IvyPatternHelper.ORGANISATION_KEY);
+ String name = moduleIdAsMap[i].get(IvyPatternHelper.MODULE_KEY);
+ String branch = moduleIdAsMap[i].get(IvyPatternHelper.BRANCH_KEY);
+ String rev = moduleIdAsMap[i].get(IvyPatternHelper.REVISION_KEY);
- Map foundExtraAtts = new HashMap();
- Set qualExtraAttributes = moduleCrit.getQualifiedExtraAttributes().keySet();
- for (Iterator iter2 = qualExtraAttributes.iterator(); iter2.hasNext();) {
- String qualifiedKey = (String) iter2.next();
+ Map foundExtraAtts = new HashMap();
+ Set qualExtraAttributes = moduleCrit.getQualifiedExtraAttributes().keySet();
+ for (String qualifiedKey : qualExtraAttributes) {
String value = null;
int colonIndex = qualifiedKey.indexOf(':');
if (colonIndex == -1) {
- value = (String) moduleIdAsMap[i].get(qualifiedKey);
+ value = moduleIdAsMap[i].get(qualifiedKey);
} else {
- value = (String) moduleIdAsMap[i].get(qualifiedKey.substring(colonIndex + 1));
+ value = moduleIdAsMap[i].get(qualifiedKey.substring(colonIndex + 1));
}
if (value != null) {
@@ -328,11 +315,11 @@ public class SearchEngine {
result.add(resolver.getNamespace().getToSystemTransformer().transform(modRevId));
}
- return (ModuleRevisionId[]) result.toArray(new ModuleRevisionId[result.size()]);
+ return result.toArray(new ModuleRevisionId[result.size()]);
}
- private void addMatcher(PatternMatcher patternMatcher, String expression, Map criteria,
- String key) {
+ private void addMatcher(PatternMatcher patternMatcher, String expression,
+ Map criteria, String key) {
if (expression == null) {
return;
}
@@ -345,9 +332,9 @@ public class SearchEngine {
}
}
- public Collection findModuleRevisionIds(DependencyResolver resolver, ModuleRevisionId pattern,
- PatternMatcher matcher) {
- Collection mrids = new ArrayList();
+ public Collection findModuleRevisionIds(DependencyResolver resolver,
+ ModuleRevisionId pattern, PatternMatcher matcher) {
+ Collection mrids = new ArrayList();
String resolverName = resolver.getName();
Message.verbose("looking for modules matching " + pattern + " using " + matcher.getName());
@@ -356,7 +343,7 @@ public class SearchEngine {
fromNamespace = ((AbstractResolver) resolver).getNamespace();
}
- Collection modules = new ArrayList();
+ Collection modules = new ArrayList();
OrganisationEntry[] orgs = resolver.listOrganisations();
if (orgs == null || orgs.length == 0) {
@@ -386,8 +373,7 @@ public class SearchEngine {
Message.debug("found " + modules.size() + " modules for " + pattern.getOrganisation()
+ " on " + resolverName);
boolean foundModule = false;
- for (Iterator iter = modules.iterator(); iter.hasNext();) {
- ModuleEntry mEntry = (ModuleEntry) iter.next();
+ for (ModuleEntry mEntry : modules) {
ModuleId foundMid = new ModuleId(mEntry.getOrganisation(), mEntry.getModule());
ModuleId systemMid = foundMid;
diff --git a/src/java/org/apache/ivy/core/settings/IvySettings.java b/src/java/org/apache/ivy/core/settings/IvySettings.java
index 1ef8dc79..de806bf2 100644
--- a/src/java/org/apache/ivy/core/settings/IvySettings.java
+++ b/src/java/org/apache/ivy/core/settings/IvySettings.java
@@ -31,10 +31,10 @@ import java.text.ParseException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
-import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
+import java.util.Map.Entry;
import java.util.Properties;
import org.apache.ivy.Ivy;
@@ -115,9 +115,9 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
ResolveEngineSettings, RetrieveEngineSettings, RepositoryManagementEngineSettings {
private static final long INTERUPT_TIMEOUT = 2000;
- private Map typeDefs = new HashMap();
+ private Map> typeDefs = new HashMap>();
- private Map resolversMap = new HashMap();
+ private Map resolversMap = new HashMap();
private DependencyResolver defaultResolver;
@@ -131,40 +131,29 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
private boolean checkUpToDate = true;
- private ModuleRules moduleSettings = new ModuleRules();
+ private ModuleRules moduleSettings = new ModuleRules();
- // Map (String conflictManagerName -> ConflictManager)
- private Map conflictsManager = new HashMap();
+ private Map conflictsManager = new HashMap();
- // Map (String latestStrategyName -> LatestStrategy)
- private Map latestStrategies = new HashMap();
+ private Map latestStrategies = new HashMap();
- // Map (String name -> LockStrategy)
- private Map lockStrategies = new HashMap();
+ private Map lockStrategies = new HashMap();
- // Map (String namespaceName -> Namespace)
- private Map namespaces = new HashMap();
+ private Map namespaces = new HashMap();
- // Map (String matcherName -> Matcher)
- private Map matchers = new HashMap();
+ private Map matchers = new HashMap();
- // Map (String outputterName -> ReportOutputter)
- private Map reportOutputters = new HashMap();
+ private Map reportOutputters = new HashMap();
- // Map (String matcherName -> VersionMatcher)
- private Map versionMatchers = new HashMap();
+ private Map versionMatchers = new HashMap();
- // Map (String name -> CircularDependencyStrategy)
- private Map circularDependencyStrategies = new HashMap();
+ private Map circularDependencyStrategies = new HashMap();
- // Map (String name -> RepositoryCacheManager)
- private Map repositoryCacheManagers = new HashMap();
+ private Map repositoryCacheManagers = new HashMap();
- // Map (String name -> SignatureGenerator)
- private Map signatureGenerators = new HashMap();
+ private Map signatureGenerators = new HashMap();
- // List (Trigger)
- private List triggers = new ArrayList();
+ private List triggers = new ArrayList();
private IvyVariableContainer variableContainer = new IvyVariableContainerImpl();
@@ -182,7 +171,7 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
private ResolutionCacheManager resolutionCacheManager = null;
- private List listingIgnore = new ArrayList();
+ private List listingIgnore = new ArrayList();
private boolean repositoriesConfigured;
@@ -192,7 +181,7 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
private File baseDir = new File(".").getAbsoluteFile();
- private List classpathURLs = new ArrayList();
+ private List classpathURLs = new ArrayList();
private ClassLoader classloader;
@@ -278,8 +267,10 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
try {
// GlobPatternMatcher is optional. Only add it when available.
- Class globClazz = IvySettings.class.getClassLoader().loadClass(
- "org.apache.ivy.plugins.matcher.GlobPatternMatcher");
+ @SuppressWarnings("unchecked")
+ Class extends PatternMatcher> globClazz = (Class extends PatternMatcher>) IvySettings.class
+ .getClassLoader()
+ .loadClass("org.apache.ivy.plugins.matcher.GlobPatternMatcher");
Field instanceField = globClazz.getField("INSTANCE");
addMatcher((PatternMatcher) instanceField.get(null));
} catch (Exception e) {
@@ -305,7 +296,7 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
private synchronized void addSystemProperties() {
try {
- addAllVariables((Map) System.getProperties().clone());
+ addAllVariables((Map, ?>) System.getProperties().clone());
} catch (AccessControlException ex) {
Message.verbose("access denied to getting all system properties: they won't be available as Ivy variables."
+ "\nset " + ex.getPermission() + " permission if you want to access them");
@@ -371,9 +362,9 @@ public class IvySettings implements SortEngineSettings, PublishEngineSettings, P
}
public synchronized void typeDefs(Properties p, boolean silentFail) {
- for (Iterator iter = p.keySet().iterator(); iter.hasNext();) {
- String name = (String) iter.next();
- typeDef(name, p.getProperty(name), silentFail);
+ for (Entry