Fix (colon,j...) indexing of ArrayPartition

Because ArrayPartition is an AbstractVector but allows a non-square indexing scheme, this confuses the defaults and thus this requires a specialization.

Author: ChrisRackauckas

src/array_partition.jl

@@ -219,6 +219,18 @@ Base.@propagate_inbounds function Base.getindex(A::ArrayPartition, i::Int, j...)
   @inbounds return b[j...]
 end
 
+"""
+    getindex(A::ArrayPartition, i::Colon, j...)
+
+Returns the entry at index `j...` of  every partition of `A`.
+"""
+Base.@propagate_inbounds function Base.getindex(A::ArrayPartition, i::Colon, j...)
+  @boundscheck 0 < i <= length(A.x) || throw(BoundsError(A.x, i))
+  @inbounds b = A.x[i]
+  @boundscheck checkbounds(b, j...)
+  @inbounds return b[j...]
+end
+
 """
     getindex(A::ArrayPartition, ::Colon)
 

test/partitions_test.jl

@@ -58,6 +58,7 @@ copyto!(p,c)
 ## inference tests
 
 x = ArrayPartition([1, 2], [3.0, 4.0])
+@test x[:,1] == (1,3.0)
 
 # similar partitions
 @inferred similar(x)