Implement base.IPC

remoting/webapp/unittests/base_unittest.js

 // Copyright 2014 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.
 
 (function() {
 
 'use strict';
 
 module('base');
 
@@ skipping 23 matching lines @@
 });
 
 test('values(obj) should return an array containing the values of |obj|',
   function() {
     var output = base.values({ a: 'a', b: 'b'});
 
     notEqual(output.indexOf('a'), -1, '"a" should be in the output');
     notEqual(output.indexOf('b'), -1, '"b" should be in the output');
 });
 
+test('deepCopy(obj) should return null on NaN and undefined',
+  function() {
+    QUnit.equal(base.deepCopy(NaN), null);
+    QUnit.equal(base.deepCopy(undefined), null);
+});
+
+test('deepCopy(obj) should copy primitive types recursively',
+  function() {
+    QUnit.equal(base.deepCopy(1), 1);
+    QUnit.equal(base.deepCopy('hello'), 'hello');
+    QUnit.equal(base.deepCopy(false), false);
+    QUnit.equal(base.deepCopy(null), null);
+    QUnit.deepEqual(base.deepCopy([1, 2]), [1, 2]);
+    QUnit.deepEqual(base.deepCopy({'key': 'value'}), {'key': 'value'});
+    QUnit.deepEqual(base.deepCopy(
+      {'key': {'key_nested': 'value_nested'}}),
+      {'key': {'key_nested': 'value_nested'}}
+    );
+    QUnit.deepEqual(base.deepCopy([1, [2, [3]]]), [1, [2, [3]]]);
+});
+
+test('modify the original after deepCopy(obj) should not affect the copy',
+  function() {
+    var original = [1, 2, 3, 4];
+    var copy = base.deepCopy(original);
+    original[2] = 1000;
+    QUnit.deepEqual(copy, [1, 2, 3, 4]);
+});
+
 test('dispose(obj) should invoke the dispose method on |obj|',
   function() {
     var obj = {
       dispose: sinon.spy()
     };
     base.dispose(obj);
     sinon.assert.called(obj.dispose);
 });
 
 test('dispose(obj) should not crash if |obj| is null',
@@ skipping 219 matching lines @@
                           /* Ѓ */ 0xD0, 0x83,
                           /* ф */ 0xD1, 0x84]).buffer),
       "挂Ѓф");
 
   // Unicode surrogate pair for U+1F603.
   QUnit.equal(base.decodeUtf8(new Uint8Array([0xF0, 0x9F, 0x98, 0x83]).buffer),
               "😃");
 });
 
 })();