| commit | 9e047eadfbd72d56c6cd5e6c038a1048938cbb92 | [log] [tgz] |
|---|---|---|
| author | Boris Kaul <localvoid@gmail.com> | Fri Oct 17 05:00:38 2014 |
| committer | Boris Kaul <localvoid@gmail.com> | Fri Oct 17 05:00:38 2014 |
| tree | 353d43469ff01ad95cfcaf9d5294dea39db6be12 |
Initial commit
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.