DO NOT SUBMIT: what chrome/browser/resources/ could eventually look like with clang-format

chrome/browser/resources/bookmark_manager/js/bmm.js

 // Copyright (c) 2012 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.
 
 cr.define('bmm', function() {
   'use strict';
 
   /**
    * Whether a node contains another node.
    * TODO(yosin): Once JavaScript style guide is updated and linter follows
@@ skipping 42 matching lines @@
   }
 
   /**
    * Loads a subtree of the bookmark tree and returns a {@code Promise} that
    * will be fulfilled when done. This reuses multiple loads so that we do not
    * load the same subtree more than once at the same time.
    * @return {!Promise<!BookmarkTreeNode>} The future promise for the load.
    */
   function loadSubtree(id) {
     if (!loadingPromises[id]) {
-      loadingPromises[id] = getSubtreePromise(id, false).then(function(nodes) {
-        return nodes && nodes[0];
-      }, function(error) {
-        console.error(error.message);
-      });
+      loadingPromises[id] = getSubtreePromise(id, false).then(
+          function(nodes) {
+            return nodes && nodes[0];
+          },
+          function(error) {
+            console.error(error.message);
+          });
       loadingPromises[id].then(function() {
         delete loadingPromises[id];
       });
     }
     return loadingPromises[id];
   }
 
   /**
    * Loads the entire bookmark tree and returns a {@code Promise} that will
    * be fulfilled when done. This reuses multiple loads so that we do not load
    * the same tree more than once at the same time.
    * @return {!Promise<!BookmarkTreeNode>} The future promise for the load.
    */
   function loadTree() {
     return loadSubtree('');
   }
 
   var bookmarkCache = {
     /**
      * Removes the cached item from both the list and tree lookups.
      */
     remove: function(id) {
       var treeItem = bmm.treeLookup[id];
       if (treeItem) {
-        var items = treeItem.items; // is an HTMLCollection
+        var items = treeItem.items;  // is an HTMLCollection
         for (var i = 0; i < items.length; ++i) {
           var item = items[i];
           var bookmarkNode = item.bookmarkNode;
           delete bmm.treeLookup[bookmarkNode.id];
         }
         delete bmm.treeLookup[id];
       }
     },
 
     /**
@@ skipping 149 matching lines @@
   }
 
   return {
     contains: contains,
     isFolder: isFolder,
     loadSubtree: loadSubtree,
     loadTree: loadTree,
     addBookmarkModelListeners: addBookmarkModelListeners
   };
 });