| commit | 767e3b6528b972c38e06569412a783cf01e278b2 | [log] [tgz] |
|---|---|---|
| author | Kwang Yul Seo <kwangyul.seo@gmail.com> | Sat Sep 19 07:26:41 2015 |
| committer | Kwang Yul Seo <kwangyul.seo@gmail.com> | Sat Sep 19 07:30:47 2015 |
| tree | 6c1af7aeb5f9f4337f0d4cf273ebc5710f7da683 | |
| parent | 9e047eadfbd72d56c6cd5e6c038a1048938cbb92 [diff] |
Add .packages file to .gitignore. As of 1.12, the .packages file exists after running pub get. Don’t check it into source control.
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.