This is an automated email from the ASF dual-hosted git repository. paulk pushed a commit to branch master in repository https://gitbox.apache.org/repos/asf/groovy.git
commit 229fbd9e63ae989b3d0b8d8658758aa4a64093fc Author: Paul King <[email protected]> AuthorDate: Sun May 18 20:13:02 2025 +1000 remove javadoc warnings --- .../groovy/runtime/ArrayGroovyMethods.java | 126 ++++++++++----------- .../groovy/runtime/DefaultGroovyMethods.java | 22 ++-- .../groovy/runtime/StringGroovyMethods.java | 4 +- .../groovy/groovy/text/GStringTemplateEngine.java | 2 +- .../groovy/groovy/text/SimpleTemplateEngine.java | 2 +- .../groovy/text/StreamingTemplateEngine.java | 2 +- .../main/groovy/groovy/text/XmlTemplateEngine.java | 2 +- 7 files changed, 80 insertions(+), 80 deletions(-) diff --git a/src/main/java/org/codehaus/groovy/runtime/ArrayGroovyMethods.java b/src/main/java/org/codehaus/groovy/runtime/ArrayGroovyMethods.java index 97c6f74c73..3a6d992d00 100644 --- a/src/main/java/org/codehaus/groovy/runtime/ArrayGroovyMethods.java +++ b/src/main/java/org/codehaus/groovy/runtime/ArrayGroovyMethods.java @@ -6620,15 +6620,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as Integer[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -6668,13 +6668,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as Integer[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -6698,15 +6698,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as char[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -6746,13 +6746,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as char[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -6776,15 +6776,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as short[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -6824,13 +6824,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as short[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -6854,15 +6854,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as int[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -6902,13 +6902,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as int[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -6932,15 +6932,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as long[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -6980,13 +6980,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as long[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -7010,15 +7010,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as float[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy arr @@ -7058,13 +7058,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as float[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr @@ -7088,15 +7088,15 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as double[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 + * assert arr.partitionPoint(0..<arr.size()) { it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 + * assert arr.partitionPoint(0..<arr.size()) { it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() + * assert arr.partitionPoint(0..<arr.size()) { it <= 100 } == arr.size() * // for all match condition - * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 + * assert arr.partitionPoint(0..<arr.size()) { it <= 0 } == 0 * // for no match condition with range - * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 + * assert arr.partitionPoint(2..<arr.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy array @@ -7136,13 +7136,13 @@ public class ArrayGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def arr = [1, 2, 3, 3, 4, 4, 5, 6, 7] as double[] * // usage case like lower_bound(cpp), bisect_left(python) - * assert arr.partitionPoint{ it < 4 } == 4 + * assert arr.partitionPoint{ it < 4 } == 4 * // usage case like upper_bound(cpp), bisect_right(python) - * assert arr.partitionPoint{ it <= 4 } == 6 + * assert arr.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert arr.partitionPoint{ it <= 100 } == arr.size() + * assert arr.partitionPoint{ it <= 100 } == arr.size() * // for no match condition - * assert arr.partitionPoint{ it <= 0 } == 0 + * assert arr.partitionPoint{ it <= 0 } == 0 * </pre> * * @param self a groovy arr diff --git a/src/main/java/org/codehaus/groovy/runtime/DefaultGroovyMethods.java b/src/main/java/org/codehaus/groovy/runtime/DefaultGroovyMethods.java index 35c09f824f..7f55e7bd9d 100644 --- a/src/main/java/org/codehaus/groovy/runtime/DefaultGroovyMethods.java +++ b/src/main/java/org/codehaus/groovy/runtime/DefaultGroovyMethods.java @@ -11082,23 +11082,23 @@ public class DefaultGroovyMethods extends DefaultGroovyMethodsSupport { * The list is assumed to be partitioned according to the given predicate. * <pre class="groovyTestCase"> * def list = [7, 15, 3, 5, 4, 12, 6] - * assert list.partitionPoint(0..<list.size()) { it%2 != 0 } == 4 + * assert list.partitionPoint(0..<list.size()) { it%2 != 0 } == 4 * </pre> * * <pre class="groovyTestCase"> * def list = [1, 2, 3, 3, 4, 4, 5, 6, 7] * // usage case as lower_bound(cpp), bisect_left(python) - * assert list.partitionPoint(0..<list.size()) { it < 4 } == 4 + * assert list.partitionPoint(0..<list.size()) { it < 4 } == 4 * // usage case as upper_bound(cpp), bisect_right(python) - * assert list.partitionPoint(0..<list.size()) { it <= 4 } == 6 + * assert list.partitionPoint(0..<list.size()) { it <= 4 } == 6 * // for all match condition - * assert list.partitionPoint(0..<list.size()) { it <= 20 } == list.size() + * assert list.partitionPoint(0..<list.size()) { it <= 20 } == list.size() * // for no match condition - * assert list.partitionPoint(0..<list.size()) { it <= 0 } == 0 + * assert list.partitionPoint(0..<list.size()) { it <= 0 } == 0 * // for all match condition with range - * assert list.partitionPoint(0..<4) { it <= 20 } == 4 + * assert list.partitionPoint(0..<4) { it <= 20 } == 4 * // for no match condition with range - * assert list.partitionPoint(2..<list.size()) { it <= 0 } == 2 + * assert list.partitionPoint(2..<list.size()) { it <= 0 } == 2 * </pre> * * @param self a groovy list @@ -11137,13 +11137,13 @@ public class DefaultGroovyMethods extends DefaultGroovyMethodsSupport { * <pre class="groovyTestCase"> * def list = [1, 2, 3, 3, 4, 4, 5, 6, 7] * // usage case as lower_bound(cpp), bisect_left(python) - * assert list.partitionPoint{ it < 4 } == 4 + * assert list.partitionPoint{ it < 4 } == 4 * // usage case as upper_bound(cpp), bisect_right(python) - * assert list.partitionPoint{ it <= 4 } == 6 + * assert list.partitionPoint{ it <= 4 } == 6 * // for all match condition - * assert list.partitionPoint{ it <= 100 } == list.size() + * assert list.partitionPoint{ it <= 100 } == list.size() * // for no match condition - * assert list.partitionPoint{ it <= 0 } == 0 + * assert list.partitionPoint{ it <= 0 } == 0 * // predicate of reverse logic examples: * assert [7, 6, 5, 4, 4, 3, 3, 2, 1].partitionPoint{ it > 4 } == 3 * assert [7, 6, 5, 4, 4, 3, 3, 2, 1].partitionPoint{ it >= 4 } == 5 diff --git a/src/main/java/org/codehaus/groovy/runtime/StringGroovyMethods.java b/src/main/java/org/codehaus/groovy/runtime/StringGroovyMethods.java index 0500bed10a..df6e6aa59d 100644 --- a/src/main/java/org/codehaus/groovy/runtime/StringGroovyMethods.java +++ b/src/main/java/org/codehaus/groovy/runtime/StringGroovyMethods.java @@ -2802,7 +2802,7 @@ public class StringGroovyMethods extends DefaultGroovyMethodsSupport { * * <pre class="groovyTestCase"> * def sb = new StringBuilder() - * sb << 'foobar' + * {@code sb << 'foobar'} * sb.length -= 3 * assert sb.toString() == 'foo' * </pre> @@ -2823,7 +2823,7 @@ public class StringGroovyMethods extends DefaultGroovyMethodsSupport { * * <pre class="groovyTestCase"> * def sb = new StringBuffer() - * sb << 'foobar' + * {@code sb << 'foobar'} * sb.length -= 3 * assert sb.toString() == 'foo' * </pre> diff --git a/subprojects/groovy-templates/src/main/groovy/groovy/text/GStringTemplateEngine.java b/subprojects/groovy-templates/src/main/groovy/groovy/text/GStringTemplateEngine.java index 30bb330293..51388fad9e 100644 --- a/subprojects/groovy-templates/src/main/groovy/groovy/text/GStringTemplateEngine.java +++ b/subprojects/groovy-templates/src/main/groovy/groovy/text/GStringTemplateEngine.java @@ -79,7 +79,7 @@ import java.util.concurrent.atomic.AtomicInteger; * * The conference committee. * </pre> - * The template engine can also be used as the engine for {@link groovy.servlet.TemplateServlet} by placing the + * The template engine can also be used as the engine for {@code groovy.servlet.TemplateServlet} by placing the * following in your <code>web.xml</code> file (plus a corresponding servlet-mapping element): * <pre> * <servlet> diff --git a/subprojects/groovy-templates/src/main/groovy/groovy/text/SimpleTemplateEngine.java b/subprojects/groovy-templates/src/main/groovy/groovy/text/SimpleTemplateEngine.java index be36da183b..6a29cb79a1 100644 --- a/subprojects/groovy-templates/src/main/groovy/groovy/text/SimpleTemplateEngine.java +++ b/subprojects/groovy-templates/src/main/groovy/groovy/text/SimpleTemplateEngine.java @@ -76,7 +76,7 @@ import java.util.concurrent.atomic.AtomicInteger; * * The conference committee. * </pre> - * The template engine can also be used as the engine for {@link groovy.servlet.TemplateServlet} by placing the + * The template engine can also be used as the engine for {@code groovy.servlet.TemplateServlet} by placing the * following in your <code>web.xml</code> file (plus a corresponding servlet-mapping element): * <pre> * <servlet> diff --git a/subprojects/groovy-templates/src/main/groovy/groovy/text/StreamingTemplateEngine.java b/subprojects/groovy-templates/src/main/groovy/groovy/text/StreamingTemplateEngine.java index 02ae2d3c34..b21a7b5367 100644 --- a/subprojects/groovy-templates/src/main/groovy/groovy/text/StreamingTemplateEngine.java +++ b/subprojects/groovy-templates/src/main/groovy/groovy/text/StreamingTemplateEngine.java @@ -102,7 +102,7 @@ import java.util.concurrent.atomic.AtomicInteger; * <br /> * <h3>StreamingTemplateEngine as a servlet engine</h3> * The template engine can also be used as the engine for - * {@link groovy.servlet.TemplateServlet} by placing the following in your + * {@code groovy.servlet.TemplateServlet} by placing the following in your * <code>web.xml</code> file (plus a corresponding servlet-mapping element): * <pre> * diff --git a/subprojects/groovy-templates/src/main/groovy/groovy/text/XmlTemplateEngine.java b/subprojects/groovy-templates/src/main/groovy/groovy/text/XmlTemplateEngine.java index 0d94776d9f..5c5172a595 100644 --- a/subprojects/groovy-templates/src/main/groovy/groovy/text/XmlTemplateEngine.java +++ b/subprojects/groovy-templates/src/main/groovy/groovy/text/XmlTemplateEngine.java @@ -92,7 +92,7 @@ import java.util.concurrent.atomic.AtomicInteger; * How are you today? * </document> * </pre> - * The XML template engine can also be used as the engine for {@link groovy.servlet.TemplateServlet} by placing the + * The XML template engine can also be used as the engine for {@code groovy.servlet.TemplateServlet} by placing the * following in your web.xml file (plus a corresponding servlet-mapping element): * <pre> * <servlet>
