@@ -682,7 +682,7 @@ Base.done(np::NextPrimes, state) = false
682
682
Base. iteratorsize (:: Type{<:NextPrimes} ) = Base. IsInfinite ()
683
683
Base. iteratoreltype (:: Type{<:NextPrimes} ) = Base. HasEltype () # default
684
684
685
- Base. eltype (:: Type{NextPrimes{T}} ) where {T} = T
685
+ Base. eltype {T} (:: Type{NextPrimes{T}} ) = T
686
686
687
687
"""
688
688
nextprimes(start::Integer)
@@ -698,7 +698,7 @@ nextprimes(start::Integer) = NextPrimes(start)
698
698
Returns an iterator over all primes, with type `T`.
699
699
Equivalent to `nextprimes(T(1))`.
700
700
"""
701
- nextprimes (:: Type{T} ) where {T <: Integer } = nextprimes (one (T))
701
+ nextprimes {T<:Integer} (:: Type{T} ) = nextprimes (one (T))
702
702
nextprimes () = nextprimes (Int)
703
703
704
704
"""
@@ -716,7 +716,7 @@ julia> nextprimes(10, 3)
716
716
17
717
717
```
718
718
"""
719
- nextprimes (start:: T , n:: Integer ) where {T <: Integer } =
719
+ nextprimes {T<:Integer} (start:: T , n:: Integer ) =
720
720
iterate (x-> nextprime (add (x, 1 )), nextprime (start), n)
721
721
722
722
struct PrevPrimes{T<: Integer }
@@ -730,7 +730,7 @@ done(np::PrevPrimes, state) = state == 2
730
730
iteratorsize (:: Type{<:PrevPrimes} ) = Base. SizeUnknown ()
731
731
iteratoreltype (:: Type{<:PrevPrimes} ) = Base. HasEltype () # default
732
732
733
- eltype (:: Type{PrevPrimes{T}} ) where {T} = T
733
+ eltype {T} (:: Type{PrevPrimes{T}} ) = T
734
734
735
735
"""
736
736
prevprimes(start::Integer)
@@ -767,11 +767,11 @@ julia> prevprimes(10, 3)
767
767
3
768
768
```
769
769
"""
770
- prevprimes (start:: T , n:: Integer ) where {T <: Integer } =
770
+ prevprimes {T<:Integer} (start:: T , n:: Integer ) =
771
771
iterate (x-> prevprime (add (x, - 1 )), prevprime (start), n)
772
772
773
- function iterate (f, x:: T , n:: Integer ) where T
774
- v = Vector {T } (n)
773
+ function iterate (f, x, n:: Integer )
774
+ v = Vector {eltype(x) } (n)
775
775
n != 0 && (@inbounds v[1 ] = x)
776
776
@inbounds for i = 2 : n
777
777
x = f (x)
0 commit comments