#845 Adjust JavaDoc

EsotericSoftware · Jan 18, 2022 · 58986f5 · 58986f5
1 parent 39c42fe
commit 58986f5
Show file tree

Hide file tree

Showing 4 changed files with 8 additions and 8 deletions.
diff --git a/src/com/esotericsoftware/kryo/util/IdentityMap.java b/src/com/esotericsoftware/kryo/util/IdentityMap.java
@@ -23,8 +23,8 @@
  * when growing the table size.
  * <p>
  * This class performs fast contains and remove (typically O(1), worst case O(n) but that is rare in practice). Add may be
- * slightly slower, depending on hash collisions. Hashcodes are rehashed to reduce collisions and the need to resize. Load factors
- * greater than 0.91 greatly increase the chances to resize to the next higher POT size.
+ * slightly slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances to resize to the
+ * next higher POT size.
  * <p>
  * Unordered sets and maps are not designed to provide especially fast iteration.
  * <p>

diff --git a/src/com/esotericsoftware/kryo/util/IdentityObjectIntMap.java b/src/com/esotericsoftware/kryo/util/IdentityObjectIntMap.java
@@ -23,8 +23,8 @@
  * allowed. No allocation is done except when growing the table size.
  * <p>
  * This class performs fast contains and remove (typically O(1), worst case O(n) but that is rare in practice). Add may be
- * slightly slower, depending on hash collisions. Hashcodes are rehashed to reduce collisions and the need to resize. Load factors
- * greater than 0.91 greatly increase the chances to resize to the next higher POT size.
+ * slightly slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances to resize to the
+ * next higher POT size.
  * <p>
  * Unordered sets and maps are not designed to provide especially fast iteration.
  * <p>

diff --git a/src/com/esotericsoftware/kryo/util/ObjectIntMap.java b/src/com/esotericsoftware/kryo/util/ObjectIntMap.java
@@ -33,8 +33,8 @@
  * except when growing the table size.
  * <p>
  * This class performs fast contains and remove (typically O(1), worst case O(n) but that is rare in practice). Add may be
- * slightly slower, depending on hash collisions. Hashcodes are rehashed to reduce collisions and the need to resize. Load factors
- * greater than 0.91 greatly increase the chances to resize to the next higher POT size.
+ * slightly slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances to resize to the
+ * next higher POT size.
  * <p>
  * Unordered sets and maps are not designed to provide especially fast iteration. Iteration is faster with OrderedSet and
  * OrderedMap.

diff --git a/src/com/esotericsoftware/kryo/util/ObjectMap.java b/src/com/esotericsoftware/kryo/util/ObjectMap.java
@@ -29,8 +29,8 @@
  * the table size.
  * <p>
  * This class performs fast contains and remove (typically O(1), worst case O(n) but that is rare in practice). Add may be
- * slightly slower, depending on hash collisions. Hashcodes are rehashed to reduce collisions and the need to resize. Load factors
- * greater than 0.91 greatly increase the chances to resize to the next higher POT size.
+ * slightly slower, depending on hash collisions. Load factors greater than 0.91 greatly increase the chances to resize to the
+ * next higher POT size.
  * <p>
  * Unordered sets and maps are not designed to provide especially fast iteration.
  * <p>