JuliaLang · timholy · May 31, 2015 · May 29, 2015 · May 29, 2015
diff --git a/base/abstractarray.jl b/base/abstractarray.jl
@@ -81,7 +81,7 @@ function stride(a::AbstractArray, i::Integer)
     return s
 end
 
-strides(a::AbstractArray) = ntuple(ndims(a), i->stride(a,i))::Dims
+strides(a::AbstractArray) = ntuple(i->stride(a,i), ndims(a))::Dims
 
 function isassigned(a::AbstractArray, i::Int...)
     # TODO
@@ -738,7 +738,7 @@ function hvcat(nbc::Integer, as...)
         throw(ArgumentError("all rows must have the same number of block columns"))
     end
     nbr = div(n,nbc)
-    hvcat(ntuple(nbr, i->nbc), as...)
+    hvcat(ntuple(i->nbc, nbr), as...)
 end
 
 function hvcat{T}(rows::Tuple{Vararg{Int}}, as::AbstractMatrix{T}...)
@@ -1049,7 +1049,7 @@ end
 
 function ind2sub{N,T<:Integer}(dims::NTuple{N,Integer}, ind::AbstractVector{T})
     M = length(ind)
-    t = NTuple{N,Vector{T}}(ntuple(N,n->Array{T}(M)))
+    t = NTuple{N,Vector{T}}(ntuple(n->Array{T}(M),N))
     copy!(t[1],ind)
     for j = 1:N-1
         d = dims[j]

diff --git a/base/array.jl b/base/array.jl
@@ -1278,8 +1278,8 @@ function indcopy(sz::Dims, I::Tuple{Vararg{RangeIndex}})
     for i = n+1:length(sz)
         s *= sz[i]
     end
-    dst::typeof(I) = ntuple(n, i-> findin(I[i], i < n ? (1:sz[i]) : (1:s)))::typeof(I)
-    src::typeof(I) = ntuple(n, i-> I[i][findin(I[i], i < n ? (1:sz[i]) : (1:s))])::typeof(I)
+    dst::typeof(I) = ntuple(i-> findin(I[i], i < n ? (1:sz[i]) : (1:s)), n)::typeof(I)
+    src::typeof(I) = ntuple(i-> I[i][findin(I[i], i < n ? (1:sz[i]) : (1:s))], n)::typeof(I)
     dst, src
 end
 

diff --git a/base/base.jl b/base/base.jl
@@ -59,10 +59,6 @@ type AssertionError <: Exception
     AssertionError(msg) = new(msg)
 end
 
-# For passing constants through type inference
-immutable Val{T}
-end
-
 ccall(:jl_get_system_hooks, Void, ())
 
 

diff --git a/base/bitarray.jl b/base/bitarray.jl
@@ -280,7 +280,7 @@ function reshape{N}(B::BitArray, dims::NTuple{N,Int})
     prod(dims) == length(B) ||
         throw(DimensionMismatch("new dimensions $(dims) must be consistent with array size $(length(B))"))
     dims == size(B) && return B
-    Br = BitArray{N}(ntuple(N,i->0)...)
+    Br = BitArray{N}(ntuple(i->0,N)...)
     Br.chunks = B.chunks
     Br.len = prod(dims)
     N != 1 && (Br.dims = dims)
@@ -1710,7 +1710,7 @@ function permutedims(B::Union(BitArray,StridedArray), perm)
     dimsB = size(B)
     ndimsB = length(dimsB)
     (ndimsB == length(perm) && isperm(perm)) || throw(ArgumentError("no valid permutation of dimensions"))
-    dimsP = ntuple(ndimsB, i->dimsB[perm[i]])::typeof(dimsB)
+    dimsP = ntuple(i->dimsB[perm[i]], ndimsB)::typeof(dimsB)
     P = similar(B, dimsP)
     permutedims!(P, B, perm)
 end
@@ -1831,7 +1831,7 @@ function cat(catdim::Integer, X::Union(BitArray, Integer)...)
         end
     end
 
-    cat_ranges = ntuple(nargs, i->(catdim <= ndimsX[i] ? dimsX[i][catdim] : 1))
+    cat_ranges = ntuple(i->(catdim <= ndimsX[i] ? dimsX[i][catdim] : 1), nargs)
 
     function compute_dims(d)
         if d == catdim
@@ -1844,7 +1844,7 @@ function cat(catdim::Integer, X::Union(BitArray, Integer)...)
     end
 
     ndimsC = max(catdim, d_max)
-    dimsC = ntuple(ndimsC, compute_dims)::Tuple{Vararg{Int}}
+    dimsC = ntuple(compute_dims, ndimsC)::Tuple{Vararg{Int}}
     typeC = promote_type(map(x->isa(x,BitArray) ? eltype(x) : typeof(x), X)...)
     if !has_integer || typeC == Bool
         C = BitArray(dimsC)
