docs: fix common typos

src/main/java/net/openhft/hashing/LongTupleHashFunction.java

@@ -29,7 +29,7 @@
  *     <p>will store the hash results in array {@code result[0 .. newResultArray().length-1]}, and
  *     throws exceptions when {@code result == null} or the length of the array is less than
  *     {@code newResultArray().length}. {@link #newResultArray} method should always be used to
- *     create resuable result arrays to avoid exceptions. See {@link #hashLong(long, long[])}.
+ *     create reusable result arrays to avoid exceptions. See {@link #hashLong(long, long[])}.
  *
  *     <p><b>Warning:</b> A single allocation occurs only at the begining of some runtime scope, so
  *     it could be called <strong>Almost-Zero-Allocation-Hashing</strong>.</li>
@@ -55,7 +55,7 @@
  * in the result array. The bits length must be greater than 64, otherwise just use the
  * {@link LongHashFunction} interface. And the length should also be a positive multiple of 8.
  *
- * <p>Also see {@link LongHashFunction} for additional information about subclassing andd access.
+ * <p>Also see {@link LongHashFunction} for additional information about subclassing and access.
  *
  * @see LongHashFunction LongHashFunction
  */

src/main/java/net/openhft/hashing/WyHash.java

@@ -9,7 +9,7 @@
  * Adapted version of WyHash implementation from https://github.com/wangyi-fudan/wyhash
  * Original @author <a href="mailto:godspeed_china@yeah.net">Wang Yi</a>
  * Adapted @author <a href="mailto:firestrand@gmail.com">Travis Silvers</a>
- * This implementation provides endian-independant hash values, but it's slower on big-endian
+ * This implementation provides endian-independent hash values, but it's slower on big-endian
  * platforms.
  * The original C based version is also much faster.
  */

src/main/java/net/openhft/hashing/XXH3.java

@@ -11,7 +11,7 @@
 
 /**
  * Adapted version of XXH3 implementation from https://github.com/Cyan4973/xxHash.
- * This implementation provides endian-independant hash values, but it's slower on big-endian platforms.
+ * This implementation provides endian-independent hash values, but it's slower on big-endian platforms.
  */
 class XXH3 {
     private static final Access<Object> unsafeLE = UnsafeAccess.INSTANCE.byteOrder(null, LITTLE_ENDIAN);

src/main/java/net/openhft/hashing/XxHash.java

@@ -7,7 +7,7 @@
 
 /**
  * Adapted version of xxHash implementation from https://github.com/Cyan4973/xxHash.
- * This implementation provides endian-independant hash values, but it's slower on big-endian platforms.
+ * This implementation provides endian-independent hash values, but it's slower on big-endian platforms.
  */
 class XxHash {
     // Primes if treated as unsigned