| commit | 3bb6325ae4ee2ce620397ae10ca1891b805ac8ac | [log] [tgz] |
|---|---|---|
| author | Boris Kaul <localvoid@gmail.com> | Sat Sep 19 07:40:41 2015 |
| committer | Boris Kaul <localvoid@gmail.com> | Sat Sep 19 07:40:41 2015 |
| tree | 6c1af7aeb5f9f4337f0d4cf273ebc5710f7da683 | |
| parent | 9e047eadfbd72d56c6cd5e6c038a1048938cbb92 [diff] | |
| parent | 767e3b6528b972c38e06569412a783cf01e278b2 [diff] |
Merge pull request #1 from kseo/gitignore Add .packages file to .gitignore.
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.