Using FiniteMap, I often run into robustness problems.
same (?) here! a student of mine recently came across a similar problem
(with a hand-made search tree): he expected to run
listToFM $ [(0, ()) | i - [0..10]]
in constant space, but instead it took all the stack and/or heap.
we
Using FiniteMap, I often run into robustness problems. For example,
consider the following program, which illustrates a common problem:
module Main (main) where
import FiniteMap
main = print
. last
. fmToList
. listToFM
$ [(i,()) | i -