@@ -1855,8 +1855,8 @@ function cat(catdim::Integer, X::Union(BitArray, Integer)...)
     range = 1
     for k = 1:nargs
         nextrange = range + cat_ranges[k]
-        cat_one = ntuple(ndimsC, i->(i != catdim ?
-                                     (1:dimsC[i]) : (range:nextrange-1) ))
+        cat_one = ntuple(i->(i != catdim ? (1:dimsC[i]) : (range:nextrange-1)),
+                         ndimsC)
         # note: when C and X are BitArrays, this calls
         #       the special assign with ranges
         C[cat_one...] = X[k]

diff --git a/base/deepcopy.jl b/base/deepcopy.jl
@@ -11,7 +11,7 @@ deepcopy_internal(x::Union(Symbol,LambdaStaticData,TopNode,QuoteNode,
                            DataType,UnionType,Task),
                   stackdict::ObjectIdDict) = x
 deepcopy_internal(x::Tuple, stackdict::ObjectIdDict) =
-    ntuple(length(x), i->deepcopy_internal(x[i], stackdict))
+    ntuple(i->deepcopy_internal(x[i], stackdict), length(x))
 deepcopy_internal(x::Module, stackdict::ObjectIdDict) = error("deepcopy of Modules not supported")
 
 function deepcopy_internal(x::Function, stackdict::ObjectIdDict)

diff --git a/base/deprecated.jl b/base/deprecated.jl
@@ -368,6 +368,8 @@ end
 
 @deprecate with_env(f::Function, key::AbstractString, val) withenv(f, key=>val)
 
+@deprecate ntuple(n::Integer, f::Function) ntuple(f, n)
+
 # 0.4 discontinued functions
 
 @noinline function subtypetree(x::DataType, level=-1)

diff --git a/base/essentials.jl b/base/essentials.jl
@@ -226,3 +226,7 @@ end
 type Colon
 end
 const (:) = Colon()
