| commit | b97d6c9456dc14010324e2b624317f985690efc3 | [log] [tgz] |
|---|---|---|
| author | Boris Kaul <localvoid@gmail.com> | Sat Sep 19 07:42:53 2015 |
| committer | Boris Kaul <localvoid@gmail.com> | Sat Sep 19 07:42:53 2015 |
| tree | ea0ba4ca70c27783ca36829cf6ca8a138269041a | |
| parent | 1d239b38adb3cb19a446615fcfc96420fe1263af [diff] |
0.1.1
There are two versions of this data structure:
final t = new Tuple2<String, int>('a', 10); print(t.i1); // prints 'a' print(t.i2); // prints '10'
In computing, a persistent data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. (A persistent data structure is not a data structure committed to persistent storage, such as a disk; this is a different and unrelated sense of the word “persistent.”)
final t1 = const PersistentTuple2<String, int>('a', 10); final t2 = t1.setI1('c'); // t2 is a new [PersistentTuple2] object with i1 is 'c' and i2 is 10.