| 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 | 8 |
| 9 #include <set> | 9 #include <set> |
| 10 | 10 |
| (...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 68 } | 68 } |
| 69 | 69 |
| 70 AXTree::AXTree() | 70 AXTree::AXTree() |
| 71 : delegate_(NULL), root_(NULL) { | 71 : delegate_(NULL), root_(NULL) { |
| 72 AXNodeData root; | 72 AXNodeData root; |
| 73 root.id = -1; | 73 root.id = -1; |
| 74 | 74 |
| 75 AXTreeUpdate initial_state; | 75 AXTreeUpdate initial_state; |
| 76 initial_state.root_id = -1; | 76 initial_state.root_id = -1; |
| 77 initial_state.nodes.push_back(root); | 77 initial_state.nodes.push_back(root); |
| 78 CHECK(Unserialize(initial_state)) << error(); | 78 CHECK(Unserialize(initial_state)); |
| 79 } | 79 } |
| 80 | 80 |
| 81 AXTree::AXTree(const AXTreeUpdate& initial_state) | 81 AXTree::AXTree(const AXTreeUpdate& initial_state) |
| 82 : delegate_(NULL), root_(NULL) { | 82 : delegate_(NULL), root_(NULL) { |
| 83 CHECK(Unserialize(initial_state)) << error(); | 83 CHECK(Unserialize(initial_state)); |
| 84 } | 84 } |
| 85 | 85 |
| 86 AXTree::~AXTree() { | 86 AXTree::~AXTree() { |
| 87 if (root_) | 87 if (root_) |
| 88 DestroyNodeAndSubtree(root_, nullptr); | 88 DestroyNodeAndSubtree(root_, nullptr); |
| 89 } | 89 } |
| 90 | 90 |
| 91 void AXTree::SetDelegate(AXTreeDelegate* delegate) { | 91 void AXTree::SetDelegate(AXTreeDelegate* delegate) { |
| 92 delegate_ = delegate; | 92 delegate_ = delegate; |
| 93 } | 93 } |
| (...skipping 273 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 367 update_state->pending_nodes.insert(child); | 367 update_state->pending_nodes.insert(child); |
| 368 update_state->new_nodes.insert(child); | 368 update_state->new_nodes.insert(child); |
| 369 } | 369 } |
| 370 new_children->push_back(child); | 370 new_children->push_back(child); |
| 371 } | 371 } |
| 372 | 372 |
| 373 return success; | 373 return success; |
| 374 } | 374 } |
| 375 | 375 |
| 376 } // namespace ui | 376 } // namespace ui |
| OLD | NEW |