keep <p> open

src/main/java/io/gitlab/jfronny/commons/data/String2ObjectMap.java

@@ -443,7 +443,7 @@ public class String2ObjectMap<V> extends AbstractMap<String, V> implements Seria
      * such that the next node is only determined when next() is called on the iterator returned.
      * The traversal algorithm uses iteration instead of recursion to allow deep trees to be traversed without
      * requiring large JVM stack sizes.
-     * <p/>
+     * <p>
      * Each node that is encountered is returned from the iterator along with a key associated with that node,
      * in a NodeKeyPair object. The key will be prefixed by the given start key, and will be generated by appending
      * to the start key the edges traversed along the path to that node from the start node.
@@ -491,13 +491,13 @@ public class String2ObjectMap<V> extends AbstractMap<String, V> implements Seria
 
     /**
      * Traverses the tree and finds the node which matches the longest prefix of the given key.
-     * <p/>
+     * <p>
      * The node returned might be an <u>exact match</u> for the key, in which case {@link SearchResult#charsMatched}
      * will equal the length of the key.
-     * <p/>
+     * <p>
      * The node returned might be an <u>inexact match</u> for the key, in which case {@link SearchResult#charsMatched}
      * will be less than the length of the key.
-     * <p/>
+     * <p>
      * There are two types of inexact match:
      * <ul>
      *     <li>
@@ -620,7 +620,7 @@ public class String2ObjectMap<V> extends AbstractMap<String, V> implements Seria
      * Encapsulates results of searching the tree for a node for which a given key is a prefix. Encapsulates the node
      * found, its parent node, its parent's parent node, and the number of characters matched in the current node and
      * in total.
-     * <p/>
+     * <p>
      * Also classifies the search result so that algorithms in methods which use this SearchResult, when adding nodes
      * and removing nodes from the tree, can select appropriate strategies based on the classification.
      */

src/main/java/io/gitlab/jfronny/commons/data/impl/util/LazyIterator.java

@@ -6,7 +6,7 @@ import java.util.function.Supplier;
 
 /**
  * An unmodifiable iterator which computes the next element to return only when it is requested.
- * <p/>
+ * <p>
  * This class is inspired by com.google.common.collect.AbstractIterator in Google Guava,
  * which was written by the Google Guava Authors, in particular by Kevin Bourrillion.
  *