[to Haskell-cafe]
At 19:29 17/02/04 -0500, S. Alexander Jacobson wrote:
Thank you for the link to FGL. I also looked at
the boilerplate stuff. If *feels* like there
should be a way to embed the graph stuff in the
boilerplate stuff to allow non-destructive update
of arbitrary object graphs
Thank you for the link to FGL. I also looked at
the boilerplate stuff. If *feels* like there
should be a way to embed the graph stuff in the
boilerplate stuff to allow non-destructive update
of arbitrary object graphs without handcoding the
mapping of the datastructure to an object graph?
Is
In imperative languages, updating an object in a
graph is an O(1) operation. However,
non-destructive update appears to be O(n) with the
size of the graph. For example, suppose we were
to implement an auction system like eBay:
--Data structures
data Bid = Bid BidId Auction User Price
S. Alexander Jacobson wrote:
In imperative languages, updating an object in a
graph is an O(1) operation. However,
non-destructive update appears to be O(n) with the
size of the graph. For example, suppose we were
to implement an auction system like eBay:
[snip]
One alternative is to store
