content/browser/accessibility/one_shot_accessibility_tree_search_unittest.cc

   1 // Copyright 2015 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "base/memory/scoped_ptr.h"
   6 #include "content/browser/accessibility/browser_accessibility.h"
   7 #include "content/browser/accessibility/browser_accessibility_manager.h"
   8 #include "content/browser/accessibility/one_shot_accessibility_tree_search.h"
   9 #include "testing/gtest/include/gtest/gtest.h"
  10
  11 namespace content {
  12
  13 namespace {
  14
  15 class TestBrowserAccessibilityManager : public BrowserAccessibilityManager {
  16  public:
  17   TestBrowserAccessibilityManager(
  18       const SimpleAXTreeUpdate& initial_tree)
  19       : BrowserAccessibilityManager(initial_tree,
  20                                     nullptr,
  21                                     new BrowserAccessibilityFactory()) {}
  22 };
  23
  24 }  // namespace
  25
  26 // These tests prevent other tests from being run. crbug.com/514632
  27 #if defined(ANDROID) && defined(ADDRESS_SANITIZER)
  28 #define MAYBE_OneShotAccessibilityTreeSearchTest DISABLED_OneShotAccessibilityTreeSearchTets
  29 #else
  30 #define MAYBE_OneShotAccessibilityTreeSearchTest OneShotAccessibilityTreeSearchTest
  31 #endif
  32 class MAYBE_OneShotAccessibilityTreeSearchTest : public testing::Test {
  33  public:
  34   MAYBE_OneShotAccessibilityTreeSearchTest() {}
  35   ~MAYBE_OneShotAccessibilityTreeSearchTest() override {}
  36
  37  protected:
  38   void SetUp() override;
  39
  40   scoped_ptr<BrowserAccessibilityManager> tree_;
  41
  42  private:
  43   DISALLOW_COPY_AND_ASSIGN(MAYBE_OneShotAccessibilityTreeSearchTest);
  44 };
  45
  46 void MAYBE_OneShotAccessibilityTreeSearchTest::SetUp() {
  47   ui::AXNodeData root;
  48   root.id = 1;
  49   root.SetName("Document");
  50   root.role = ui::AX_ROLE_ROOT_WEB_AREA;
  51   root.state = 0;
  52   root.child_ids.push_back(2);
  53   root.child_ids.push_back(3);
  54   root.child_ids.push_back(6);
  55
  56   ui::AXNodeData heading;
  57   heading.id = 2;
  58   heading.SetName("Heading");
  59   heading.role = ui::AX_ROLE_HEADING;
  60   heading.state = 0;
  61
  62   ui::AXNodeData list;
  63   list.id = 3;
  64   list.role = ui::AX_ROLE_LIST;
  65   list.state = 0;
  66   list.child_ids.push_back(4);
  67   list.child_ids.push_back(5);
  68
  69   ui::AXNodeData list_item_1;
  70   list_item_1.id = 4;
  71   list_item_1.SetName("Autobots");
  72   list_item_1.role = ui::AX_ROLE_LIST_ITEM;
  73   list_item_1.state = 0;
  74
  75   ui::AXNodeData list_item_2;
  76   list_item_2.id = 5;
  77   list_item_2.SetName("Decepticons");
  78   list_item_2.role = ui::AX_ROLE_LIST_ITEM;
  79   list_item_2.state = 0;
  80
  81   ui::AXNodeData footer;
  82   footer.id = 6;
  83   footer.SetName("Footer");
  84   footer.role = ui::AX_ROLE_FOOTER;
  85   footer.state = 1 << ui::AX_STATE_OFFSCREEN;
  86
  87   tree_.reset(new TestBrowserAccessibilityManager(
  88       MakeAXTreeUpdate(root, heading, list, list_item_1, list_item_2, footer)));
  89 }
  90
  91 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, GetAll) {
  92   OneShotAccessibilityTreeSearch search(tree_.get());
  93   ASSERT_EQ(6U, search.CountMatches());
  94 }
  95
  96 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, ForwardsWithStartNode) {
  97   OneShotAccessibilityTreeSearch search(tree_.get());
  98   search.SetStartNode(tree_->GetFromID(4));
  99   ASSERT_EQ(2U, search.CountMatches());
 100   EXPECT_EQ(5, search.GetMatchAtIndex(0)->GetId());
 101   EXPECT_EQ(6, search.GetMatchAtIndex(1)->GetId());
 102 }
 103
 104 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, BackwardsWithStartNode) {
 105   OneShotAccessibilityTreeSearch search(tree_.get());
 106   search.SetStartNode(tree_->GetFromID(4));
 107   search.SetDirection(OneShotAccessibilityTreeSearch::BACKWARDS);
 108   ASSERT_EQ(3U, search.CountMatches());
 109   EXPECT_EQ(3, search.GetMatchAtIndex(0)->GetId());
 110   EXPECT_EQ(2, search.GetMatchAtIndex(1)->GetId());
 111   EXPECT_EQ(1, search.GetMatchAtIndex(2)->GetId());
 112 }
 113
 114 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, ResultLimitZero) {
 115   OneShotAccessibilityTreeSearch search(tree_.get());
 116   search.SetResultLimit(0);
 117   ASSERT_EQ(0U, search.CountMatches());
 118 }
 119
 120 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, ResultLimitFive) {
 121   OneShotAccessibilityTreeSearch search(tree_.get());
 122   search.SetResultLimit(5);
 123   ASSERT_EQ(5U, search.CountMatches());
 124 }
 125
 126 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, DescendantsOnly) {
 127   OneShotAccessibilityTreeSearch search(tree_.get());
 128   search.SetStartNode(tree_->GetFromID(1));
 129   search.SetImmediateDescendantsOnly(true);
 130   ASSERT_EQ(3U, search.CountMatches());
 131   EXPECT_EQ(2, search.GetMatchAtIndex(0)->GetId());
 132   EXPECT_EQ(3, search.GetMatchAtIndex(1)->GetId());
 133   EXPECT_EQ(6, search.GetMatchAtIndex(2)->GetId());
 134 }
 135
 136 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, VisibleOnly) {
 137   OneShotAccessibilityTreeSearch search(tree_.get());
 138   search.SetVisibleOnly(true);
 139   ASSERT_EQ(5U, search.CountMatches());
 140   EXPECT_EQ(1, search.GetMatchAtIndex(0)->GetId());
 141   EXPECT_EQ(2, search.GetMatchAtIndex(1)->GetId());
 142   EXPECT_EQ(3, search.GetMatchAtIndex(2)->GetId());
 143   EXPECT_EQ(4, search.GetMatchAtIndex(3)->GetId());
 144   EXPECT_EQ(5, search.GetMatchAtIndex(4)->GetId());
 145 }
 146
 147 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, CaseInsensitiveStringMatch) {
 148   OneShotAccessibilityTreeSearch search(tree_.get());
 149   search.SetSearchText("eCEptiCOn");
 150   ASSERT_EQ(1U, search.CountMatches());
 151   EXPECT_EQ(5, search.GetMatchAtIndex(0)->GetId());
 152 }
 153
 154 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, OnePredicate) {
 155   OneShotAccessibilityTreeSearch search(tree_.get());
 156   search.AddPredicate([](BrowserAccessibility* start,
 157                          BrowserAccessibility* current) {
 158     return current->GetRole() == ui::AX_ROLE_LIST_ITEM;
 159   });
 160   ASSERT_EQ(2U, search.CountMatches());
 161   EXPECT_EQ(4, search.GetMatchAtIndex(0)->GetId());
 162   EXPECT_EQ(5, search.GetMatchAtIndex(1)->GetId());
 163 }
 164
 165 TEST_F(MAYBE_OneShotAccessibilityTreeSearchTest, TwoPredicates) {
 166   OneShotAccessibilityTreeSearch search(tree_.get());
 167   search.AddPredicate([](BrowserAccessibility* start,
 168                          BrowserAccessibility* current) {
 169     return (current->GetRole() == ui::AX_ROLE_LIST ||
 170             current->GetRole() == ui::AX_ROLE_LIST_ITEM);
 171   });
 172   search.AddPredicate([](BrowserAccessibility* start,
 173                          BrowserAccessibility* current) {
 174     return (current->GetId() % 2 == 1);
 175   });
 176   ASSERT_EQ(2U, search.CountMatches());
 177   EXPECT_EQ(3, search.GetMatchAtIndex(0)->GetId());
 178   EXPECT_EQ(5, search.GetMatchAtIndex(1)->GetId());
 179 }
 180
 181 }  // namespace content