Android accessibility should not treat whitespace-only nodes as interesting.

content/browser/accessibility/one_shot_accessibility_tree_search_unittest.cc

 // Copyright 2015 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 "content/browser/accessibility/one_shot_accessibility_tree_search.h"
 
 #include <memory>
 
 #include "base/macros.h"
 #include "content/browser/accessibility/browser_accessibility.h"
@@ skipping 78 matching lines @@
 
   tree_.reset(new TestBrowserAccessibilityManager(
       MakeAXTreeUpdate(root, heading, list, list_item_1, list_item_2, footer)));
 }
 
 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, GetAll) {
   OneShotAccessibilityTreeSearch search(tree_->GetRoot());
   ASSERT_EQ(6U, search.CountMatches());
 }
 
+TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, NoCycle) {
+  // If you set a result limit of 1, you won't get the root node back as
+  // the first match.
+  OneShotAccessibilityTreeSearch search(tree_->GetRoot());
+  search.SetResultLimit(1);
+  ASSERT_EQ(1U, search.CountMatches());
+  EXPECT_NE(1, search.GetMatchAtIndex(0)->GetId());
+}
+
 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, ForwardsWithStartNode) {
   OneShotAccessibilityTreeSearch search(tree_->GetRoot());
   search.SetStartNode(tree_->GetFromID(4));
   ASSERT_EQ(2U, search.CountMatches());
   EXPECT_EQ(5, search.GetMatchAtIndex(0)->GetId());
   EXPECT_EQ(6, search.GetMatchAtIndex(1)->GetId());
 }
 
 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, BackwardsWithStartNode) {
   OneShotAccessibilityTreeSearch search(tree_->GetRoot());
@@ skipping 109 matching lines @@
   search.AddPredicate([](BrowserAccessibility* start,
                          BrowserAccessibility* current) {
     return (current->GetId() % 2 == 1);
   });
   ASSERT_EQ(2U, search.CountMatches());
   EXPECT_EQ(3, search.GetMatchAtIndex(0)->GetId());
   EXPECT_EQ(5, search.GetMatchAtIndex(1)->GetId());
 }
 
 }  // namespace content