Specialize iterate (#181)

* add iterate

* version bump to v0.13.3

* bugfix in upper limit

Author: jishnub

Project.toml

@@ -1,6 +1,6 @@
 name = "FillArrays"
 uuid = "1a297f60-69ca-5386-bcde-b61e274b549b"
-version = "0.13.2"
+version = "0.13.3"
 
 [deps]
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"

src/FillArrays.jl

@@ -121,7 +121,7 @@ Fill{T,0}(x::T, ::Tuple{}) where T = Fill{T,0,Tuple{}}(x, ()) # ambiguity fix
 @inline Fill{T,N,Axes}(F::Fill{T,N,Axes}) where {T,N,Axes} = F
 
 @inline axes(F::Fill) = F.axes
-@inline size(F::Fill) = length.(F.axes)
+@inline size(F::Fill) = map(length, F.axes)
 
 @inline getindex_value(F::Fill) = F.value
 
@@ -183,6 +183,12 @@ Base.@propagate_inbounds @inline Base._unsafe_getindex(::IndexStyle, F::Abstract
 getindex(A::AbstractFill, kr::AbstractVector{Bool}) = _fill_getindex(A, kr)
 getindex(A::AbstractFill, kr::AbstractArray{Bool}) = _fill_getindex(A, kr)
 
+@inline Base.iterate(F::AbstractFill) = length(F) == 0 ? nothing : (v = getindex_value(F); (v, (v, 1)))
+@inline function Base.iterate(F::AbstractFill, (v, n))
+    n >= length(F) && return nothing
+    v, (v, n+1)
+end
+
 sort(a::AbstractFill; kwds...) = a
 sort!(a::AbstractFill; kwds...) = a
 svdvals!(a::AbstractFill{<:Any,2}) = [getindex_value(a)*sqrt(prod(size(a))); Zeros(min(size(a)...)-1)]
@@ -509,11 +515,8 @@ end
 # Cumsum
 #########
 
-sum(x::AbstractFill) = getindex_value(x)*length(x)
 sum(x::Zeros) = getindex_value(x)
 
-sum(f, x::AbstractFill) = length(x) * f(getindex_value(x))
-
 cumsum(x::AbstractFill{<:Any,1}) = range(getindex_value(x); step=getindex_value(x),
                                                     length=length(x))