@@ -19,7 +19,7 @@ numel(a::Array) = arraylen(a)
1919## copy ##
2020
2121copy_to{T }(dest:: Ptr{T }, src:: Ptr{T }, n:: Integer) =
22- ccall (: memcpy, Ptr{Void}, (Ptr{Void}, Ptr{Void}, Uint), dest, src, uint ( n* sizeof (T ) ))
22+ ccall (: memcpy, Ptr{Void}, (Ptr{Void}, Ptr{Void}, Uint), dest, src, n* sizeof (T ))
2323
2424function copy_to{T}(dest :: Array {T }, do , src :: Array {T }, so , N )
2525 if so+N-1 > numel(src) || do+N-1 > numel(dest) || do < 1 || so < 1
@@ -40,7 +40,7 @@ copy_to{T}(dest::Array{T}, src::Array{T}) = copy_to(dest, 1, src, 1, numel(src))
4040function reinterpret{T,S}(:: Type {T }, a :: Array {S })
4141 b = Array(T, div(numel(a)*sizeof(S),sizeof(T)))
4242 ccall(:memcpy, Ptr{T }, (Ptr{T }, Ptr{S }, Uint),
43- b, a, uint ( length (b)* sizeof (T ) ))
43+ b, a, length (b)* sizeof (T ))
4444 return b
4545end
4646reinterpret (t,x) = reinterpret (t,[x])[1 ]
@@ -81,12 +81,12 @@ ref{T}(::Type{T}) = Array(T,0)
8181ref{T }(:: Type{T }, x) = (a= Array (T ,1 ); a[1 ]= x; a)
8282
8383function fill!{T<:Union (Int8 ,Uint8 )}(a:: Array {T }, x:: Integer)
84- ccall (: memset, Void, (Ptr{T }, Int32, Int), a, int32 (x), int ( length (a) ))
84+ ccall (: memset, Void, (Ptr{T }, Int32, Int), a, x, length (a))
8585 return a
8686end
8787function fill!{T<:Union (Integer ,Float )}(a:: Array {T }, x)
8888 if convert (T ,x) == 0
89- ccall (: bzero, Void, (Ptr{T }, Int), a, int ( length (a)* sizeof (T ) ))
89+ ccall (: bzero, Void, (Ptr{T }, Int), a, length (a)* sizeof (T ))
9090 else
9191 for i = 1 : numel (a)
9292 a[i] = x
@@ -417,13 +417,13 @@ function push{T}(a::Array{T,1}, item)
417417 end
418418 # convert first so we don't grow the array if the assignment won't work
419419 item = convert(T, item)
420- ccall(:jl_array_grow_end, Void, (Any, Uint), a, uint(1) )
420+ ccall(:jl_array_grow_end, Void, (Any, Uint), a, 1 )
421421 a[end] = item
422422 return a
423423end
424424
425425function push(a::Array{Any,1 }, item:: ANY )
426- ccall (: jl_array_grow_end, Void, (Any, Uint), a, uint ( 1 ) )
426+ ccall (: jl_array_grow_end, Void, (Any, Uint), a, 1 )
427427 a[end] = item
428428 return a
429429end
@@ -433,13 +433,13 @@ function append!{T}(a::Array{T,1}, items::Array{T,1})
433433 error("[] cannot grow. Instead, initialize the array with \"T[]\".")
434434 end
435435 n = length(items)
436- ccall(:jl_array_grow_end, Void, (Any, Uint), a, uint(n) )
436+ ccall(:jl_array_grow_end, Void, (Any, Uint), a, n )
437437 a[end-n+1:end] = items
438438 return a
439439end
440440
441441function grow(a::Vector, n::Integer)
442- ccall(:jl_array_grow_end, Void, (Any, Uint), a, uint(n) )
442+ ccall(:jl_array_grow_end, Void, (Any, Uint), a, n )
443443 return a
444444end
445445
@@ -448,7 +448,7 @@ function pop(a::Vector)
448448 error("pop: array is empty")
449449 end
450450 item = a[end]
451- ccall(:jl_array_del_end, Void, (Any, Uint), a, uint(1) )
451+ ccall(:jl_array_del_end, Void, (Any, Uint), a, 1 )
452452 return item
453453end
454454
@@ -457,7 +457,7 @@ function enqueue{T}(a::Array{T,1}, item)
457457 error (" [] cannot grow. Instead, initialize the array with \" T[]\" ." )
458458 end
459459 item = convert (T , item)
460- ccall (: jl_array_grow_beg, Void, (Any, Uint), a, uint ( 1 ) )
460+ ccall (: jl_array_grow_beg, Void, (Any, Uint), a, 1 )
461461 a[1 ] = item
462462 return a
463463end
@@ -468,7 +468,7 @@ function shift(a::Vector)
468468 error("shift: array is empty")
469469 end
470470 item = a[1]
471- ccall(:jl_array_del_beg, Void, (Any, Uint), a, uint(1) )
471+ ccall(:jl_array_del_beg, Void, (Any, Uint), a, 1 )
472472 return item
473473end
474474
@@ -479,14 +479,14 @@ function insert{T}(a::Array{T,1}, i::Integer, item)
479479 item = convert (T , item)
480480 n = length (a)
481481 if i > n
482- ccall (: jl_array_grow_end, Void, (Any, Uint), a, uint ( i- n) )
482+ ccall (: jl_array_grow_end, Void, (Any, Uint), a, i- n)
483483 elseif i > div (n,2 )
484- ccall (: jl_array_grow_end, Void, (Any, Uint), a, uint ( 1 ) )
484+ ccall (: jl_array_grow_end, Void, (Any, Uint), a, 1 )
485485 for k= n+ 1 : - 1 : i+ 1
486486 a[k] = a[k- 1 ]
487487 end
488488 else
489- ccall (: jl_array_grow_beg, Void, (Any, Uint), a, uint ( 1 ) )
489+ ccall (: jl_array_grow_beg, Void, (Any, Uint), a, 1 )
490490 for k= 1 : (i- 1 )
491491 a[k] = a[k+ 1 ]
492492 end
@@ -503,12 +503,12 @@ function del(a::Vector, i::Integer)
503503 for k = i:-1:2
504504 a[k] = a[k-1]
505505 end
506- ccall(:jl_array_del_beg, Void, (Any, Uint), a, uint(1) )
506+ ccall(:jl_array_del_beg, Void, (Any, Uint), a, 1 )
507507 else
508508 for k = i:n-1
509509 a[k] = a[k+1]
510510 end
511- ccall(:jl_array_del_end, Void, (Any, Uint), a, uint(1) )
511+ ccall(:jl_array_del_end, Void, (Any, Uint), a, 1 )
512512 end
513513 return a
514514end
@@ -528,18 +528,18 @@ function del{T<:Integer}(a::Vector, r::Range1{T})
528528 for k = l: - 1 : 1 + d
529529 a[k] = a[k- d]
530530 end
531- ccall (: jl_array_del_beg, Void, (Any, Uint), a, uint (d) )
531+ ccall (: jl_array_del_beg, Void, (Any, Uint), a, d )
532532 else
533533 for k = f: n- d
534534 a[k] = a[k+ d]
535535 end
536- ccall (: jl_array_del_end, Void, (Any, Uint), a, uint (d) )
536+ ccall (: jl_array_del_end, Void, (Any, Uint), a, d )
537537 end
538538 return a
539539end
540540
541541function del_all (a :: Vector )
542- ccall(:jl_array_del_end, Void, (Any, Uint), a, uint( length(a) ))
542+ ccall(:jl_array_del_end, Void, (Any, Uint), a, length(a))
543543 return a
544544end
545545
0 commit comments