Hi Marshall!
You are right, this better belongs to sage-devel.
What I find interesting: The memory is not constantly leaking, there
are jumps.
sage: R.<x>=QQ[]
sage: M=get_memory_usage()
sage: for n in range(50000):
....: if get_memory_usage()>M:
....: M = get_memory_usage()
....: print n
....: print M
....: f=x+1
....:
0
794.6953125
4946
794.82421875
7058
794.953125
9170
795.08203125
11282
795.2109375
13394
795.33984375
15506
795.46875
17618
795.59765625
19730
795.7265625
21842
795.85546875
23954
795.984375
26066
796.11328125
28178
796.2421875
30290
796.37109375
32402
796.5
34514
796.62890625
36626
796.7578125
38738
796.88671875
40850
797.015625
42962
797.14453125
45074
797.2734375
47186
797.40234375
49298
797.53125
And it only concerns univariate rings:
sage: R.<x,y>=QQ[]
sage: for n in range(50000):
if get_memory_usage()>M:
M = get_memory_usage()
print n
print M
f=x+1
....:
0
797.9453125
Note that this is also a lot faster than the first loop.
Cheers,
Simon
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
