--- a/src/java.base/share/classes/java/lang/String.java Wed May 23 16:26:29 2018 +0200
+++ b/src/java.base/share/classes/java/lang/String.java Wed May 23 08:49:00 2018 -0700
@@ -2180,14 +2180,23 @@
*
* <p> The {@code limit} parameter controls the number of times the
* pattern is applied and therefore affects the length of the resulting
- * array. If the limit <i>n</i> is greater than zero then the pattern
- * will be applied at most <i>n</i> - 1 times, the array's
- * length will be no greater than <i>n</i>, and the array's last entry
- * will contain all input beyond the last matched delimiter. If <i>n</i>
- * is non-positive then the pattern will be applied as many times as
- * possible and the array can have any length. If <i>n</i> is zero then
- * the pattern will be applied as many times as possible, the array can
- * have any length, and trailing empty strings will be discarded.
+ * array.
+ * <ul>
+ * <li><p>
+ * If the <i>limit</i> is positive then the pattern will be applied
+ * at most <i>limit</i> - 1 times, the array's length will be
+ * no greater than <i>limit</i>, and the array's last entry will contain
+ * all input beyond the last matched delimiter.</p></li>
+ *
+ * <li><p>
+ * If the <i>limit</i> is zero then the pattern will be applied as
+ * many times as possible, the array can have any length, and trailing
+ * empty strings will be discarded.</p></li>
+ *
+ * <li><p>
+ * If the <i>limit</i> is negative then the pattern will be applied
+ * as many times as possible and the array can have any length.</p></li>
+ * </ul>
*
* <p> The string {@code "boo:and:foo"}, for example, yields the
* following results with these parameters:
--- a/src/java.base/share/classes/java/util/regex/Pattern.java Wed May 23 16:26:29 2018 +0200
+++ b/src/java.base/share/classes/java/util/regex/Pattern.java Wed May 23 08:49:00 2018 -0700
@@ -1193,14 +1193,23 @@
*
* <p> The {@code limit} parameter controls the number of times the
* pattern is applied and therefore affects the length of the resulting
- * array. If the limit <i>n</i> is greater than zero then the pattern
- * will be applied at most <i>n</i> - 1 times, the array's
- * length will be no greater than <i>n</i>, and the array's last entry
- * will contain all input beyond the last matched delimiter. If <i>n</i>
- * is non-positive then the pattern will be applied as many times as
- * possible and the array can have any length. If <i>n</i> is zero then
- * the pattern will be applied as many times as possible, the array can
- * have any length, and trailing empty strings will be discarded.
+ * array.
+ * <ul>
+ * <li><p>
+ * If the <i>limit</i> is positive then the pattern will be applied
+ * at most <i>limit</i> - 1 times, the array's length will be
+ * no greater than <i>limit</i>, and the array's last entry will contain
+ * all input beyond the last matched delimiter.</p></li>
+ *
+ * <li><p>
+ * If the <i>limit</i> is zero then the pattern will be applied as
+ * many times as possible, the array can have any length, and trailing
+ * empty strings will be discarded.</p></li>
+ *
+ * <li><p>
+ * If the <i>limit</i> is negative then the pattern will be applied
+ * as many times as possible and the array can have any length.</p></li>
+ * </ul>
*
* <p> The input {@code "boo:and:foo"}, for example, yields the following
* results with these parameters: