Shorten Closure template notation from Array.<*> to Array<*>.

chrome/browser/resources/bookmark_manager/js/main.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.
 
 (function() {
 /** @const */ var BookmarkList = bmm.BookmarkList;
 /** @const */ var BookmarkTree = bmm.BookmarkTree;
 /** @const */ var Command = cr.ui.Command;
 /** @const */ var LinkKind = cr.LinkKind;
 /** @const */ var ListItem = cr.ui.ListItem;
 /** @const */ var Menu = cr.ui.Menu;
 /** @const */ var MenuButton = cr.ui.MenuButton;
 /** @const */ var Splitter = cr.ui.Splitter;
 /** @const */ var TreeItem = cr.ui.TreeItem;
 
 /**
  * An array containing the BookmarkTreeNodes that were deleted in the last
  * deletion action. This is used for implementing undo.
- * @type {?{nodes: Array.<Array.<BookmarkTreeNode>>, target: EventTarget}}
+ * @type {?{nodes: Array<Array<BookmarkTreeNode>>, target: EventTarget}}
  */
 var lastDeleted;
 
 /**
  *
  * Holds the last DOMTimeStamp when mouse pointer hovers on folder in tree
  * view. Zero means pointer doesn't hover on folder.
  * @type {number}
  */
 var lastHoverOnFolderTimeStamp = 0;
@@ skipping 271 matching lines @@
   }
 }
 
 function handleLoadForTree(e) {
   processHash();
 }
 
 /**
  * Returns a promise for all the URLs in the {@code nodes} and the direct
  * children of {@code nodes}.
- * @param {!Array.<BookmarkTreeNode>} nodes .
- * @return {!Promise.<Array.<string>>} .
+ * @param {!Array<BookmarkTreeNode>} nodes .
+ * @return {!Promise<Array<string>>} .
  */
 function getAllUrls(nodes) {
   var urls = [];
 
   // Adds the node and all its direct children.
   function addNodes(node) {
     if (node.id == 'new')
       return;
 
     if (node.children) {
@@ skipping 16 matching lines @@
 
   return Promise.all(promises).then(function(nodes) {
     nodes.forEach(addNodes);
     return urls;
   });
 }
 
 /**
  * Returns the nodes (non recursive) to use for the open commands.
  * @param {HTMLElement} target
- * @return {!Array.<BookmarkTreeNode>}
+ * @return {!Array<BookmarkTreeNode>}
  */
 function getNodesForOpen(target) {
   if (target == bmm.tree) {
     if (bmm.tree.selectedItem != searchTreeItem)
       return bmm.tree.selectedFolders;
     // Fall through to use all nodes in the list.
   } else {
     var items = bmm.list.selectedItems;
     if (items.length)
       return items;
   }
 
   // The list starts off with a null dataModel. We can get here during startup.
   if (!bmm.list.dataModel)
     return [];
 
   // Return an array based on the dataModel.
   return bmm.list.dataModel.slice();
 }
 
 /**
  * Returns a promise that will contain all URLs of all the selected bookmarks
  * and the nested bookmarks for use with the open commands.
  * @param {HTMLElement} target The target list or tree.
- * @return {Promise.<Array.<string>>} .
+ * @return {Promise<Array<string>>} .
  */
 function getUrlsForOpenCommands(target) {
   return getAllUrls(getNodesForOpen(target));
 }
 
 function notNewNode(node) {
   return node.id != 'new';
 }
 
 /**
@@ skipping 455 matching lines @@
  * @param {EventTarget=} opt_target The target list or tree.
  * @return {!Array} Array of bookmark nodes.
  */
 function getSelectedBookmarkNodes(opt_target) {
   return (opt_target || document.activeElement) == bmm.tree ?
       bmm.tree.selectedFolders : bmm.list.selectedItems;
 }
 
 /**
  * @param {EventTarget=} opt_target The target list or tree.
- * @return {!Array.<string>} An array of the selected bookmark IDs.
+ * @return {!Array<string>} An array of the selected bookmark IDs.
  */
 function getSelectedBookmarkIds(opt_target) {
   var selectedNodes = getSelectedBookmarkNodes(opt_target);
   selectedNodes.sort(function(a, b) { return a.index - b.index });
   return selectedNodes.map(function(node) {
     return node.id;
   });
 }
 
 /**
  * @param {BookmarkTreeNode} node The node to test.
  * @return {boolean} Whether the given node is unmodifiable.
  */
 function isUnmodifiable(node) {
   return !!(node && node.unmodifiable);
 }
 
 /**
- * @param {Array.<BookmarkTreeNode>} nodes A list of BookmarkTreeNodes.
+ * @param {Array<BookmarkTreeNode>} nodes A list of BookmarkTreeNodes.
  * @return {boolean} Whether any of the nodes is managed.
  */
 function hasUnmodifiable(nodes) {
   return nodes.some(isUnmodifiable);
 }
 
 /**
  * Opens the selected bookmarks.
  * @param {cr.LinkKind} kind The kind of link we want to open.
  * @param {HTMLElement=} opt_eventTarget The target of the user initiated event.
@@ skipping 338 matching lines @@
   if (contains(getSelectedBookmarkNodes(), parentNode))
     return true;
 
   // Keep digging.
   return hasSelectedAncestor(
       bmm.tree.getBookmarkNodeById(parentNode.parentId));
 }
 
 /**
  * @param {EventTarget=} opt_target A target to get bookmark IDs from.
- * @return {Array.<string>} An array of bookmarks IDs.
+ * @return {Array<string>} An array of bookmarks IDs.
  */
 function getFilteredSelectedBookmarkIds(opt_target) {
   // Remove duplicates from filteredIds and return.
   var filteredIds = [];
   // Selected nodes to iterate through for matches.
   var nodes = getSelectedBookmarkNodes(opt_target);
 
   for (var i = 0; i < nodes.length; i++)
     if (!hasSelectedAncestor(bmm.tree.getBookmarkNodeById(nodes[i].parentId)))
       filteredIds.splice(0, 0, nodes[i].id);
@@ skipping 267 matching lines @@
 
   cr.ui.FocusOutlineManager.forDocument(document);
   initializeSplitter();
   bmm.addBookmarkModelListeners();
   dnd.init(selectItemsAfterUserAction);
   bmm.tree.reload();
 }
 
 initializeBookmarkManager();
 })();