| OLD | NEW |
| (Empty) |
| 1 // Copyright (c) 2012, 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 yaml; | |
| 6 | |
| 7 /// This class wraps behaves almost identically to the normal Dart Map | |
| 8 /// implementation, with the following differences: | |
| 9 /// | |
| 10 /// * It allows null, NaN, boolean, list, and map keys. | |
| 11 /// * It defines `==` structurally. That is, `yamlMap1 == yamlMap2` if they | |
| 12 /// have the same contents. | |
| 13 /// * It has a compatible [hashCode] method. | |
| 14 class YamlMap implements Map { | |
| 15 Map _map; | |
| 16 | |
| 17 YamlMap() : _map = new Map(); | |
| 18 | |
| 19 YamlMap.from(Map map) : _map = new Map.from(map); | |
| 20 | |
| 21 YamlMap._wrap(this._map); | |
| 22 | |
| 23 bool containsValue(value) => _map.containsValue(value); | |
| 24 bool containsKey(key) => _map.containsKey(_wrapKey(key)); | |
| 25 operator [](key) => _map[_wrapKey(key)]; | |
| 26 operator []=(key, value) { _map[_wrapKey(key)] = value; } | |
| 27 putIfAbsent(key, ifAbsent()) => _map.putIfAbsent(_wrapKey(key), ifAbsent); | |
| 28 remove(key) => _map.remove(_wrapKey(key)); | |
| 29 void clear() => _map.clear(); | |
| 30 void forEach(void f(key, value)) => | |
| 31 _map.forEach((k, v) => f(_unwrapKey(k), v)); | |
| 32 Iterable get keys => _map.keys.mappedBy(_unwrapKey); | |
| 33 Iterable get values => _map.values; | |
| 34 int get length => _map.length; | |
| 35 bool get isEmpty => _map.isEmpty; | |
| 36 String toString() => _map.toString(); | |
| 37 | |
| 38 int get hashCode => _hashCode(_map); | |
| 39 | |
| 40 bool operator ==(other) { | |
| 41 if (other is! YamlMap) return false; | |
| 42 return deepEquals(this, other); | |
| 43 } | |
| 44 | |
| 45 /// Wraps an object for use as a key in the map. | |
| 46 _wrapKey(obj) { | |
| 47 if (obj != null && obj is! bool && obj is! List && | |
| 48 (obj is! double || !obj.isNan()) && | |
| 49 (obj is! Map || obj is YamlMap)) { | |
| 50 return obj; | |
| 51 } else if (obj is Map) { | |
| 52 return new YamlMap._wrap(obj); | |
| 53 } | |
| 54 return new _WrappedHashKey(obj); | |
| 55 } | |
| 56 | |
| 57 /// Unwraps an object that was used as a key in the map. | |
| 58 _unwrapKey(obj) => obj is _WrappedHashKey ? obj.value : obj; | |
| 59 } | |
| 60 | |
| 61 /// A class for wrapping normally-unhashable objects that are being used as keys | |
| 62 /// in a YamlMap. | |
| 63 class _WrappedHashKey { | |
| 64 var value; | |
| 65 | |
| 66 _WrappedHashKey(this.value); | |
| 67 | |
| 68 int get hashCode => _hashCode(value); | |
| 69 | |
| 70 String toString() => value.toString(); | |
| 71 | |
| 72 /// This is defined as both values being structurally equal. | |
| 73 bool operator ==(other) { | |
| 74 if (other is! _WrappedHashKey) return false; | |
| 75 return deepEquals(this.value, other.value); | |
| 76 } | |
| 77 } | |
| 78 | |
| 79 /// Returns the hash code for [obj]. This includes null, true, false, maps, and | |
| 80 /// lists. Also handles self-referential structures. | |
| 81 int _hashCode(obj, [List parents]) { | |
| 82 if (parents == null) { | |
| 83 parents = []; | |
| 84 } else if (parents.any((p) => identical(p, obj))) { | |
| 85 return -1; | |
| 86 } | |
| 87 | |
| 88 parents.add(obj); | |
| 89 try { | |
| 90 if (obj == null) return 0; | |
| 91 if (obj == true) return 1; | |
| 92 if (obj == false) return 2; | |
| 93 if (obj is Map) { | |
| 94 return _hashCode(obj.keys, parents) ^ | |
| 95 _hashCode(obj.values, parents); | |
| 96 } | |
| 97 if (obj is Iterable) { | |
| 98 // This is probably a really bad hash function, but presumably we'll get | |
| 99 // this in the standard library before it actually matters. | |
| 100 int hash = 0; | |
| 101 for (var e in obj) { | |
| 102 hash ^= _hashCode(e, parents); | |
| 103 } | |
| 104 return hash; | |
| 105 } | |
| 106 return obj.hashCode; | |
| 107 } finally { | |
| 108 parents.removeLast(); | |
| 109 } | |
| 110 } | |
| OLD | NEW |