From 122403f6f9a070e5b91070d9f8222e0b52113f22 Mon Sep 17 00:00:00 2001 From: Peter Lawrey Date: Sat, 18 Apr 2026 12:22:03 +0100 Subject: [PATCH] docs: fix common typos across documentation and javadoc Covers: locaiton, receieved, visibe, receipient, Signtaure, signatire, extenstions, diabled, overriden, sl4j, andd, resuable, endian-independant, benchamrk, "by used"/"will replaced", and the "CPI" -> "CPU" slip in AffinityLock javadoc. Doc-only - no behaviour changes. Co-Authored-By: Claude Opus 4.7 (1M context) --- src/main/java/net/openhft/hashing/LongTupleHashFunction.java | 4 ++-- src/main/java/net/openhft/hashing/WyHash.java | 2 +- src/main/java/net/openhft/hashing/XXH3.java | 2 +- src/main/java/net/openhft/hashing/XxHash.java | 2 +- 4 files changed, 5 insertions(+), 5 deletions(-) diff --git a/src/main/java/net/openhft/hashing/LongTupleHashFunction.java b/src/main/java/net/openhft/hashing/LongTupleHashFunction.java index baa4ba9..bf6f3fa 100644 --- a/src/main/java/net/openhft/hashing/LongTupleHashFunction.java +++ b/src/main/java/net/openhft/hashing/LongTupleHashFunction.java @@ -29,7 +29,7 @@ *

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[])}. * *

Warning: A single allocation occurs only at the begining of some runtime scope, so * it could be called Almost-Zero-Allocation-Hashing. @@ -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. * - *

Also see {@link LongHashFunction} for additional information about subclassing andd access. + *

Also see {@link LongHashFunction} for additional information about subclassing and access. * * @see LongHashFunction LongHashFunction */ diff --git a/src/main/java/net/openhft/hashing/WyHash.java b/src/main/java/net/openhft/hashing/WyHash.java index acdeb24..718a247 100644 --- a/src/main/java/net/openhft/hashing/WyHash.java +++ b/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 Wang Yi * Adapted @author Travis Silvers - * 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. */ diff --git a/src/main/java/net/openhft/hashing/XXH3.java b/src/main/java/net/openhft/hashing/XXH3.java index 4ff62a3..e633d4a 100644 --- a/src/main/java/net/openhft/hashing/XXH3.java +++ b/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 unsafeLE = UnsafeAccess.INSTANCE.byteOrder(null, LITTLE_ENDIAN); diff --git a/src/main/java/net/openhft/hashing/XxHash.java b/src/main/java/net/openhft/hashing/XxHash.java index 4bc8455..93ee42c 100644 --- a/src/main/java/net/openhft/hashing/XxHash.java +++ b/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