docs: convert narrative US spellings to UK English

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

@@ -234,7 +234,7 @@ public long hashShort(short input) {
         }
 
         private static final int FIRST_SHORT_BYTE_SHIFT = NATIVE_LITTLE_ENDIAN ? 0 : 8;
-        // JIT could probably optimize & -1 to no-op
+        // JIT could probably optimise & -1 to no-op
         private static final int FIRST_SHORT_BYTE_MASK = NATIVE_LITTLE_ENDIAN ? 0xFF : -1;
         private static final int SECOND_SHORT_BYTE_SHIFT = 8 - FIRST_SHORT_BYTE_SHIFT;
         private static final int SECOND_SHORT_BYTE_MASK = NATIVE_LITTLE_ENDIAN ? -1 : 0xFF;

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

@@ -60,11 +60,11 @@
  * Parameters:
  *
  * Parameters must satisfy: 0 <= offset < offset + typeWidth <= input.length*2.
- * When offset + typeWidth >= (input.length + 1)*2, the behavior is undefined, throwing a exception
+ * When offset + typeWidth >= (input.length + 1)*2, the behaviour is undefined, throwing a exception
  * or returning dirty results.
  * When offset + typeWidth == input.length*2 + 1,
  * 1) on BE machine, the result is correct
- * 2) on LE machine, the behavior is undefined, throwing a exception or returning dirty results.
+ * 2) on LE machine, the behaviour is undefined, throwing a exception or returning dirty results.
  *
  * compressed idx :  0
  * expanded index :  0  1

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

@@ -39,7 +39,7 @@ private static <T> long u64Rorate32(final Access<T> access, T in, final long ind
      *
      * @param seed seed for the hash
      * @param input the type wrapped by the Access, ex. byte[], ByteBuffer, etc.
-     * @param access class wrapping optimized access pattern to the input
+     * @param access class wrapping optimised access pattern to the input
      * @param off offset to the input
      * @param length length to read from input
      * @param <T> byte[], ByteBuffer, etc.