heap and walking through a very long list
Thu, 22 Nov 2001 03:57:17 -0800
The trouble here is the usual one: accumArray is lazy,
and simply accumulates a giant closure in each array slot.
Then, when it is evaluated, the stack gets big.
There should really be a strict accumArray, just as there
should be a strict foldl. There isn't in Haskell 98, but if you
are using a fixed type (like Int) you can use GHC's IArrays
(see documentation on the 'lang' package). There's an
accumArray in there too, and it'll be strict for sure.
| -----Original Message-----
| From: Lukasz Pankowski [mailto:email@example.com]=20
| Sent: 18 November 2001 23:18
| To: firstname.lastname@example.org
| Subject: heap and walking through a very long list
| Hi. I wonder if there are any methods of walking through a=20
| very long list without a huge heap. It is good that a=20
| laziness makes creation of large stuctures delayed, but it=20
| seems that destruction of never again used beginning of a=20
| list is also delayed (probably because of other reason).
| Consider the simple program:
| main =3D do putStrLn $ show $ hist_inc 100000 3
| hist_inc n b =3D hist (0,b) $ take n $ repeat b
| hist bnds is =3D accumArray (+) 0 bnds [(i, 1) | i <-=20
| is, inRange bnds i]
| and it's output (compiled with GHC):
| $ ./hist_inc
| Stack space overflow: current size 1048576 bytes.
| Use `+RTS -Ksize' to increase it.
| I am using GHC 5.0, does it have any optimization to overcome=20
| it (`-O -fvia-C -O2-for-C' does not do this). It is obvious=20
| that the beginning of the list is no longer needed (does=20
| garbage collector now this?).
| If there is a way is it written somewhere in documentation?
| I feel it insane to have to have let say 256Mb of memory=20
| because I have 1 million measurements on a list. Currently I=20
| pipe the results to a C program, nice UN!X practice which I=20
| would like avoid.
| =3D*=3D Lukasz Pankowski =3D*=3D
| Haskell mailing list
| Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell