title: Could I always compare two Immutable.Map using Map.equals() ? The computational complexity is really different than "===" on two identical objects?
body: <p>I would like to understand the computational complexity of an Immutable.equals().
  I haven't clearly found my answer by reading the source code, an neither in web discutions...</p>
  
  <pre><code>var obj1 = Immutable.Map({a: 1, b: 2, c: 'lot of entries'});
  var obj2 = obj1.set('a', 1); 
  </code></pre>
  
  <p><strong>Does <code>obj1.equals(obj2)</code> will compare every key of the objects even if there are equals?</strong><br>
  If it compares every key, I would better compare it with <code>obj1===obj2</code>.<br>
  Does Immutable verify the === equality before comparing every keys/values of the objects?<br>
  In the case of two identical objects, it would be interesting to know if there is a big difference between the computational complexity of an Immutable.equals() and the === operator.</p>