I have a code that uses a lot of memory and I'm trying to release some of
it but without success. I made up an examples to illustrate the problem:
function memuse()
return string(round(Int,parse(Int,readall(`ps -p 29563 -o
rss=`))/1024),"M")
end
function test()
for i = 1:2
t;>
>> To get a feel for what is involved, have a look at this:
>>
>> https://github.com/JuliaLang/julia/blob/master/base/array.jl
>>
>> That file has the definitions of the functions that you're trying to
>> mimic. As you'll see, they end up using "ccall
1.0 1.0 1.0
The best way is to do "x = deletecolumns(x,1)" ? I want to make something
more like delete!(x,1).
Thanks in advance,
Thuener Silva
It worked, thanks.
On Friday, October 16, 2015 at 6:38:50 PM UTC-3, Yichao Yu wrote:
>
> On Fri, Oct 16, 2015 at 5:35 PM, Thuener Silva <thu...@gmail.com
> > wrote:
> > I'm having this kind of problem in different situations. Another
> example:
> >
> > jul
*I'm having this kind of problem in different situations. Another example:*
julia> groups_1 = [Array((Int),0) for i=1:K]
5-element Array{Array{Int64,1},1}:
[]
[]
[]
[]
[]
julia> groups_1[size(groups_1[i],1) .!= 0 for i=1:size(groups_1,1)]
ERROR: `Array{T,N}` has no method matching
0-element Array{Array{Int64,1},1}:
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
Grats,
Thuener Silva
What is the best way to represent adjacent lists in Julia? By adjacent list
I a mean dinamic array of dinamic arrays.
Grats,
Thuener Silva
You are right, this is a scope problem.
Thanks.
an to to change the function when I change the value of a.
Grats,
Thuener Silva
