OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2009 Apple Inc. All rights reserved. | 2 * Copyright (C) 2009 Apple Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * | 7 * |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 11 matching lines...) Expand all Loading... |
22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 22 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND | 23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 */ | 27 */ |
28 | 28 |
29 #include "config.h" | 29 #include "config.h" |
30 #include "modules/accessibility/AXARIAGridRow.h" | 30 #include "modules/accessibility/AXARIAGridRow.h" |
31 | 31 |
| 32 #include "core/dom/AXObjectCache.h" |
32 #include "modules/accessibility/AXTable.h" | 33 #include "modules/accessibility/AXTable.h" |
33 | 34 |
34 | 35 |
35 namespace blink { | 36 namespace blink { |
36 | 37 |
37 AXARIAGridRow::AXARIAGridRow(RenderObject* renderer) | 38 AXARIAGridRow::AXARIAGridRow(RenderObject* renderer, AXObjectCache* axObjectCach
e) |
38 : AXTableRow(renderer) | 39 : AXTableRow(renderer, axObjectCache) |
39 { | 40 { |
40 } | 41 } |
41 | 42 |
42 AXARIAGridRow::~AXARIAGridRow() | 43 AXARIAGridRow::~AXARIAGridRow() |
43 { | 44 { |
44 } | 45 } |
45 | 46 |
46 PassRefPtr<AXARIAGridRow> AXARIAGridRow::create(RenderObject* renderer) | 47 PassRefPtr<AXARIAGridRow> AXARIAGridRow::create(RenderObject* renderer, AXObject
Cache* axObjectCache) |
47 { | 48 { |
48 return adoptRef(new AXARIAGridRow(renderer)); | 49 return adoptRef(new AXARIAGridRow(renderer, axObjectCache)); |
49 } | 50 } |
50 | 51 |
51 bool AXARIAGridRow::isARIATreeGridRow() const | 52 bool AXARIAGridRow::isARIATreeGridRow() const |
52 { | 53 { |
53 AXObject* parent = parentTable(); | 54 AXObject* parent = parentTable(); |
54 if (!parent) | 55 if (!parent) |
55 return false; | 56 return false; |
56 | 57 |
57 return parent->ariaRoleAttribute() == TreeGridRole; | 58 return parent->ariaRoleAttribute() == TreeGridRole; |
58 } | 59 } |
59 | 60 |
60 AXObject* AXARIAGridRow::headerObject() | 61 AXObject* AXARIAGridRow::headerObject() |
61 { | 62 { |
62 AccessibilityChildrenVector rowChildren = children(); | 63 AccessibilityChildrenVector rowChildren = children(); |
63 unsigned childrenCount = rowChildren.size(); | 64 unsigned childrenCount = rowChildren.size(); |
64 for (unsigned i = 0; i < childrenCount; ++i) { | 65 for (unsigned i = 0; i < childrenCount; ++i) { |
65 AXObject* cell = rowChildren[i].get(); | 66 AXObject* cell = rowChildren[i].get(); |
66 if (cell->ariaRoleAttribute() == RowHeaderRole) | 67 if (cell->ariaRoleAttribute() == RowHeaderRole) |
67 return cell; | 68 return cell; |
68 } | 69 } |
69 | 70 |
70 return 0; | 71 return 0; |
71 } | 72 } |
72 | 73 |
73 } // namespace blink | 74 } // namespace blink |
OLD | NEW |