Remove use of <h2> tags

gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/RngStreams.java

@@ -457,7 +457,7 @@ public static IntStream ints(SplittableUniformRandomProvider rng, long streamSiz
    * Returns an effectively unlimited stream of pseudorandom {@code int} values from the generator
    * and/or one split from it.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #ints(SplittableUniformRandomProvider, long) ints(rng, Long.MAX_VALUE)}.
@@ -502,7 +502,7 @@ public static IntStream ints(SplittableUniformRandomProvider rng, long streamSiz
    * int} values from the generator and/or one split from it; each value conforms to the given
    * origin (inclusive) and bound (exclusive).
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #ints(SplittableUniformRandomProvider, long, int, int) ints(rng, Long.MAX_VALUE,
@@ -546,7 +546,7 @@ public static IntStream ints(SplittableIntSupplier generator, long streamSize) {
    * Returns an effectively unlimited stream of {@code int} values from the generator and/or one
    * split from it.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to {@link #ints(SplittableIntSupplier, long)
    * ints(generator, Long.MAX_VALUE)}.
@@ -580,7 +580,7 @@ public static LongStream longs(SplittableUniformRandomProvider rng, long streamS
    * Returns an effectively unlimited stream of pseudorandom {@code
    * long} values from the generator and/or one split from it.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #longs(SplittableUniformRandomProvider, long) longs(rng, Long.MAX_VALUE)}.
@@ -625,7 +625,7 @@ public static LongStream longs(SplittableUniformRandomProvider rng, long streamS
    * long} values from the generator and/or one split from it; each value conforms to the given
    * origin (inclusive) and bound (exclusive).
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #longs(SplittableUniformRandomProvider, long, long, long) longs(rng, Long.MAX_VALUE,
@@ -669,7 +669,7 @@ public static LongStream longs(SplittableLongSupplier generator, long streamSize
    * Returns an effectively unlimited stream of {@code long} values from the generator and/or one
    * split from it.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to {@link #longs(SplittableLongSupplier, long)
    * longs(generator, Long.MAX_VALUE)}.
@@ -705,7 +705,7 @@ public static DoubleStream doubles(SplittableUniformRandomProvider rng, long str
    * double} values from the generator and/or one split from it; each value is between zero
    * (inclusive) and one (exclusive).
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #doubles(SplittableUniformRandomProvider, long) doubles(rng, Long.MAX_VALUE)}.
@@ -751,7 +751,7 @@ public static DoubleStream doubles(SplittableUniformRandomProvider rng, long str
    * double} values from the generator and/or one split from it; each value conforms to the given
    * origin (inclusive) and bound (exclusive).
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #doubles(SplittableUniformRandomProvider, long, double, double) doubles(rng,
@@ -796,7 +796,7 @@ public static DoubleStream doubles(SplittableDoubleSupplier generator, long stre
    * Returns an effectively unlimited stream of {@code double} values from the generator and/or one
    * split from it.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>This method is implemented to be equivalent to
    * {@link #doubles(SplittableDoubleSupplier, long) doubles(generator, Long.MAX_VALUE)}.

gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableDoubleSupplier.java

@@ -34,7 +34,7 @@
  * Applies to suppliers of {@code double} numbers that can be split to create a new independent
  * instance.
  *
- * <h2>Overlap Computations</h2>
+ * <p><strong>Overlap Computations</strong>
  *
  * <p>The probability of overlap among different streams of suppliers can be computed using an
  * approximation. The following is extracted from L&#39;Ecuyer, et al. (2017).

gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableIntSupplier.java

@@ -34,7 +34,7 @@
  * Applies to suppliers of {@code int} numbers that can be split to create a new independent
  * instance.
  *
- * <h2>Overlap Computations</h2>
+ * <p><strong>Overlap Computations</strong>
  *
  * <p>The probability of overlap among different streams of suppliers can be computed using an
  * approximation. The following is extracted from L&#39;Ecuyer, et al. (2017).

gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableLongSupplier.java

@@ -34,7 +34,7 @@
  * Applies to suppliers of {@code long} numbers that can be split to create a new independent
  * instance.
  *
- * <h2>Overlap Computations</h2>
+ * <p><strong>Overlap Computations</strong>
  *
  * <p>The probability of overlap among different streams of suppliers can be computed using an
  * approximation. The following is extracted from L&#39;Ecuyer, et al. (2017).

gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableUniformRandomProvider.java

@@ -34,7 +34,7 @@
  * Applies to generators of random number sequences that follow a uniform distribution and can be
  * split to create a new independent instance.
  *
- * <h2>Overlap Computations</h2>
+ * <p><strong>Overlap Computations</strong>
  *
  * <p>The probability of overlap among different streams of generators can be computed using an
  * approximation. The following is extracted from L&#39;Ecuyer, et al. (2017).

gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollections.java

@@ -66,7 +66,7 @@
  *     HashIntIntMaps.getDefaultFactory().withKeysDomain(0, Integer.MAX_VALUE).newUpdatableMap();
  * </pre>
  *
- * <h2>Note</h2>
+ * <p><strong>Note</strong>
  *
  * <p>The keys domain is a performance hint. It is not expected that the returned maps will prevent
  * insertion of negative valued keys. The class is tested to ensure that the default factory

gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollectionsTest.java

@@ -69,7 +69,7 @@ class HashIndexCollectionsTest {
   /**
    * Keys not in the key domain.
    *
-   * <h2>Note</h2>
+   * <p><strong>Note</strong>
    *
    * <p>Koloboke v1.0.0 used the keys domain as a performance hint for table initialisation.
    * Out-of-domain keys should still be allowed. Filtering the key domain is expensive. The tests