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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this file,
* You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "TableCellAccessible.h"
#include "Accessible-inl.h"
#include "TableAccessible.h"
using namespace mozilla;
using namespace mozilla::a11y;
void TableCellAccessible::RowHeaderCells(nsTArray<Accessible*>* aCells) {
uint32_t rowIdx = RowIdx(), colIdx = ColIdx();
TableAccessible* table = Table();
if (!table) return;
// Move to the left to find row header cells
for (uint32_t curColIdx = colIdx - 1; curColIdx < colIdx; curColIdx--) {
Accessible* cell = table->CellAt(rowIdx, curColIdx);
if (!cell) continue;
// CellAt should always return a TableCellAccessible (XXX Bug 587529)
TableCellAccessible* tableCell = cell->AsTableCell();
NS_ASSERTION(tableCell, "cell should be a table cell!");
if (!tableCell) continue;
// Avoid addding cells multiple times, if this cell spans more columns
// we'll get it later.
if (tableCell->ColIdx() == curColIdx && cell->Role() == roles::ROWHEADER)
aCells->AppendElement(cell);
}
}
Accessible* TableCellAccessible::PrevColHeader() {
TableAccessible* table = Table();
if (!table) {
return nullptr;
}
TableAccessible::HeaderCache& cache = table->GetHeaderCache();
bool inCache = false;
Accessible* cachedHeader = cache.GetWeak(this, &inCache);
if (inCache) {
// Cached but null means we know there is no previous column header.
// if defunct, the cell was removed, so behave as if there is no cached
// value.
if (!cachedHeader || !cachedHeader->IsDefunct()) {
return cachedHeader;
}
}
uint32_t rowIdx = RowIdx(), colIdx = ColIdx();
for (uint32_t curRowIdx = rowIdx - 1; curRowIdx < rowIdx; curRowIdx--) {
Accessible* cell = table->CellAt(curRowIdx, colIdx);
if (!cell) {
continue;
}
// CellAt should always return a TableCellAccessible (XXX Bug 587529)
TableCellAccessible* tableCell = cell->AsTableCell();
MOZ_ASSERT(tableCell, "cell should be a table cell!");
if (!tableCell) {
continue;
}
// Check whether the previous table cell has a cached value.
cachedHeader = cache.GetWeak(tableCell, &inCache);
if (
// We check the cache first because even though we might not use it,
// it's faster than the other conditions.
inCache &&
// Only use the cached value if:
// 1. cell is a table cell which is not a column header. In that case,
// cell is the previous header and cachedHeader is the one before that.
// We will return cell later.
cell->Role() != roles::COLUMNHEADER &&
// 2. cell starts in this column. If it starts in a previous column and
// extends into this one, its header will be for the starting column,
// which is wrong for this cell.
// ColExtent is faster than ColIdx, so check that first.
(tableCell->ColExtent() == 1 || tableCell->ColIdx() == colIdx)) {
if (!cachedHeader || !cachedHeader->IsDefunct()) {
// Cache it for this cell.
cache.Put(this, RefPtr<Accessible>(cachedHeader));
return cachedHeader;
}
}
// Avoid addding cells multiple times, if this cell spans more rows
// we'll get it later.
if (cell->Role() != roles::COLUMNHEADER ||
tableCell->RowIdx() != curRowIdx) {
continue;
}
// Cache the header we found.
cache.Put(this, RefPtr<Accessible>(cell));
return cell;
}
// There's no header, so cache that fact.
cache.Put(this, RefPtr<Accessible>(nullptr));
return nullptr;
}
void TableCellAccessible::ColHeaderCells(nsTArray<Accessible*>* aCells) {
for (Accessible* cell = PrevColHeader(); cell;
cell = cell->AsTableCell()->PrevColHeader()) {
aCells->AppendElement(cell);
}
}
|
