Use lists in javadoc
diff --git a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Fast.java b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Fast.java
index b32d949..b116a0e 100644
--- a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Fast.java
+++ b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Fast.java
@@ -34,8 +34,10 @@
* Benefits from multiple small optimizations. (see: {@link FastTripleStore})
* <p>
* The heritage of GraphMem:
- * - Also uses 3 hash-maps indexed by subjects, predicates, and objects
- * - Values of the maps also switch from arrays to hash sets for the triples
+ * <ul>
+ * <li>Also uses 3 hash-maps indexed by subjects, predicates, and objects
+ * <li>Values of the maps also switch from arrays to hash sets for the triples
+ * </ul>
*/
public class GraphMem2Fast extends GraphMem2 {
diff --git a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Legacy.java b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Legacy.java
index bb8e40a..4557a16 100644
--- a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Legacy.java
+++ b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Legacy.java
@@ -31,9 +31,11 @@
* Simplified implementation, primarily due to lack of support for Iterator#remove
* <p>
* The heritage of GraphMem:
- * - Same basic structure
- * - Same memory consumption
- * - Also based on HashCommon
+ * <ul>
+ * <li>Same basic structure
+ * <li>Same memory consumption
+ * <li>Also based on HashCommon
+ * </ul>
* <p>
* This implementation is based on the original {@link org.apache.jena.mem.GraphMem} implementation.
* The main difference is that it strictly uses term equality for all nodes.
diff --git a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Roaring.java b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Roaring.java
index bee2ab4..0be37fa 100644
--- a/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Roaring.java
+++ b/jena-core/src/main/java/org/apache/jena/mem2/GraphMem2Roaring.java
@@ -37,9 +37,11 @@
* No heritage of GraphMem.
* <p>
* Internal structure:
- * - One indexed hash set (same as GraphMem2Fast uses) that holds all triples.
- * - Three hash maps indexed by subjects, predicates, and objects with RoaringBitmaps as values.
- * - The bitmaps contain the indices of the triples in the central hash set.
+ * <ul>
+ * <li>One indexed hash set (same as GraphMem2Fast uses) that holds all triples.
+ * <li>Three hash maps indexed by subjects, predicates, and objects with RoaringBitmaps as values.
+ * <li>The bitmaps contain the indices of the triples in the central hash set.
+ * </ul>
*/
public class GraphMem2Roaring extends GraphMem2 {
public GraphMem2Roaring() {
