Menu
▾
▴
[cilib-devel] [PATCH 4/4] Corrected index issue with subList().
|
From: Gary P. <gpa...@gm...> - 2009-06-01 08:08:04
|
The Vector and TypeList classes had a bug where they interpreted a range
of values [fromIndex, toIndex) instead of [fromIndex, toIndex].
Signed-off-by: Gary Pampara <gpa...@gm...>
---
pom.xml | 2 +-
.../problem/dataset/StringDataSetBuilder.java | 3 -
.../net/sourceforge/cilib/type/types/Type.java | 29 ++++++-
.../cilib/type/types/container/AbstractList.java | 16 +++-
.../cilib/type/types/container/TypeList.java | 87 +++++++++++++++++---
src/site/site.xml | 22 ++++-
.../clustering/ClusteringFitnessFunctionTest.java | 1 -
.../sourceforge/cilib/type/DomainParserTest.java | 62 ++++++--------
.../cilib/type/types/container/TypeListTest.java | 48 +++++++++++
.../cilib/type/types/container/VectorTest.java | 10 ++
.../net/sourceforge/cilib/xml/XMLFileTest.java | 11 ++-
11 files changed, 223 insertions(+), 68 deletions(-)
create mode 100644 src/test/java/net/sourceforge/cilib/type/types/container/TypeListTest.java
diff --git a/pom.xml b/pom.xml
index ba9cb3d..3be1913 100644
--- a/pom.xml
+++ b/pom.xml
@@ -54,7 +54,7 @@
<distributionManagement>
<site>
<id>sourceforge</id>
- <url>sftp://web.sourceforge.net/home/groups/c/ci/cilib/htdocs</url>
+ <url>scp://shell.sourceforge.net/home/groups/c/ci/cilib/htdocs</url>
</site>
</distributionManagement>
<developers>
diff --git a/src/main/java/net/sourceforge/cilib/problem/dataset/StringDataSetBuilder.java b/src/main/java/net/sourceforge/cilib/problem/dataset/StringDataSetBuilder.java
index e1f9370..3e0e45d 100644
--- a/src/main/java/net/sourceforge/cilib/problem/dataset/StringDataSetBuilder.java
+++ b/src/main/java/net/sourceforge/cilib/problem/dataset/StringDataSetBuilder.java
@@ -39,7 +39,6 @@ public class StringDataSetBuilder extends TextDataSetBuilder {
public StringDataSetBuilder() {
this.strings = new ArrayList<String>();
- // System.out.println("Building...");
}
public StringDataSetBuilder(StringDataSetBuilder rhs) {
@@ -66,7 +65,6 @@ public class StringDataSetBuilder extends TextDataSetBuilder {
String result = in.readLine();
while (result != null) {
- // System.out.println(result);
strings.add(result);
result = in.readLine();
@@ -75,7 +73,6 @@ public class StringDataSetBuilder extends TextDataSetBuilder {
catch (IOException ioException) {
throw new RuntimeException(ioException);
}
- // System.out.println("Data set(s) initialised, proceeding...");
}
}
diff --git a/src/main/java/net/sourceforge/cilib/type/types/Type.java b/src/main/java/net/sourceforge/cilib/type/types/Type.java
index 4cb56f2..a33cca8 100644
--- a/src/main/java/net/sourceforge/cilib/type/types/Type.java
+++ b/src/main/java/net/sourceforge/cilib/type/types/Type.java
@@ -25,6 +25,7 @@ import net.sourceforge.cilib.util.Cloneable;
/**
* {@code Type} interface for all type-objects that are used within CIlib.
+ * The types are built on an extend the Java Collections Framework.
*/
public interface Type extends Cloneable {
@@ -35,15 +36,35 @@ public interface Type extends Cloneable {
public Type getClone();
/**
- * {@inheritDoc}
+ * Compare the specified object with this type for equality. Returns
+ * {@code true} if and only if the specified object is also an instance
+ * of the same type.
+ * @param o The object to compare.
+ * @return {@code true} if equality exists, {@code false} otherwise.
* @see Object#equals(Object)
*/
@Override
- public boolean equals(Object other);
+ public boolean equals(Object o);
/**
- * {@inheritDoc}
- * @see Object#hashCode()
+ * Returns the hash code value for this list. The hash code of a list
+ * is defined to be the result of the following calculation:
+ * <pre>
+ * int hashCode = 7;
+ * Iterator<E> i = list.iterator();
+ * while (i.hasNext()) {
+ * E obj = i.next();
+ * hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());
+ * }
+ * </pre>
+ * This ensures that <tt>type1.equals(type2)</tt> implies that
+ * <tt>type1.hashCode()==type2.hashCode()</tt> for any two types,
+ * <tt>type1</tt> and <tt>type2</tt>, as required by the general
+ * contract of {@link Object#hashCode}.
+ *
+ * @return the hash code value for this list
+ * @see Object#equals(Object)
+ * @see #equals(Object)
*/
@Override
public int hashCode();
diff --git a/src/main/java/net/sourceforge/cilib/type/types/container/AbstractList.java b/src/main/java/net/sourceforge/cilib/type/types/container/AbstractList.java
index 50fc7b6..a3ff4b4 100644
--- a/src/main/java/net/sourceforge/cilib/type/types/container/AbstractList.java
+++ b/src/main/java/net/sourceforge/cilib/type/types/container/AbstractList.java
@@ -27,6 +27,7 @@ import net.sourceforge.cilib.type.types.TypeUtil;
/**
* The basic definition for all {@linkplain Type} objects that are based on a list.
*
+ * @param <E> The type element.
* @author Gary Pampara
*/
public abstract class AbstractList<E extends Type> implements StructuredType<E> {
@@ -35,16 +36,19 @@ public abstract class AbstractList<E extends Type> implements StructuredType<E>
/**
* {@inheritDoc}
*/
+ @Override
public abstract AbstractList<E> getClone();
/**
* {@inheritDoc}
*/
- public abstract boolean equals(Object obj);
+ @Override
+ public abstract boolean equals(Object o);
/**
* {@inheritDoc}
*/
+ @Override
public abstract int hashCode();
/**
@@ -94,7 +98,7 @@ public abstract class AbstractList<E extends Type> implements StructuredType<E>
/**
* Add the provided {@linkplain AbstractList} to the start of the current list.
- * @param vector The object to add.
+ * @param list The object to add.
* @return <code>true</code> if the operation was successful, <code>false</code> otherwise.
*/
public abstract boolean prepend(AbstractList<E> list);
@@ -150,15 +154,16 @@ public abstract class AbstractList<E extends Type> implements StructuredType<E>
/**
* Create a sub vector from the current {@linkplain Vector}.
- * @param fromIndex The index to start the sub-vector from.
- * @param toIndex The last index to end the sub-vector at.
- * @return The created sub-vector instance.
+ * @param fromIndex The index to start the sub-list from.
+ * @param toIndex The last index to end the sub-list at.
+ * @return The created sub-list instance.
*/
public abstract AbstractList<E> subList(int fromIndex, int toIndex);
/**
* Create a new (cloned) <tt>Vector</tt> consisting of <tt>rhs</tt> that has been appended to
* <tt>lhs</tt>.
+ * @param <T> The type element.
* @param lhs The <tt>Vector</tt> that will form the front part of the new (cloned)
* <tt>Vector</tt>.
* @param rhs The <tt>Vector</tt> that will form the back part of the new (cloned)
@@ -228,6 +233,7 @@ public abstract class AbstractList<E extends Type> implements StructuredType<E>
/**
* {@inheritDoc}
*/
+ @Override
public String toString() {
return toString('[', ']', ',');
}
diff --git a/src/main/java/net/sourceforge/cilib/type/types/container/TypeList.java b/src/main/java/net/sourceforge/cilib/type/types/container/TypeList.java
index bb907cd..a257e95 100644
--- a/src/main/java/net/sourceforge/cilib/type/types/container/TypeList.java
+++ b/src/main/java/net/sourceforge/cilib/type/types/container/TypeList.java
@@ -29,28 +29,32 @@ import net.sourceforge.cilib.container.visitor.Visitor;
import net.sourceforge.cilib.type.types.Type;
/**
- * Concrete implementation of the {@see net.sourceforge.cilib.type.types.Vector}
- * class. Any {@see net.sourceforge.cilib.type.types.Type} object may be contained
- * within this object.
+ * General list container for all {@code Type} instances.
*
- * @author Gary Pampara
- * @author Edwin Peer
+ * @author gpampara
*/
public class TypeList extends AbstractList<Type> {
private static final long serialVersionUID = 136711882764612609L;
private List<Type> components;
+ /**
+ * Create a new instance.
+ */
public TypeList() {
this.components = new ArrayList<Type>();
}
+ /**
+ * Create a new instance with the predefined size.
+ * @param size The predefined size.
+ */
public TypeList(int size) {
this.components = new ArrayList<Type>();
}
/**
- *
- * @param copy
+ * Create a copy of the provided instance.
+ * @param copy The instance to copy.
*/
public TypeList(TypeList copy) {
this.components = new ArrayList<Type>(copy.components.size());
@@ -59,6 +63,9 @@ public class TypeList extends AbstractList<Type> {
this.components.add(type.getClone());
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public TypeList getClone() {
return new TypeList(this);
@@ -68,14 +75,15 @@ public class TypeList extends AbstractList<Type> {
/**
* {@inheritDoc}
*/
- public boolean equals(Object other) {
- if (other == this)
+ @Override
+ public boolean equals(Object o) {
+ if (o == this)
return true;
- if ((other == null) || (this.getClass() != other.getClass()))
+ if ((o == null) || (this.getClass() != o.getClass()))
return false;
- TypeList otherList = (TypeList) other;
+ TypeList otherList = (TypeList) o;
return this.components.equals(otherList.components);
}
@@ -83,27 +91,40 @@ public class TypeList extends AbstractList<Type> {
/**
* {@inheritDoc}
*/
+ @Override
public int hashCode() {
int hash = 7;
hash = 31 * hash + (this.components == null ? 0 : this.components.hashCode());
return hash;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public Type get(int index) {
return this.components.get(index);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public void set(int index, Type value) {
this.components.set(index, value);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public void insert(int index, Type value) {
this.components.add(index, value);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean append(AbstractList<Type> list) {
for (Type type : list)
@@ -112,6 +133,9 @@ public class TypeList extends AbstractList<Type> {
return true;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean prepend(AbstractList<Type> list) {
for (int i = list.size()-1; i >= 0; i--)
@@ -120,11 +144,17 @@ public class TypeList extends AbstractList<Type> {
return true;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public Object[] toArray() {
return this.components.toArray();
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public TypeList subList(int fromIndex, int toIndex) {
// Need to bump up the toIndex because the List.subList() operation is upper bound exclusive.
@@ -137,11 +167,17 @@ public class TypeList extends AbstractList<Type> {
return sublist;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean add(Type element) {
return this.components.add(element);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean addAll(StructuredType<? extends Type> structure) {
for (Type type : structure)
@@ -150,36 +186,59 @@ public class TypeList extends AbstractList<Type> {
return true;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public void clear() {
this.components.clear();
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean contains(Type element) {
return this.components.contains(element);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean isEmpty() {
return this.components.isEmpty();
}
+ /**
+ * Returns an iterator over the elements in this list in proper sequence.
+ *
+ * @return an iterator over the elements in this list in proper sequence
+ */
@Override
public Iterator<Type> iterator() {
return this.components.iterator();
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean remove(Type element) {
return this.components.remove(element);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public Type remove(int index) {
return this.components.remove(index);
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public boolean removeAll(StructuredType<Type> structure) {
for (Type type : structure)
@@ -188,11 +247,17 @@ public class TypeList extends AbstractList<Type> {
return true;
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public int size() {
return this.components.size();
}
+ /**
+ * {@inheritDoc}
+ */
@Override
public void accept(Visitor<Type> visitor) {
for (Type type : this.components)
diff --git a/src/site/site.xml b/src/site/site.xml
index a263ada..58beb77 100644
--- a/src/site/site.xml
+++ b/src/site/site.xml
@@ -6,17 +6,17 @@
Department of Computer Science
University of Pretoria
South Africa
-
+
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
-
+
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
-
+
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
@@ -36,7 +36,7 @@
</bannerRight>
<poweredBy>
- <logo
+ <logo
href="http://sourceforge.net/projects/cilib"
img="http://sflogo.sourceforge.net/sflogo.php?group_id=72233&type=11"
name="Get Computational Intelligence Library at SourceForge.net. Fast, secure and Free Open Source software downloads"
@@ -50,6 +50,20 @@
</poweredBy>
<body>
+ <head>
+ <meta content="Computational Intelligence, CI, Artificial Intelligence, AI, PSO, Particle swarm optimization, Evolutionary computation, GA, Genetic Algorithm, DE, Differential evolution, ABC, Artificial Bee Colony" name="KEYWORDS"/>
+ <script type="text/javascript">
+ var gaJsHost = (("https:" == document.location.protocol) ? "https://ssl." : "http://www.");
+ document.write(unescape("%3Cscript src='" + gaJsHost + "google-analytics.com/ga.js' type='text/javascript'%3E%3C/script%3E"));
+ </script>
+ <script type="text/javascript">
+ try {
+ var pageTracker = _gat._getTracker("UA-4962709-1");
+ pageTracker._trackPageview();
+ } catch(err) {}
+ </script>
+ </head>
+
<links>
<item name="SoureForge.net project page"
href="http://www.sourceforge.net/projects/cilib" />
diff --git a/src/test/java/net/sourceforge/cilib/functions/clustering/ClusteringFitnessFunctionTest.java b/src/test/java/net/sourceforge/cilib/functions/clustering/ClusteringFitnessFunctionTest.java
index e3f7964..c1de919 100644
--- a/src/test/java/net/sourceforge/cilib/functions/clustering/ClusteringFitnessFunctionTest.java
+++ b/src/test/java/net/sourceforge/cilib/functions/clustering/ClusteringFitnessFunctionTest.java
@@ -84,7 +84,6 @@ public class ClusteringFitnessFunctionTest {
@Test
public void testEvaluate() {
// the evaluate method arranges the clusters and centroids
- System.out.println(function.evaluate(centroids));
assertEquals(4.27188655918496, function.evaluate(centroids), DELTA);
}
diff --git a/src/test/java/net/sourceforge/cilib/type/DomainParserTest.java b/src/test/java/net/sourceforge/cilib/type/DomainParserTest.java
index ca30397..a6e1872 100644
--- a/src/test/java/net/sourceforge/cilib/type/DomainParserTest.java
+++ b/src/test/java/net/sourceforge/cilib/type/DomainParserTest.java
@@ -4,17 +4,17 @@
* Department of Computer Science
* University of Pretoria
* South Africa
- *
+ *
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
- *
+ *
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
@@ -32,11 +32,11 @@ import net.sourceforge.cilib.type.types.container.Vector;
import org.junit.Test;
/**
- *
+ *
* @author Gary Pampara
*/
public class DomainParserTest {
-
+
@Test
public void testParseReal() {
DomainParser parser = new DomainParser();
@@ -55,8 +55,8 @@ public class DomainParserTest {
fail("Parser cannot handle parsing of R! " + e.getMessage());
}
}
-
-
+
+
@Test
public void testParseBit() {
DomainParser parser = new DomainParser();
@@ -70,7 +70,7 @@ public class DomainParserTest {
fail("Parser cannot handle parsing of B! " + e.getMessage());
}
}
-
+
@Test
public void testParseInteger() {
@@ -90,11 +90,11 @@ public class DomainParserTest {
assertEquals("Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0),Z(0.0,1.0)", parser.expandDomainString("Z(0,1)^10"));
}
catch (Exception e) {
- fail("Parser cannot handle parsing of Z! " + e.getMessage());
+ fail("Parser cannot handle parsing of Z! " + e.getMessage());
}
}
-
-
+
+
@Test
public void testParseString() {
DomainParser parser = new DomainParser();
@@ -106,8 +106,8 @@ public class DomainParserTest {
fail("Parser cannot handle parsing of T! " + e.getMessage());
}
}
-
-
+
+
@Test
public void testParseComplexDomain() {
DomainParser parser = new DomainParser();
@@ -121,7 +121,7 @@ public class DomainParserTest {
}
}
-
+
/**
* This test determines if the parser can successfully parse and build
* domains that can be represented as a matrix (also regarded as second order
@@ -139,30 +139,30 @@ public class DomainParserTest {
fail("Parser cannot handle martix representation domains! " + e.getMessage());
}
}
-
-
+
+
@Test
public void testBuildMatrixDomain() {
DomainParser parser = new DomainParser();
try {
parser.parse("[R(-30.0,30.0)^4]^5");
-
+
TypeList matrix = (TypeList) parser.getBuiltRepresentation();
-
+
// Test the dimensionality
assertEquals(5, matrix.size());
-
+
for (int i = 0; i < matrix.size(); i++) {
assertEquals(4, ((TypeList)matrix.get(i)).size());
}
-
+
// Test object equality
Vector v1 = (Vector) matrix.get(0);
Vector v2 = (Vector) matrix.get(1);
Vector v3 = (Vector) matrix.get(2);
Vector v4 = (Vector) matrix.get(3);
Vector v5 = (Vector) matrix.get(4);
-
+
assertTrue(assertObjectNotSame(v1, v2));
assertTrue(assertObjectNotSame(v1, v3));
assertTrue(assertObjectNotSame(v1, v4));
@@ -173,32 +173,24 @@ public class DomainParserTest {
assertTrue(assertObjectNotSame(v3, v4));
assertTrue(assertObjectNotSame(v3, v4));
assertTrue(assertObjectNotSame(v4, v5));
- }
-
- catch (Exception e) {
-
+ } catch (Exception e) {
+
}
}
-
-// @Test
-// public void expansionOfPredefinedDomain() {
-// parser.parse("[R(4.3, 7.9), R(2.0, 4.4), R(1.0, 6.9), R(0.1, 2.5)]^3");
-// System.out.println(parser.getBuiltRepresentation());
-// }
-
+
/**
- *
+ *
* @param v1
* @param v2
* @return
*/
private boolean assertObjectNotSame(Vector v1, Vector v2) {
-
+
for (int i = 0; i < v1.getDimension(); i++) {
if (v1.get(i).equals(v2.get(i)))
return false;
}
-
+
return true;
}
diff --git a/src/test/java/net/sourceforge/cilib/type/types/container/TypeListTest.java b/src/test/java/net/sourceforge/cilib/type/types/container/TypeListTest.java
new file mode 100644
index 0000000..273f93e
--- /dev/null
+++ b/src/test/java/net/sourceforge/cilib/type/types/container/TypeListTest.java
@@ -0,0 +1,48 @@
+/**
+ * Copyright (C) 2003 - 2008
+ * Computational Intelligence Research Group (CIRG@UP)
+ * Department of Computer Science
+ * University of Pretoria
+ * South Africa
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
+
+package net.sourceforge.cilib.type.types.container;
+
+import net.sourceforge.cilib.type.types.Int;
+import org.junit.Assert;
+import org.junit.Test;
+
+/**
+ *
+ * @author gpampara
+ */
+public class TypeListTest {
+
+ @Test
+ public void subList() {
+ TypeList list = new TypeList();
+ list.add(new Vector());
+ list.add(new BinaryTree());
+ list.add(new Int());
+ list.add(new Set());
+ list.add(new NaryTree());
+
+ TypeList subList = list.subList(0, 3);
+
+ Assert.assertEquals(4, subList.size());
+ }
+}
\ No newline at end of file
diff --git a/src/test/java/net/sourceforge/cilib/type/types/container/VectorTest.java b/src/test/java/net/sourceforge/cilib/type/types/container/VectorTest.java
index 1b03f92..86ef5d9 100644
--- a/src/test/java/net/sourceforge/cilib/type/types/container/VectorTest.java
+++ b/src/test/java/net/sourceforge/cilib/type/types/container/VectorTest.java
@@ -34,7 +34,9 @@ import net.sourceforge.cilib.type.types.Int;
import net.sourceforge.cilib.type.types.Numeric;
import net.sourceforge.cilib.type.types.Real;
+import net.sourceforge.cilib.util.VectorUtils;
import org.junit.AfterClass;
+import org.junit.Assert;
import org.junit.BeforeClass;
import org.junit.Test;
@@ -511,4 +513,12 @@ public class VectorTest {
assertTrue(a.equals(a));
assertTrue(a.equals(b));
}
+
+ @Test
+ public void subList() {
+ Vector original = VectorUtils.create(1, 2, 3, 4, 5, 6, 7, 8, 9);
+ Vector subVector = original.subList(0, 3);
+
+ Assert.assertEquals(4, subVector.size());
+ }
}
diff --git a/src/test/java/net/sourceforge/cilib/xml/XMLFileTest.java b/src/test/java/net/sourceforge/cilib/xml/XMLFileTest.java
index f56e89b..772bd93 100644
--- a/src/test/java/net/sourceforge/cilib/xml/XMLFileTest.java
+++ b/src/test/java/net/sourceforge/cilib/xml/XMLFileTest.java
@@ -4,17 +4,17 @@
* Department of Computer Science
* University of Pretoria
* South Africa
- *
+ *
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
- *
+ *
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
- *
+ *
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
@@ -53,6 +53,9 @@ public class XMLFileTest {
* <p>
* Tests will pass if all the instance creation succeeds.
* </p>
+ * @throws ParserConfigurationException
+ * @throws SAXException
+ * @throws IOException
*/
@Test
public void simulationConstruction() throws ParserConfigurationException, SAXException, IOException {
@@ -67,7 +70,7 @@ public class XMLFileTest {
NodeList simulations = doc.getElementsByTagName("simulation");
ProgressListener progress = new ProgressText(simulations.getLength());
-
+
for (int i = 0; i < simulations.getLength(); ++i) {
if(progress != null)
progress.setSimulation(i);
--
1.6.2.3
|
