Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(149)

Side by Side Diff: utils/pub/yaml/deep_equals.dart

Issue 11622011: Restructure YAML package suitable for pub lish (Closed) Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart
Patch Set: Created 8 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
(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 library deep_equals;
6
7 /**
8 * Returns whether two objects are structurally equivalent. This considers NaN
9 * values to be equivalent. It also handles self-referential structures.
10 */
11 bool deepEquals(obj1, obj2, [List parents1, List parents2]) {
12 if (identical(obj1, obj2)) return true;
13 if (parents1 == null) {
14 parents1 = [];
15 parents2 = [];
16 }
17
18 // parents1 and parents2 are guaranteed to be the same size.
19 for (var i = 0; i < parents1.length; i++) {
20 var loop1 = identical(obj1, parents1[i]);
21 var loop2 = identical(obj2, parents2[i]);
22 // If both structures loop in the same place, they're equal at that point in
23 // the structure. If one loops and the other doesn't, they're not equal.
24 if (loop1 && loop2) return true;
25 if (loop1 || loop2) return false;
26 }
27
28 parents1.add(obj1);
29 parents2.add(obj2);
30 try {
31 if (obj1 is List && obj2 is List) {
32 return _listEquals(obj1, obj2, parents1, parents2);
33 } else if (obj1 is Map && obj2 is Map) {
34 return _mapEquals(obj1, obj2, parents1, parents2);
35 } else if (obj1 is double && obj2 is double) {
36 return _doubleEquals(obj1, obj2);
37 } else {
38 return obj1 == obj2;
39 }
40 } finally {
41 parents1.removeLast();
42 parents2.removeLast();
43 }
44 }
45
46 /** Returns whether [list1] and [list2] are structurally equal. */
47 bool _listEquals(List list1, List list2, List parents1, List parents2) {
48 if (list1.length != list2.length) return false;
49
50 for (var i = 0; i < list1.length; i++) {
51 if (!deepEquals(list1[i], list2[i], parents1, parents2)) return false;
52 }
53
54 return true;
55 }
56
57 /** Returns whether [map1] and [map2] are structurally equal. */
58 bool _mapEquals(Map map1, Map map2, List parents1, List parents2) {
59 if (map1.length != map2.length) return false;
60
61 for (var key in map1.keys) {
62 if (!map2.containsKey(key)) return false;
63 if (!deepEquals(map1[key], map2[key], parents1, parents2)) return false;
64 }
65
66 return true;
67 }
68
69 /**
70 * Returns whether two doubles are equivalent. This differs from `d1 == d2` in
71 * that it considers NaN to be equal to itself.
72 */
73 bool _doubleEquals(double d1, double d2) {
74 if (d1.isNaN && d2.isNaN) return true;
75 return d1 == d2;
76 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698