OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1997 Martin Jones (mjones@kde.org) | 2 * Copyright (C) 1997 Martin Jones (mjones@kde.org) |
3 * (C) 1997 Torben Weis (weis@kde.org) | 3 * (C) 1997 Torben Weis (weis@kde.org) |
4 * (C) 1998 Waldo Bastian (bastian@kde.org) | 4 * (C) 1998 Waldo Bastian (bastian@kde.org) |
5 * (C) 1999 Lars Knoll (knoll@kde.org) | 5 * (C) 1999 Lars Knoll (knoll@kde.org) |
6 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 6 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
7 * Copyright (C) 2003, 2004, 2005, 2006, 2009, 2013 Apple Inc. | 7 * Copyright (C) 2003, 2004, 2005, 2006, 2009, 2013 Apple Inc. |
8 * All rights reserved. | 8 * All rights reserved. |
9 * | 9 * |
10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
(...skipping 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
94 bool RowIndexWasSet() const { return row_index_ != kUnsetRowIndex; } | 94 bool RowIndexWasSet() const { return row_index_ != kUnsetRowIndex; } |
95 unsigned RowIndex() const { | 95 unsigned RowIndex() const { |
96 DCHECK(RowIndexWasSet()); | 96 DCHECK(RowIndexWasSet()); |
97 DCHECK( | 97 DCHECK( |
98 !Section() || | 98 !Section() || |
99 !Section() | 99 !Section() |
100 ->NeedsCellRecalc()); // index may be bogus if cells need recalc. | 100 ->NeedsCellRecalc()); // index may be bogus if cells need recalc. |
101 return row_index_; | 101 return row_index_; |
102 } | 102 } |
103 | 103 |
104 const BorderValue& BorderAdjoiningTableStart() const { | 104 BorderValue BorderAdjoiningTableStart() const { |
105 if (Section()->HasSameDirectionAs(Table())) | 105 if (Section()->HasSameDirectionAs(Table())) |
106 return Style()->BorderStart(); | 106 return Style()->BorderStart(); |
107 | 107 |
108 return Style()->BorderEnd(); | 108 return Style()->BorderEnd(); |
109 } | 109 } |
110 | 110 |
111 const BorderValue& BorderAdjoiningTableEnd() const { | 111 BorderValue BorderAdjoiningTableEnd() const { |
112 if (Section()->HasSameDirectionAs(Table())) | 112 if (Section()->HasSameDirectionAs(Table())) |
113 return Style()->BorderEnd(); | 113 return Style()->BorderEnd(); |
114 | 114 |
115 return Style()->BorderStart(); | 115 return Style()->BorderStart(); |
116 } | 116 } |
117 | 117 |
118 const BorderValue& BorderAdjoiningStartCell(const LayoutTableCell*) const; | 118 BorderValue BorderAdjoiningStartCell(const LayoutTableCell*) const; |
119 const BorderValue& BorderAdjoiningEndCell(const LayoutTableCell*) const; | 119 BorderValue BorderAdjoiningEndCell(const LayoutTableCell*) const; |
120 | 120 |
121 bool NodeAtPoint(HitTestResult&, | 121 bool NodeAtPoint(HitTestResult&, |
122 const HitTestLocation& location_in_container, | 122 const HitTestLocation& location_in_container, |
123 const LayoutPoint& accumulated_offset, | 123 const LayoutPoint& accumulated_offset, |
124 HitTestAction) override; | 124 HitTestAction) override; |
125 | 125 |
126 PaginationBreakability GetPaginationBreakability() const final; | 126 PaginationBreakability GetPaginationBreakability() const final; |
127 | 127 |
128 void ComputeOverflow(); | 128 void ComputeOverflow(); |
129 | 129 |
(...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
195 return ToLayoutTableRow(FirstChild()); | 195 return ToLayoutTableRow(FirstChild()); |
196 } | 196 } |
197 | 197 |
198 inline LayoutTableRow* LayoutTableSection::LastRow() const { | 198 inline LayoutTableRow* LayoutTableSection::LastRow() const { |
199 return ToLayoutTableRow(LastChild()); | 199 return ToLayoutTableRow(LastChild()); |
200 } | 200 } |
201 | 201 |
202 } // namespace blink | 202 } // namespace blink |
203 | 203 |
204 #endif // LayoutTableRow_h | 204 #endif // LayoutTableRow_h |
OLD | NEW |