Immutable Object Graph updates

Andrew ArnottMay 7, 2013May 7, 201305/7/13

In my last post, I introduced a T4 template that constructs efficient and quite capable immutable objects based on the simplest mutable type definition. I also mentioned that the published sample is (necessarily, ala T4 style) open source and hosted online. Two outsiders have already submitted pull requests that have been accepted. Some though

Simple immutable objects

Andrew ArnottJanuary 8, 2013Jan 8, 201301/8/13

We’re all familiar with immutable collections now. But immutability is only as immutable as it is deep. And an immutable collection of mutable objects may not provide the depth you’re looking for. So how can one create an immutable object? Suppose you would define the mutable version like this: An immutable version might be def

Immutable collection algorithmic complexity

Andrew ArnottJanuary 7, 2013Jan 7, 201301/7/13

I received some feedback from my recent BCL blog post on the prerelease of the immutable collections that my algorithm complexity table left a few important entries out. Here is the table again, with more data filled in (particularly around list indexer lookup and enumeration): A noteworthy trait to call out here is that where a List<

Immutable collections now available

Andrew ArnottDecember 19, 2012Dec 19, 201212/19/12

In previous posts, I discussed immutable collections. I’m pleased to say they are now available. Read my announcement on the BCL blog.

Immutable collections with mutable performance

Andrew ArnottAugust 29, 2011Aug 29, 201108/29/11

In my last post, I detailed the differences among read/write, read only, frozen and immutable collection types.  I described how immutable collections come with a hit to the garbage collector due to the garbage they generate during mutations.  I have a very positive update on that topic. My previous implementation for the immutabl

Read only, frozen, and immutable collections

Andrew ArnottAugust 21, 2011Aug 21, 201108/21/11

[Update: a more recent post with new data on attainable performance of immutable collections] The topics of immutability and functional programming has fascinated me lately.  Mostly because of my work on the Visual Studio Common Project System (CPS) which is a large, highly multi-threaded code base that only remains sane because of its