Immutable Red-Black trees

[Craig Dillabaugh]

On Tuesday, 26 November 2013 at 01:31:11 UTC, bearophile wrote:
> Craig Dillabaugh:
>
>> What do you mean by an 'immutable' data structure.  The linked 
>> article talks about Persistent data structures.  Are these the 
>> same thing?
>>
>> When I saw "Immutable" I figured it didn't support 
>> insertion/deletion - which would sort eliminate the need for a 
>> Red-Black tree anyways.
>
> In those articles Bartosz is implementing in C++11 the 
> immutable data structures from the book by Okasaki. Immutable 
> doesn't mean you can't change them :-) It means you can't 
> modify the single data items, and you have referential 
> transparency.
>
> Bye,
> bearophile

Ok, that make sense.