Am Dienstag, 3. März 2009 11:10 schrieb Manlio Perillo: > Manlio Perillo ha scritto: > > [...] > > > >>> The other program, with a lot of array concatenations, still eats a > >>> lot of memory... > >> > >> Concatenating arrays generally copies data. Which uses memory. > > > > Of course, but why the garbage collector does not "release" this > > temporary used memory? > > Note that I'm using the -F1 flag with the RST. > > > > Maybe it is a problem with IntMap, when there are a lot of keys? > > It *is* a problem with IntMap. > I have changed the program to not use any array concatenation, and it > still requires a lot of memory. > > > Does esist a data structure that is able to store something like 480189 > keys with efficient memory usage? >
An array? Might be complicated to write fast code, but the memory overhead should be small. > > Thanks Manlio Perillo _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
