| 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 #ifndef UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 5 #ifndef UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 
| 6 #define UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 6 #define UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 
| 7 | 7 | 
| 8 #include <stddef.h> | 8 #include <stddef.h> | 
| 9 #include <stdint.h> | 9 #include <stdint.h> | 
| 10 | 10 | 
| 11 #include <string> | 11 #include <string> | 
| 12 #include <vector> | 12 #include <vector> | 
| 13 | 13 | 
|  | 14 #include "base/containers/hash_tables.h" | 
| 14 #include "base/strings/string_number_conversions.h" | 15 #include "base/strings/string_number_conversions.h" | 
| 15 #include "ui/accessibility/ax_node_data.h" | 16 #include "ui/accessibility/ax_node_data.h" | 
| 16 #include "ui/accessibility/ax_tree_data.h" | 17 #include "ui/accessibility/ax_tree_data.h" | 
| 17 | 18 | 
| 18 namespace ui { | 19 namespace ui { | 
| 19 | 20 | 
| 20 // An AXTreeUpdate is a serialized representation of an atomic change | 21 // An AXTreeUpdate is a serialized representation of an atomic change | 
| 21 // to an AXTree. The sender and receiver must be in sync; the update | 22 // to an AXTree. The sender and receiver must be in sync; the update | 
| 22 // is only meant to bring the tree from a specific previous state into | 23 // is only meant to bring the tree from a specific previous state into | 
| 23 // its next state. Trying to apply it to the wrong tree should immediately | 24 // its next state. Trying to apply it to the wrong tree should immediately | 
| (...skipping 82 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 106     for (size_t j = 0; j < nodes[i].child_ids.size(); ++j) | 107     for (size_t j = 0; j < nodes[i].child_ids.size(); ++j) | 
| 107       id_to_indentation[nodes[i].child_ids[j]] = indent + 1; | 108       id_to_indentation[nodes[i].child_ids[j]] = indent + 1; | 
| 108   } | 109   } | 
| 109 | 110 | 
| 110   return result; | 111   return result; | 
| 111 } | 112 } | 
| 112 | 113 | 
| 113 }  // namespace ui | 114 }  // namespace ui | 
| 114 | 115 | 
| 115 #endif  // UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 116 #endif  // UI_ACCESSIBILITY_AX_TREE_UPDATE_H_ | 
| OLD | NEW | 
|---|