Mojo JS Bindings: add support for associative arrays (Mojo map type)

gin/test/expect.js

 // Copyright 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 define(function() {
   // Equality function based on isEqual in
   // Underscore.js 1.5.2
   // http://underscorejs.org
   // (c) 2009-2013 Jeremy Ashkenas,
   //               DocumentCloud,
@@ skipping 64 matching lines @@
     var aCtor = a.constructor, bCtor = b.constructor;
     if (aCtor !== bCtor && !(isFunction(aCtor) && (aCtor instanceof aCtor) &&
                              isFunction(bCtor) && (bCtor instanceof bCtor))
                         && ('constructor' in a && 'constructor' in b)) {
       return false;
     }
     // Add the first object to the stack of traversed objects.
     aStack.push(a);
     bStack.push(b);
     var size = 0, result = true;
-    // Recursively compare objects and arrays.
+    // Recursively compare Maps, objects and arrays.
     if (className == '[object Array]' || isArrayBufferClass(className)) {
       // Compare array lengths to determine if a deep comparison is necessary.
       size = a.length;
       result = size == b.length;
       if (result) {
         // Deep compare the contents, ignoring non-numeric properties.
         while (size--) {
           if (!(result = eq(a[size], b[size], aStack, bStack)))
             break;
         }
       }
+    } else if (className == '[object Map]') {
+      result = a.size == b.size;
+      if (result) {
+        var entries = a.entries();
+        for (var e = entries.next(); result && !e.done; e = entries.next()) {
+          var key = e.value[0];
+          var value = e.value[1];
+          result = b.has(key) && eq(value, b.get(key), aStack, bStack);
+        }
+      }
     } else {
       // Deep compare objects.
       for (var key in a) {
         if (has(a, key)) {
           // Count the expected number of properties.
           size++;
           // Deep compare each member.
           if (!(result = has(b, key) && eq(a[key], b[key], aStack, bStack)))
             break;
         }
@@ skipping 173 matching lines @@
       var bound = predicates[name].bind(null, actual);
       this[name] = check(bound);
       this.not[name] = check(negate(bound));
     }, this);
   }
 
   return function(actual) {
     return new Condition(actual);
   };
 });