javadoc fixes part 5 (ticket #1894)

core/java/src/net/i2p/crypto/SHA1.java

@@ -62,7 +62,7 @@ import net.i2p.util.SystemVersion;
  *      http://www.itl.nist.gov/div897/pubs/fip180-1.htm</a></li>
  *   <li> Bruce Schneier, "Section 18.7 Secure Hash Algorithm (SHA)",
  *      <cite>Applied Cryptography, 2nd edition</cite>, <br>
- *      John Wiley & Sons, 1996</li>
+ *      John Wiley &amp; Sons, 1996</li>
  * </ol>
  */
 public final class SHA1 extends MessageDigest implements Cloneable {

core/java/src/net/i2p/kademlia/KBucketImpl.java

@@ -34,7 +34,7 @@ import net.i2p.util.ConcurrentHashSet;
  *  The keys are kept in a Set and are NOT sorted by last-seen.
  *  Per-key last-seen-time, failures, etc. must be tracked elsewhere.
  *
- *  If this bucket is full (i.e. begin == end && size == max)
+ *  If this bucket is full (i.e. begin == end && size == max)
  *  then add() will call KBucketTrimmer.trim() do
  *  (possibly) remove older entries, and indicate whether
  *  to add the new entry. If the trimmer returns true without

core/java/src/net/metanotion/io/block/BlockFile.java

@@ -337,7 +337,7 @@ public class BlockFile implements Closeable {
 	/**
 	 *  Go to any page but the superblock.
 	 *  Page 1 is the superblock, must use file.seek(0) to get there.
-	 *  @param page >= 2
+	 *  @param page >= 2
 	 */
 	public static void pageSeek(RandomAccessInterface file, int page) throws IOException {
 		if (page < METAINDEX_PAGE)

core/java/src/net/metanotion/io/block/index/BSkipList.java

@@ -221,6 +221,7 @@ public class BSkipList<K extends Comparable<? super K>, V> extends SkipList<K, V
 	}
 ****/
 
+	/** find */
 	@Override
 	public SkipIterator<K, V> find(K key) {
 		if (!this.fileOnly)