I don't have commit access so here's a quick patch for enum being a
keyword in Java 1.5.
svn diff
Index: java/src/jde/wizards/ImportWizard.java
===================================================================
--- java/src/jde/wizards/ImportWizard.java (revision 30)
+++ java/src/jde/wizards/ImportWizard.java (working copy)
@@ -92,9 +92,9 @@
try {
ZipFile zipFile = new ZipFile(classPathFile);
- Enumeration enum = zipFile.entries();
- while (enum.hasMoreElements()) {
- ZipEntry zipEntry = (ZipEntry)enum.nextElement();
+ Enumeration enumerator = zipFile.entries();
+ while (enumerator.hasMoreElements()) {
+ ZipEntry zipEntry = (ZipEntry)enumerator.nextElement();
String current = zipEntry.getName();
if (current.toLowerCase().endsWith(".class")) {
current = current.substring(0, current.length() - 6);
Index: java/src/jde/debugger/expr/ExpressionParser.java
===================================================================
--- java/src/jde/debugger/expr/ExpressionParser.java (revision 30)
+++ java/src/jde/debugger/expr/ExpressionParser.java (working copy)
@@ -2609,8 +2609,8 @@
jj_expentry[i] = jj_lasttokens[i];
}
boolean exists = false;
- for (java.util.Enumeration enum = jj_expentries.elements();
enum.hasMoreElements();) {
- int[] oldentry = (int[])(enum.nextElement());
+ for (java.util.Enumeration enumerator =
jj_expentries.elements(); enumerator.hasMoreElements();) {
+ int[] oldentry = (int[])(enumerator.nextElement());
if (oldentry.length == jj_expentry.length) {
exists = true;
for (int i = 0; i < jj_expentry.length; i++) {
Index: java/src/jde/debugger/gui/ReferenceTreeNode.java
===================================================================
--- java/src/jde/debugger/gui/ReferenceTreeNode.java (revision 30)
+++ java/src/jde/debugger/gui/ReferenceTreeNode.java (working copy)
@@ -145,7 +145,7 @@
* @return the children of the reciever as an Enumeration.
*/
public Enumeration children() {
- return Collections.enumeration(Arrays.asList(m_children));
+ return Collections.enumeratoreration(Arrays.asList(m_children));
}
/**
Index: java/src/jde/debugger/gui/PrimitiveTreeNode.java
===================================================================
--- java/src/jde/debugger/gui/PrimitiveTreeNode.java (revision 30)
+++ java/src/jde/debugger/gui/PrimitiveTreeNode.java (working copy)
@@ -68,7 +68,7 @@
/** Asks if the node is a leaf node */
public boolean isLeaf() { return true; }
- /** Returns an enumeration of the children */
+ /** Returns an enumeratoreration of the children */
public Enumeration children() {
return new Vector().elements();
}
Index: java/src/jde/parser/JavaParser.java
===================================================================
--- java/src/jde/parser/JavaParser.java (revision 30)
+++ java/src/jde/parser/JavaParser.java (working copy)
@@ -8585,8 +8585,8 @@
jj_expentry[i] = jj_lasttokens[i];
}
boolean exists = false;
- for (java.util.Enumeration enum = jj_expentries.elements();
enum.hasMoreElements();) {
- int[] oldentry = (int[])(enum.nextElement());
+ for (java.util.Enumeration enumerator =
jj_expentries.elements(); enumerator.hasMoreElements();) {
+ int[] oldentry = (int[])(enumerator.nextElement());
if (oldentry.length == jj_expentry.length) {
exists = true;
for (int i = 0; i < jj_expentry.length; i++) {
Index: java/src/jde/util/ClassPathZip.java
===================================================================
--- java/src/jde/util/ClassPathZip.java (revision 30)
+++ java/src/jde/util/ClassPathZip.java (working copy)
@@ -52,9 +52,9 @@
*/
void load() throws IOException {
ZipFile zipFile = new ZipFile(zipOrJar);
- Enumeration enum = zipFile.entries();
- while (enum.hasMoreElements()) {
- ZipEntry zipEntry = (ZipEntry)enum.nextElement();
+ Enumeration enumerator = zipFile.entries();
+ while (enumerator.hasMoreElements()) {
+ ZipEntry zipEntry = (ZipEntry)enumerator.nextElement();
String current = zipEntry.getName();
if (current.toLowerCase().endsWith(".class")) {
current = current.substring(0, current.length() - 6);
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
jdee-users mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/jdee-users
