| 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 /** | |
| 6 * This class wraps behaves almost identically to the normal Dart Map | |
| 7 * implementation, with the following differences: | |
| 8 * | |
| 9 * * It allows null, NaN, boolean, list, and map keys. | |
| 10 * * It defines `==` structurally. That is, `yamlMap1 == yamlMap2` if they have | |
| 11 * the same contents. | |
| 12 * * It has a compatible [hashCode] method. | |
| 13 */ | |
| 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 Collection get keys => _map.keys.map(_unwrapKey); | |
| 33 Collection 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 /** | |
| 62 * A class for wrapping normally-unhashable objects that are being used as keys | |
| 63 * in a YamlMap. | |
| 64 */ | |
| 65 class _WrappedHashKey { | |
| 66 var value; | |
| 67 | |
| 68 _WrappedHashKey(this.value); | |
| 69 | |
| 70 int get hashCode => _hashCode(value); | |
| 71 | |
| 72 String toString() => value.toString(); | |
| 73 | |
| 74 /** This is defined as both values being structurally equal. */ | |
| 75 bool operator ==(other) { | |
| 76 if (other is! _WrappedHashKey) return false; | |
| 77 return deepEquals(this.value, other.value); | |
| 78 } | |
| 79 } | |
| 80 | |
| 81 /** | |
| 82 * Returns the hash code for [obj]. This includes null, true, false, maps, and | |
| 83 * lists. Also handles self-referential structures. | |
| 84 */ | |
| 85 int _hashCode(obj, [List parents]) { | |
| 86 if (parents == null) { | |
| 87 parents = []; | |
| 88 } else if (parents.some((p) => identical(p, obj))) { | |
| 89 return -1; | |
| 90 } | |
| 91 | |
| 92 parents.add(obj); | |
| 93 try { | |
| 94 if (obj == null) return 0; | |
| 95 if (obj == true) return 1; | |
| 96 if (obj == false) return 2; | |
| 97 if (obj is Map) { | |
| 98 return _hashCode(obj.keys, parents) ^ | |
| 99 _hashCode(obj.values, parents); | |
| 100 } | |
| 101 if (obj is List) { | |
| 102 // This is probably a really bad hash function, but presumably we'll get t
his | |
| 103 // in the standard library before it actually matters. | |
| 104 int hash = 0; | |
| 105 for (var e in obj) { | |
| 106 hash ^= _hashCode(e, parents); | |
| 107 } | |
| 108 return hash; | |
| 109 } | |
| 110 return obj.hashCode; | |
| 111 } finally { | |
| 112 parents.removeLast(); | |
| 113 } | |
| 114 } | |
| OLD | NEW |