1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
// Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ui/accessibility/ax_tree_update.h"
#include "base/strings/strcat.h"
#include "base/strings/string_number_conversions.h"
#include "ui/accessibility/ax_enum_util.h"
#include "ui/accessibility/ax_tree_checks.h"
#include "ui/accessibility/ax_tree_data.h"
namespace ui {
AXTreeUpdate::AXTreeUpdate() = default;
AXTreeUpdate::AXTreeUpdate(AXTreeUpdate&& other) = default;
AXTreeUpdate& AXTreeUpdate::operator=(AXTreeUpdate&& other) = default;
AXTreeUpdate::AXTreeUpdate(const AXTreeUpdate& other) = default;
AXTreeUpdate& AXTreeUpdate::operator=(const AXTreeUpdate& other) = default;
AXTreeUpdate::~AXTreeUpdate() = default;
std::string AXTreeUpdate::ToString(bool verbose, int max_items) const {
std::string result;
if (has_tree_data) {
base::StrAppend(&result,
{"AXTreeUpdate tree data:", tree_data.ToString(), "\n"});
}
if (node_id_to_clear != kInvalidAXNodeID) {
base::StrAppend(&result, {"AXTreeUpdate: clear node ",
base::NumberToString(node_id_to_clear), "\n"});
}
if (root_id != kInvalidAXNodeID) {
base::StrAppend(&result, {"AXTreeUpdate: root id ",
base::NumberToString(root_id), "\n"});
}
if (event_from != ax::mojom::EventFrom::kNone) {
base::StrAppend(&result, {"event_from=", ui::ToString(event_from), "\n"});
}
if (event_from_action != ax::mojom::Action::kNone) {
base::StrAppend(
&result, {"event_from_action=", ui::ToString(event_from_action), "\n"});
}
if (!event_intents.empty()) {
result += "event_intents=[\n";
for (const auto& event_intent : event_intents)
base::StrAppend(&result, {" ", event_intent.ToString(), "\n"});
result += "]\n";
}
// The challenge here is that we want to indent the nodes being updated
// so that parent/child relationships are clear, but we don't have access
// to the rest of the tree for context, so we have to try to show the
// relative indentation of child nodes in this update relative to their
// parents.
std::map<AXNodeID, int> id_to_indentation;
for (const AXNodeData& node_data : nodes) {
if (max_items > 0 && max_items-- == 0) {
break;
}
int indent = id_to_indentation[node_data.id];
result.append(2 * indent, ' ');
base::StrAppend(&result, {node_data.ToString(/*verbose=*/verbose), "\n"});
for (AXNodeID child_id : node_data.child_ids)
id_to_indentation[child_id] = indent + 1;
}
return result;
}
size_t AXTreeUpdate::ByteSize() const {
size_t total_size = sizeof(AXTreeUpdate);
for (auto& node : nodes) {
total_size += node.ByteSize();
}
total_size += event_intents.size() * sizeof(AXEventIntent);
return total_size;
}
void AXTreeUpdate::AccumulateSize(
AXNodeData::AXNodeDataSize& node_data_size) const {
for (const auto& node : nodes) {
node.AccumulateSize(node_data_size);
}
}
} // namespace ui
|
