Adds back BookmarkNode::IsVisible. Turns out we want to conditionally

chrome/browser/bookmarks/bookmark_extension_helpers.cc

 // Copyright (c) 2011 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.
 
 #include "chrome/browser/bookmarks/bookmark_extension_helpers.h"
 
 #include "base/string_number_conversions.h"
 #include "base/values.h"
 #include "chrome/browser/bookmarks/bookmark_extension_api_constants.h"
 #include "chrome/browser/bookmarks/bookmark_model.h"
 
 namespace keys = bookmark_extension_api_constants;
 
 namespace {
 
 void AddNode(const BookmarkNode* node,
              base::ListValue* list,
              bool recurse,
              bool only_folders) {
-  base::DictionaryValue* dict = bookmark_extension_helpers::GetNodeDictionary(
-      node, recurse, only_folders);
-  list->Append(dict);
+  if (node->IsVisible()) {
+    base::DictionaryValue* dict = bookmark_extension_helpers::GetNodeDictionary(
+        node, recurse, only_folders);
+    list->Append(dict);
+  }
 }
 
 }  // namespace
 
 namespace bookmark_extension_helpers {
 
 base::DictionaryValue* GetNodeDictionary(const BookmarkNode* node,
                                          bool recurse,
                                          bool only_folders) {
   base::DictionaryValue* dict = new base::DictionaryValue;
@@ skipping 19 matching lines @@
   if (!node->date_added().is_null()) {
     // Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds.
     dict->SetDouble(keys::kDateAddedKey,
                     floor(node->date_added().ToDoubleT() * 1000));
   }
 
   if (recurse && node->is_folder()) {
     base::ListValue* children = new base::ListValue;
     for (int i = 0; i < node->child_count(); ++i) {
       const BookmarkNode* child = node->GetChild(i);
-      if (!only_folders || child->is_folder()) {
+      if (child->IsVisible() && (!only_folders || child->is_folder())) {
         DictionaryValue* dict = GetNodeDictionary(child, true, only_folders);
         children->Append(dict);
       }
     }
     dict->Set(keys::kChildrenKey, children);
   }
   return dict;
 }
 
 void AddNode(const BookmarkNode* node, base::ListValue* list, bool recurse) {
@@ skipping 23 matching lines @@
     *error = keys::kFolderNotEmptyError;
     return false;
   }
 
   const BookmarkNode* parent = node->parent();
   model->Remove(parent, parent->GetIndexOf(node));
   return true;
 }
 
 }  // namespace bookmark_extension_helpers