Hi Christian!<br><br><div class="gmail_quote">On Tue, Aug 17, 2010 at 2:34 PM, C Gosch <span dir="ltr">&lt;<a href="mailto:ch.gosch@googlemail.com">ch.gosch@googlemail.com</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">

I have two more beginner questions: I ran into texts mentioning types of &quot;mutable&quot; data.<br>Does that mean the data is actually changed in place? How would I go about implementing such a data type,<br>
as I expect much higher performance in some applications? Do I do that with the Foreign module and Ptr<br>types?<br></blockquote><div><br>Yes, by mutable data we mean data that changes in place. There are several ways to use mutable data in Haskell: mutable variables and arrays in the ST monad, IORefs, MVars (for concurrent access), and Ptrs (although these should mostly be used for foreign function calls).<br>

 </div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">The second question is this: say I have some functions working with a data type, say a graph.<br>

Some of them might want to change the graph and return a new graph as a result.<br>
If they change say only one graph node, it would be extremely bad for performance if the whole graph got copied<br>any time such a change takes place. Is the compiler smart enough to make the code only copy the parts<br>

that have changed (copying lazily, so to speak)? Is that even possible?<br></blockquote><div><br></div></div>Since the graph is immutable most of the nodes in the new graph are shared with nodes in the old graph. This is know as path copying and is everywhere persistent (&quot;immutable&quot;) data structures are used. Updating a data structure (e.g. a tree) typically requires O(log n) nodes to be copied.<br>

<br>-- Johan<br><br>