diff options
| author | rriggs <none@none> | 2013-10-22 17:02:08 -0400 |
|---|---|---|
| committer | rriggs <none@none> | 2013-10-22 17:02:08 -0400 |
| commit | d04f58bcf1b96ac2aeed34240fd2fd3f6c8c7742 (patch) | |
| tree | ee9e20270a8bc2f04f2fc3e2e1e303167f4800d3 /src/share/classes/java/util/concurrent | |
| parent | 410de882a809cf73495674b180105917b02e9f02 (diff) | |
| download | jdk8u_jdk-d04f58bcf1b96ac2aeed34240fd2fd3f6c8c7742.tar.gz | |
8026982: javadoc errors in core libs
Summary: Cleanup of javadoc -Xlint errors
Reviewed-by: lancea, mduigou, darcy, mullan, mchung
Diffstat (limited to 'src/share/classes/java/util/concurrent')
4 files changed, 2 insertions, 6 deletions
diff --git a/src/share/classes/java/util/concurrent/BlockingDeque.java b/src/share/classes/java/util/concurrent/BlockingDeque.java index d98586a95b..0a26fa8dee 100644 --- a/src/share/classes/java/util/concurrent/BlockingDeque.java +++ b/src/share/classes/java/util/concurrent/BlockingDeque.java @@ -50,7 +50,6 @@ import java.util.*; * and the fourth blocks for only a given maximum time limit before giving * up. These methods are summarized in the following table: * - * <p> * <table BORDER CELLPADDING=3 CELLSPACING=1> * <caption>Summary of BlockingDeque methods</caption> * <tr> @@ -126,7 +125,6 @@ import java.util.*; * {@code BlockingQueue} interface are precisely equivalent to * {@code BlockingDeque} methods as indicated in the following table: * - * <p> * <table BORDER CELLPADDING=3 CELLSPACING=1> * <caption>Comparison of BlockingQueue and BlockingDeque methods</caption> * <tr> diff --git a/src/share/classes/java/util/concurrent/BlockingQueue.java b/src/share/classes/java/util/concurrent/BlockingQueue.java index 8eb3ce2c98..3d097079f6 100644 --- a/src/share/classes/java/util/concurrent/BlockingQueue.java +++ b/src/share/classes/java/util/concurrent/BlockingQueue.java @@ -53,7 +53,6 @@ import java.util.Queue; * and the fourth blocks for only a given maximum time limit before giving * up. These methods are summarized in the following table: * - * <p> * <table BORDER CELLPADDING=3 CELLSPACING=1> * <caption>Summary of BlockingQueue methods</caption> * <tr> diff --git a/src/share/classes/java/util/concurrent/Future.java b/src/share/classes/java/util/concurrent/Future.java index 5c5578e03a..1011972167 100644 --- a/src/share/classes/java/util/concurrent/Future.java +++ b/src/share/classes/java/util/concurrent/Future.java @@ -52,8 +52,8 @@ package java.util.concurrent; * * <p> * <b>Sample Usage</b> (Note that the following classes are all - * made-up.) <p> - * <pre> {@code + * made-up.) + * <pre> {@code * interface ArchiveSearcher { String search(String target); } * class App { * ExecutorService executor = ... diff --git a/src/share/classes/java/util/concurrent/locks/ReentrantReadWriteLock.java b/src/share/classes/java/util/concurrent/locks/ReentrantReadWriteLock.java index 519477e524..dc811c2146 100644 --- a/src/share/classes/java/util/concurrent/locks/ReentrantReadWriteLock.java +++ b/src/share/classes/java/util/concurrent/locks/ReentrantReadWriteLock.java @@ -56,7 +56,6 @@ import java.util.Collection; * constraints. A nonfair lock that is continuously contended may * indefinitely postpone one or more reader or writer threads, but * will normally have higher throughput than a fair lock. - * <p> * * <dt><b><i>Fair mode</i></b> * <dd>When constructed as fair, threads contend for entry using an |