Lines Matching defs:node
17 std::string TreeToStringHelper(AXNode* node, int indent) {
19 result += node->data().ToString() + "\n";
20 for (int i = 0; i < node->child_count(); ++i)
21 result += TreeToStringHelper(node->ChildAtIndex(i), indent + 1);
84 AXNode* node = GetFromId(update.node_id_to_clear);
85 if (!node) {
90 if (node == root_) {
94 for (int i = 0; i < node->child_count(); ++i)
95 DestroyNodeAndSubtree(node->ChildAtIndex(i));
97 node->SwapChildren(children);
98 update_state.pending_nodes.insert(node);
118 AXNode* node = GetFromId(update.nodes[i].id);
119 if (update_state.new_nodes.find(node) != update_state.new_nodes.end()) {
120 delegate_->OnNodeCreationFinished(node);
121 update_state.new_nodes.erase(node);
123 delegate_->OnNodeChangeFinished(node);
148 // This method updates one node in the tree based on serialized data
152 // Look up the node by id. If it's not found, then either the root
155 AXNode* node = GetFromId(src.id);
157 if (node) {
158 update_state->pending_nodes.erase(node);
159 node->SetData(src);
167 node = new_node;
168 update_state->new_nodes.insert(node);
169 node->SetData(src);
173 delegate_->OnNodeChanged(node);
175 // First, delete nodes that used to be children of this node but aren't
177 if (!DeleteOldChildren(node, src.child_ids)) {
187 node, src.child_ids, &new_children, update_state);
188 node->SwapChildren(new_children);
195 root_ = node;
201 void AXTree::DestroyNodeAndSubtree(AXNode* node) {
202 id_map_.erase(node->id());
203 for (int i = 0; i < node->child_count(); ++i)
204 DestroyNodeAndSubtree(node->ChildAtIndex(i));
206 delegate_->OnNodeWillBeDeleted(node);
207 node->Destroy();
210 bool AXTree::DeleteOldChildren(AXNode* node,
217 error_ = base::StringPrintf("Node %d has duplicate child id %d",
218 node->id(), new_child_ids[i]);
225 const std::vector<AXNode*>& old_children = node->children();
235 bool AXTree::CreateNewChildVector(AXNode* node,
245 if (child->parent() != node) {
247 // If this case occurs, continue so this node isn't left in an
250 "Node %d reparented from %d to %d",
253 node->id());
259 child = CreateNode(node, child_id, index_in_parent);
