On 12/20/06, Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
Hello Joachim,
Wednesday, December 20, 2006, 11:22:24 AM, you wrote:
> The update code would now have to unmarshall a blob of game data,
> traverse it to find all instances of SomeData, wrap them in a
> one-element list to turn them into SomeData1s, reconstruct the blob of
> game data with the SomeData1 items, and marshall the result back out to
> disk.
marshalling and unmarshalling code can be geberated automatically using
Template Haskell ([1],[2]) or Data.Generics [3]
> That would mean I couldn't use infinite data structures in data that
> goes out to disk.
[1] also supports infinite data structures
No, it only supports cyclic data structures.
--
Cheers,
Lemmih
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
