subject line

Corrected spelling

Corrected spelling.

Author: wclodius2

doc/specs/stdlib_hash_functions.md

@@ -581,7 +581,7 @@ It differs from typical implementations in that it also ecodes the
 size of the structure in the hash code.
 This code is relatively fast on short keys, and is small enough that it
 will often be retained in the instruction cache if hashing is
-intermitent.
+intermittent.
 As a result it should give good performance for typical hash table
 applications.
 This code does not pass any of the SMHasher tests, but the resulting
@@ -643,7 +643,7 @@ It differs from typical implementations in that it also ecodes the
 size of the structure in the hash code.
 This code is relatively fast on short keys, and is small enough that it
 will often be retained in the instruction cache if hashing is
-intermitent.
+intermittent.
 As a result it should give good performance for typical hash table
 applications.
 This code does not pass any of the SMHasher tests, but the resulting
@@ -1208,7 +1208,7 @@ It differs from typical implementations in that it also ecodes the
 size of the structure in the hash code.
 This code is relatively fast on short keys, and is small enough that it
 will often be retained in the instruction cache if hashing is
-intermitent.
+intermittent.
 As a result it should give good performance for typical hash table
 applications, although it is rare for them to need 64 bits.
 This code does not pass any of the SMHasher tests, but the resulting
@@ -1270,7 +1270,7 @@ It differs from typical implementations in that it also ecodes the
 size of the structure in the hash code.
 This code is relatively fast on short keys, and is small enough that it
 will often be retained in the instruction cache if hashing is
-intermitent.
+intermittent.
 As a result it should give good performance for typical hash table
 applications.
 This code does not pass any of the SMHasher tests, but the resulting

src/stdlib_32_bit_hash_functions.fypp

@@ -229,7 +229,7 @@ contains
     end function universal_mult_hash
 
     subroutine odd_random_integer( harvest )
-!! Returns a 32 bit psuedo random integer, HARVEST, distributed uniformly over
+!! Returns a 32 bit pseudo random integer, HARVEST, distributed uniformly over
 !! the odd integers of the INT32 kind.
         integer(int32), intent(out) :: harvest
         real(dp) :: sample

src/stdlib_64_bit_hash_functions.fypp

@@ -279,7 +279,7 @@ contains
     end function universal_mult_hash
 
     subroutine odd_random_integer( harvest )
-!! Returns a 64 bit psuedo random integer, HARVEST, distributed uniformly over
+!! Returns a 64 bit pseudo random integer, HARVEST, distributed uniformly over
 !! the odd integers of the 64 bit kind.
         integer(int64), intent(out) :: harvest
         real(dp) :: sample(2)
@@ -293,7 +293,7 @@ contains
     end subroutine odd_random_integer
 
     subroutine random_integer( harvest )
-!! Returns a 64 bit psuedo random integer, HARVEST, distributed uniformly over
+!! Returns a 64 bit pseudo random integer, HARVEST, distributed uniformly over
 !! the values of the 64 bit kind.
         integer(int64), intent(out) :: harvest
         real(dp) :: sample(2)

src/stdlib_64_bit_spookyv2_hashes.fypp

@@ -1,4 +1,3 @@
-#! Integer kinds to be considered during templating
 !!------------------------------------------------------------------------------
 !! `SPOOKY_HASH` is a translation to Fortran 2008 of the unsigned 64 bit
 !! `SpookyHash` V2 function of Bob Jenkins
@@ -11,6 +10,7 @@
 !! different on Big Endian processors, but still probably as good quality.
 !!------------------------------------------------------------------------------
 
+#! Integer kinds to be considered during templating
 #:set INT_KINDS = ["int16", "int32", "int64"]
 
 submodule(stdlib_64_bit_hash_functions) stdlib_64_bit_spookyv2_hashes
@@ -204,7 +204,7 @@ contains
 100     c = c + sc_const
         d = d + sc_const
 
-888     call shortend( a, b, c, d )
+888     call short_end( a, b, c, d )
 
         hash_inout(1) = a
         hash_inout(2) = b
@@ -285,7 +285,7 @@ contains
 
         end subroutine shortmix
 
-        pure subroutine shortend( h0, h1, h2, h3 )
+        pure subroutine short_end( h0, h1, h2, h3 )
     !
     ! Mix all 4 inputs together so that h0, h1 are a hash of them all.
     !
@@ -334,7 +334,7 @@ contains
             h0 = ishftc( h0, 63 )
             h1 = h1 + h0
 
-        end subroutine shortend
+        end subroutine short_end
 
     end subroutine spookyhash_short