| 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 "base/memory/scoped_ptr.h" | 5 #include "base/memory/scoped_ptr.h" |
| 6 #include "base/strings/string_number_conversions.h" | 6 #include "base/strings/string_number_conversions.h" |
| 7 #include "testing/gtest/include/gtest/gtest.h" | 7 #include "testing/gtest/include/gtest/gtest.h" |
| 8 #include "ui/accessibility/ax_node.h" | 8 #include "ui/accessibility/ax_node.h" |
| 9 #include "ui/accessibility/ax_serializable_tree.h" | 9 #include "ui/accessibility/ax_serializable_tree.h" |
| 10 #include "ui/accessibility/ax_tree.h" | 10 #include "ui/accessibility/ax_tree.h" |
| (...skipping 307 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 318 update.nodes[0].role = AX_ROLE_ROOT_WEB_AREA; | 318 update.nodes[0].role = AX_ROLE_ROOT_WEB_AREA; |
| 319 update.nodes[0].child_ids.push_back(4); | 319 update.nodes[0].child_ids.push_back(4); |
| 320 update.nodes[1].id = 4; | 320 update.nodes[1].id = 4; |
| 321 | 321 |
| 322 FakeAXTreeDelegate fake_delegate; | 322 FakeAXTreeDelegate fake_delegate; |
| 323 tree.SetDelegate(&fake_delegate); | 323 tree.SetDelegate(&fake_delegate); |
| 324 | 324 |
| 325 EXPECT_TRUE(tree.Unserialize(update)); | 325 EXPECT_TRUE(tree.Unserialize(update)); |
| 326 | 326 |
| 327 ASSERT_EQ(2U, fake_delegate.deleted_ids().size()); | 327 ASSERT_EQ(2U, fake_delegate.deleted_ids().size()); |
| 328 EXPECT_EQ(1, fake_delegate.deleted_ids()[0]); | 328 EXPECT_EQ(2, fake_delegate.deleted_ids()[0]); |
| 329 EXPECT_EQ(2, fake_delegate.deleted_ids()[1]); | 329 EXPECT_EQ(1, fake_delegate.deleted_ids()[1]); |
| 330 | 330 |
| 331 ASSERT_EQ(1U, fake_delegate.subtree_deleted_ids().size()); | 331 ASSERT_EQ(1U, fake_delegate.subtree_deleted_ids().size()); |
| 332 EXPECT_EQ(1, fake_delegate.subtree_deleted_ids()[0]); | 332 EXPECT_EQ(1, fake_delegate.subtree_deleted_ids()[0]); |
| 333 | 333 |
| 334 ASSERT_EQ(2U, fake_delegate.created_ids().size()); | 334 ASSERT_EQ(2U, fake_delegate.created_ids().size()); |
| 335 EXPECT_EQ(3, fake_delegate.created_ids()[0]); | 335 EXPECT_EQ(3, fake_delegate.created_ids()[0]); |
| 336 EXPECT_EQ(4, fake_delegate.created_ids()[1]); | 336 EXPECT_EQ(4, fake_delegate.created_ids()[1]); |
| 337 | 337 |
| 338 ASSERT_EQ(1U, fake_delegate.subtree_creation_finished_ids().size()); | 338 ASSERT_EQ(1U, fake_delegate.subtree_creation_finished_ids().size()); |
| 339 EXPECT_EQ(3, fake_delegate.subtree_creation_finished_ids()[0]); | 339 EXPECT_EQ(3, fake_delegate.subtree_creation_finished_ids()[0]); |
| 340 | 340 |
| 341 ASSERT_EQ(1U, fake_delegate.node_creation_finished_ids().size()); | 341 ASSERT_EQ(1U, fake_delegate.node_creation_finished_ids().size()); |
| 342 EXPECT_EQ(4, fake_delegate.node_creation_finished_ids()[0]); | 342 EXPECT_EQ(4, fake_delegate.node_creation_finished_ids()[0]); |
| 343 | 343 |
| 344 ASSERT_EQ(true, fake_delegate.root_changed()); | 344 ASSERT_EQ(true, fake_delegate.root_changed()); |
| 345 | 345 |
| 346 tree.SetDelegate(NULL); | 346 tree.SetDelegate(NULL); |
| 347 } | 347 } |
| 348 | 348 |
| 349 } // namespace ui | 349 } // namespace ui |
| OLD | NEW |