doc update

Author: cicirello

src/main/java/org/cicirello/sequences/SequenceSampler.java

@@ -162,9 +162,8 @@ public static <T> T[] sample(T[] source, double p) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -195,9 +194,8 @@ public static int[] sample(int[] source, int k, int[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -228,9 +226,8 @@ public static long[] sample(long[] source, int k, long[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -261,9 +258,8 @@ public static short[] sample(short[] source, int k, short[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -294,9 +290,8 @@ public static byte[] sample(byte[] source, int k, byte[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -327,9 +322,8 @@ public static char[] sample(char[] source, int k, char[] target) {
 	 * given source String.  All n choose k combinations are equally
 	 * likely, where n is the length of the source String.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -360,9 +354,8 @@ public static char[] sample(String source, int k, char[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -393,9 +386,8 @@ public static double[] sample(double[] source, int k, double[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle 
@@ -426,9 +418,8 @@ public static float[] sample(float[] source, int k, float[] target) {
 	 * given source array.  All n choose k combinations are equally
 	 * likely, where n is the length of the source array.</p>
 	 *
-	 * <p>This method chooses among the samplePool, 
-	 * sampleReservoir, and sampleInsertion 
-	 * methods based on the values of n and k.</p>
+	 * <p>This method chooses among the {@link SequencePoolSampler}, {@link SequenceReservoirSampler}, 
+	 * and {@link SequenceInsertionSampler} classes based on the values of n and k.</p>
 	 *
 	 * <p>This approach combining reservoir sampling, pool sampling, and insertion sampling
 	 * was described in: Vincent A. Cicirello. 2022. <a href="https://www.cicirello.org/publications/applsci-12-05506.pdf">Cycle