blob: 81ac19d0e303eb38a0a5dea61c307c828f3b175b (
plain)
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
// Copyright 2018 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_id.h"
#include <algorithm>
#include <iostream>
#include "base/check.h"
#include "base/json/values_util.h"
#include "base/notreached.h"
#include "base/values.h"
#include "ui/accessibility/ax_enums.mojom.h"
namespace ui {
AXTreeID::AXTreeID() : AXTreeID(ax::mojom::AXTreeIDType::kUnknown) {}
AXTreeID::AXTreeID(const AXTreeID& other) = default;
AXTreeID::AXTreeID(ax::mojom::AXTreeIDType type) : type_(type) {
if (type_ == ax::mojom::AXTreeIDType::kToken)
token_ = base::UnguessableToken::Create();
}
AXTreeID::AXTreeID(const std::string& string) {
if (string.empty()) {
type_ = ax::mojom::AXTreeIDType::kUnknown;
} else {
type_ = ax::mojom::AXTreeIDType::kToken;
absl::optional<base::UnguessableToken> token =
base::ValueToUnguessableToken(base::Value(string));
CHECK(token);
token_ = *token;
}
}
// static
AXTreeID AXTreeID::FromString(const std::string& string) {
return AXTreeID(string);
}
// static
AXTreeID AXTreeID::FromToken(const base::UnguessableToken& token) {
AXTreeID id;
id.type_ = ax::mojom::AXTreeIDType::kToken;
id.token_ = token;
return id;
}
// static
AXTreeID AXTreeID::CreateNewAXTreeID() {
return AXTreeID(ax::mojom::AXTreeIDType::kToken);
}
AXTreeID& AXTreeID::operator=(const AXTreeID& other) = default;
std::string AXTreeID::ToString() const {
switch (type_) {
case ax::mojom::AXTreeIDType::kUnknown:
return "";
case ax::mojom::AXTreeIDType::kToken:
return base::UnguessableTokenToValue(*token_).GetString();
}
}
void swap(AXTreeID& first, AXTreeID& second) {
std::swap(first.type_, second.type_);
std::swap(first.token_, second.token_);
}
bool AXTreeID::operator==(const AXTreeID& rhs) const {
return type_ == rhs.type_ && token_ == rhs.token_;
}
bool AXTreeID::operator!=(const AXTreeID& rhs) const {
return !(*this == rhs);
}
bool AXTreeID::operator<(const AXTreeID& rhs) const {
return std::tie(type_, token_) < std::tie(rhs.type_, rhs.token_);
}
bool AXTreeID::operator<=(const AXTreeID& rhs) const {
return std::tie(type_, token_) <= std::tie(rhs.type_, rhs.token_);
}
bool AXTreeID::operator>(const AXTreeID& rhs) const {
return !(*this <= rhs);
}
bool AXTreeID::operator>=(const AXTreeID& rhs) const {
return !(*this < rhs);
}
size_t AXTreeIDHash::operator()(const ui::AXTreeID& tree_id) const {
DCHECK(tree_id.type() == ax::mojom::AXTreeIDType::kToken);
return base::UnguessableTokenHash()(tree_id.token().value());
}
std::ostream& operator<<(std::ostream& stream, const AXTreeID& value) {
return stream << value.ToString();
}
const AXTreeID& AXTreeIDUnknown() {
static const AXTreeID ax_tree_id_unknown(ax::mojom::AXTreeIDType::kUnknown);
return ax_tree_id_unknown;
}
} // namespace ui
|
