From d3649034292a4e9a49fa3260bd3c4ec8baebdeeb Mon Sep 17 00:00:00 2001
From: Alex Herbert <a.herbert@sussex.ac.uk>
Date: Thu, 21 Nov 2024 12:00:13 +0000
Subject: [PATCH] Remove use of <h2> tags

---
 .../sussex/gdsc/core/utils/rng/RngStreams.java | 18 +++++++++---------
 .../utils/rng/SplittableDoubleSupplier.java    |  2 +-
 .../core/utils/rng/SplittableIntSupplier.java  |  2 +-
 .../core/utils/rng/SplittableLongSupplier.java |  2 +-
 .../rng/SplittableUniformRandomProvider.java   |  2 +-
 .../gdsc/core/utils/HashIndexCollections.java  |  2 +-
 .../core/utils/HashIndexCollectionsTest.java   |  2 +-
 7 files changed, 15 insertions(+), 15 deletions(-)

diff --git a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/RngStreams.java b/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/RngStreams.java
index 929dcf88..a7ea558d 100644
--- a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/RngStreams.java
+++ b/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)}.
diff --git a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableDoubleSupplier.java b/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableDoubleSupplier.java
index 228e02fc..21e6d402 100644
--- a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableDoubleSupplier.java
+++ b/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).
diff --git a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableIntSupplier.java b/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableIntSupplier.java
index f70ff492..c9bc6cc1 100644
--- a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableIntSupplier.java
+++ b/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).
diff --git a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableLongSupplier.java b/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableLongSupplier.java
index 9fc74919..dad81292 100644
--- a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableLongSupplier.java
+++ b/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).
diff --git a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableUniformRandomProvider.java b/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableUniformRandomProvider.java
index 316d3e43..3773d844 100644
--- a/gdsc-core/src/main/java/uk/ac/sussex/gdsc/core/utils/rng/SplittableUniformRandomProvider.java
+++ b/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).
diff --git a/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollections.java b/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollections.java
index ce025ad0..0d314334 100644
--- a/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollections.java
+++ b/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
diff --git a/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollectionsTest.java b/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollectionsTest.java
index df29b8c3..230fff2b 100644
--- a/gdsc-core/src/test/java/uk/ac/sussex/gdsc/core/utils/HashIndexCollectionsTest.java
+++ b/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