Bug fix: distance between arrays of floats

Author: cicirello

CHANGELOG.md

@@ -24,6 +24,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 * Bug in Permutation.toString which was inserting an extra space at end.
 * Added validation checking for all permutation distance measures validating same length permutations (except for EditDistance which can handle that case).
 * Bug in ReversalDistance.max in case when permutation length is 2, and also added missing parameter validation.
+* Minor bug fix in KendallTauSequenceDistance in the case of distance between arrays of floats.
 
 ### CI/CD
 * Migrated build process from Ant to Maven, including GitHub workflows.

src/org/cicirello/sequences/distance/KendallTauSequenceDistance.java

@@ -1,5 +1,5 @@
 /*
- * Copyright 2018-2019 Vincent A. Cicirello, <https://www.cicirello.org/>.
+ * Copyright 2018-2021 Vincent A. Cicirello, <https://www.cicirello.org/>.
  *
  * This file is part of JavaPermutationTools (https://jpt.cicirello.org/).
  *
@@ -72,13 +72,12 @@
  * assumes permutations of the integers from 0 to N-1.</p>
  *
  * <p>This distance metric, and both algorithms, is first described in the paper:<br>
- * V.A. Cicirello, <a href="https://www.cicirello.org/publications/cicirello2019arXiv.html" target=_top>"Kendall Tau
+ * V.A. Cicirello, <a href="https://www.cicirello.org/publications/eai.13-7-2018.163925.pdf" target=_top>"Kendall Tau
  * Sequence Distance: Extending Kendall Tau from Ranks to Sequences,"</a> 
- * arXiv preprint arXiv:1905.02752 [cs.DM], May 2019.</p>
+ * Industrial Networks and Intelligent Systems, 7(23), Article e1, April 2020.</p>
  *
  * @author <a href=https://www.cicirello.org/ target=_top>Vincent A. Cicirello</a>, <a href=https://www.cicirello.org/ target=_top>https://www.cicirello.org/</a>
- * @version 1.19.6.10
- * @since 1.1
+ * @version 1.30.2021
  */
 public final class KendallTauSequenceDistance extends AbstractSequenceDistanceMeasurer {
 
@@ -112,8 +111,6 @@ public KendallTauSequenceDistance() {
 	 * cost to hash objects, or if the objects are of a class that implements Comparable but
 	 * which does not provide an implementation of hashCode.</p>
 	 *
-	 * @since 1.2.3
-	 *
 	 * @param useAlternateAlg To use the alternate algorithm pass true. To use the default algorithm pass false.
 	 */
 	public KendallTauSequenceDistance(boolean useAlternateAlg) {
@@ -411,7 +408,7 @@ private int relabelElementsWithHash(double[] s1, double[] s2, int[][] relabeling
 	}
 
 	private int relabelElementsWithHash(float[] s1, float[] s2, int[][] relabeling) {
-		DoubleHT labelMap = new DoubleHT((int)(1.334 * relabeling.length)+2);
+		FloatHT labelMap = new FloatHT((int)(1.334 * relabeling.length)+2);
 		int current = -1;
 		for (int i = 0; i < relabeling.length; i++) {
 			if (!labelMap.containsKey(s1[i])) {