| commit | 2df26b4d87d314135efc228416ab5d65275fbb59 | [log] [tgz] |
|---|---|---|
| author | Kwang Yul Seo <kwangyul.seo@gmail.com> | Mon Sep 21 01:11:45 2015 |
| committer | Kwang Yul Seo <kwangyul.seo@gmail.com> | Mon Sep 21 01:19:49 2015 |
| tree | 718656a74033d72e99fec132d8895fb48ed9f5d0 | |
| parent | c4a285e8945943f2da0b84075965e87bf924d034 [diff] |
Bump the version to 0.1.2. * Add me as an author. * Change homepage to https://github.com/kseo/tuple.
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.