+
+# For passing constants through type inference
+immutable Val{T}
+end
diff --git a/base/inference.jl b/base/inference.jl
@@ -1871,7 +1871,7 @@ function type_annotate(ast::Expr, states::Array{Any,1}, sv::ANY, rettype::ANY, a
             # builtins.c:jl_trampoline. However if jl_trampoline is changed then
             # this code will need to be restored.
             #na = length(a.args[1])
-            #li.ast, _ = typeinf(li, ntuple(na+1, i->(i>na ? (Tuple)[1] : Any)),
+            #li.ast, _ = typeinf(li, ntuple(i->(i>na ? (Tuple)[1] : Any), na+1),
             #                    li.sparams, li, false)
         end
     end

diff --git a/base/mmap.jl b/base/mmap.jl
@@ -166,7 +166,7 @@ function mmap_bitarray{N}(dims::NTuple{N,Integer}, s::IOStream, offset::FileOffs
             throw(ArgumentError("the given file does not contain a valid BitArray of size $(join(dims, 'x')) (open with \"r+\" mode to override)"))
         end
     end
-    B = BitArray{N}(ntuple(N,i->0)...)
+    B = BitArray{N}(ntuple(i->0,N)...)
     B.chunks = chunks
     B.len = n
     if N != 1

diff --git a/base/multidimensional.jl b/base/multidimensional.jl
@@ -856,7 +856,7 @@ end
 @generated function findn{N}(B::BitArray{N})
     quote
         nnzB = countnz(B)
-        I = ntuple($N, x->Array(Int, nnzB))
+        I = ntuple(x->Array(Int, nnzB), $N)
         if nnzB > 0
             count = 1
             @nloops $N i B begin

diff --git a/base/serialize.jl b/base/serialize.jl
@@ -403,7 +403,7 @@ function handle_deserialize(s, b)
     return deserialize(s, tag)
 end
 
-deserialize_tuple(s, len) = ntuple(len, i->deserialize(s))
+deserialize_tuple(s, len) = ntuple(i->deserialize(s), len)
 
 deserialize(s, ::Type{Symbol}) = symbol(read(s, UInt8, Int32(read(s, UInt8))))
 deserialize(s, ::Type{LongSymbol}) = symbol(read(s, UInt8, read(s, Int32)))

diff --git a/base/subarray.jl b/base/subarray.jl
@@ -31,7 +31,7 @@ parent(V::SubArray) = V.parent
 parentindexes(V::SubArray) = V.indexes
 
 parent(a::AbstractArray) = a
-parentindexes(a::AbstractArray) = ntuple(ndims(a), i->1:size(a,i))
+parentindexes(a::AbstractArray) = ntuple(i->1:size(a,i), ndims(a))
 
 ## SubArray creation
 # Drops singleton dimensions (those indexed with a scalar)

diff --git a/base/tuple.jl b/base/tuple.jl
@@ -28,15 +28,25 @@ eltype{T,_}(::Type{NTuple{_,T}}) = T
 
 ## mapping ##
 
-ntuple(n::Integer, f::Function) = ntuple(f, n) # TODO: deprecate this?
 ntuple(f::Function, n::Integer) =
     n<=0 ? () :
     n==1 ? (f(1),) :
     n==2 ? (f(1),f(2),) :
     n==3 ? (f(1),f(2),f(3),) :
     n==4 ? (f(1),f(2),f(3),f(4),) :
     n==5 ? (f(1),f(2),f(3),f(4),f(5),) :
-    tuple(ntuple(n-2,f)..., f(n-1), f(n))
+    tuple(ntuple(f,n-5)..., f(n-4), f(n-3), f(n-2), f(n-1), f(n))
+
+ntuple(f, ::Type{Val{0}}) = ()
+ntuple(f, ::Type{Val{1}}) = (f(1),)
+ntuple(f, ::Type{Val{2}}) = (f(1),f(2))
+ntuple(f, ::Type{Val{3}}) = (f(1),f(2),f(3))
+ntuple(f, ::Type{Val{4}}) = (f(1),f(2),f(3),f(4))
+ntuple(f, ::Type{Val{5}}) = (f(1),f(2),f(3),f(4),f(5))
+@generated function ntuple{N}(f, ::Type{Val{N}})
+    M = N-5
+    :(tuple(ntuple(f, Val{$M})..., f($N-4), f($N-3), f($N-2), f($N-1), f($N)))
+end
 
 # 0 argument function
 map(f) = f()

diff --git a/doc/stdlib/base.rst b/doc/stdlib/base.rst
@@ -220,7 +220,7 @@ All Objects
 
    Construct a tuple of the given objects.
 
-.. function:: ntuple(n, f::Function)
+.. function:: ntuple(f::Function, n)
 
    Create a tuple of length ``n``, computing each element as ``f(i)``, where ``i`` is the index of the element.
 

diff --git a/test/arrayops.jl b/test/arrayops.jl
@@ -882,12 +882,12 @@ A = [NaN]; B = [NaN]
 Nmax = 3 # TODO: go up to CARTESIAN_DIMS+2 (currently this exposes problems)
 for N = 1:Nmax
     #indexing with (UnitRange, UnitRange, UnitRange)
-    args = ntuple(N, d->UnitRange{Int})
+    args = ntuple(d->UnitRange{Int}, N)
     @test Base.return_types(getindex, Tuple{Array{Float32, N}, args...}) == [Array{Float32, N}]
     @test Base.return_types(getindex, Tuple{BitArray{N}, args...}) == Any[BitArray{N}]
     @test Base.return_types(setindex!, Tuple{Array{Float32, N}, Array{Int, 1}, args...}) == [Array{Float32, N}]
     # Indexing with (UnitRange, UnitRange, Float64)
-    args = ntuple(N, d->d<N ? UnitRange{Int} : Float64)
+    args = ntuple(d->d<N ? UnitRange{Int} : Float64, N)
     N > 1 && @test Base.return_types(getindex, Tuple{Array{Float32, N}, args...}) == [Array{Float32, N-1}]
     N > 1 && @test Base.return_types(getindex, Tuple{BitArray{N}, args...}) == [BitArray{N-1}]
     N > 1 && @test Base.return_types(setindex!, Tuple{Array{Float32, N}, Array{Int, 1}, args...}) == [Array{Float32, N}]
@@ -995,7 +995,7 @@ for i = 1:10
     @test mdsum(A) == 15
     @test mdsum2(A) == 15
     AA = reshape(aa, tuple(2, shp...))
-    B = sub(AA, 1:1, ntuple(i, i->Colon())...)
+    B = sub(AA, 1:1, ntuple(i->Colon(), i)...)
     @test isa(Base.linearindexing(B), Base.IteratorsMD.LinearSlow)
     @test mdsum(B) == 15
     @test mdsum2(B) == 15
@@ -1008,7 +1008,7 @@ for i = 2:10
     A = reshape(a, tuple(shp...))
     @test mdsum(A) == 55
     @test mdsum2(A) == 55
-    B = sub(A, ntuple(i, i->Colon())...)
+    B = sub(A, ntuple(i->Colon(), i)...)
     @test mdsum(B) == 55
     @test mdsum2(B) == 55
     insert!(shp, 2, 1)