Finished first loop of JavaDoc generation.

-Fixed: A couple bugs that were found during javadoc generation. Next loop of javadoc comes later right now i want to add splititerators and streams
2021-04-26 22:25:09 +02:00
parent f7d311fd09
commit a9a38f7853
22 changed files with 1173 additions and 212 deletions
@@ -430,7 +430,7 @@ public class CUSTOM_HASH_MAP KEY_VALUE_GENERIC_TYPE extends ABSTRACT_MAP KEY_VAL
 	
 #if !TYPE_OBJECT
 	protected int findIndex(KEY_TYPE key) {
-		if(KEY_EQUALS_NULL(key)) return containsNull ? nullIndex : -(nullIndex + 1);
+		if(strategy.equals(key, EMPTY_KEY_VALUE)) return containsNull ? nullIndex : -(nullIndex + 1);
 		int pos = HashUtil.mix(strategy.hashCode(key)) & mask;
 		KEY_TYPE current = keys[pos];
 		if(!strategy.equals(current, EMPTY_KEY_VALUE)) {
@@ -43,7 +43,7 @@ import speiger.src.collections.objects.sets.ObjectSet;
 * A Simple Type Specific AVL TreeMap implementation that reduces boxing/unboxing.
 * It is using a bit more memory then <a href="https://github.com/vigna/fastutil">FastUtil</a>,
 * but it saves a lot of Performance on the Optimized removal and iteration logic.
- * Which makes the implementation actually useable and does not force to use Javas default implementation.
+ * Which makes the implementation actually useable and does not get outperformed by Javas default implementation.
 * @Type(T)
 * @ValueType(V)
 */
@@ -43,7 +43,7 @@ import speiger.src.collections.objects.sets.ObjectSet;
 * A Simple Type Specific RB TreeMap implementation that reduces boxing/unboxing.
 * It is using a bit more memory then <a href="https://github.com/vigna/fastutil">FastUtil</a>,
 * but it saves a lot of Performance on the Optimized removal and iteration logic.
- * Which makes the implementation actually useable and does not force to use Javas default implementation.
+ * Which makes the implementation actually useable and does not get outperformed by Javas default implementation.
 * @Type(T)
 * @ValueType(V)
 */