OLD | NEW |
(Empty) | |
| 1 // Copyright (c) 2013, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. |
| 4 |
| 5 part of observe; |
| 6 |
| 7 /** |
| 8 * Converts the [Iterable] or [Map] to an [ObservableList] or [ObservableMap], |
| 9 * respectively. This is a convenience function to make it easier to convert |
| 10 * literals into the corresponding observable collection type. |
| 11 * |
| 12 * If [value] is not one of those collection types, or is already [Observable], |
| 13 * it will be returned unmodified. |
| 14 * |
| 15 * If [value] is a [Map], the resulting value will use the appropriate kind of |
| 16 * backing map: either [HashMap], [LinkedHashMap], or [SplayTreeMap]. |
| 17 * |
| 18 * By default this performs a deep conversion, but you can set [deep] to false |
| 19 * for a shallow conversion. This does not handle circular data structures. |
| 20 * If a conversion is peformed, mutations are only observed to the result of |
| 21 * this function. Changing the original collection will not affect it. |
| 22 */ |
| 23 // TODO(jmesserly): ObservableSet? |
| 24 toObservable(value, {bool deep: true}) => |
| 25 deep ? _toObservableDeep(value) : _toObservableShallow(value); |
| 26 |
| 27 _toObservableShallow(value) { |
| 28 if (value is Observable) return value; |
| 29 if (value is Map) return new ObservableMap.from(value); |
| 30 if (value is Iterable) return new ObservableList.from(value); |
| 31 return value; |
| 32 } |
| 33 |
| 34 _toObservableDeep(value) { |
| 35 if (value is Observable) return value; |
| 36 if (value is Map) { |
| 37 var result = new ObservableMap._createFromType(value); |
| 38 value.forEach((k, v) { |
| 39 result[_toObservableDeep(k)] = _toObservableDeep(v); |
| 40 }); |
| 41 return result; |
| 42 } |
| 43 if (value is Iterable) { |
| 44 return new ObservableList.from(value.map(_toObservableDeep)); |
| 45 } |
| 46 return value; |
| 47 } |
OLD | NEW |