OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "ui/accessibility/ax_tree.h" | 5 #include "ui/accessibility/ax_tree.h" |
6 | 6 |
7 #include <stddef.h> | 7 #include <stddef.h> |
8 #include <stdint.h> | 8 #include <stdint.h> |
9 | 9 |
10 #include <memory> | 10 #include <memory> |
11 | 11 |
12 #include "base/strings/string_number_conversions.h" | 12 #include "base/strings/string_number_conversions.h" |
13 #include "testing/gtest/include/gtest/gtest.h" | 13 #include "testing/gtest/include/gtest/gtest.h" |
| 14 #include "ui/accessibility/ax_enums.h" |
14 #include "ui/accessibility/ax_node.h" | 15 #include "ui/accessibility/ax_node.h" |
15 #include "ui/accessibility/ax_serializable_tree.h" | 16 #include "ui/accessibility/ax_serializable_tree.h" |
16 #include "ui/accessibility/ax_tree_serializer.h" | 17 #include "ui/accessibility/ax_tree_serializer.h" |
17 | 18 |
18 namespace ui { | 19 namespace ui { |
19 | 20 |
20 namespace { | 21 namespace { |
21 | 22 |
22 class FakeAXTreeDelegate : public AXTreeDelegate { | 23 class FakeAXTreeDelegate : public AXTreeDelegate { |
23 public: | 24 public: |
(...skipping 402 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
426 std::vector<int> node_reparented = | 427 std::vector<int> node_reparented = |
427 fake_delegate.node_reparented_finished_ids(); | 428 fake_delegate.node_reparented_finished_ids(); |
428 ASSERT_EQ(std::find(created.begin(), created.end(), 3), created.end()); | 429 ASSERT_EQ(std::find(created.begin(), created.end(), 3), created.end()); |
429 ASSERT_NE(std::find(subtree_reparented.begin(), subtree_reparented.end(), 3), | 430 ASSERT_NE(std::find(subtree_reparented.begin(), subtree_reparented.end(), 3), |
430 subtree_reparented.end()); | 431 subtree_reparented.end()); |
431 ASSERT_EQ(std::find(node_reparented.begin(), node_reparented.end(), 3), | 432 ASSERT_EQ(std::find(node_reparented.begin(), node_reparented.end(), 3), |
432 node_reparented.end()); | 433 node_reparented.end()); |
433 } | 434 } |
434 | 435 |
435 } // namespace ui | 436 } // namespace ui |
OLD | NEW |