Hal Daume III wrote:
I have a datatype which (simplified) looks like:
data FBTree a = FBLeaf (Maybe (FBTree a)) a | FBBranch (Maybe (FBTree
a)) (FBTree a) (FBTree a)
is basically a tree with Maybe a parent node. however, unlike the nice
non-haskell equivalent, they tend to eat up memory as
Hi all,
I have a datatype which (simplified) looks like:
data FBTree a = FBLeaf (Maybe (FBTree a)) a | FBBranch (Maybe (FBTree
a)) (FBTree a) (FBTree a)
is basically a tree with Maybe a parent node. however, unlike the nice
non-haskell equivalent, they tend to eat up memory as you traverse