@@ -532,10 +532,6 @@ convert{T,N}(::Type{AbstractArray{T,N}}, B::BitArray{N}) = convert(Array{T,N}, B
532
532
reinterpret {N} (:: Type{Bool} , B:: BitArray , dims:: NTuple{N,Int} ) = reinterpret (B, dims)
533
533
reinterpret {N} (B:: BitArray , dims:: NTuple{N,Int} ) = reshape (B, dims)
534
534
535
- # shorthand forms BitArray <-> Array
536
- bitunpack {N} (B:: BitArray{N} ) = convert (Array{Bool,N}, B)
537
- bitpack {T,N} (A:: AbstractArray{T,N} ) = convert (BitArray{N}, A)
538
-
539
535
# # Indexing: getindex ##
540
536
541
537
@inline function unsafe_bitgetindex (Bc:: Vector{UInt64} , i:: Int )
@@ -665,8 +661,8 @@ function append!(B::BitVector, items::BitVector)
665
661
return B
666
662
end
667
663
668
- append! (B:: BitVector , items:: AbstractVector{Bool} ) = append! (B, bitpack (items))
669
- append! (A:: Vector{Bool} , items:: BitVector ) = append! (A, bitunpack (items))
664
+ append! (B:: BitVector , items:: AbstractVector{Bool} ) = append! (B, BitArray (items))
665
+ append! (A:: Vector{Bool} , items:: BitVector ) = append! (A, Array (items))
670
666
671
667
function prepend! (B:: BitVector , items:: BitVector )
672
668
n0 = length (B)
@@ -687,8 +683,8 @@ function prepend!(B::BitVector, items::BitVector)
687
683
return B
688
684
end
689
685
690
- prepend! (B:: BitVector , items:: AbstractVector{Bool} ) = prepend! (B, bitpack (items))
691
- prepend! (A:: Vector{Bool} , items:: BitVector ) = prepend! (A, bitunpack (items))
686
+ prepend! (B:: BitVector , items:: AbstractVector{Bool} ) = prepend! (B, BitArray (items))
687
+ prepend! (A:: Vector{Bool} , items:: BitVector ) = prepend! (A, Array (items))
692
688
693
689
function sizehint! (B:: BitVector , sz:: Integer )
694
690
ccall (:jl_array_sizehint , Void, (Any, UInt), B. chunks, num_bit_chunks (sz))
@@ -1068,19 +1064,19 @@ end
1068
1064
1069
1065
for f in (:/ , :\ )
1070
1066
@eval begin
1071
- ($ f)(A:: BitArray , B:: BitArray ) = ($ f)(bitunpack (A), bitunpack (B))
1067
+ ($ f)(A:: BitArray , B:: BitArray ) = ($ f)(Array (A), Array (B))
1072
1068
end
1073
1069
end
1074
- (/ )(B:: BitArray , x:: Number ) = (/ )(bitunpack (B), x)
1075
- (/ )(x:: Number , B:: BitArray ) = (/ )(x, bitunpack (B))
1070
+ (/ )(B:: BitArray , x:: Number ) = (/ )(Array (B), x)
1071
+ (/ )(x:: Number , B:: BitArray ) = (/ )(x, Array (B))
1076
1072
1077
1073
function div (A:: BitArray , B:: BitArray )
1078
1074
shp = promote_shape (size (A), size (B))
1079
1075
all (B) || throw (DivideError ())
1080
1076
return reshape (copy (A), shp)
1081
1077
end
1082
- div (A:: BitArray , B:: Array{Bool} ) = div (A, bitpack (B))
1083
- div (A:: Array{Bool} , B:: BitArray ) = div (bitpack (A), B)
1078
+ div (A:: BitArray , B:: Array{Bool} ) = div (A, BitArray (B))
1079
+ div (A:: Array{Bool} , B:: BitArray ) = div (BitArray (A), B)
1084
1080
function div (B:: BitArray , x:: Bool )
1085
1081
return x ? copy (B) : throw (DivideError ())
1086
1082
end
@@ -1100,8 +1096,8 @@ function mod(A::BitArray, B::BitArray)
1100
1096
all (B) || throw (DivideError ())
1101
1097
return falses (shp)
1102
1098
end
1103
- mod (A:: BitArray , B:: Array{Bool} ) = mod (A, bitpack (B))
1104
- mod (A:: Array{Bool} , B:: BitArray ) = mod (bitpack (A), B)
1099
+ mod (A:: BitArray , B:: Array{Bool} ) = mod (A, BitArray (B))
1100
+ mod (A:: Array{Bool} , B:: BitArray ) = mod (BitArray (A), B)
1105
1101
function mod (B:: BitArray , x:: Bool )
1106
1102
return x ? falses (size (B)) : throw (DivideError ())
1107
1103
end
@@ -1157,10 +1153,10 @@ for f in (:&, :|, :$)
1157
1153
Fc[end ] &= _msk_end (F)
1158
1154
return F
1159
1155
end
1160
- ($ f)(A:: DenseArray{Bool} , B:: BitArray ) = ($ f)(bitpack (A), B)
1161
- ($ f)(B:: BitArray , A:: DenseArray{Bool} ) = ($ f)(B, bitpack (A))
1162
- ($ f)(x:: Number , B:: BitArray ) = ($ f)(x, bitunpack (B))
1163
- ($ f)(B:: BitArray , x:: Number ) = ($ f)(bitunpack (B), x)
1156
+ ($ f)(A:: DenseArray{Bool} , B:: BitArray ) = ($ f)(BitArray (A), B)
1157
+ ($ f)(B:: BitArray , A:: DenseArray{Bool} ) = ($ f)(B, BitArray (A))
1158
+ ($ f)(x:: Number , B:: BitArray ) = ($ f)(x, Array (B))
1159
+ ($ f)(B:: BitArray , x:: Number ) = ($ f)(Array (B), x)
1164
1160
end
1165
1161
end
1166
1162
@@ -1233,8 +1229,8 @@ end
1233
1229
1234
1230
(.* )(x:: Bool , B:: BitArray ) = x & B
1235
1231
(.* )(B:: BitArray , x:: Bool ) = B & x
1236
- (.* )(x:: Number , B:: BitArray ) = x .* bitunpack (B)
1237
- (.* )(B:: BitArray , x:: Number ) = bitunpack (B) .* x
1232
+ (.* )(x:: Number , B:: BitArray ) = x .* Array (B)
1233
+ (.* )(B:: BitArray , x:: Number ) = Array (B) .* x
1238
1234
1239
1235
# # promotion to complex ##
1240
1236
0 commit comments