cosmetic fixes (tkelman)

Author: rfourquet

base/array.jl

@@ -1055,16 +1055,16 @@ end
 
 const BitIntegerArray{N} = Union{map(T->Array{T,N}, BitInteger_types)...} where N
 # use memcmp for == on bit integer types
-function ==(a::A, b::A) where A <: BitIntegerArray
+function ==(a::Arr, b::Arr) where Arr <: BitIntegerArray
     size(a) == size(b) && 0 == ccall(
-        :memcmp, Int32, (Ptr{Void}, Ptr{Void}, UInt), a, b, sizeof(eltype(A)) * length(a))
+        :memcmp, Int32, (Ptr{Void}, Ptr{Void}, UInt), a, b, sizeof(eltype(Arr)) * length(a))
 end
 
 # this is ~20% faster than the generic implementation above for very small arrays
-function ==(a::A, b::A) where A <: BitIntegerArray{1}
+function ==(a::Arr, b::Arr) where Arr <: BitIntegerArray{1}
     len = length(a)
     len == length(b) && 0 == ccall(
-        :memcmp, Int32, (Ptr{Void}, Ptr{Void}, UInt), a, b, sizeof(eltype(A)) * len)
+        :memcmp, Int32, (Ptr{Void}, Ptr{Void}, UInt), a, b, sizeof(eltype(Arr)) * len)
 end
 
 function reverse(A::AbstractVector, s=first(linearindices(A)), n=last(linearindices(A)))

base/random.jl

@@ -33,7 +33,6 @@ const BoolBitIntegerType = Union{Type{Bool},BitIntegerType}
 const BoolBitIntegerArray = Union{Array{Bool},Base.BitIntegerArray}
 
 if is_windows()
-
     struct RandomDevice <: AbstractRNG
         buffer::Vector{UInt128}
 
@@ -46,9 +45,7 @@ if is_windows()
     end
 
     rand!(rd::RandomDevice, A::BoolBitIntegerArray) = (win32_SystemFunction036!(A); A)
-
 else # !windows
-
     struct RandomDevice <: AbstractRNG
         file::IOStream
         unlimited::Bool
@@ -568,7 +565,7 @@ function rand!(r::MersenneTwister, A::Array{UInt128}, n::Int=length(A))
     A
 end
 
-# A::Array{UInt128} will matche the specialized method above
+# A::Array{UInt128} will match the specialized method above
 function rand!(r::MersenneTwister, A::Base.BitIntegerArray)
     n=length(A)
     T = eltype(A)