Interesting data point: The echelonization isn't important. It's the
creation of a non-square matrix space that seems to cement the
integermodring in memory. This has the same effect as before (you can
get the object L[0] as above)
import gc, collections
import sage.matrix.matrix_space as matrix_space
p=next_prime(50000)
M=sage.misc.getusage.linux_memory_usage()
set_random_seed(0)
for j in range(3000):
p=next_prime(p)
_=matrix_space.MatrixSpace(IntegerModRing(p),1,2)
if (j%250) ==0 :
gc.collect()
Mn=sage.misc.getusage.linux_memory_usage()
print Mn-M
M=Mn
however, when you make it a square matrix space, it doesn't happen.
--
--
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
