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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
/*
* Copyright (C) 2009 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Apple Inc. ("Apple") nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "AccessibilityARIAGridRow.h"
#include "AccessibilityObject.h"
#include "AccessibilityTable.h"
namespace WebCore {
AccessibilityARIAGridRow::AccessibilityARIAGridRow(RenderObject* renderer)
: AccessibilityTableRow(renderer)
{
}
AccessibilityARIAGridRow::AccessibilityARIAGridRow(Node& node)
: AccessibilityTableRow(node)
{
}
AccessibilityARIAGridRow::~AccessibilityARIAGridRow() = default;
Ref<AccessibilityARIAGridRow> AccessibilityARIAGridRow::create(RenderObject* renderer)
{
return adoptRef(*new AccessibilityARIAGridRow(renderer));
}
Ref<AccessibilityARIAGridRow> AccessibilityARIAGridRow::create(Node& node)
{
return adoptRef(*new AccessibilityARIAGridRow(node));
}
bool AccessibilityARIAGridRow::isARIATreeGridRow() const
{
AccessibilityObject* parent = parentTable();
if (!parent)
return false;
return parent->isTreeGrid();
}
AXCoreObject::AccessibilityChildrenVector AccessibilityARIAGridRow::disclosedRows()
{
AccessibilityChildrenVector disclosedRows;
// The contiguous disclosed rows will be the rows in the table that
// have an aria-level of plus 1 from this row.
AccessibilityObject* parent = parentObjectUnignored();
if (!is<AccessibilityTable>(*parent) || !downcast<AccessibilityTable>(*parent).isExposable())
return disclosedRows;
// Search for rows that match the correct level.
// Only take the subsequent rows from this one that are +1 from this row's level.
int index = rowIndex();
if (index < 0)
return disclosedRows;
unsigned level = hierarchicalLevel();
auto allRows = parent->rows();
int rowCount = allRows.size();
for (int k = index + 1; k < rowCount; ++k) {
auto* row = allRows[k].get();
// Stop at the first row that doesn't match the correct level.
if (row->hierarchicalLevel() != level + 1)
break;
disclosedRows.append(row);
}
return disclosedRows;
}
AXCoreObject* AccessibilityARIAGridRow::disclosedByRow() const
{
// The row that discloses this one is the row in the table
// that is aria-level subtract 1 from this row.
AccessibilityObject* parent = parentObjectUnignored();
if (!is<AccessibilityTable>(*parent) || !downcast<AccessibilityTable>(*parent).isExposable())
return nullptr;
// If the level is 1 or less, than nothing discloses this row.
unsigned level = hierarchicalLevel();
if (level <= 1)
return nullptr;
// Search for the previous row that matches the correct level.
int index = rowIndex();
auto allRows = parent->rows();
int rowCount = allRows.size();
if (index >= rowCount)
return nullptr;
for (int k = index - 1; k >= 0; --k) {
auto* row = allRows[k].get();
if (row->hierarchicalLevel() == level - 1)
return row;
}
return nullptr;
}
AccessibilityObject* AccessibilityARIAGridRow::parentObjectUnignored() const
{
if (auto* table = parentTable())
return table;
return AccessibilityTableRow::parentObjectUnignored();
}
AccessibilityTable* AccessibilityARIAGridRow::parentTable() const
{
// The parent table might not be the direct ancestor of the row unfortunately. ARIA states that role="grid" should
// only have "row" elements, but if not, we still should handle it gracefully by finding the right table.
return downcast<AccessibilityTable>(Accessibility::findAncestor<AccessibilityObject>(*this, false, [this] (const auto& ancestor) {
// The parent table for an ARIA grid row should be an ARIA table.
// Unless the row is a native tr element.
if (is<AccessibilityTable>(ancestor)) {
auto& ancestorTable = downcast<AccessibilityTable>(ancestor);
return ancestorTable.isExposable() && (ancestorTable.isAriaTable() || node()->hasTagName(HTMLNames::trTag));
}
return false;
}));
}
AXCoreObject* AccessibilityARIAGridRow::headerObject()
{
for (const auto& child : children()) {
if (child->roleValue() == AccessibilityRole::RowHeader)
return child.get();
}
return nullptr;
}
} // namespace WebCore
|
