Hi Guido,
> the idea was (and still is) to initially allocate all VarArrays from
> the space, and only when they are resized (by using add), the array is
> copied to the heap. That way, most arrays are still efficiently
> allocated in the space (e.g. copying an array always allocates it in
n Schulte, www.ict.kth.se/~cschulte/
>
>
> -Original Message-
> From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On
> Behalf
> Of Filip Konvicka
> Sent: Wednesday, March 25, 2009 2:18 PM
> To: us...@gecode.org
> Subject: [gecode-users] Memory managemen
, 2009 2:18 PM
To: us...@gecode.org
Subject: [gecode-users] Memory management bug in 2.2.0?
Hi,
I know I'm probably late with this... I am hunting a memory leak in a
program that uses Gecode 2.2.0. The script (space) constructor
incrementally adds variables to a var-array (one by one).
Hi,
I know I'm probably late with this... I am hunting a memory leak in a
program that uses Gecode 2.2.0. The script (space) constructor
incrementally adds variables to a var-array (one by one). IMHO,
VarArray::resize acts strangely:
VarArray::resize(Space* home, int m) {
...
x = stati
benoitlaur...@neuf.fr wrote:
Hello,
I am working on a scheduling problem. On the instances I have to
deal with, I can reach a number of constraints of 500 000. During
the search process, the memory usage is very high, which eventually
renders my operating system unstable. Is it possible to
Hello,
I am working on a scheduling problem. On the instances I have to deal
with, I can reach a number of constraints of 500 000. During the search
process, the memory usage is very high, which eventually renders my operating
system unstable. Is it possible to solve this problem ? How ?
I am no
